Sciweavers

1431 search results - page 69 / 287
» Analytical Performance Models of Parallel Programs in Cluste...
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
CLUSTER
2003
IEEE
14 years 2 months ago
Run-Time Prediction of Parallel Applications on Shared Environments
Application run-time information is a fundamental component in application and job scheduling. However, accurate predictions of run times are difficult to achieve for parallel app...
Byoung-Dai Lee, Jennifer M. Schopf
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 3 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ICS
2005
Tsinghua U.
14 years 2 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
CEC
2003
IEEE
14 years 2 months ago
Diversity analysis in cellular and multipopulation genetic programming
This paper presents a study that evaluates the influence of the parallel genetic programming (GP) models in maintaining diversity in a population. The parallel models used are the...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...