Object technologies and real-time scheduling
Abstract
Any object-based real-time system gives rise to real-time scheduling issues not easily solved by use of standard scheduling methods, including: (1) the invocation of an object's method may imply the need for online schedulability analysis for the thread(s) able to execute method code, (2) parallelism internal to objects may result in the need to schedule multiple threads and target processors simultaneously, and (3) methods that invoke other methods as part of their execution give rise to hierarchically composed groups of to-be-scheduled real-time threads. The Rapid scheduler presented in this paper addresses such dynamic object-based real-time systems for target machines comprised of both multi- and uniprocessor machines. To address the variety of needs of object-based real-time systems, Rapid is 1) configurable to the target multiprocessor architecture, 2) dynamically re-configurable to changes in application requirements, 3) efficient in terms of processor utilization, and 4) effective in producing high quality schedules. Rapid's current implementation addresses hard deadline application, with future work concerning alternative formulations of timing constraints.
References
[1]
[Anderson et al., 1990] T.E. Anderson, B.N. Bershad, E.D. Lazowska, and H.M. Levy. Scheduler activations: Effective kernel support for the user-level management of parallelism. Technical report, Department of Computer Science and Engineering, University of Washington, TR 90-04-02, April 1990.
[2]
[Bihari et al., 1989] Tomas E. Bihari, Thomas M. Walliser, and Mark R. Patterson. Controlling the adaptive suspension vehicle. IEEE Computer, pages 59-64, June 1989.
[3]
[Blake, 1990] Ben Blake. A Fast, Effective Scheduling Framework for Parallel Computing Systems. PhD thesis, Department of Computer and Information Science, Ohio State University, 1990. C-128-B.
[4]
[III et al., 1992] H. Burkhardt III, S. Frank, B. Knobe, and J. Rothnie. Overview of the ksr1 computer system. Technical Report KSR-TR-9202001, Kendall Square Research, Boston, February 1992.
[5]
[Kandlur et al., 1989] Dilip D. Kandlur, Daniel L. Kiskis, and Kang G. Shin. HARTOS: A distributed real-time operating system. In Operating Systems Review of ACM SIGOPS, pages 72-89. ACM Press, July 1989.
[6]
[Locke et al., 1985] C. D. Locke, H. Tokuda, and E. D. Jensen. A time-driven scheduling model for real-time operating systems. Technical report, Carnegie-Mellon University, 1985.
[7]
[Mok and Dertouzos, 1978] A. K. Mok and M. L. Dertouzos. Multiprocessor scheduling in a hard real-time environment. In Proc. of the Seventh Texas Conference on Computing Systems, November 1978.
[8]
[Niehaus et al., 1993] Douglas Niehaus, Krithi Ramamritham, John A. Stankovic, Gary Wallace, and Charles Weems. The spring scheduling co-processor: Design, use and performance. In Proceedings of the Real-Time Systems Symposium, pages 106-111. IEEE Computer Society Press, December 1993.
[9]
[Ramamritham et al., 1989] K. Ramamritham, J. Stankovic, and WI Zhao. Distributed scheduling of tasks with deadlines and resource requirements. IEEE Transactions on Computers, pages 1,110-1,123, August 1989.
[10]
[Schwan and Zhou, 1992] Karsten Schwan and Hongyi Zhou. Dynamic scheduling of hard real-time tasks and real-time threads. IEEE Transactions on Software Engineering , 18(8):736-748, Aug. 1992.
[11]
[Sprunt et al., 1989] Brinkley Sprunt, Lui Sha, and John Lehoczky. Aperiodic task scheduling for hard-real-time systems. The Journal of Real-Time Systems, 1:27-60, 1989.
[12]
[Stankovic and Ramamritham, 1991] J. A. Stankovic and K. Ramamritham. The spring kernel: A new paradigm for real-time systems. IEEE Software, 8(3):62-72, May 1991.
[13]
[Wisniewski and Brown, 1993] R. W. Wisniewski and C. M. Brown. Ephor, a run-time environment for parallel intelligent applications. In Proceedings of the Workshop on Parallel and Distributed Real-Time Systems, pages 51-60, April 1993. Newport Beach, CA.
[14]
[Zhou et al., 1992] Hongyi Zhou, Karsten Schwan, and Ian F. Akyildiz. Performance effects of information sharing in a distributed multiprocessor real-time scheduler. In Real-Time Systems Symposium. IEEE, IEEE, 1992. Also available as GIT-CC-91/40 from Ga. Tech.
Index Terms
- Object technologies and real-time scheduling
Recommendations
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time ...
Preference-oriented fixed-priority scheduling for periodic real-time tasks
A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Real-Time Job Scheduling in Hypercube Systems
ICPP '97: Proceedings of the international Conference on Parallel ProcessingIn this paper, we present the problem of scheduling real-time jobs in a hypercube system and propose a scheduling algorithm. The goals of the proposed scheduling algorithm are to determine whether all jobs can complete their processing before their ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1996 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1996
Published in SIGPLAN-OOPS Volume 7, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 156Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)7
Reflects downloads up to 23 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in