148 search results - page 1 / 30 » Dynamic Process Partitioning and Migration for Irregular App... |
PARELEC
2002
IEEE
13 years 10 months ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
SC
1994
ACM
13 years 9 months ago
1994
ACM
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
ICCD
1999
IEEE
13 years 9 months ago
1999
IEEE
ISCC
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
In this paper we describe one experiment in which a new coordination language, called MANIFOLD, is used to restructure an existing sequential Fortran code from computational uid dy...