NETWORKING IN DISTRIBUTED REAL-TIME SYSTEMS (DISTRIBUTED SYSTEMS).
University of MICHIGAN, 1991 - 144 pages
Distributed computing systems are increasingly being used for many critical real-time applications. In these systems, large or unpredictable delays in the delivery of messages can adversely affect the execution of tasks dependent on these messages. Consequently, there are usually deadlines associated with messages between cooperating processes. The goal of this dissertation is to design and develop a communication scheme for a distributed real-time system which guarantees the delivery of messages within
8 pages matching topology in this book
Results 1-3 of 8
What people are saying - Write a review
We haven't found any reviews in the usual places.
6-BCAST ALLP application broadcast algorithms broadcast packet broadcast tree buffer management bytes channel creation channel Mc chapter clock synchronization communication subsystem considered constraints cost function current.time deadline Decision Problem destination node direction=(from.direction distance=n Ethernet guarantees handle hardware HARTS hexagonal mesh hypercube implementation inter-arrival interface intermediate nodes interrupt handler latency link cost function link level link load logical arrival mesh network message delivery message scheduling Network Manager network processor number of bufferings number of flows operation packet group packet header packet switching packet.distance packet.tag packets belonging parameters performance point-to-point problem protocol object Queue rate-monotonic scheduling real-time channels real-time messages real-time system reliable broadcast request routing controller RTCC RTCP SBCAST scheme Section session sessn simple broadcast simulator source node specified tasks time-constrained communication topology traffic transmitted uniform distribution virtual cut-through switching worst-case delay worst-case response x-Kernel XOBJ