1989
DOI: 10.1145/71021.71025
|View full text |Cite
|
Sign up to set email alerts
|

HARTOS: a distributed real-time operating system

Abstract: This paper outlines the design objectives and research goals for HARTOS, a distributed real-time operating system being developed at The University of Michigan. This effort is part of a larger research project to design and implement an experimental distributed real-time system called the Hexagonal Architecture for Real-Time Systems (HARTS). An important feature of HARTS is the use of an intelligent network processor to handle many of the functions relating to communications. The paper focuses on the communica… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

1992
1992
2023
2023

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…In our scheme, although the MTRT is defined to be the maximum time interval between two consecutive token allocations, it is approximately the same as the corresponding expected time, as the variance of actual token return time is negligibly small if MTRT >> RTHT (holds in most cases when the network is expected to support many real-time channels). Among the several models proposed to describe the traffic generated by a real-time channel, the linear bounded model-which was originally proposed by Cruz [8] and also adopted by other researchers [13], [14], [27]-is one of the most popular models. The traffic generated by a real-time channel is said to follow the linear bounded model if the number of packets generated in any interval T is bounded by a linear function of the interval length T, G max T + B max , where G max is the maximum packet-generation rate of this channel and B max is the maximum burst size.…”
Section: Hard Real-time Channels On Multiaccess Linksmentioning
confidence: 99%
See 2 more Smart Citations
“…In our scheme, although the MTRT is defined to be the maximum time interval between two consecutive token allocations, it is approximately the same as the corresponding expected time, as the variance of actual token return time is negligibly small if MTRT >> RTHT (holds in most cases when the network is expected to support many real-time channels). Among the several models proposed to describe the traffic generated by a real-time channel, the linear bounded model-which was originally proposed by Cruz [8] and also adopted by other researchers [13], [14], [27]-is one of the most popular models. The traffic generated by a real-time channel is said to follow the linear bounded model if the number of packets generated in any interval T is bounded by a linear function of the interval length T, G max T + B max , where G max is the maximum packet-generation rate of this channel and B max is the maximum burst size.…”
Section: Hard Real-time Channels On Multiaccess Linksmentioning
confidence: 99%
“…The traffic generated by a real-time channel is said to follow the linear bounded model if the number of packets generated in any interval T is bounded by a linear function of the interval length T, G max T + B max , where G max is the maximum packet-generation rate of this channel and B max is the maximum burst size. Using the user-specified delivery-delay bound D, one can establish a hard real-time channel in a point-to-point network [13], [14], [27]. Here we adopt an even simpler model which requires only two parameters for establishing hard real-time channels:…”
Section: Hard Real-time Channels On Multiaccess Linksmentioning
confidence: 99%
See 1 more Smart Citation
“…HARTOS is a distributed real-time operating system which was part of a larger research project developed at the University of Michigan called the Hexagonal Architecture for Real-Time Systems (HARTS) [KANDLUR, KISKIS and SHIN 1989]. An important aspect of this work is the attention given to network communications, whereas dedicated communication processors were employed while the distributed kernel were executed on dedicated application processors [KANDLUR, KISKIS and SHIN 1989].…”
Section: Hartosmentioning
confidence: 99%
“…An important aspect of this work is the attention given to network communications, whereas dedicated communication processors were employed while the distributed kernel were executed on dedicated application processors [KANDLUR, KISKIS and SHIN 1989]. Messages were delivered within a bounded time, with deadlines defined on both a hop-by-hop and end-to-end basis.…”
Section: Hartosmentioning
confidence: 99%