331 search results - page 16 / 67 » A Parallel Algorithm for Compile-Time Scheduling of Parallel... |
SPAA
1995
ACM
13 years 11 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
ICS
2001
Tsinghua U.
14 years 13 hour ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
ISHPC
2003
Springer
14 years 23 days ago
2003
Springer
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...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...