423 search results - page 8 / 85 » Predicting Queue Times on Space-Sharing Parallel Computers |
158
Voted
TSMC
1998
15 years 6 months ago
1998
— This paper is concerned with the analytical modeling of computer architectures to aid in the design of high-level language-directed computer architectures. High-level language-...
166
Voted
HPCA
2004
IEEE
16 years 6 months ago
2004
IEEE
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...
156
Voted
COR
2008
15 years 6 months ago
2008
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
161
Voted
CLUSTER
2003
IEEE
15 years 11 months ago
2003
IEEE
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...
171
Voted
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...