Sciweavers

1534 search results - page 10 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
WCET
2003
13 years 9 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
SPIN
2004
Springer
14 years 29 days ago
Formal Analysis of Processor Timing Models
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
Reinhard Wilhelm
SBACPAD
2004
IEEE
124views Hardware» more  SBACPAD 2004»
13 years 9 months ago
Improving Parallel Execution Time of Sorting on Heterogeneous Clusters
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
Christophe Cérin, Michel Koskas, Hazem Fkai...
SPAA
1995
ACM
13 years 11 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
IPPS
2005
IEEE
14 years 1 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch