Sciweavers

423 search results - page 15 / 85
» Predicting Queue Times on Space-Sharing Parallel Computers
Sort
View
IPPS
1999
IEEE
15 years 2 months ago
The Case for Prediction-Based Best-Effort Real-Time Systems
Abstract. We propose a prediction-based best-effort real-time service to support distributed, interactive applications in shared, unreserved computing environments. These applicati...
Peter A. Dinda, Loukas F. Kallivokas, Bruce Loweka...
74
Voted
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
14 years 10 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
PAAPP
2002
101views more  PAAPP 2002»
14 years 9 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
ISPDC
2008
IEEE
15 years 4 months ago
Load Balancing in Mesh-like Computations using Prediction Binary Trees
We present a load-balancing technique that exploits the temporal coherence, among successive computation phases, in mesh-like computations to be mapped on a cluster of processors....
Biagio Cosenza, Gennaro Cordasco, Rosario De Chiar...
HIPC
2005
Springer
15 years 3 months ago
Application of Reduce Order Modeling to Time Parallelization
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
Ashok Srinivasan, Yanan Yu, Namas Chandra