2477 search results - page 103 / 496 » Parallelizing Functional Programs by Generalization |
138
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
The results produced by five different MPI benchmark programs on an SGI Altix 3700 are analyzed and compared. There are significant differences in the results for some MPI operati...
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
123
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples. The analysis of t...
143
click to vote
PODC
2000
ACM
15 years 6 months ago
2000
ACM
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...