Sciweavers

874 search results - page 1 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
IPPS
1998
IEEE
13 years 9 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
IPPS
2006
IEEE
13 years 11 months ago
A simulator for parallel applications with dynamically varying compute node allocation
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
Basile Schaeli, B. Gerlach, Roger D. Hersch
JCSS
2008
81views more  JCSS 2008»
13 years 4 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
PAAPP
2002
101views more  PAAPP 2002»
13 years 4 months ago
Static performance prediction of skeletal parallel programs
We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...
Yasushi Hayashi, Murray Cole
CLUSTER
2003
IEEE
13 years 10 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