Sciweavers

275 search results - page 13 / 55
» The Polling Primitive for Computer Networks
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
COST
1994
Springer
146views Multimedia» more  COST 1994»
15 years 1 months ago
A Binding Architecture for Multimedia Networks
: An open architecture that achieves seamless binding between networking and multimedia devices is proposed. The building blocks of the binding architecture consist of a set of es,...
Aurel A. Lazar, Shailendra K. Bhonsle, Koon-Seng L...
DSN
2006
IEEE
15 years 3 months ago
High Throughput Total Order Broadcast for Cluster Environments
Total order broadcast is a fundamental communication primitive that plays a central role in bringing cheap software-based high availability to a wide array of services. This paper...
Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Viv...
IPPS
2005
IEEE
15 years 3 months ago
A Comparison of MPI and Process Networks
The Message Passing Interface (MPI) is a popular communication library that supports the SIMD model of parallel computing. Process networks (PN), where processes communicate throu...
Thomas M. Parks
ICDCS
1991
IEEE
15 years 29 days ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste