Scheduling real-time communication on dual-link networks

Sha, Lui; Sathaye, Shirish S.; Strosnider, J.K.

doi:10.1109/real.1992.242664

Cited by 32 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The bandwidth allocation schemes are often based on well-known real-time scheduling results, for example rate-monotonic scheduling [19,15,21], pin-wheel scheduling [5], and weighted round-robin [2]. The success of a particular bandwidth allocation scheme depends on whether a suitable media access control can be used to enforce the scheme.…”

Section: Related Workmentioning

confidence: 99%

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

Mukherjee

Saha

Saksena³

et al. 1999

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

Mukherjee

Saha

Saksena³

et al. 1999

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…Sha et al (1992) have examined the scheduling of synchronous messages in dual bus networks, and have shown that under certain conditions the rate monotonic scheduling algorithm can be implemented. The work on real-time communications in local area networks needs to be extended to metropolitan area networks using protocols such as the IEEE 802.6 DQDB protocol.…”

Section: Other Network and Protocolsmentioning

confidence: 99%

Hard real-time communication in multiple-access networks

Malcolm

Zhao

1995

Real-Time Syst

View full text Add to dashboard Cite

With the increasing use of distributed hard real-time systems, the ability of computer networks to handle hard real-time message traffic is becoming more important. For traditional networks, maximizing the throughput or minimizing the average message delay is the most important performance criteria. In the hard real-time domain, however, concern focuses on satisfying the time constraints of individual messages. This paper examines recent developments in hard real-time communication in local area multiple-access networks. Two general strategies are used in hard real-time communication: the guarantee strategy and the best-effol~ strategy. In the former, messages are guaranteed to meet their deadlines during normal operation of the network. In the best-effort strategy, the network will attempt to send messages before their deadlines, but no guarantees are given. Real-time message traffic can be distinguished according to whether it is best suited for the guarantee strategy or the best-effort strategy. Although this paper concentrates on multiple-access networks, many of the concepts presented and lessons learned are also applicable to other types of networks. COMMUNICATION IN MULTIPLE-ACCESS NEWTWORKS 49

show abstract

“…A formal description of the above concepts is described as a coherent reservation protocol (CRP) and a preemption-control protocol [8]. The important theoretical result of this work is summarized by the following theorem:…”

Section: System Consistencymentioning

confidence: 99%

Distributed Real-Time System Design: Theoretical Concepts and Applications

Sha¹,

Sathaye²

1993

View full text Add to dashboard Cite

Scheduling real-time communication on dual-link networks

Cited by 32 publications

References 6 publications

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

A Distributed Scheduling Algorithm for Real-Time Communication on Slotted Shared Medium

Hard real-time communication in multiple-access networks

Distributed Real-Time System Design: Theoretical Concepts and Applications

Contact Info

Product

Resources

About