Sciweavers

6939 search results - page 632 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
COMCOM
2006
120views more  COMCOM 2006»
15 years 6 months ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti
ISHPC
2000
Springer
15 years 10 months ago
Leveraging Transparent Data Distribution in OpenMP via User-Level Dynamic Page Migration
This paper describes transparent mechanisms for emulating some of the data distribution facilities offered by traditional data-parallel programming models, such as High Performance...
Dimitrios S. Nikolopoulos, Theodore S. Papatheodor...
IPPS
2005
IEEE
16 years 8 days ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
172
Voted
PODC
2000
ACM
15 years 10 months ago
Efficient atomic broadcast using deterministic merge
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Marcos Kawazoe Aguilera, Robert E. Strom
DCOSS
2008
Springer
15 years 8 months ago
Multi-root, Multi-Query Processing in Sensor Networks
Sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make ...
Zhiguo Zhang, Ajay D. Kshemkalyani, Sol M. Shatz