{"id":19404976,"url":"https://github.com/sajdoko/sjf-preemptive-simulator","last_synced_at":"2026-06-13T12:33:34.062Z","repository":{"id":163511589,"uuid":"587800253","full_name":"sajdoko/sjf-preemptive-simulator","owner":"sajdoko","description":"This project is a simulation of the Shortest Job First (SJF) preemptive or shortest-remaining-time-first scheduling algorithm.","archived":false,"fork":false,"pushed_at":"2023-01-15T00:09:21.000Z","size":86,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-25T00:44:45.928Z","etag":null,"topics":["preemptive","shortest-job-first","shortest-remaining-time-first","simulation","simulator","sjf"],"latest_commit_sha":null,"homepage":"https://sajdoko.github.io/sjf-preemptive-simulator/","language":"JavaScript","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/sajdoko.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":"2023-01-11T16:06:41.000Z","updated_at":"2024-02-27T22:12:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"ffabf53d-3fe4-498c-9f12-f803c2e53ed4","html_url":"https://github.com/sajdoko/sjf-preemptive-simulator","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sajdoko/sjf-preemptive-simulator","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sajdoko%2Fsjf-preemptive-simulator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sajdoko%2Fsjf-preemptive-simulator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sajdoko%2Fsjf-preemptive-simulator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sajdoko%2Fsjf-preemptive-simulator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sajdoko","download_url":"https://codeload.github.com/sajdoko/sjf-preemptive-simulator/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sajdoko%2Fsjf-preemptive-simulator/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34285190,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-13T02:00:06.617Z","response_time":62,"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":["preemptive","shortest-job-first","shortest-remaining-time-first","simulation","simulator","sjf"],"created_at":"2024-11-10T11:36:53.763Z","updated_at":"2026-06-13T12:33:34.033Z","avatar_url":"https://github.com/sajdoko.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SJF Preemptive Scheduler Simulator\n\nThis project is a simulation of the Shortest Job First (SJF) preemptive or shortest-remaining-time-first scheduling algorithm. It allows you to add processes to a scheduler, and then simulate the execution of the processes using the Shortest Job First (SJF) algorithm. The scheduler prioritizes the execution of processes with the shortest burst time, and can interrupt a running process to give CPU time to another process with a shorter burst time.\n\n## Features\n\n- Add new process with its ID, arrival time, and burst time\n- Run the scheduler and simulate the execution of the processes using the SJF Preemptive algorithm\n- Display the process list and the result of the scheduling in the table\n\n## Getting Started\n\n1. Clone the repository to your local machine\n2. Open the `index.html` file in your browser\n3. Use the form to add processes to the scheduler\n4. Click the \"Run Scheduler\" button to simulate the execution of the processes\n\n## Technologies Used\n\n- HTML\n- CSS\n- JavaScript\n- Bootstrap\n\n## Contributing\n\nPlease feel free to contribute by reporting any issues or by creating pull requests to the repository.\n\n## Author\n\nSajmir Doko\n\n## Acknowledgements\n\nThe project is based on the simulation of the SJF Preemptive scheduling algorithm. More information about the algorithm can be found in various Operating System textbooks.\n\n## Note\n\nthis is a basic simulation of the algorithm, and it can be enhanced as per your requirements.\n\n## Screenshot\n\n![App Screenshot](https://raw.githubusercontent.com/sajdoko/sjf-preemptive-simulator/master/sjf-simulator.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsajdoko%2Fsjf-preemptive-simulator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsajdoko%2Fsjf-preemptive-simulator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsajdoko%2Fsjf-preemptive-simulator/lists"}