{"id":20646829,"url":"https://github.com/abaksy/os_algos","last_synced_at":"2025-07-06T17:38:28.435Z","repository":{"id":68546589,"uuid":"296055619","full_name":"abaksy/os_algos","owner":"abaksy","description":"Algorithms implemented in Operating Systems course at PES University, B'lore","archived":false,"fork":false,"pushed_at":"2024-12-20T19:47:00.000Z","size":24,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-09T17:41:51.997Z","etag":null,"topics":["deadlock","os-course","scheduling"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/abaksy.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2020-09-16T14:22:07.000Z","updated_at":"2024-12-20T19:47:04.000Z","dependencies_parsed_at":null,"dependency_job_id":"8e4c3ee2-bdcd-4bfd-ace6-cb98c081a042","html_url":"https://github.com/abaksy/os_algos","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/abaksy/os_algos","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abaksy%2Fos_algos","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abaksy%2Fos_algos/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abaksy%2Fos_algos/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abaksy%2Fos_algos/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/abaksy","download_url":"https://codeload.github.com/abaksy/os_algos/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abaksy%2Fos_algos/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263943723,"owners_count":23533638,"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","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":["deadlock","os-course","scheduling"],"created_at":"2024-11-16T16:27:57.354Z","updated_at":"2025-07-06T17:38:28.408Z","avatar_url":"https://github.com/abaksy.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Operating Systems Algorithms\n\nC/C++ implementation of some algorithms used in Operating Systems. This repository covers algorithms from the Dinosaur Book (OS Concepts by Silberschatz, Galvin, Gagne et. al.)\n\n## Scheduling\n\nThe output is a table with rows in the order in which the processes in the queue will be submitted to the CPU.\n\n1) Shortest Job First scheduling:\nThe job with the shortest burst time is sent in first\n\n2) Round Robin Scheduling:\nAll jobs get an equal slice (quantum) of CPU time, and this repeats until all jobs are complete.\n\n3) Priority Scheduling:\nJobs are submitted to the CPU in order of their user-defined priorities.\n\n## Deadlocks\n\nDeadlock detection algorithm is implemented as presented in the textbook Operating Systems Concepts (9e.) by Galvin, Silberschatz and\nGagne.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabaksy%2Fos_algos","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabaksy%2Fos_algos","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabaksy%2Fos_algos/lists"}