[1990] Proceedings 11th Real-Time Systems Symposium 1990
DOI: 10.1109/real.1990.128732
|View full text |Cite
|
Sign up to set email alerts
|

From CHAOS/sup base/ to CHAOS/sup arc/: a family of real-time kernels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
8
0

Year Published

1992
1992
2004
2004

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…Unfortunately, portability is difficult to attain due to common requirements of predictability and high efficiency for real-time kernels and application programs [14]. As a result, implementors are often forced to repeat the implementation of lowlevel operating [14,16,15] or runtime system (e.g., for Ada runtime system implementations) functionality for each target machine.…”
Section: Real-time Operating Systemsmentioning
confidence: 99%
See 3 more Smart Citations
“…Unfortunately, portability is difficult to attain due to common requirements of predictability and high efficiency for real-time kernels and application programs [14]. As a result, implementors are often forced to repeat the implementation of lowlevel operating [14,16,15] or runtime system (e.g., for Ada runtime system implementations) functionality for each target machine.…”
Section: Real-time Operating Systemsmentioning
confidence: 99%
“…This package has been implemented on standard Unix platforms (on SUN OS TM) and on a 32-node BBN Butterfly multiprocessor, and it has been used as a portable basis for the construction of parallel real-time applications and multiprocessor operating system kernels, such as the CHAOS arc system described in several recent publications [6,12,15].…”
Section: Real-time Operating Systemsmentioning
confidence: 99%
See 2 more Smart Citations
“…As with other global abstractions in parallel programs (e.g., global sums, etc. [26]), certain dynamic program characteristics (e.g., the natural orderings between queue elements due to their times of insertion into the queue) can be exploited in order to reduce the costs of executing certain policies associated with those abstractions (e.g., the amount of work performed or the actual communication topology used to maintain some acceptable global ordering in a queue).…”
Section: Configuring Ktk Programsmentioning
confidence: 99%