EXTRA THRESHOLD IN ROUND ROBIN ALGORITHM IN MULTIPROCESSOR SYSTEM

Size: px
Start display at page:

Download "EXTRA THRESHOLD IN ROUND ROBIN ALGORITHM IN MULTIPROCESSOR SYSTEM"

Transcription

1 EXTRA THRESHOLD IN ROUND ROBIN ALGORITHM IN MULTIPROCESSOR SYSTEM 1 AISHWARYA ARORA, 2 HIMANSHI BHATIA 1,2 Department of Computer Science, Jamia Hamdard, New Delhi, Delhi aishwaryaa30@gmail.com, 18himanshi@gmail.com Abstract- The prevalent Round Scheduling Algorithm makes use of a variable, Time Quantum for its pre-emption which allots a slice of time to the processors to switch between the processes. Setting the quantum too small causes lot many process switching and reduce the CPU efficiency, but setting it large results in starvation of other processes in the queue. The conventional Round algorithm does not allow any process to be allocated to the processor for more than one Time Quantum. So, if a process has a burst time less than or equal to the time quantum then the process is executed in one go but if a fraction of burst time is left over then the process is moved to the tail of the ready queue and waits till other processes in the ready queue executes following the FCFS decorum. This procedure is continued until the process terminates. Our proposed Round Scheduling for multiprocessor system (considering homogeneous CPUs) cites a new variable ET (Extra Threshold) which has a value equal to 10% of the time quantum in a system. The processes with burst time less than or equal to the added result of Time Quantum and Extra Threshold (TQ+ET) are able to execute in the same time slice without having to wait in the ready queue for their allocation to the processor in the next time cycle. This ameliorates the conventional Round by improving the throughput, turnaround time and waiting time. Keywords- Time Quantum, Extra Threshold, Turnaround Time, Waiting Time, Context Switch I. INTRODUCTION II. RELATED WORK A multiprocessor system provides a benefit of concurrent employment of more than one CPU. This makes the Work- Load Balancing important so that the processes are almost equally distributed among the CPUs and no process waits for more than (n- 1)*TQ time for being allocated to the processor, where n is the number of process here. The different types of scheduling algorithms are given below: First Come First Serve (FCFS) is a nonpreemptive algorithm which follows FIFO (First In, First Out) principle. It suffers from convoy effect and results in lower CPU and device utilization. Shortest Job First (SJF), more appropriately known as Shortest-Next-CPU-First algorithm. Scheduling depends upon the length of next CPU burst of a process [3]. It cannot be implemented in short term scheduling i.e. CPU scheduling. In Priority Scheduling, processes are prioritized. The process with higher seniority is executed first and processes with equal priority are served on FCFS basis. The Round Algorithm (RR) follows preemptive FCFS in which preemption is defined through a small unit of time known as the time quantum. In Multilevel Queue Scheduling, multiple queues are managed with few processes in foreground queue and others in background queue. Both the queues can operate on any of the scheduling algorithms (FCFS, SJF, RR and others mentioned above). Multilevel Feedback Queue Scheduling Algorithm is akin to multilevel queue scheduling which allows switching of processes from one queue to another. Various notable researches for improving the conventional Round have been carried out around the globe. The novelist of suggests improving the Round (RR) algorithm using dynamic Intelligent Time Slice (ITS) by merging it with Shortest Remaining Time Next (SRTN) algorithm. The authors of calculate the time slice for tasks and allocate the time slice for every individual task. The researcher uses a comparative approach by placing the burst time of the jobs in ascending order and then executing it. Similarly, analysts of have put forth their ideas for modifying the Round Scheduling algorithm which are currently in use. III. ABBREVIATIONS 1. TQ=Time Quantum 2. ET=Extra Threshold 3. Old_TQ=Original value of TQ 4. RT=Remaining Time 5. BT=Burst Time 6. NOC= Number Of Cycles 7. j[k]=processors 8. i=process 9. Counter= Number of Switches for each process Some important definitions, Turnaround Time: Total amount of time for a process to be completed Waiting Time: Total amount of time a particular process has waited-for in the ready queue 100

2 Burst Time: The time required by the process to complete its execution. Mathematically, Waiting Time (for a particular process or job) is given by (Turnaround Time of the process Burst Time of the process) No. of cycles= where,.. symbol indicates the ceil function which rounds a number down to the nearest integer. Remaining Time(RT[i]) is calculated by subtracting burst time from time quantum(tq- BT[i]) ET(Extra Threshold)= 0.1*(TQ) IV. PROPOSED ALGORITHM 1. For all processes in ready queue do { 2. Counter[i]=1 3. TQ=Old_TQ 4. RT[i]=0 5.j[k]=0 6. NOC[i]= BT[i]/TQ 7. while(bt[i]!=0){ 8. if(k==3) 9. k=0 10. if BT[i]<TQ { 11. Assign processor j[k] to job i 12. k Counter } 15. if(bt[i]%tq==0) { 16. Assign processor j[k] to the job i 17. BT[i]=BT[i]-TQ 18. Counter[i] k } 21. else if(bt[i]%tq!=0) { 22. RT[i]=BT[i]-TQ 23. if(counter[i]== NOC[i]) { 24. If (RT[i]<=ET) { 25. TQ=TQ+ET//RT[i] 26. BT[i]=BT[i]-TQ 27. TQ=Old_TQ 28. Assign processor j[k] to job i 29. k } 31.else 32. BT[i]=BT[i]-TQ 33. } 34. } 35. else { 36. BT[i]=BT[i]-TQ 37. Counter Assign processor j[k] to job i 39. k } 41. } 42. } V. FLOW CHART VI. PROPOSED APPROACH The proposed approach adduces a new variable, Extra Threshold (ET) in the Round Algorithm. The value of ET is equal to 10% of the time quantum (TQ). The CPU burst of processes less than or equal to the combined value of TQ and ET can be processed in the same time slice cycle. This attributes an advantage of reduced turnaround time and wait time keeping the efficiency same i.e. O(n). The algorithm for it is explained as: For the processes in the ready queue set the value of Old_TQ to TQ, RT[i]=0; k=0 and Counter[i] to 1. Also set NOC[i] to ceil of BT[i] divided by TQ. Iterate the while loop until the condition BT[i]!=0 is true and if the value of k=3 then modify it to 0 since we are considering only 4 processors here. Check - If burst time of a process is less than the time quantum, assign the processor j[k] to the process I and increment k and Counter by 1. Now if the burst time of a process is completely divisible by the time quantum then assign the processor j[k] to the job i and subtract the time quantum from the respective burst time of the process 101

3 and take it back to the ready queue if it is not complete. Also increment the Counter and k. Further, check if the burst time of a process is not completely divisible by the time quantum then calculate RT[i] by subtracting TQ from BT[i]. Else increment the counter and subtract TQ from BT[i] and assign the processor j[k] to job i. Check further if the Counter[i] is equal to NOC[i] and check if the remaining time of the process is less than or equal to ET. If the condition satisfies add RT[i] to TQ, subtract time quantum from the respective burst time of the process and assign Old_TQ value to TQ. Also assign the processor j[k] to job i and increment the value of k. Else subtract time quantum from the respective burst time of the process. Repeat the above algorithm for all the processes present in the ready queue until they are complete i.e. BT[i]=0. Wait Time = (10-10)+( )+( )+( )+(48-8)+( )=281.6ms B) Modified Round TQ=10ms; ET=1ms TQ + ET=11ms b) Table 2 (Ready Queue table for B) J J J J5 8 1 J VII. HYPOTHETICAL EXAMPLES A set of 3 examples are illustrated for the proposed Round algorithm - Suppose, Arrival time for 6particular processes or jobs=0ms& 4 processors are being assigned to the jobs. i. EXAMPLE 1 A) Classical Round TQ=10ms a) Table 1 (Ready Queue table for A) Cycles)= J J J J5 8 1 J Figure 2 shows the Gantt chart for the above ready =314.5ms Wait Time = (10-10)+( )+( )+( )+(48.2-8)+( )=225.8ms ii. EXAMPLE 2 A) Classical Round TQ=12ms a) Table 3(Ready Queue table for A) J J J J J J Figure 1 shows the Gantt chart for the above ready =370.3ms Figure 3 shows the Gantt chart for the above ready 102

4 =453.2ms Wait Time = (12-12)+( )+( )+( )+(58-10)+( )=349.5ms B) Modified Round TQ=12ms; ET=1.2ms TQ+ET=13.5ms b) Table 4 Ready Queue table for B J J J J J J Figure 4 shows the Gantt chart for the above ready =390.1ms Wait Time = (12-12)+( )+( )+( )+( )+( )=286.4ms iii. EXAMPLE 3 A) Regular Round TQ=20ms a) Table 5 Ready Queue table for A J J J J J Figure 5 shows the Gantt chart for the above ready =465ms Wait Time = (10-10)+(30-20)+(110-22)+(111-21)+(88-18)+(116-25)=349ms B) Modified Round TQ=20ms; ET=2.0ms TQ+ ET=22ms b) Table 6 Ready Queue table for A J J J J J Figure 6 shows the Gantt chart for the above ready Turnaround Time= =366ms Wait Time = (10-10)+(30-20)+(52-22)+(71-21)+(89-18)+(114-25)=250ms VIII. RESULTS Comparison Table for EXAMPLE 1 Compariso n factor Turnaroun d Time Waiting time Context Switches Classica l Round 370.3m s 281.6m s Propose d Round 314.5ms 225.8ms Improveme nt Observed 55.8ms 55.8ms

5 Comparison Table for EXAMPLE 2 Compariso n factor Turnaroun d Time Waiting time Context Switches Classica l Round Propose d Round Improvemen t Observed 453.2ms 390.1ms 63.1ms 349.5ms 286.4ms 63.1ms Comparison Table for EXAMPLE 3 Compariso n factor Turnaroun d Time Waiting time Context Switches Classica l Round Propose d Round Improvemen t Observed 465ms 366ms 99ms 349ms 250ms 99ms Comparison Graph for EXAMPLE 1 Comparison Graph for EXAMPLE 2 Comparison Graph for EXAMPLE 3 REFERENCES [1] H.S Behera, Simpli Patel, Bijayalakshmi Panda Veer Surendra University of Technology A New Dynamic Round and SRTN Algorithm Time Slice for Soft Real Time Systems International Journal of Computer Applications (IJCA)Volume 16-No. 1,February 2011 [2] Yashuwanth and Ramesh, Dept. of Electrical and Electronic Engineering Anna University, Chennai Intelligent Time Slice for Round in Real Time Operating Systems International Journal of Research and Reviews in Applied Sciences(IJRRAS 2 (2)),February 2010 [3] A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Principles, 7th Edition., John Wiley and Sons, 2008 [6] T. Helmy and A. Dekdouk, Burst Round : As A Proportional-Share Scheduling Algorithm, In Proceedings of The Forth IEEE-GCC Conference on Towards Techno-Industrial Innovations,pp ,11-14 November 2007, at the Gulf International Convention Center, Bahrain [7] Ji-Young Kwak, Ji-Seung Nam, and Doo-Hyun Kim, A Modified Dynamic Weighted Round robin cell scheduling algorithm, ETRI Journal, Volume 24, Number 5, October 2002 [8] Saroj Hiranwal, Computer Science and Engineering Suresh Gyan Vihar University Jaipur, Rajasthan, India, Dr. K.C. Roy roy.krishna@rediffmail.com,electronics and communication Engineering Pacific University Udaipur, Rajasthan, India Adaptive Round Scheduling using Shortest Burst Approach Based on Smart Time Slice, International Journal of Data Engineering (IJDE), Volume 2, Issue 3. [9] Prof. Rakesh Mohanty, Prof. H. S. Behera, Khusbu Patwari, Manas Ranjan Das, Monisha Dash, Sudhashree Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round (SRBRR) Scheduling Algorithm, Am. J. Applied Sci., 6 (10): , [10] Debashree Nayak Lecturer Gandhi Institute of Technology And Management, Bhubaneswar, Odisha, India, Sanjeev Kumar Malla Student Gandhi Institute of Technology And Management, Bhubaneswar, Odisha, India, Debashree Debadarshini Student Gandhi Institute of Technology And Management, Bhubaneswar, Odisha, India, Improved round robin scheduling using dynamic time quantum, 104

6 International Journal of Computer Applications ( ),Volume 38 No.5, January [11] H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu, Sourav Kumar Bhoi, Comparative performance analysis of multidynamic time quantum round robin (mdtqrr),indian Journal of Computer Science and Engineering (IJCSE), Vol. 2 No. 2 Apr-May [12] CPU Scheduling: ~jbell/ CourseNotes/ OperatingSystems/ 5_CPU_Scheduling.html 105

Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm

Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm Prof. Rakesh Mohanty, Prof. H. S. Behera Khusbu Patwari, Manas Ranjan Das, Monisha

More information

February 2011 Page 23 of 93 ISSN

February 2011 Page 23 of 93 ISSN Design and Performance Evaluation of A New Proposed Fittest Job First Dynamic Round Robin (FJFDRR) Scheduling Algorithm Prof. Rakesh Mohanty 1 Lecturer Department of Computer Science and Engineering Veer

More information

Revamped Round Robin Scheduling Algorithm

Revamped Round Robin Scheduling Algorithm Revamped Round Robin Scheduling Chhayanath Padhy, M.Tech Student, Government College of Engineering Kalahandi, Odissa, India Dillip Ranjan Nayak, Assistant Professor, Government College of Engineering

More information

Journal of Global Research in Computer Science

Journal of Global Research in Computer Science Volume 2, No. 2, February 2011 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info Design and Performance Evaluation of Multi Cyclic Round Robin (MCRR) Algorithm

More information

2/5/07 CSE 30341: Operating Systems Principles

2/5/07 CSE 30341: Operating Systems Principles page 1 Shortest-Job-First (SJR) Scheduling Associate with each process the length of its next CPU burst. Use these lengths to schedule the process with the shortest time Two schemes: nonpreemptive once

More information

ENHANCED ROUND ROBIN ALGORITHM FOR PROCESS SCHEDULING USING VARYING QUANTUM PRECISION

ENHANCED ROUND ROBIN ALGORITHM FOR PROCESS SCHEDULING USING VARYING QUANTUM PRECISION ENHANCED ROUND ROBIN ALGORITHM FOR PROCESS SCHEDULING USING VARYING QUANTUM PRECISION 1 AASHNA BISHT, 2 MOHD ABDUL AHAD, 3 SIELVIE SHARMA Department of Computer Science, Jamia Hamdard, New Delhi Abstract:

More information

COMPARATIVE PERFORMANCE ANALYSIS OF MULTI-DYNAMIC TIME QUANTUM ROUND ROBIN (MDTQRR) ALGORITHM WITH ARRIVAL TIME

COMPARATIVE PERFORMANCE ANALYSIS OF MULTI-DYNAMIC TIME QUANTUM ROUND ROBIN (MDTQRR) ALGORITHM WITH ARRIVAL TIME COMPARATIVE PERFORMANCE ANALYSIS OF MULTI-DYNAMIC TIME QUANTUM ROUND ROBIN (MDTQRR) ALGORITHM WITH ARRIVAL TIME Abstract H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu, Sourav Kumar Bhoi Dept. of Computer

More information

Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm

Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm Yosef Berhanu Department of Computer Science University of Gondar Ethiopia Abebe Alemu Department of Computer Science University of Gondar

More information

Module 5: CPU Scheduling

Module 5: CPU Scheduling Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained

More information

ENHANCING CPU PERFORMANCE USING SUBCONTRARY MEAN DYNAMIC ROUND ROBIN (SMDRR) SCHEDULING ALGORITHM

ENHANCING CPU PERFORMANCE USING SUBCONTRARY MEAN DYNAMIC ROUND ROBIN (SMDRR) SCHEDULING ALGORITHM ENHANCING CPU PERFORMANCE USING SUBCONTRARY MEAN DYNAMIC ROUND ROBIN (SMD) SCHEDULING ALGORITHM Sourav Kumar Bhoi *1, Sanjaya Kumar Panda 2 and Debashee Tarai 3 * 1 Department of Computer Science & Engineering,

More information

An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time

An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time An Improved Round Robin Approach using Dynamic Quantum for Improving Waiting Sandeep Negi Assistant Professor Department of Computer Science & Engineering Delhi Institute of Technology & Management ABSTRACT

More information

Improvising Round Robin Process Scheduling through Dynamic Time Quantum Estimation

Improvising Round Robin Process Scheduling through Dynamic Time Quantum Estimation Improvising Round Robin Process Scheduling through Dynamic Time Quantum Estimation Mr. Nischaykumar Hegde 1, Mr. Pramod Kumar P M 2 Department of Computer Science, Vivekananda College of Engineering &

More information

International Journal of Advanced Research in Computer Science and Software Engineering

International Journal of Advanced Research in Computer Science and Software Engineering Volume 2, Issue 11, November 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Best possible

More information

CPU scheduling. CPU Scheduling

CPU scheduling. CPU Scheduling EECS 3221 Operating System Fundamentals No.4 CPU scheduling Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University CPU Scheduling CPU scheduling is the basis of multiprogramming

More information

Journal of Global Research in Computer Science

Journal of Global Research in Computer Science Volume 2, No. 4, April 2011 Journal of Global Research in Computer Science RESEARCH ARTICLE Available Online at www.jgrcs.info PERFORMANCE EVALUATION OF A NEW PROPOSED SHOTREST EXECUTION FIRST DYNAMIC

More information

TDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.

TDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts. TDDI4 Concurrent Programming, Operating Systems, and Real-time Operating Systems CPU Scheduling Overview: CPU Scheduling CPU bursts and I/O bursts Scheduling Criteria Scheduling Algorithms Multiprocessor

More information

TDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II

TDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II TDDB68 Concurrent programming and operating systems Lecture: CPU Scheduling II Mikael Asplund, Senior Lecturer Real-time Systems Laboratory Department of Computer and Information Science Copyright Notice:

More information

ENHANCING THE CPU PERFORMANCE USING A MODIFIED MEAN- DEVIATION ROUND ROBIN SCHEDULING ALGORITHM FOR REAL TIME SYSTEMS.

ENHANCING THE CPU PERFORMANCE USING A MODIFIED MEAN- DEVIATION ROUND ROBIN SCHEDULING ALGORITHM FOR REAL TIME SYSTEMS. Volume 3, o. 3, March 2012 Journal of lobal Research in Computer Science RSRCH PPR vailable Online at www.jgrcs.info HC H CPU PRFORMC US MODFD M- DVO ROUD ROB SCHDUL LORHM FOR RL M SYSMS. H.s.Behera *1,

More information

CPU Scheduling Exercises

CPU Scheduling Exercises CPU Scheduling Exercises NOTE: All time in these exercises are in msec. Processes P 1, P 2, P 3 arrive at the same time, but enter the job queue in the order presented in the table. Time quantum = 3 msec

More information

Comp 204: Computer Systems and Their Implementation. Lecture 11: Scheduling cont d

Comp 204: Computer Systems and Their Implementation. Lecture 11: Scheduling cont d Comp 204: Computer Systems and Their Implementation Lecture 11: Scheduling cont d 1 Today Scheduling algorithms continued Shortest remaining time first (SRTF) Priority scheduling Round robin (RR) Multilevel

More information

CSCE 313 Introduction to Computer Systems. Instructor: Dezhen Song

CSCE 313 Introduction to Computer Systems. Instructor: Dezhen Song CSCE 313 Introduction to Computer Systems Instructor: Dezhen Song Schedulers in the OS CPU Scheduling Structure of a CPU Scheduler Scheduling = Selection + Dispatching Criteria for scheduling Scheduling

More information

CPU Scheduling. CPU Scheduler

CPU Scheduling. CPU Scheduler CPU Scheduling These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of each

More information

A NEW PROPOSED DYNAMIC DUAL PROCESSOR BASED CPU SCHEDULING ALGORITHM

A NEW PROPOSED DYNAMIC DUAL PROCESSOR BASED CPU SCHEDULING ALGORITHM A NEW POPOSED DYNAMIC DUAL POCESSO BASED CPU SCHEDULING ALGOITHM 1 G.SIVA NAGESWAA AO, 2 D.S.V.N. SINIVASU, 3 D. N SINIVASU, 4 D. O NAGA AJU 1 Assoc. Professor, Department of Computer Science and Engineering,

More information

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.

More information

Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method

Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method I.J. Information Technology and Computer Science, 2012, 10, 67-73 Published Online September 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijitcs.2012.10.08 Determining the Optimum Time Quantum

More information

CS 550 Operating Systems Spring CPU scheduling I

CS 550 Operating Systems Spring CPU scheduling I 1 CS 550 Operating Systems Spring 2018 CPU scheduling I Process Lifecycle Ready Process is ready to execute, but not yet executing Its waiting in the scheduling queue for the CPU scheduler to pick it up.

More information

ENHANCING THE CPU PERFORMANCE USING A MODIFIED MEAN- DEVIATION ROUND ROBIN SCHEDULING ALGORITHM FOR REAL TIME SYSTEMS

ENHANCING THE CPU PERFORMANCE USING A MODIFIED MEAN- DEVIATION ROUND ROBIN SCHEDULING ALGORITHM FOR REAL TIME SYSTEMS Volume 3, o. 3, March 212 Journal of lobal esearch in Computer Science SCH PP vailable Online at www.jgrcs.info HC H CPU PFOMC US MODFD M- DVO OUD OB SCHDUL LOHM FO L M SYSMS H.s.Behera *1, Sreelipa Curtis

More information

DETERMINING THE VARIABLE QUANTUM TIME (VQT) IN ROUND ROBIN AND IT S IMPORTANCE OVER AVERAGE QUANTUM TIME METHOD

DETERMINING THE VARIABLE QUANTUM TIME (VQT) IN ROUND ROBIN AND IT S IMPORTANCE OVER AVERAGE QUANTUM TIME METHOD D DETERMINING THE VARIABLE QUANTUM TIME (VQT) IN ROUND ROBIN AND IT S IMPORTANCE OVER AVERAGE QUANTUM TIME METHOD Yashasvini Sharma 1 Abstract The process scheduling, is one of the most important tasks

More information

CPU SCHEDULING RONG ZHENG

CPU SCHEDULING RONG ZHENG CPU SCHEDULING RONG ZHENG OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed scheduling 2 SHORT-TERM, MID-TERM, LONG- TERM

More information

Improved Deadline Monotonic Scheduling With Dynamic and Intelligent Time Slice for Real-time Systems

Improved Deadline Monotonic Scheduling With Dynamic and Intelligent Time Slice for Real-time Systems Improved Deadline Monotonic Scheduling With Dynamic and Intelligent Time Slice for Real-time Systems H. S. Behera, Sushree Sangita Panda and Jana Chakraborty Department of Computer Science and Engineering,

More information

A new Hybridized Multilevel Feedback Queue Scheduling with Intelligent Time Slice and its Performance Analysis

A new Hybridized Multilevel Feedback Queue Scheduling with Intelligent Time Slice and its Performance Analysis A new Hybridized Multilevel Feedback Queue Scheduling with Intelligent Time Slice and its Performance Analysis H.S.Behera, Reena Kumari Naik, Suchilagna Parida Department of Computer Science and Engineering

More information

CS 370. FCFS, SJF and Round Robin. Yashwanth Virupaksha and Abhishek Yeluri

CS 370. FCFS, SJF and Round Robin. Yashwanth Virupaksha and Abhishek Yeluri CS 370 FCFS, SJF and Round Robin Yashwanth Virupaksha and Abhishek Yeluri Homework-4 Review Write a C program to demonstrate the following scheduling algorithms First Come First Serve. (20 pts) Shortest

More information

ODSA: A Novel Ordering Divisional Scheduling Algorithm for Modern Operating Systems

ODSA: A Novel Ordering Divisional Scheduling Algorithm for Modern Operating Systems ODSA: A Novel Ordering Divisional Scheduling Algorithm for Modern Operating Systems Junaid Haseeb Khizar Hameed Muhammad Junaid Muhammad Tayyab Samia Rehman COMSATS Institute of Information Technology,

More information

Half Life Variable Quantum Time Round Robin (HLVQTRR)

Half Life Variable Quantum Time Round Robin (HLVQTRR) Half Life Variable Quantum Time Round Robin () Simon Ashiru, Salleh Abdullahi, Sahalu Junaidu Department of Mathematics, ABU Zaria, Nigeria Abstract Round Robin (RR), one of the oldest CPU scheduling algorithms

More information

Efficient Dual Nature Round Robin CPU Scheduling Algorithm: A Comparative Analysis

Efficient Dual Nature Round Robin CPU Scheduling Algorithm: A Comparative Analysis Efficient Dual Nature Round Robin CPU Scheduling Algorithm: A Comparative Analysis Sajida Fayyaz 1, Hafiz Ali Hamza 2, Saira Moin U Din 3 and Iqra 4 1-4 Department of Computer Science, University of Lahore

More information

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should

More information

CHAPTER 5 - PROCESS SCHEDULING

CHAPTER 5 - PROCESS SCHEDULING CHAPTER 5 - PROCESS SCHEDULING OBJECTIVES To introduce CPU scheduling, which is the basis for multiprogrammed operating systems To describe various CPU-scheduling algorithms To discuss evaluation criteria

More information

Process Scheduling. Process Scheduling. CPU and I/O Bursts. CPU - I/O Burst Cycle. Variations in Bursts. Histogram of CPU Burst Times

Process Scheduling. Process Scheduling. CPU and I/O Bursts. CPU - I/O Burst Cycle. Variations in Bursts. Histogram of CPU Burst Times Scheduling The objective of multiprogramming is to have some process running all the time The objective of timesharing is to have the switch between processes so frequently that users can interact with

More information

CPU Scheduling. Heechul Yun

CPU Scheduling. Heechul Yun CPU Scheduling Heechul Yun 1 Recap Four deadlock conditions: Mutual exclusion No preemption Hold and wait Circular wait Detection Avoidance Banker s algorithm 2 Recap: Banker s Algorithm 1. Initialize

More information

Scheduling. Uwe R. Zimmer & Alistair Rendell The Australian National University

Scheduling. Uwe R. Zimmer & Alistair Rendell The Australian National University 6 Scheduling Uwe R. Zimmer & Alistair Rendell The Australian National University References for this chapter [Bacon98] J. Bacon Concurrent Systems 1998 (2nd Edition) Addison Wesley Longman Ltd, ISBN 0-201-17767-6

More information

Last class: Today: Threads. CPU Scheduling

Last class: Today: Threads. CPU Scheduling 1 Last class: Threads Today: CPU Scheduling 2 Resource Allocation In a multiprogramming system, we need to share resources among the running processes What are the types of OS resources? Question: Which

More information

Computing the Signal Duration to Minimize Average Waiting Time using Round Robin Algorithm

Computing the Signal Duration to Minimize Average Waiting Time using Round Robin Algorithm Volume 4, No. 6, June 2013 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info Computing the Signal Duration to Minimize Average Waiting Time using Round Robin

More information

CSE 380 Computer Operating Systems

CSE 380 Computer Operating Systems CSE 380 Computer Operating Systems Instructor: Insup Lee & Dianna Xu University of Pennsylvania, Fall 2003 Lecture Note 3: CPU Scheduling 1 CPU SCHEDULING q How can OS schedule the allocation of CPU cycles

More information

Scheduling IoT on to the Cloud : A New Algorithm

Scheduling IoT on to the Cloud : A New Algorithm European Journal of Applied Sciences 9 (5): 249-257, 2017 ISSN 2079-2077 IDOSI Publications, 2017 DOI: 10.5829/idosi.ejas.2017.249.257 Scheduling IoT on to the Cloud : A New Algorithm 1 2 3 4 S. Balamurugan,

More information

Simulation of Process Scheduling Algorithms

Simulation of Process Scheduling Algorithms Simulation of Process Scheduling Algorithms Project Report Instructor: Dr. Raimund Ege Submitted by: Sonal Sood Pramod Barthwal Index 1. Introduction 2. Proposal 3. Background 3.1 What is a Process 4.

More information

LSN 15 Processor Scheduling

LSN 15 Processor Scheduling LSN 15 Processor Scheduling ECT362 Operating Systems Department of Engineering Technology LSN 15 Processor Scheduling LSN 15 FCFS/FIFO Scheduling Each process joins the Ready queue When the current process

More information

Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling

Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling Scheduling I Today Introduction to scheduling Classical algorithms Next Time Advanced topics on scheduling Scheduling out there You are the manager of a supermarket (ok, things don t always turn out the

More information

UC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara

UC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara Operating Systems Christopher Kruegel Department of Computer Science http://www.cs.ucsb.edu/~chris/ Many processes to execute, but one CPU OS time-multiplexes the CPU by operating context switching Between

More information

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out

More information

ANALYSIS AND TESTING OF DIFFERENT TIME QUANTUM FOR ROUND ROBIN ALGORITHM

ANALYSIS AND TESTING OF DIFFERENT TIME QUANTUM FOR ROUND ROBIN ALGORITHM ANALYSIS AND TESTING OF DIFFERENT TIME QUANTUM FOR ROUND ROBIN ALGORITHM KM. ARCHANA PATEL Student of MCA, Department of Computer Applications, NIT Kurukshetra. (Haryana) E-mail: archanamca92@gmail.com

More information

Season Finale: Which one is better?

Season Finale: Which one is better? CS4310.01 Introduction to Operating System Spring 2016 Dr. Zhizhang Shen Season Finale: Which one is better? 1 Background In this lab, we will study, and compare, two processor scheduling policies via

More information

Research Article Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler

Research Article Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler Fuzzy Systems Volume 6, Article ID 78467, pages http://dx.doi.org/./6/78467 Research Article Designing of Vague Logic Based -Layered Framework for CPU Scheduler Supriya Raheja School of Engineering & Technology,

More information

D Praveen Kumar et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (5), 2014,

D Praveen Kumar et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 5 (5), 2014, Finding Best Time Quantum for Round Robin Scheduling Algorithm to avoid Frequent Context Switch D Praveen Kumar #1, T. Sreenivasula Reddy *2, A. Yugandhar Reddy *3 # Assistant Professor, Department of

More information

Real-Time Systems. Event-Driven Scheduling

Real-Time Systems. Event-Driven Scheduling Real-Time Systems Event-Driven Scheduling Marcus Völp, Hermann Härtig WS 2013/14 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed

More information

Lecture Note #6: More on Task Scheduling EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan

Lecture Note #6: More on Task Scheduling EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan Lecture Note #6: More on Task Scheduling EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan Note 6-1 Mars Pathfinder Timing Hiccups? When: landed on the

More information

Networked Embedded Systems WS 2016/17

Networked Embedded Systems WS 2016/17 Networked Embedded Systems WS 2016/17 Lecture 2: Real-time Scheduling Marco Zimmerling Goal of Today s Lecture Introduction to scheduling of compute tasks on a single processor Tasks need to finish before

More information

Clock-driven scheduling

Clock-driven scheduling Clock-driven scheduling Also known as static or off-line scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017

More information

Task Models and Scheduling

Task Models and Scheduling Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling

More information

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling Real-Time Systems Lecture 6 Dynamic Priority Scheduling Online scheduling with dynamic priorities: Earliest Deadline First scheduling CPU utilization bound Optimality and comparison with RM: Schedulability

More information

process arrival time CPU burst time priority p1 0ms 25ms 3 p2 1ms 9ms 1 p3 20ms 14ms 4 p4 32ms 4ms 2

process arrival time CPU burst time priority p1 0ms 25ms 3 p2 1ms 9ms 1 p3 20ms 14ms 4 p4 32ms 4ms 2 Homework #2 Solutions 1. Suppose that the following processes arrive for execution at the times indicated. Each process will run with a single burst of CPU activity (i.e., no I/O) which lasts for the listed

More information

Scheduling Lecture 1: Scheduling on One Machine

Scheduling Lecture 1: Scheduling on One Machine Scheduling Lecture 1: Scheduling on One Machine Loris Marchal October 16, 2012 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer

More information

Priority-driven Scheduling of Periodic Tasks (1) Advanced Operating Systems (M) Lecture 4

Priority-driven Scheduling of Periodic Tasks (1) Advanced Operating Systems (M) Lecture 4 Priority-driven Scheduling of Periodic Tasks (1) Advanced Operating Systems (M) Lecture 4 Priority-driven Scheduling Assign priorities to jobs, based on their deadline or other timing constraint Make scheduling

More information

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013 Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S

More information

Embedded Systems 14. Overview of embedded systems design

Embedded Systems 14. Overview of embedded systems design Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The

More information

Embedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i

Embedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i Embedded Systems 15-1 - REVIEW: Aperiodic scheduling C i J i 0 a i s i f i d i Given: A set of non-periodic tasks {J 1,, J n } with arrival times a i, deadlines d i, computation times C i precedence constraints

More information

Real-Time Scheduling and Resource Management

Real-Time Scheduling and Resource Management ARTIST2 Summer School 2008 in Europe Autrans (near Grenoble), France September 8-12, 2008 Real-Time Scheduling and Resource Management Lecturer: Giorgio Buttazzo Full Professor Scuola Superiore Sant Anna

More information

Analysis of Software Artifacts

Analysis of Software Artifacts Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University

More information

11 The M/G/1 system with priorities

11 The M/G/1 system with priorities 11 The M/G/1 system with priorities In this chapter we analyse queueing models with different types of customers, where one or more types of customers have priority over other types. More precisely we

More information

AS computer hardware technology advances, both

AS computer hardware technology advances, both 1 Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources Chunhui Guo, Student Member, IEEE, Xiayu Hua, Student Member, IEEE, Hao Wu, Student Member, IEEE, Douglas Lautner,

More information

NATCOR: Stochastic Modelling

NATCOR: Stochastic Modelling NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control

More information

Process Scheduling for RTS. RTS Scheduling Approach. Cyclic Executive Approach

Process Scheduling for RTS. RTS Scheduling Approach. Cyclic Executive Approach Process Scheduling for RTS Dr. Hugh Melvin, Dept. of IT, NUI,G RTS Scheduling Approach RTS typically control multiple parameters concurrently Eg. Flight Control System Speed, altitude, inclination etc..

More information

Aperiodic Task Scheduling

Aperiodic Task Scheduling Aperiodic Task Scheduling Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2017 年 11 月 29 日 These slides use Microsoft clip arts. Microsoft copyright

More information

Introduction to Queueing Theory

Introduction to Queueing Theory Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/

More information

PBS: A Unified Priority-Based CPU Scheduler

PBS: A Unified Priority-Based CPU Scheduler PBS: A Unified Priority-Based CPU Scheduler Hanhua Feng Computer Science Columbia University Vishal Misra Computer Science Columbia University May, 006 Dan Rubenstein Electrical Engineering Columbia University

More information

Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2

Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Lecture Outline Scheduling periodic tasks The rate monotonic algorithm Definition Non-optimality Time-demand analysis...!2

More information

Dependency Graph Approach for Multiprocessor Real-Time Synchronization. TU Dortmund, Germany

Dependency Graph Approach for Multiprocessor Real-Time Synchronization. TU Dortmund, Germany Dependency Graph Approach for Multiprocessor Real-Time Synchronization Jian-Jia Chen, Georg von der Bru ggen, Junjie Shi, and Niklas Ueter TU Dortmund, Germany 14,12,2018 at RTSS Jian-Jia Chen 1 / 21 Multiprocessor

More information

Real-time Systems: Scheduling Periodic Tasks

Real-time Systems: Scheduling Periodic Tasks Real-time Systems: Scheduling Periodic Tasks Advanced Operating Systems Lecture 15 This work is licensed under the Creative Commons Attribution-NoDerivatives 4.0 International License. To view a copy of

More information

Embedded Systems Development

Embedded Systems Development Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs

More information

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions Common approaches 3 3. Scheduling issues Priority-driven (event-driven) scheduling This class of algorithms is greedy They never leave available processing resources unutilized An available resource may

More information

Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment

Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment C. Liu and J. Layland Journal of the ACM, 20(1):46--61, January 1973. 2 Contents 1. Introduction and Background 2. The Environment

More information

Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems

Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems By: J.C. Palencia and M. González Harbour Departamento de Electrónica y Computadores, Universidad de Cantabria,

More information

Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems

Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems Vishnu Swaminathan and Krishnendu Chakrabarty Department of Electrical & Computer Engineering Duke University Durham,

More information

Multiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund

Multiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund Multiprocessor Scheduling II: Global Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 28, June, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 42 Global Scheduling We will only focus on identical

More information

EDF Scheduling. Giuseppe Lipari May 11, Scuola Superiore Sant Anna Pisa

EDF Scheduling. Giuseppe Lipari   May 11, Scuola Superiore Sant Anna Pisa EDF Scheduling Giuseppe Lipari http://feanor.sssup.it/~lipari Scuola Superiore Sant Anna Pisa May 11, 2008 Outline 1 Dynamic priority 2 Basic analysis 3 FP vs EDF 4 Processor demand bound analysis Generalization

More information

Research Article Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment

Research Article Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment Hindawi Publishing Corporation Journal of Computer Systems, Networks, and Communications Volume 008, Article ID 57880, 9 pages doi:0.55/008/57880 Research Article Scheduling Algorithm: Tasks Scheduling

More information

Coin Changing: Give change using the least number of coins. Greedy Method (Chapter 10.1) Attempt to construct an optimal solution in stages.

Coin Changing: Give change using the least number of coins. Greedy Method (Chapter 10.1) Attempt to construct an optimal solution in stages. IV-0 Definitions Optimization Problem: Given an Optimization Function and a set of constraints, find an optimal solution. Optimal Solution: A feasible solution for which the optimization function has the

More information

EDF Scheduling. Giuseppe Lipari CRIStAL - Université de Lille 1. October 4, 2015

EDF Scheduling. Giuseppe Lipari  CRIStAL - Université de Lille 1. October 4, 2015 EDF Scheduling Giuseppe Lipari http://www.lifl.fr/~lipari CRIStAL - Université de Lille 1 October 4, 2015 G. Lipari (CRIStAL) Earliest Deadline Scheduling October 4, 2015 1 / 61 Earliest Deadline First

More information

M/G/1 and Priority Queueing

M/G/1 and Priority Queueing M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula

More information

Paper Presentation. Amo Guangmo Tong. University of Taxes at Dallas January 24, 2014

Paper Presentation. Amo Guangmo Tong. University of Taxes at Dallas January 24, 2014 Paper Presentation Amo Guangmo Tong University of Taxes at Dallas gxt140030@utdallas.edu January 24, 2014 Amo Guangmo Tong (UTD) January 24, 2014 1 / 30 Overview 1 Tardiness Bounds under Global EDF Scheduling

More information

Real-Time Scheduling. Real Time Operating Systems and Middleware. Luca Abeni

Real-Time Scheduling. Real Time Operating Systems and Middleware. Luca Abeni Real Time Operating Systems and Middleware Luca Abeni luca.abeni@unitn.it Definitions Algorithm logical procedure used to solve a problem Program formal description of an algorithm, using a programming

More information

Non-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund

Non-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund Non-Preemptive and Limited Preemptive Scheduling LS 12, TU Dortmund 09 May 2017 (LS 12, TU Dortmund) 1 / 31 Outline Non-Preemptive Scheduling A General View Exact Schedulability Test Pessimistic Schedulability

More information

Real-Time and Embedded Systems (M) Lecture 5

Real-Time and Embedded Systems (M) Lecture 5 Priority-driven Scheduling of Periodic Tasks (1) Real-Time and Embedded Systems (M) Lecture 5 Lecture Outline Assumptions Fixed-priority algorithms Rate monotonic Deadline monotonic Dynamic-priority algorithms

More information

EDF Feasibility and Hardware Accelerators

EDF Feasibility and Hardware Accelerators EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo, Waterloo, Canada, arrmorton@uwaterloo.ca Wayne M. Loucks University of Waterloo, Waterloo, Canada, wmloucks@pads.uwaterloo.ca

More information

Controlling Preemption for Better Schedulability in Multi-Core Systems

Controlling Preemption for Better Schedulability in Multi-Core Systems 2012 IEEE 33rd Real-Time Systems Symposium Controlling Preemption for Better Schedulability in Multi-Core Systems Jinkyu Lee and Kang G. Shin Dept. of Electrical Engineering and Computer Science, The University

More information

A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling

A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling Tarek F. Abdelzaher, Vivek Sharma Department of Computer Science, University of Virginia, Charlottesville, VA 224 Chenyang Lu Department

More information

Real-Time Systems. Event-Driven Scheduling

Real-Time Systems. Event-Driven Scheduling Real-Time Systems Event-Driven Scheduling Hermann Härtig WS 2018/19 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed Priority schedulers

More information

Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors. Sanjoy K.

Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors. Sanjoy K. Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors Sanjoy K. Baruah Abstract In fixed-priority scheduling the priority of a job, once assigned,

More information

An Optimal k-exclusion Real-Time Locking Protocol Motivated by Multi-GPU Systems

An Optimal k-exclusion Real-Time Locking Protocol Motivated by Multi-GPU Systems An Optimal k-exclusion Real-Time Locking Protocol Motivated by Multi-GPU Systems Glenn A. Elliott and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract

More information

An Energy-efficient Task Scheduler for Multi-core Platforms with per-core DVFS Based on Task Characteristics

An Energy-efficient Task Scheduler for Multi-core Platforms with per-core DVFS Based on Task Characteristics 1 An -efficient Task Scheduler for Multi-core Platforms with per-core DVFS Based on Task Characteristics Ching-Chi Lin, You-Cheng Syu, Chao-Jui Chang, Jan-Jan Wu, Pangfeng Liu, Po-Wen Cheng and Wei-Te

More information