423 search results - page 5 / 85 » Predicting Queue Times on Space-Sharing Parallel Computers |
TC
2010
13 years 2 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
SWAT
1992
Springer
13 years 11 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
Several types of network trafic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy period of an ATM system driven by a long-range dependen...
ICS
2004
Tsinghua U.
14 years 23 days ago
2004
Tsinghua U.
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...