{"id":16839544,"url":"https://github.com/mxinden/schedulingprocesses","last_synced_at":"2025-03-18T04:25:37.520Z","repository":{"id":34047208,"uuid":"37823915","full_name":"mxinden/SchedulingProcesses","owner":"mxinden","description":null,"archived":false,"fork":false,"pushed_at":"2015-07-06T15:26:51.000Z","size":292,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-01-24T11:11:57.619Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mxinden.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}},"created_at":"2015-06-21T20:04:15.000Z","updated_at":"2015-11-01T20:57:59.000Z","dependencies_parsed_at":"2022-07-14T03:10:33.618Z","dependency_job_id":null,"html_url":"https://github.com/mxinden/SchedulingProcesses","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mxinden%2FSchedulingProcesses","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mxinden%2FSchedulingProcesses/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mxinden%2FSchedulingProcesses/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mxinden%2FSchedulingProcesses/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mxinden","download_url":"https://codeload.github.com/mxinden/SchedulingProcesses/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244155426,"owners_count":20407342,"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":[],"created_at":"2024-10-13T12:32:47.632Z","updated_at":"2025-03-18T04:25:37.499Z","avatar_url":"https://github.com/mxinden.png","language":"Java","readme":"# Documentation: Scheduling Processes\n\n\n## Code Structure:\n![alt text](UMLDiagram.png)\n\n\n##Program flow\n1. The main method calls the read() method from the CSVReader class to receive a List of processes.\n- The main method calls each generateProcessSchedule() function of the SchedulingAlgorithm classes each returning a schedule object\n- The main method walks through all processes and prints the processID, the algorithm name and the turnAroundTime from each schedule.\n\n\n##The SchedulingAlgorithms\n\nEach scheduling algorithm walks through the simulation time (ct = current time), adds processes to the process queue and works the queue off. Each time a process is finished or taken off the CPU the algorithm adds a schedule item to the schedule. Once there are no processes left the algorithm returns the created schedule to the main method.\n\n### Non preemptive\n- First Come First Serve (FCFS): The process with the earliest arrival time is processed next.\n- Highest Response Ratio Next (HHRN): The process with the highest response ratio  is processed next. Response ratio = (waiting time + processing time) / processing time\n\n### Preemptive\n- Round Robin (RR): Each process gets a time slice (quantum) on the CPU.\n- ShortestRemaining Time (SRT): The process with the shortest processing time wether a process is running or not is processed next.\n\n\n## Schedule and Schedule Items\nA schedule contains schedule items which state when a process started running on the CPU and when it ended. Furthermore it contains the information whether the process is now finished or not.\n\n##How to use the SchedulingProcesses tool\nPlease run the jar file in a terminal like following\n```sh\njava -jar SchedulingProcesses.jar PathToCSVFile\n```\nfor further debugging and average computing please run:\n```sh\njava -jar SchedulingProcesses.jar PathToCSVFile -d\n```\n\n\n\n\n##Discussion\nFor further discussions regarding the comparison of the algorithms in terms of average turn around time please see the [discussion file](./discussion.md).\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmxinden%2Fschedulingprocesses","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmxinden%2Fschedulingprocesses","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmxinden%2Fschedulingprocesses/lists"}