Sciweavers

2716 search results - page 100 / 544
» Integrating Performance Monitoring and Communication in Para...
Sort
View
124
Voted
IPPS
1999
IEEE
15 years 8 months ago
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
S. Chingchit, Mohan Kumar, Laxmi N. Bhuyan
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 5 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
PPOPP
1999
ACM
15 years 8 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
131
Voted
IPPS
2000
IEEE
15 years 8 months ago
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
Leonid Oliker, Xiaoye S. Li, Gerd Heber, Rupak Bis...
JPDC
2008
129views more  JPDC 2008»
15 years 4 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...