6105 search results - page 428 / 1221 » A Parallel Algorithm for Bound-Smoothing |
186
Voted
PPAM
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
160
Voted
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
176
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Checkpointing is a very effective technique to tolerate the occurrence of failures in distributed and parallel applications. The existing algorithms in the literature are basicall...
139
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
186
click to vote
HPDC
2005
IEEE
16 years 14 days ago
2005
IEEE
We present an algorithm for scheduling distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing da...