#### DMCA

## Abstract GLOBAL STATIC-PRIORITY SCHEDULING OF SPORADIC TASK SYSTEMS ON MULTIPROCESSOR PLATFORMS

### Citations

3746 | Scheduling Algorithms for Multiprogramming in A Hard Real-Time Environment
- Liu, Layland
- 1973
(Show Context)
Citation Context ...ruah}@cs.unc.edu each sporadic task, and all the jobs generated by a task are assigned the priority of this task. Examples of staticpriority scheduling algorithms include the rate-monotonic algorithm =-=[11]-=-, in which higher priorities are assigned to tasks with smaller values of the period parameter, and the deadline-monotonic algorithm [10], which assigns tasks priorities in inverse proportion to their... |

2008 | A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks
- Parekh
- 1992
(Show Context)
Citation Context ...tems. Upper bounds on the load may be obtainable through empirical or analytical methods (for example, we may obtain upper bounds for load of real-time network traffic using the wellknown (σ,ρ) model =-=[13]-=-). Once an upper bound on load has been determined, we may apply the schedulability test of Theorem 1. Abdelzaher et al. [2] have previously considered the static-priority multiprocessor scheduling of... |

441 |
On the complexity of fixed-priority scheduling of periodic real-time tasks,” Performance Evaluation(2
- Leung, Whitehead
- 1982
(Show Context)
Citation Context ...ity scheduling algorithms include the rate-monotonic algorithm [11], in which higher priorities are assigned to tasks with smaller values of the period parameter, and the deadline-monotonic algorithm =-=[10]-=-, which assigns tasks priorities in inverse proportion to their relative deadline parameters: if dk < dℓ, then task τk has a higher priority than task τℓ (ties broken arbitrarily). Static-priority sch... |

403 |
fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment
- Mok
- 1983
(Show Context)
Citation Context ...s of these schedulability tests. Keywords: Multiprocessor platforms; Static-Priority Scheduling; Schedulability analysis; Resource Augmentation. 1 Introduction Over the years, the sporadic task model =-=[12, 6]-=- has proven remarkably useful for the modelling of recurring processes that occur in hard-real-time systems. In this model, a sporadic task τk = (ek,dk,pk) is characterized by a worstcase execution re... |

357 |
Scheduling real-time transactions: A performance evaluation
- Abbott, Garcia-Molina
- 1992
(Show Context)
Citation Context ...th each request a deadline and priority. From a different domain: real-time database systems (RTDBS) may characterize transactions by their arrival time, execution requirement, deadline, and priority =-=[1]-=-. In both these examples, the real-time instance characterization discussed in Section 2 can be used to model these systems. Upper bounds on the load may be obtainable through empirical or analytical ... |

301 |
A Practitioner’s Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems.
- Klein, Ralya, et al.
- 1993
(Show Context)
Citation Context ...(ties broken arbitrarily). Static-priority scheduling algorithms are very commonly used in real-time systems; indeed, the RateMonotonic Analysis (RMA) real-time system design and analysis methodology =-=[9]-=- has become a standard in the domain of hard-real-time systems. One of the benefits of scheduling systems using static-priority scheduling is that higher-priority tasks are protected from errant behav... |

245 | Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor
- Baruah, Rosier, et al.
- 1990
(Show Context)
Citation Context ...l demand, normalized by interval length, of priority k or greater that can be generated by sporadic task system τ. It has been shown that load may be efficiently determined for sporadic task systems. =-=[5, 8, 15]-=- present algorithms that have pseudo-polynomial time complexity for task systems that have a system utilization ( �n i=1 ei/pi) strictly less than m. If a bounded amount of inaccuracy may be tolerated... |

236 | Preemptively scheduling hard-real-time sporadic tasks on one processor
- Baruah, Mok, et al.
- 1990
(Show Context)
Citation Context ...s of these schedulability tests. Keywords: Multiprocessor platforms; Static-Priority Scheduling; Schedulability analysis; Resource Augmentation. 1 Introduction Over the years, the sporadic task model =-=[12, 6]-=- has proven remarkably useful for the modelling of recurring processes that occur in hard-real-time systems. In this model, a sporadic task τk = (ek,dk,pk) is characterized by a worstcase execution re... |

158 | Optimal time-critical scheduling via resource augmentation.
- Phillips, Stein, et al.
- 1997
(Show Context)
Citation Context ... the research reported in this document is aimed at determining schedulability-analysis algorithms for sporadic task systems which are implemented upon multiprocessor platforms. Resource augmentation =-=[14]-=- provides a measure of the relative effectiveness and tightness of a given schedulability analysis algorithm. Resource augmentation works by comparing a given algorithm against the performance of a hy... |

45 |
Improvement in feasibility testing for real-time tasks.
- Ripoll, Crespo, et al.
- 1996
(Show Context)
Citation Context ...l demand, normalized by interval length, of priority k or greater that can be generated by sporadic task system τ. It has been shown that load may be efficiently determined for sporadic task systems. =-=[5, 8, 15]-=- present algorithms that have pseudo-polynomial time complexity for task systems that have a system utilization ( �n i=1 ei/pi) strictly less than m. If a bounded amount of inaccuracy may be tolerated... |

40 |
New Schedulability Tests for Real-time Task Sets Scheduled by Deadline Monotonic on Multiprocessors
- Bertogna, Cirinei, et al.
- 2006
(Show Context)
Citation Context ... instances. 4.2 The Scheduling of Sporadic Task Systems Recently, researchers have focussed on the multiprocessor static-priority scheduling of sporadic task systems. Baker [3, 4] and Bertogna et al. =-=[7]-=- have derived sufficient conditions for the multiprocessor, static-priority schedulability of sporadic task systems. The following theorem restates the schedulability test from Bertogna et al. [7]: Th... |

38 | An Analysis of Fixed-Priority Schedulability on a Multiprocessor, Real-Time Systems,
- Baker
- 2006
(Show Context)
Citation Context ...nic scheduling of real-time instances. 4.2 The Scheduling of Sporadic Task Systems Recently, researchers have focussed on the multiprocessor static-priority scheduling of sporadic task systems. Baker =-=[3, 4]-=- and Bertogna et al. [7] have derived sufficient conditions for the multiprocessor, static-priority schedulability of sporadic task systems. The following theorem restates the schedulability test from... |

37 | The partitioned scheduling of sporadic tasks according to static-priorities
- Fisher, Baruah, et al.
- 2006
(Show Context)
Citation Context ...l demand, normalized by interval length, of priority k or greater that can be generated by sporadic task system τ. It has been shown that load may be efficiently determined for sporadic task systems. =-=[5, 8, 15]-=- present algorithms that have pseudo-polynomial time complexity for task systems that have a system utilization ( �n i=1 ei/pi) strictly less than m. If a bounded amount of inaccuracy may be tolerated... |

11 | The aperiodic multiprocessor utilization bound for liquid tasks
- Abdelzaher, Andersson, et al.
- 2002
(Show Context)
Citation Context ...unds for load of real-time network traffic using the wellknown (σ,ρ) model [13]). Once an upper bound on load has been determined, we may apply the schedulability test of Theorem 1. Abdelzaher et al. =-=[2]-=- have previously considered the static-priority multiprocessor scheduling of real-time instances. Abdelzaher et al. propose a workload characterization called synthetic utilization. Let V (t) be the s... |

10 | An analysis of deadline-monotonic schedulability on a multiprocessor
- Baker
- 2003
(Show Context)
Citation Context ...nic scheduling of real-time instances. 4.2 The Scheduling of Sporadic Task Systems Recently, researchers have focussed on the multiprocessor static-priority scheduling of sporadic task systems. Baker =-=[3, 4]-=- and Bertogna et al. [7] have derived sufficient conditions for the multiprocessor, static-priority schedulability of sporadic task systems. The following theorem restates the schedulability test from... |