Sciweavers

234 search results - page 2 / 47
» Sorting and Selection on Distributed Memory Bus Computers
Sort
View
107
Voted
IPPS
2008
IEEE
15 years 8 months ago
Automatic generation of a parallel sorting algorithm
In this paper, we discuss a library generator for parallel sorting routines that examines the input characteristics (and the parameters they affect) to select the best performing ...
Brian A. Garber, Daniel Hoeflinger, Xiaoming Li, M...
129
Voted
ICPADS
2006
IEEE
15 years 8 months ago
Memory and Network Bandwidth Aware Scheduling of Multiprogrammed Workloads on Clusters of SMPs
Symmetric Multiprocessors (SMPs), combined with modern interconnection technologies are commonly used to build cost-effective compute clusters. However, contention among processor...
Evangelos Koukis, Nectarios Koziris
IPPS
2002
IEEE
15 years 7 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
85
Voted
IPPS
1993
IEEE
15 years 6 months ago
Selection, Routing, and Sorting on the Star Graph
Sanguthevar Rajasekaran, David S. L. Wei
ICPP
2003
IEEE
15 years 7 months ago
Scheduling Algorithms with Bus Bandwidth Considerations for SMPs
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
Christos D. Antonopoulos, Dimitrios S. Nikolopoulo...