Sciweavers

4586 search results - page 454 / 918
» Computing stable models in parallel
Sort
View
IPPS
2005
IEEE
16 years 13 days ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
IPPS
2003
IEEE
16 years 3 days ago
Natural Block Data Decomposition for Heterogeneous Clusters
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
Egor Dovolnov, Alexey Kalinov, Sergey Klimov
IPPS
1999
IEEE
15 years 11 months ago
Distributed Scheduling with Decomposed Optimization Criterion: Genetic Programming Approach
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
Franciszek Seredynski, Jacek Koronacki, Cezary Z. ...
IPPS
1998
IEEE
15 years 11 months ago
Tailoring UNITY to Distributed Program Design
As a general framework, UNITY does not offer any specific facility for the design of distributed systems. For such systems, distribution aspects must be represented at a low level,...
Michel Charpentier, Mamoun Filali, Philippe Mauran...
SC
1990
ACM
15 years 11 months ago
Loop distribution with arbitrary control flow
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...
Ken Kennedy, Kathryn S. McKinley