Sciweavers

6105 search results - page 35 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
CORR
2002
Springer
117views Education» more  CORR 2002»
13 years 8 months ago
Detecting Race Conditions in Parallel Programs that Use Semaphores
Abstract. We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race co...
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer
IPPS
2010
IEEE
13 years 6 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...
EMO
2005
Springer
110views Optimization» more  EMO 2005»
14 years 2 months ago
Parallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
Felix Streichert, Holger Ulmer, Andreas Zell
PAMI
1998
88views more  PAMI 1998»
13 years 8 months ago
Large-Scale Parallel Data Clustering
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
Dan Judd, Philip K. McKinley, Anil K. Jain
CAP
2010
13 years 3 months ago
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Michael B. Monagan, Roman Pearce