ACM Home Page
Please provide us with feedback. Feedback
Object technologies and real-time scheduling
Full text PdfPdf (733 KB)
Source ACM SIGPLAN OOPS Messenger archive
Volume 7 ,  Issue 1  (January 1996) table of contents
Special issue: object-oriented real-time systems
Pages: 44 - 50  
Year of Publication: 1996
ISSN:1055-6400
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/227986.227994
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
 
3
 
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
 
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
 
10
 
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
 
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.

Collaborative Colleagues:
Harold Forbes: colleagues
Karsten Schwan: colleagues