Abstract-We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed to-ken medium access control protocol is employed. Synchronous bandwidth, defined as the maximum time for which a node can transmit its synchronous messages every time it receives

This paper studies the characteristics of synchronous ordering of messages. Synchronous ordering of messages defines synchronous communication based on the causality relation rather than time. We present the necessary characteristics of any algorithm providing deadlock-free synchronous ordering

Traditional message-passing (TMP) is characterized by multiple, individual, point-to-point, typed messages, inducing unintended temporal synchronization. Asynchronous communication can hide some of the overhead and latency from an application, but doing so changes neither the behavior of nor

for event-driven simulation

This paper investigates the use of additional synchro-nization messages in round-based message-passing syn-chronous systems. It first presents a synchronous compu-tation model allowing a process to send such messages. The difference with respect to the traditional round-based synchronous model lies

Abstract. A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environ-ment to a refinement which uses semaphores to implement wait control. The proof uses a most general scheduler, which is left as abstract and as-sumed to satisfy

periodic radio broadcast of synchronization messages, and implicit dynamic topology update. The unique high precision performance is reached by utilizing MAC-layer time-stamping, comprehensive error compensation, including linear regression, which reduces time skew and keeps network traffic overhead low

are required to the converter for subliminal channels. Vernum encryption can convert any message sequences into perfectly indistinguishable random number sequences. However the receivers cannot decode the message sequences from anywhere of the converted sequences without any knowledge of the synchronization

This paper addresses issues related to guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. We show that several network parameters must be set carefully if message deadlines are to be satisfied. First, message deadlines can only be met if sufficient synchronous

to solve the k-set agreement problem in a synchronous, message-passing model of computation. The central idea in this approach is a simple combinatorial structure we call a pseudosphere in which each process from a set of processes is independently assigned a value from a set of values. Pseudospheres have