Sciweavers

6897 search results - page 294 / 1380
» Parallelization of Modular Algorithms
Sort
View
IPPS
2003
IEEE
15 years 8 months ago
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
Yang Yang, Henri Casanova
BMCBI
2011
14 years 10 months ago
DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI
Background: Next-generation sequencing technologies have led to the high-throughput production of sequence data (reads) at low cost. However, these reads are significantly shorter...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell
IPPS
2003
IEEE
15 years 8 months ago
Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
Judith Hippold, Gudula Rünger
PPOPP
1995
ACM
15 years 6 months ago
High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusio...
Robert W. Wisniewski, Leonidas I. Kontothanassis, ...
CISIS
2010
IEEE
14 years 6 months ago
A Simple Improvement of the Work-stealing Scheduling Algorithm
Work-stealing is the todays algorithm of choice for dynamic load-balancing of irregular parallel applications on multiprocessor systems. We have evaluated the algorithm’s effic...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz