Sciweavers

159 search results - page 20 / 32
» Analytical Models of Probability Distributions for MPI Point...
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
SPAA
1997
ACM
13 years 11 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
IPPS
2006
IEEE
14 years 1 months ago
FIFO scheduling of divisible loads with return messages under the one-port model
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
Olivier Beaumont, Loris Marchal, Veronika Rehn, Yv...
IPPS
2007
IEEE
14 years 1 months ago
A Model for Large Scale Self-Stabilization
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
Thomas Hérault, Pierre Lemarinier, Olivier ...
IPPS
2007
IEEE
14 years 1 months ago
Low-Overhead LogGP Parameter Assessment for Modern Interconnection Networks
Network performance measurement and prediction is very important to predict the running time of high performance computing applications. The LogP model family has been proven to b...
Torsten Hoefler, Andre Lichei, Wolfgang Rehm