𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing functions on asynchronous anonymous networks

✍ Scribed by M. Yamashita

Book ID
105915280
Publisher
Springer
Year
1998
Tongue
English
Weight
14 KB
Volume
31
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Distributed Computing on Anonymous Hyper
Distributed Computing on Anonymous Hypercube Networks
✍ Evangelos Kranakis; Danny Krizanc πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 245 KB

We consider the bit-complexity i.e.a, total number of bits transmitted of computing boolean functions on an anonymous canonically labeled n-dimensional hypercube network and give a characterization of the boolean functions computable on such a network as exactly those boolean functions which are inv

Computing on anonymous networks with sen
Computing on anonymous networks with sense of direction
✍ Paola Flocchini; Alessandro Roncato; Nicola Santoro πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 358 KB

Sense of direction refers to a set of global consistency constraints of the local labeling of the edges of a network. Sense of direction has a large impact on the communication complexity of many distributed problems. In this paper, we study the impact that sense of direction has on computability an

Computing with truly asynchronous thresh
Computing with truly asynchronous threshold logic networks
✍ Pekka Orponen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 946 KB

We present simulation mechanisms by which any network of threshold logic units with either symmetric or asymmetric interunit connections (i.e. a symmetric or asymmetric "Hopfield net") can be simulated on a network of the same type, but without any a priori constraints on the order of updates of the

Partially ordered distributed computatio
Partially ordered distributed computations on asynchronous point-to-point networks
✍ Ricardo C. CorrΓͺa; Valmir C. Barbosa πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 490 KB

Asynchronous executions of a distributed algorithm differ from each other due to the nondeterminism in the order in which the messages exchanged are handled. In many situations of interest, the asynchronous executions induced by restricting nondeterminism are more efficient, in an application-specif