𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Message-passing primitives for multimicroprocessor systems

✍ Scribed by KW Ng


Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
531 KB
Volume
10
Category
Article
ISSN
0141-9331

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Finite-State Self-Stabilizing Protocols
✍ Rodney R. Howell; Mikhail Nesterenko; Masaaki Mizuno πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 285 KB

We define a finite-state message-passing model using guarded commands. This model is particularly appropriate for defining and reasoning about selfstabilizing protocols, due to the well-known result that self-stabilizing protocols on unbounded-channel models must have infinitely many legitimate stat

MPJ: MPI-like message passing for Java
✍ Carpenter, Bryan ;Getov, Vladimir ;Judd, Glenn ;Skjellum, Anthony ;Fox, Geoffrey πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 130 KB
Performance modeling for SPMD message-pa
✍ BREHM, JÜRGEN; WORLEY, PATRICK H.; MADHUKAR, MANISH πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 279 KB πŸ‘ 2 views

Today's massively parallel machines are typically message-passing systems consisting of hundreds or thousands of processors. Implementing parallel applications efficiently in this environment is a challenging task, and poor parallel design decisions can be expensive to correct. Tools and techniques

Efficient and Robust Sharing of Memory i
✍ Hagit Attiya πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 154 KB

A simulation of a wait-free, atomic, single-writer multireader register in an asynchronous message passing system is presented. The simulation can withstand Ε½ . Ε½ the failure of up to half of the processors and requires O n messages for each . read or write operation , assuming there are n q 1 proce

Enhanced distributed computing message p
✍ C. J. Gillan; V. Fusco πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 91 KB πŸ‘ 1 views

The "nite di!erence time domain method (FDTD) solves Maxwell's equations by employing numerically and storage intensive computation to map the electric and magnetic "elds within a "nite volume as an explicit function of time. Distributed computation, using heterogeneous networks of computers, is a c