Sciweavers

27354 search results - page 112 / 5471
» Distributed And Parallel Computing
Sort
View
IPPS
2002
IEEE
15 years 2 months ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim
PACT
2001
Springer
15 years 2 months ago
UNICORE: A Grid Computing Environment for Distributed and Parallel Computing
UNICORE (UNiform Interface to COmputer REsources) provides a seamless and secure access to distributed supercomputer resources. This paper will give an overview of the its architec...
Valentina Huber
ICA3PP
2005
Springer
15 years 3 months ago
Analytical Models of Probability Distributions for MPI Point-to-Point Communication Times on Distributed Memory Parallel Compute
Abstract. Measurement and modelling of distributions of data communication times is commonly done for telecommunication networks, but this has not previously been done for message ...
Duncan A. Grove, Paul D. Coddington
HIPC
2005
Springer
15 years 3 months ago
Data and Computation Abstractions for Dynamic and Irregular Computations
Sriram Krishnamoorthy, Jarek Nieplocha, P. Sadayap...