Sciweavers

1161 search results - page 52 / 233
» Resource Modeling for Timed Creol Models
Sort
View
CLUSTER
2003
IEEE
15 years 8 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
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
15 years 9 months ago
A continuous time markov decision process based on-chip buffer allocation methodology
We have presented an optimal on-chip buffer allocation and buffer insertion methodology which uses stochastic models of the architecture. This methodology uses finite buffer s...
Sankalp Kallakuri, Nattawut Thepayasuwan, Alex Dob...
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
15 years 7 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
RTSS
2005
IEEE
15 years 9 months ago
Trading End-to-End Latency for Composability
The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints...
Slobodan Matic, Thomas A. Henzinger
IPPS
2003
IEEE
15 years 8 months ago
New Dynamic Heuristics in the Client-Agent-Server Model
MCT is a widely used heuristic for scheduling tasks onto grid platforms. However, when dealing with many tasks, MCT tends to dramatically delay already mapped task completion time...
Yves Caniou, Emmanuel Jeannot