Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems

Tia, Too-Seng; Liu, Jane W. S.; Shankar, Mallikarjun

doi:10.1007/bf00357882

Cited by 58 publications

(32 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Indeed, Tia et al (1996) proved that, if periodic tasks are scheduled using a fixedpriority assignment, no algorithm can minimize the response time of every aperiodic request and still guarantee the schedulability of the periodic tasks. The same is not true for EDF, as discussed below.…”

Section: Aperiodic Task Handlingmentioning

confidence: 99%

“…The same is not true for EDF, as discussed below. In particular, the following theorems were proved in Tia et al (1996): Theorem 3 [Tia-Liu-Shankar]. For any set of periodic tasks ordered on a given fixedpriority scheme and aperiodic requests ordered according to a given aperiodic queueing discipline, there does not exist any valid algorithm that minimizes the response time of every soft aperiodic request.…”

Section: Aperiodic Task Handlingmentioning

confidence: 99%

See 1 more Smart Citation

Rate Monotonic vs. EDF: Judgment Day

Buttazzo

2003

Embedded Software

121

View full text Add to dashboard Cite

Abstract. Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedulability analysis of periodic task sets. Unfortunately, many misconceptions still exist about the properties of these two scheduling methods, which usually tend to favor RM more than EDF. Typical wrong statements often heard in technical conferences and even in research papers claim that RM is easier to analyze than EDF, it introduces less runtime overhead, it is more predictable in overload conditions, and causes less jitter in task execution.Since the above statements are either wrong, or not precise, it is time to clarify these issues in a systematic fashion, because the use of EDF allows a better exploitation of the available resources and significantly improves system's performance. This paper compares RM against EDF under several aspects, using existing theoretical results, specific simulation experiments, or simple counterexamples to show that many common beliefs are either false or only restricted to specific situations.

show abstract

Section: Aperiodic Task Handlingmentioning

confidence: 99%

Section: Aperiodic Task Handlingmentioning

confidence: 99%

Rate Monotonic vs. EDF: Judgment Day

Buttazzo

2003

Embedded Software

121

View full text Add to dashboard Cite

show abstract

“…Maximum-Minimum Frequency for Dynamic Voltage-Frequency Scaling (MMF-DVS) technique on hand in [11] is comparable to RDVS as together of these approaches use DVS to decrease energy consumption of scheduled needy tasks in clusters. Unlike RDVS algorithm which applies only one frequency to execute a job, MMF-DVS uses a linear combination of maximum and minimum processor frequencies to attain the optimal energy consumption regarding to slack time of the task.…”

Section: Maximum-minimum Frequency For Dynamic Voltage-frequency Scalmentioning

confidence: 99%

“…We have knowledgeable our algorithm with in cooperation random and real-world application job graphs and compared with the consequences in preceding research in [7] and [11]. The RDVS algorithm decreases task implementation power by choosing the most excellent processor's speed with respect to the task's unoccupied time [7].…”

Section: Multiple Frequency Selection For Dynamic Voltage-frequency Smentioning

confidence: 99%

A Metaphorical Research on Diversified Approaches of DVS Enabled Energy - Aware Cloud Data Centers under the Cloudsim Platform

C.Saranya¹

2015

IJIRCCE

View full text Add to dashboard Cite

Energy has turn into one of the majority critical issues. Energy-efficient designs encompass engage in recreation significance roles for hardware as fine as software implementations. Energy-efficiency can be achieved by adopting the dynamic voltage scaling (DVS) scheme. DVS has been a solution scheme in exploiting to reduce energy dissipation by lowering the supply voltage and operating occurrence. In this dissertation we anticipated diversified approaches on DVS enabled Energy aware Cloud Data centers. DVS has implemented on every approaches with different mechanisms and it provides energy saving and different advantaged features of the system. The scrutiny of research would give the instruction concerning what has been done previously in the same area, what is the in attendance tendency and what are the other related areas, Comparison of algorithms imposed with DVS features under the Cloudsim. The analysis has resultant that the DVS has reduced the power and improve the system utilization.

show abstract

“…The problem of optimal scheduling of update messages subject to some optimization criteria is related to a family of task scheduling problems real-time systems [4,10,14,15]. In such systems, real-time tasks need to be completed by certain deadlines.…”

Section: Related Workmentioning

confidence: 99%

Schemes for scheduling of control messages by hierarchical protocols

Bortnikov

Cohen²

Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Compu

View full text Add to dashboard Cite

The paper addresses the problem of designing ef®cient scheduling policies for the transmission of control messages by hierarchical network protocols. Such protocols encounter a tradeoff between the desire to forward a control message across the tree as soon as it is received, and the desire to reduce control traf®c. Scheduling problems that arise in this context are de®ned and discussed. The paper mainly concentrates on minimizing the average extra delay encountered by the control messages under an upper bound on the number of outgoing messages a node can send during a ®xed period of time. A polynomial-time algorithm is presented for the off-line version of the problem, and then several ef®cient on-line heuristics are presented and compared. q

show abstract

Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems

Cited by 58 publications

References 7 publications

Rate Monotonic vs. EDF: Judgment Day

Rate Monotonic vs. EDF: Judgment Day

A Metaphorical Research on Diversified Approaches of DVS Enabled Energy - Aware Cloud Data Centers under the Cloudsim Platform

Schemes for scheduling of control messages by hierarchical protocols

Contact Info

Product

Resources

About