|
Makerere University Research Repository >
Faculty of Computing and Information Technology >
Theses & Dissertations (CIT) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/1412
|
| Title: | A combination of round robin and earliest deadline first scheduling algorithms using timeliness as the performance criteria |
| Authors: | Bukenya, Andrew
Gachara, Paul Kiruri
Orina, Jane G.
Kabanda, Fred
Sigei, Kiprotich Weldone
Tambo, K. Cyprian
Birundu, Stella Kerubo
Soreh, S. Patson |
| Keywords: | Scheduling
Scheduling algorithms
Round Robin
Earliest Deadline First
Time management
Work time
Production scheduling
Job scheduling |
| Issue Date: | Jul-2009 |
| Series/Report no.: | SD0010-09 |
| Abstract: | The increased use of computers in today’s world has necessitated the need of having scheduling algorithms which are efficient. Due to the computer’s limited resources, it is inevitable to consider aspects such as the tasks meeting their deadlines and to maximize CPU utilization. In this research paper, we focused on RR (Round Robin) and EDF (Earliest Deadline First) scheduling algorithms. In which the fair access strength for RR and the deadline criticality being catered for EDF were combined which gave us a motivation to come up with RREDF (Round Robin with Earliest Deadline First) as a new algorithm. EDF was used for sorting the jobs in the queue while RR was used for allocating the jobs to 32 processors. The jobs had hard real time deadlines implying those jobs whose deadline had passed were thrown out of the system. The RREDF was developed and implemented in Microsoft Visual C++, simulated in CSIM environment and the results were transferred to excel for easier statistical analysis. Our main interest was to investigate the fraction of jobs that were executed while varying mean inter arrival time at a given quantum. The deductions got from the results were that the proportion of jobs processed was directly proportional to mean inter arrival time and inversely proportional to quantum. We also discovered that the job stream favored by our system were small jobs. |
| Description: | A project report submitted to the Faculty of Computing and Information Technology for the study leading to a project in partial fulfillment of the requirements for the award of the degree of Bachelor of Science in Computer Science of Makerere University |
| URI: | http://hdl.handle.net/123456789/1412 |
| Appears in Collections: | Theses & Dissertations (CIT)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| group-no-sd0010-09-cit-undergraduate.pdf | | 635Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
