Sciweavers

1053 search results - page 33 / 211
» Estimating Execution Time of Distributed Applications
Sort
View
JSSPP
1998
Springer
14 years 2 months ago
Predicting Application Run Times Using Historical Information
We present a technique for deriving predictions for the run times of parallel applications from the run times of "similar" applications that have executed in the past. T...
Warren Smith, Ian T. Foster, Valerie E. Taylor
TRIDENTCOM
2010
IEEE
13 years 7 months ago
Managing Distributed Applications Using Gush
Deploying and controlling experiments running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the...
Jeannie Albrecht, Danny Yuxing Huang
ECRTS
2007
IEEE
14 years 4 months ago
Cache-Aware Timing Analysis of Streaming Applications
Of late, there has been a considerable interest in models, algorithms and methodologies specifically targeted towards designing hardware and software for streaming applications. ...
Samarjit Chakraborty, Tulika Mitra, Abhik Roychoud...
JSSPP
2007
Springer
14 years 4 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
RSP
2005
IEEE
131views Control Systems» more  RSP 2005»
14 years 3 months ago
Models for Embedded Application Mapping onto NoCs: Timing Analysis
Networks-on-chip (NoCs) are an emergent communication infrastructure, which can be designed to deal with growing system complexity and technology evolution. The efficient use of N...
César A. M. Marcon, Márcio Eduardo K...