Algorithms for distributed termination detection
F Mattern - Distributed computing, 1987 - Springer
The termination problem for distributed computations is analyzed in the general context of
asynchronous communication. In the underlying computational model it is assumed that …
asynchronous communication. In the underlying computational model it is assumed that …
A cooperative multi-agent transportation management and route guidance system
JL Adler, VJ Blue - Transportation Research Part C: Emerging …, 2002 - Elsevier
Developing real-time approaches to manage roadway network congestion over time and
space is a difficult problem. While many approaches to solving networking problems have …
space is a difficult problem. While many approaches to solving networking problems have …
A taxonomy of distributed termination detection algorithms
An important problem in the field of distributed systems is that of detecting the termination of
a distributed computation. Distributed termination detection (DTD) is a difficult problem due …
a distributed computation. Distributed termination detection (DTD) is a difficult problem due …
[图书][B] Load balancing in parallel computers: theory and practice
Load Balancing in Parallel Computers: Theory and Practice is about the essential software
technique of load balancing in distributed memory message-passing parallel computers …
technique of load balancing in distributed memory message-passing parallel computers …
Programming with visual expressions
W Citrin, R Hall, B Zorn - Proceedings of Symposium on Visual …, 1995 - ieeexplore.ieee.org
The lambda calculus is a formal symbolic term rewriting system that has been used for many
years both as a mechanism for defining the semantics of programming languages and as …
years both as a mechanism for defining the semantics of programming languages and as …
Revisiting snapshot algorithms by refinement-based techniques
MB Andriamiarina, D Méry… - 2012 13th International …, 2012 - ieeexplore.ieee.org
The snapshot problem addresses a collection of important algorithmic issues related to the
distributed computations, which are used for debugging or recovering the distributed …
distributed computations, which are used for debugging or recovering the distributed …
Sustainable GPU computing at scale
General purpose GPU (GPGPU) computing has produced the fastest running
supercomputers in the world. For continued sustainable progress, GPU computing at scale …
supercomputers in the world. For continued sustainable progress, GPU computing at scale …
Decentralized remapping of data parallel computations with the generalized dimension exchange method
The Generalized Dimension Exchange (GDE) method is a fully distributed load balancing
method that is most suitable for multicomputers with a direct communication network. It is …
method that is most suitable for multicomputers with a direct communication network. It is …
Election in partially anonymous networks with arbitrary knowledge in message passing systems
J Chalopin, E Godard, Y Métivier - Distributed Computing, 2012 - Springer
This paper attempts to find an answer to an open question of Angluin in her seminal paper
(1980) about the election problem for families of graphs (Section 4, page 87). More …
(1980) about the election problem for families of graphs (Section 4, page 87). More …
On fault-tolerant structure, distributed fault-diagnosis, reconfiguration, and recovery of the array processors
SH Hosseini - IEEE transactions on computers, 1989 - ieeexplore.ieee.org
A study is made of the design of fault-tolerant array processors. It is shown how hardware
redundancy can be used in the existing structures in order to make them capable of …
redundancy can be used in the existing structures in order to make them capable of …