Isotach networks

We introduce a class of networks called Isotach networks designed to reduce the cost of synchronization in parallel computations. Isotach networks maintain an invariant that allows each process to control the logical times at which its messages are received and consequently executed. This control al...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 1997-04, Vol.8 (4), p.337-348
Main Authors: Reynolds, P.F., Williams, C., Wagner, R.R.
Format: Article
Language:English
Subjects:
Computational modeling
Computer networks
Computer Society
Concurrency control
Concurrent computing
Costs
Distributed computing
Network topology
Pipelines
Process control
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a class of networks called Isotach networks designed to reduce the cost of synchronization in parallel computations. Isotach networks maintain an invariant that allows each process to control the logical times at which its messages are received and consequently executed. This control allows processes to pipeline operations without sacrificing sequential consistency and to send isochrons, groups of operations that appear to be received and executed as an indivisible unit. Isochrons allow processes to execute atomic actions without locks. Other uses of Isotach networks include ensuring causal message delivery and consistency among replicated data. Isotach networks are characterized by this invariant, not by their topology. They can be implemented in a wide variety of configurations, including NUMA (nonuniform memory access) multiprocessors. Empirical and analytic studies of Isotach synchronization techniques show that they outperform conventional techniques, in some cases by an order of magnitude or more. Results presented here assume fault-free systems; we are exploring extension to selected failure models.
ISSN:1045-9219
1558-2183
DOI:10.1109/71.588601