Sciweavers

874 search results - page 20 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Selecting the tile shape to reduce the total communication volume
In this paper we revisit the tile-shape selection problem, that has been extensively discussed in bibliography. An efficient approach is proposed for the selection of a suitable t...
Nikolaos Drosinos, Georgios I. Goumas, Nectarios K...
CSC
2010
13 years 5 months ago
An Evaluation of Parallel Knapsack Algorithms on Multicore Architectures
Emergence of chip multiprocessor systems has dramatically increased the performance potential of computer systems. Since the amount of exploited parallelism is directly influenced ...
Hammad Rashid, Clara Novoa, Apan Qasem
IPPS
2008
IEEE
14 years 2 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...
IFIP
1994
Springer
13 years 11 months ago
Program Speedups in Theory and Practice
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
Neil D. Jones
ISHPC
2003
Springer
14 years 24 days ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska