## The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems (2006)

### Download From

IEEE### Download Links

- [www.cs.unc.edu]
- [www.cs.wayne.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Transactions on Computers |

Citations: | 15 - 2 self |

### BibTeX

@ARTICLE{Baruah06thepartitioned,

author = {Sanjoy Baruah and Nathan Fisher and Student Member},

title = {The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems},

journal = {IEEE Transactions on Computers},

year = {2006},

volume = {55}

}

### OpenURL

### Abstract

Abstract—A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks, each constrained to have its relative-deadline parameter be no larger than its period parameter, among the processors of an identical multiprocessor platform. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation: It is shown that any set of sporadic tasks that can be partitioned among the processors of an m-processor identical multiprocessor platform will be partitioned by this algorithm on an m-processor platform in which each processor is ð3 1=mÞ times as fast. Index Terms—Sporadic tasks, partitioned scheduling, multiprocessors, resource augmentation. 1

### Citations

3180 | Scheduling algorithms for multiprogram in a hard real-time environment
- Liu, Layland
- 1973
(Show Context)
Citation Context ... arrival sequence for the sporadic task system). This fact, in conjunction with the optimality of the Earliest Deadline First scheduling algorithm (EDF) for scheduling preemptive uniprocessor systems =-=[16]-=-, [8], has allowed for the design of preemptive uniprocessor feasibility-analysis algorithms for sporadic task systems [19], [6]. On multiprocessor systems, two alternative paradigms for scheduling co... |

375 |
On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks. Performance Evaluation
- Leung, Whitehead
- 1982
(Show Context)
Citation Context ...e that, in the case of uniprocessor real-time scheduling, moving from implicit-deadline systems (the initial work of Liu and Layland [16]) to constrained systems (as represented in, e.g., [19], [14], =-=[15]-=-, [13], [2] etc., 2 had a major impact on the maturity and development of the field of uniprocessor real-time systems; we are hopeful that progress in better understanding the multiprocessor schedulin... |

320 |
Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment
- Mok
- 1983
(Show Context)
Citation Context ... in which each processor is ð3 1=mÞ times as fast. Index Terms—Sporadic tasks, partitioned scheduling, multiprocessors, resource augmentation. 1 INTRODUCTION Ç OVER the years, the sporadic task model =-=[19]-=- has proven remarkably useful for the modeling of recurring processes that occur in hard-real-time systems. In this model, a sporadic task i ðei;di;piÞ is characterized by a worst-case execution req... |

158 | Preemptively scheduling hard-real-time sporadic tasks on one processor
- Baruah, Mok, et al.
- 1990
(Show Context)
Citation Context ... job-arrival sequences by the different tasks comprising the system. The feasibilityanalysis of sporadic task systems on preemptive uniprocessors has been extensively studied. It is known (see, e.g., =-=[6]-=-) that a sporadic task system is feasible on a preemptive uniprocessor if and only if all deadlines can be met when each task in the system has a job arrive at the same time-instant and subsequent job... |

140 | Optimal time-critical scheduling via resource augmentation
- Phillips, Stein, et al.
- 2002
(Show Context)
Citation Context ...-real-time systems, this question must be answered beforehand, during the design of the system and prior to system runtime. With respect to global scheduling, there is a result due to Phillips et al. =-=[20]-=-, which can be paraphrased as follows: If a collection of real-time jobs is feasible on m identical processors, then the same collection of jobs will be scheduled to meet all deadlines by the global E... |

107 | Fast algorithm for bin packing
- Johnson
- 1974
(Show Context)
Citation Context ...asks 1; 2; ...; i 1 have all been successfully allocated among the m processors and we are now attempting to allocate task i to a processor. Our algorithm for doing this is a variant of the First Fit =-=[11]-=- algorithm for bin-packing and is as follows: For any processor ‘, let ð ‘Þ denote the tasks from among 1; ...; i 1 that have already been allocated to processor ‘. Considering the processors 1; 2; ..... |

105 | Multiprocessor edf and deadline monotonic schedulability analysis
- Baker
- 2003
(Show Context)
Citation Context ... using the heuristics presented in [18], [17]. Our major contribution is a polynomial-time algorithm for partitioning a given sporadic 1. A notable and important exception is the recent work of Baker =-=[3]-=-, [4], [5], which considers systems of sporadic tasks with di 6 pi. We will discuss the relationship between our results and the work of Baker in Section 3. 2. This is merely a small sample and by no... |

82 |
Some simple scheduling algorithms
- Horn
- 1974
(Show Context)
Citation Context ...r all tasks i)—such sporadic systems are sometimes referred to in the literature as implicitdeadline systems. 1 For implicit-deadline systems, feasibilityanalysis under the global paradigm is trivial =-=[10]-=-, [21]: An implicit-deadline system is feasible upon a platform comprised of m unit-capacity processors if and only if 1) ðei=piÞ 1 for each task i 2 and 2) P i2 ðei=piÞ m. Under the partitioned parad... |

82 |
Near-optimal Bin-packing Algorithms
- Johnson
- 1973
(Show Context)
Citation Context ...ors if and only if 1) ðei=piÞ 1 for each task i 2 and 2) P i2 ðei=piÞ m. Under the partitioned paradigm, feasibility-analysis for implicit-deadline systems can be transformed to a bin-packing problem =-=[12]-=- and shown to be NP-hard in the strong sense; sufficient feasibility tests for various bin-packing heuristics have recently been obtained [18], [17], [9]. The research described in this report is part... |

80 |
Fixed priority scheduling of periodic tasks with arbitrary deadlines
- Lehoczky
- 1990
(Show Context)
Citation Context ..., in the case of uniprocessor real-time scheduling, moving from implicit-deadline systems (the initial work of Liu and Layland [16]) to constrained systems (as represented in, e.g., [19], [14], [15], =-=[13]-=-, [2] etc., 2 had a major impact on the maturity and development of the field of uniprocessor real-time systems; we are hopeful that progress in better understanding the multiprocessor scheduling of c... |

50 |
An Analysis of EDF Schedulability on a Multiprocessor
- Baker
- 2005
(Show Context)
Citation Context ... heuristics presented in [18], [17]. Our major contribution is a polynomial-time algorithm for partitioning a given sporadic 1. A notable and important exception is the recent work of Baker [3], [4], =-=[5]-=-, which considers systems of sporadic tasks with di 6 pi. We will discuss the relationship between our results and the work of Baker in Section 3. 2. This is merely a small sample and by no means an ... |

46 | An event stream driven approximation for the analysis of real-time systems
- Albers, Slomka
- 2004
(Show Context)
Citation Context ...function DBFð i;tÞ, if plotted as a function of t for a given task i, is represented by a series of “steps,” each of height ei, at time-instants di, di þ pi, di þ 2pi, , di þ kpi, . Albers and Slomka =-=[1]-=- have proposed a technique for approximating the DBF, which tracks the DBF exactly through the first several steps and then approximates it by a line of slope ei=pi. In the following, we are applying ... |

35 |
Utilization bounds for edf scheduling on real-time multiprocessor systems
- Lopez, Diaz, et al.
- 2004
(Show Context)
Citation Context ...systems can be transformed to a bin-packing problem [12] and shown to be NP-hard in the strong sense; sufficient feasibility tests for various bin-packing heuristics have recently been obtained [18], =-=[17]-=-, [9]. The research described in this report is part of a larger project that is aimed at obtaining a better understanding of the multiprocessor scheduling of sporadic task systems comprised of tasks ... |

31 |
Control Robotics: The
- Dertouzos
- 1974
(Show Context)
Citation Context ...al sequence for the sporadic task system). This fact, in conjunction with the optimality of the Earliest Deadline First scheduling algorithm (EDF) for scheduling preemptive uniprocessor systems [16], =-=[8]-=-, has allowed for the design of preemptive uniprocessor feasibility-analysis algorithms for sporadic task systems [19], [6]. On multiprocessor systems, two alternative paradigms for scheduling collect... |

28 |
Deadline Monotonic Scheduling Theory and Application
- Audsley, Burns, et al.
- 1993
(Show Context)
Citation Context ...he case of uniprocessor real-time scheduling, moving from implicit-deadline systems (the initial work of Liu and Layland [16]) to constrained systems (as represented in, e.g., [19], [14], [15], [13], =-=[2]-=- etc., 2 had a major impact on the maturity and development of the field of uniprocessor real-time systems; we are hopeful that progress in better understanding the multiprocessor scheduling of constr... |

24 | Improved Schedulability Analysis - Bertogna, Cirinei, et al. - 2005 |

22 | Efficient and Flexible Fair Scheduling of Real-time Tasks on Multiprocessors
- Srinivasan
- 2003
(Show Context)
Citation Context ...tasks i)—such sporadic systems are sometimes referred to in the literature as implicitdeadline systems. 1 For implicit-deadline systems, feasibilityanalysis under the global paradigm is trivial [10], =-=[21]-=-: An implicit-deadline system is feasible upon a platform comprised of m unit-capacity processors if and only if 1) ðei=piÞ 1 for each task i 2 and 2) P i2 ðei=piÞ m. Under the partitioned paradigm, f... |

11 |
A Note on Preemptive Scheduling
- Leung, Merrill
- 1980
(Show Context)
Citation Context ...observe that, in the case of uniprocessor real-time scheduling, moving from implicit-deadline systems (the initial work of Liu and Layland [16]) to constrained systems (as represented in, e.g., [19], =-=[14]-=-, [15], [13], [2] etc., 2 had a major impact on the maturity and development of the field of uniprocessor real-time systems; we are hopeful that progress in better understanding the multiprocessor sch... |

8 | Task assignment on uniform heterogeneous multiprocessors
- Funk, Baruah
- 2005
(Show Context)
Citation Context ...s can be transformed to a bin-packing problem [12] and shown to be NP-hard in the strong sense; sufficient feasibility tests for various bin-packing heuristics have recently been obtained [18], [17], =-=[9]-=-. The research described in this report is part of a larger project that is aimed at obtaining a better understanding of the multiprocessor scheduling of sporadic task systems comprised of tasks that ... |

7 | An analysis of deadline-monotonic scheduling on a multiprocessor”, technical report
- Baker
- 2003
(Show Context)
Citation Context ...g the heuristics presented in [18], [17]. Our major contribution is a polynomial-time algorithm for partitioning a given sporadic 1. A notable and important exception is the recent work of Baker [3], =-=[4]-=-, [5], which considers systems of sporadic tasks with di 6 pi. We will discuss the relationship between our results and the work of Baker in Section 3. 2. This is merely a small sample and by no mean... |

4 |
Utilization Bounds for EDF scheduling
- LOPEZ, GARCIA, et al.
- 2004
(Show Context)
Citation Context ...dline systems can be transformed to a bin-packing problem [12] and shown to be NP-hard in the strong sense; sufficient feasibility tests for various bin-packing heuristics have recently been obtained =-=[18]-=-, [17], [9]. The research described in this report is part of a larger project that is aimed at obtaining a better understanding of the multiprocessor scheduling of sporadic task systems comprised of ... |