{"id":15720708,"url":"https://github.com/echosingh/csa","last_synced_at":"2026-05-14T23:34:38.415Z","repository":{"id":215330653,"uuid":"738486952","full_name":"EchoSingh/CSA","owner":"EchoSingh","description":"what CPU will do when all processes are in ready queue","archived":false,"fork":false,"pushed_at":"2024-05-17T18:44:27.000Z","size":16,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-30T22:47:08.893Z","etag":null,"topics":["c-language","cpu-scheduling","gtk"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"unlicense","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/EchoSingh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-01-03T10:41:05.000Z","updated_at":"2025-01-21T15:11:38.000Z","dependencies_parsed_at":"2024-01-07T20:36:17.409Z","dependency_job_id":"b66f04df-e47b-4a06-9eb4-e3cba3b1a6fb","html_url":"https://github.com/EchoSingh/CSA","commit_stats":null,"previous_names":["aditya26062003/csa","echosingh/csa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/EchoSingh/CSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EchoSingh%2FCSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EchoSingh%2FCSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EchoSingh%2FCSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EchoSingh%2FCSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/EchoSingh","download_url":"https://codeload.github.com/EchoSingh/CSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EchoSingh%2FCSA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272356450,"owners_count":24920312,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-27T02:00:09.397Z","response_time":76,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c-language","cpu-scheduling","gtk"],"created_at":"2024-10-03T21:59:55.927Z","updated_at":"2026-05-14T23:34:38.388Z","avatar_url":"https://github.com/EchoSingh.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# CSA\nOVERVIEW\nThis program implements various CPU scheduling algorithms, allowing users to simulate and analyze the performance of different scheduling strategies. The supported scheduling algorithms include:\n\nFirst-Come-First-Serve (FCFS)\nShortest Job First (SJF)\nRound Robin (RR)\nShortest Remaining Time First (SRTF)\nPriority Scheduling\nThe program takes user input for the number of processes, burst times, and priorities (if applicable) and provides details such as waiting time, turnaround time, and averages for each algorithm.\n\nCompilation and Execution\nCompilation:\n\nCompile the program using a C compiler. \n\nUser Input:\n\nFollow the on-screen prompts to input the number of processes, burst times, priorities (if applicable), and time quantum (for Round Robin).\n\nResults:\n\nThe program will display the results for each scheduling algorithm, including details for each process and average metrics.\n\nScheduling Algorithms\n1. First-Come-First-Serve (FCFS)\nThis algorithm executes processes in the order they arrive, without considering burst times or priorities.\n\n2. Shortest Job First (SJF)\nProcesses are scheduled based on their burst times, with the shortest job executed first.\n\n3. Round Robin (RR)\nProcesses are executed in a circular manner with a fixed time quantum. Each process gets a turn to execute, and the algorithm cycles through the processes until all are completed.\n\n4. Shortest Remaining Time First (SRTF)\nSimilar to SJF, but the algorithm dynamically selects the process with the shortest remaining burst time at each step.\n\n5. Priority Scheduling\nProcesses are scheduled based on priority, with the highest priority process executed first. In case of a tie, FCFS is used.\n\nAuthor\nADITYA SINGH\n\nLicense\nUnlicense\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fechosingh%2Fcsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fechosingh%2Fcsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fechosingh%2Fcsa/lists"}