Distributed System Design Using Generalized Rate Monotonic Theory.

Sha, Lui; Sathaye, Shirish S.

doi:10.21236/ada304100

Cited by 10 publications

(9 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [23], Sha et al thoroughly studied the applicability of RM scheduling on multiprocessor distributed systems, using SS for aperiodic activities. However, the main focus was on hardware and network-level real-time support for distributed, or loosely coupled multiprocessor systems, quite different from our perspective.…”

Section: Related Workmentioning

confidence: 99%

Sporadic Server revisited

Faggioli

Bertogna

Checconi

2010

Proceedings of the 2010 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

The Sporadic Server (SS) overcomes the major limitations of other Resource Reservation Fixed Priority based techniques, but it also presents some drawbacks, mainly related to an increased scheduling overhead and a not so efficient behavior during overrun situations.In this paper we introduce and prove the effectiveness of an improved SS with reduced overhead and fairer handling of server overrun situations. We also show how this can be efficiently exploited to provide temporal isolation in a multiprocessor platform, adapting already existing schedulability tests.

show abstract

Section: Related Workmentioning

confidence: 99%

Sporadic Server revisited

Faggioli

Bertogna

Checconi

2010

Proceedings of the 2010 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…been proposed for online admission control of newly arrived tasks. The incremental algorithm does not need to recompute the response time of all tasks as in some precise schedulability tests [13], [15], [20], [21]. 4.…”

Section: An Incremental Schedulability Test Algorithm Hasmentioning

confidence: 99%

“…The goal of this paper is to provide a theoretical base for more efficient schedulability tests. The concept developed in this paper could be integrated with the work in the Rate Monotonic Analysis [15], [21] regarding the overhead handling of context switches and sporadic-server-based analysis [4] and the work in process synchronization regarding blocking time analysis, e.g., [22].…”

Section: An Incremental Schedulability Test Algorithm Hasmentioning

confidence: 99%

“…The schedulability test for priority-based task set has been extensively studied [1], [2], [6], [8], [13], [15], [20], [21], [30]. Some of them are known to be precise [13], [15], [20], [21]. However, precise tests usually have high time complexities and may not be adequate for online admission control if the system has a large number of tasks or a dynamic workload.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient online schedulability tests for real-time systems

Kuo

Chang

Liu

et al. 2003

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for online admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. On the other hand, most precise schedulability tests proposed to date have a high complexity and may not be suitable for online tests. In this paper, we present new efficient online schedulability tests for both the periodic process model [8] and the multiframe process model [1] in uniprocessor environments. The schedulability tests are shown to be more precise and efficient than any existing polynomial-time schedulability tests. Moreover, the tests can be done incrementally as each new task arrives at the system. Our proposed tests can also be used for the multiframe model where a task may have different computation times in different periods. We show the performance of the proposed schedulability tests in several simulation experiments.

show abstract

“…Some of them are kno wn to be precise 2, 10, 19,21]. How ever, precise tests usually have high time complexities and may not be adequate for on-line admission control if the system has a large number of tasks or a dynamic workload.…”

Section: Introductionmentioning

confidence: 99%

Efficient on-line schedulability tests for priority driven real-time systems

Kuo

Liu²,

Lini³

Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000

View full text Add to dashboard Cite

Many computer systems, such as those for open system envir onmentsor multimedia servic es, ne edan efcient schedulability test for on-line admission control of new jobs. A lthough various p olynomial time schedulability tests have been propose d, they often fail to decide the schedulability of the system precisely when the system is heavily loade d. This paper presents e cient on-line sche dulability tests which are are shown to be more p r ecise and e cient than any existing polynomialtime schedulability tests. Moreover, our proposed t e s t s can be u s e d for the multiframe model where a task may have di erent computation times in di erent periods. We show the performance of the prop ose dsche dulability tests in several simulation experiments.

show abstract

Distributed System Design Using Generalized Rate Monotonic Theory.

Cited by 10 publications

References 25 publications

Sporadic Server revisited

Sporadic Server revisited

Efficient online schedulability tests for real-time systems

Efficient on-line schedulability tests for priority driven real-time systems

Contact Info

Product

Resources

About