Results 1 - 10
of
65
A survey of hard real-time scheduling for multiprocessor systems
- ACM COMPUTING SURVEYS
, 2011
"... This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results ab ..."
Abstract
-
Cited by 92 (9 self)
- Add to MetaCart
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges, and likely productive research directions.
An optimal realtime scheduling algorithm for multiprocessors
- In Proc. 27th IEEE International Real-Time Systems Symposium, Rio de Janeiro
, 2006
"... Abstract — We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on multiprocessors. We derive LNREF’s minimum-required space cost for wait-free synchronization using the space-opt ..."
Abstract
-
Cited by 66 (0 self)
- Add to MetaCart
(Show Context)
Abstract — We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on multiprocessors. We derive LNREF’s minimum-required space cost for wait-free synchronization using the space-optimal waitfree algorithm. We then establish the feasibility conditions for lock-free and lock-based sharing under LNREF, and the concomitant tradeoffs. While the tradeoff between wait-free versus the other sharing is obvious, i.e., space and time costs, we show that the tradeoff between lock-free and lock-based sharing for LNREF hinges on the cost of the lock-free retry, blocking time under lock-based. Finally, we numerically evaluate lock-free and lock-based sharing for LNREF. I.
Pragmatic Nonblocking Synchronization for Real-Time Systems
, 2001
"... We present a pragmatic methodology for designing nonblocking real-time systems. Our methodology uses a combination of lock-free and wait-free synchronization techniques and clearly states which technique should be applied in which situation. ..."
Abstract
-
Cited by 46 (10 self)
- Add to MetaCart
We present a pragmatic methodology for designing nonblocking real-time systems. Our methodology uses a combination of lock-free and wait-free synchronization techniques and clearly states which technique should be applied in which situation.
On recent advances in time/utility function real-time scheduling and resource management
- In IEEE ISORC, pages 55 – 60
, 2005
"... We argue that the key underpinning of the current stateof-the real-time practice — the priority artifact — and that of the current state-of-the real-time art — deadline-based timeliness optimality — are entirely inadequate for specifying timeliness objectives, for reasoning about timeliness behavior ..."
Abstract
-
Cited by 35 (11 self)
- Add to MetaCart
(Show Context)
We argue that the key underpinning of the current stateof-the real-time practice — the priority artifact — and that of the current state-of-the real-time art — deadline-based timeliness optimality — are entirely inadequate for specifying timeliness objectives, for reasoning about timeliness behavior, and for performing resource management that can dependably satisfy timeliness objectives in many dynamic real-time systems. We argue that time/utility functions and the utility accrual scheduling paradigm provide a more generalized, adaptive, and flexible approach. Recent research in the utility accrual paradigm have significantly advanced the state-of-the-art of that paradigm. We survey these advances. 1.
A Framework for Implementing Objects and Scheduling Tasks in Lock-Free Real-Time Systems
- In Proceedings of the 17th IEEE Real-Time Systems Symposium
, 1996
"... We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work. The first is to enable functionality for object sharing in lock-free real-time systems that is comparable to that in lo ..."
Abstract
-
Cited by 31 (16 self)
- Add to MetaCart
(Show Context)
We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work. The first is to enable functionality for object sharing in lock-free real-time systems that is comparable to that in lock-based systems. Our main contribution toward this objective is an efficient approach for implementing multiobject lock-free operations and transactions. A second key objective of our work is to improve upon previously proposed scheduling conditions for tasks that share lock-free objects. When developing such conditions, the key issue is to bound the cost of operation "interferences". We present a general approach for doing this, based on linear programming. 1. Introduction Mostworkon implementing shared objects in preemptive real-time uniprocessor systems has focused on using critical sections to ensure object consistency. The main problem that arises when using critical sections is that ...
An improved schedulability test for uniprocessor periodic task systems
- In Proceedings of EuroMicro Conference on Real-Time Systems
, 2003
"... We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show analytically and empirically that this test is more accurate than the commonlyused d ..."
Abstract
-
Cited by 31 (0 self)
- Add to MetaCart
(Show Context)
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm. We show analytically and empirically that this test is more accurate than the commonlyused density condition. We also present and discuss the results of experiments that compare the accuracy and execution time of our test with that of a pseudo-polynomial-time schedulability test presented previously for a restricted class of task systems in which utilization is strictly less than one. 1
Utility Accrual Real-Time Scheduling: Models and Algorithms
- PH.D. DISSERTATION, VIRGINIA TECH
, 2004
"... ..."
A Survey of Hard Real-Time Scheduling Algorithms and Schedulability Analysis Techniques for Multiprocessor Systems
"... This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results a ..."
Abstract
-
Cited by 29 (1 self)
- Add to MetaCart
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open
Wait-free Object-Sharing Schemes for Real-Time Uniprocessors and Multiprocessors
- In Proceedings of the Eighteenth IEEE Real-Time Systems Symposium
, 1997
"... Several new wait-free object-sharing schemes for realtime uniprocessors and multiprocessors are presented. These schemes have characteristics in common with the priority inheritance and priority ceiling protocols, but are nonblocking and implemented at the user level. In total, six new object-sharin ..."
Abstract
-
Cited by 25 (10 self)
- Add to MetaCart
(Show Context)
Several new wait-free object-sharing schemes for realtime uniprocessors and multiprocessors are presented. These schemes have characteristics in common with the priority inheritance and priority ceiling protocols, but are nonblocking and implemented at the user level. In total, six new object-sharing schemes are proposed: two for uniprocessors and four for multiprocessors. Breakdown utilization experiments are presented that show that the multiprocessor schemes entail less overhead than lock-based schemes. 1. Introduction In a wait-free object implementation [9], operations must be implemented using bounded, sequential code fragments, with no blocking synchronization constructs. In real-time applications, wait-free object implementations are an attractive alternative to more conventional lock-based objectsharing schemes, because wait-free implementations avoid deadlock and priority inversion with no underlying kernel support. However, previous wait-free implementations designed for asy...
