Learn More
It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying transformations to garbage collection algorithms. The transformation can be applied to collectors of the(More)
A b s t r a c t . We discuss recent research evaluating the benefits of certain link labellings in processor networks. Such a labelling, called Sense of Direction or SoD, allows processors to communicate more efficiently with each other, and to exploit topological properties of the network algorithmically. We shall define sense of direction for several(More)
This article studies characteristic properties of synchronous and asynchronous message communications in distributed systems. Based on the causality relation between events in computations with asynchronous communications, we characterize computations which are realizable with synchronous communications, which respect causal order, or where messages between(More)
We deene the notion of total algorithms for networks of processes. A total algorithm enforces that a \decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of distributed algorithms. For some important network control(More)
This paper analyses how the symmetry of a processor network innuences the existence of a solution for the network orientation problem. The orientation of cliques, hypercubes and tori is the problem of assigning labels to each link of each processor, in such a way that a sense of direction is given to the network. In this paper the problem of network(More)