✦ LIBER ✦

An Overview of Synchronous Message-Passing and Topology

✍ Scribed by Maurice Herlihy; Sergio Rajsbaum; Mark R. Tuttle

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 265 KB
Volume: 39
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)01148-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scalable timestamp synchronization for e

Scalable timestamp synchronization for event traces of message-passing applications

✍ Daniel Becker; Rolf Rabenseifner; Felix Wolf; John C. Linford 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Event traces are helpful in understanding the performance behavior of message-passing applications since they allow the in-depth analysis of communication and synchronization patterns. However, the absence of synchronized clocks may render the analysis ineffective because inaccurate relative event t

An evaluation of Java implementations of

An evaluation of Java implementations of message-passing

✍ Nenad Stankovic; Kang Zhang 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB

As an objected-oriented programming language and a platform-independent environment, Java has been attracting much attention. However, the trade-off between portability and performance has not spared Java. The initial performance of Java programs has been poor, due to the interpretive nature of the

Analysis and optimum performance of two

Analysis and optimum performance of two message-passing parallel processors synchronized by rollback

✍ Debasis Mitra; Isi Mitrani 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Parallelism and recursion in message pas

Parallelism and recursion in message passing libraries: an efficient methodology

✍ Rodríguez, C.; De Sande, F.; León, C.; García, L. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

Nested parallelism appears naturally in many applications. It is required whenever a function performing parallel statements needs to call a subroutine using parallelism. A particular case occurs when the function is recursive. Nested parallelism is to parallel programming as basic as nested loops t

Message-passing performance of various c

Message-passing performance of various computers

✍ Dongarra, Jack J.; Dunigan, Tom 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

This report compares the performance of different computer systems for basic message passing. Latency and bandwidth are measured on Convex, Cray, IBM, Intel, KSR, Meiko, nCUBE, NEC, SGI and TMC multiprocessors. Communication performance is contrasted with the computational power of each system. The

Message passing and shared address space

Message passing and shared address space parallelism on an SMP cluster

✍ Hongzhang Shan; Jaswinder P. Singh; Leonid Oliker; Rupak Biswas 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Currently, message passing (MP) and shared address space (SAS) are the two leading parallel programming paradigms. MP has been standardized with MPI, and is the more common and mature approach; however, code development can be extremely difficult, especially for irregularly structured computations.