Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach
Cataloged from PDF version of thesis report.
| Huvudupphovsman: | |
|---|---|
| Övriga upphovsmän: | |
| Materialtyp: | Lärdomsprov |
| Språk: | English |
| Publicerad: |
BARC University
2018
|
| Ämnen: | |
| Länkar: | http://hdl.handle.net/10361/9016 |
| id |
10361-9016 |
|---|---|
| record_format |
dspace |
| spelling |
10361-90162022-01-26T10:18:13Z Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach Ullah, Md. Shihab Uddin, Dr. Jia Department of Computer Science and Engineering, BRAC University Improved Optimum Dynamic Time Slicing Round Robin Algorithm Algorithm Time quantum Dynamic queue Context and thread switching Randomized control trial Cataloged from PDF version of thesis report. Includes bibliographical references (page 43). This thesis report is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2017. CPU. In this paper, the static use of dynamic time quantum as CPU Time Slice is reviewed and a new algorithm for CPU scheduling named Improved Optimum Dynamic Time Slicing Round Robin Algorithm (IODTSRR) is proposed for process and thread scheduling. The proposed algorithm is based upon dynamic nature of allocation, calculation of the value of time quantum which varies according to the state of queue along with the capability of executing ready processes arriving at the same or different time. The concept of multi-threading by using Dummy Thread is introduced to hold the added processes in the queue during all arrival time intervals respectively. The performance is compared with Optimum Dynamic Time Slicing Using Round Robin (ODTSRR) and the results revealed that the proposed algorithm is much better specifically in response time and turnaround time. As process gets fully or partially executed while others arrive simultaneously, the context switch rates, waiting time and throughput improves hence resulting in optimized CPU performance. Keywords — scheduling algorithm; randomized control trial; time quantum; context and thread switching; response time; turnaround time; waiting time; fairness; multi-threading; synchronization; arrival time interval; dynamic queue; first come shortest job first (FCSJF); improved optimum dynamic time slicing round robin algorithm (IODTSRR); optimum dynamic time slicing using round robin (ODTSRR) Md. Shihab Ullah B. Computer Science and Engineering 2018-01-11T04:20:58Z 2018-01-11T04:20:58Z 2017 4/12/2017 Thesis ID 11201047 http://hdl.handle.net/10361/9016 en BRAC University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. 44 pages application/pdf BARC University |
| institution |
Brac University |
| collection |
Institutional Repository |
| language |
English |
| topic |
Improved Optimum Dynamic Time Slicing Round Robin Algorithm Algorithm Time quantum Dynamic queue Context and thread switching Randomized control trial |
| spellingShingle |
Improved Optimum Dynamic Time Slicing Round Robin Algorithm Algorithm Time quantum Dynamic queue Context and thread switching Randomized control trial Ullah, Md. Shihab Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach |
| description |
Cataloged from PDF version of thesis report. |
| author2 |
Uddin, Dr. Jia |
| author_facet |
Uddin, Dr. Jia Ullah, Md. Shihab |
| format |
Thesis |
| author |
Ullah, Md. Shihab |
| author_sort |
Ullah, Md. Shihab |
| title |
Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach |
| title_short |
Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach |
| title_full |
Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach |
| title_fullStr |
Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach |
| title_full_unstemmed |
Improved optimum dynamic time slicing CPU scheduling algorithm based on round robin approach |
| title_sort |
improved optimum dynamic time slicing cpu scheduling algorithm based on round robin approach |
| publisher |
BARC University |
| publishDate |
2018 |
| url |
http://hdl.handle.net/10361/9016 |
| work_keys_str_mv |
AT ullahmdshihab improvedoptimumdynamictimeslicingcpuschedulingalgorithmbasedonroundrobinapproach |
| _version_ |
1814308669642244096 |