Show simple item record

dc.contributor.advisorUddin, Dr. Jia
dc.contributor.authorUllah, Md. Shihab
dc.date.accessioned2018-01-11T04:20:58Z
dc.date.available2018-01-11T04:20:58Z
dc.date.copyright2017
dc.date.issued2017-04-12
dc.identifier.otherID 11201047
dc.identifier.urihttp://hdl.handle.net/10361/9016
dc.descriptionThis thesis report is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2017.en_US
dc.descriptionCataloged from PDF version of thesis report.
dc.descriptionIncludes bibliographical references (page 43).
dc.description.abstractCPU. 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)en_US
dc.description.statementofresponsibilityMd. Shihab Ullah
dc.format.extent44 pages
dc.language.isoenen_US
dc.publisherBARC Universityen_US
dc.rightsBRAC 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.
dc.subjectImproved Optimum Dynamic Time Slicing Round Robin Algorithmen_US
dc.subjectAlgorithmen_US
dc.subjectTime quantumen_US
dc.subjectDynamic queueen_US
dc.subjectContext and thread switchingen_US
dc.subjectRandomized control trialen_US
dc.titleImproved optimum dynamic time slicing CPU scheduling algorithm based on round robin approachen_US
dc.typeThesisen_US
dc.contributor.departmentDepartment of Computer Science and Engineering, BRAC University
dc.description.degreeB. Computer Science and Engineering 


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record