Efficient object sharing in quantum-based real-time systems
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10528725,p. 346-355
- https://doi.org/10.1109/real.1998.739768
Abstract
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum-based systems, the size of the quantum is quite large in comparison to the length of an object call. As a result, most object calls can be expected to execute without preemption. A good object-sharing scheme should optimize for this expected case, while achieving low overhead when preemptions do occur. In this paper, we present several new shared-object algorithms for uniprocessors and multiprocessors that were designed based upon this principle. We also present scheduling analysis results that can be used in conjunction with these algorithms.Keywords
This publication has 20 references indexed in Scilit:
- The non-blocking write protocol NBW: A solution to a real-time synchronization problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A framework for implementing objects and scheduling tasks in lock-free real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On non-preemptive scheduling of period and sporadic tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The synergy between non-blocking synchronization and operating system structurePublished by Association for Computing Machinery (ACM) ,1996
- Real-time object sharing with minimal system supportPublished by Association for Computing Machinery (ACM) ,1996
- Engineering and analysis of fixed priority schedulersIEEE Transactions on Software Engineering, 1993
- PROTEUS: a high-performance parallel-architecture simulatorPublished by Association for Computing Machinery (ACM) ,1992
- Algorithms for scalable synchronization on shared-memory multiprocessorsACM Transactions on Computer Systems, 1991
- Synchronization algorithms for shared-memory multiprocessorsComputer, 1990
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973