466 search results - page 14 / 94 » Using Queue Time Predictions for Processor Allocation |
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...
PLDI
2004
ACM
14 years 29 days ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
JSSPP
2005
Springer
14 years 1 months ago
2005
Springer
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
WWW
2005
ACM
14 years 1 months ago
2005
ACM
How to effectively allocate system resource to meet the Service Level Agreement (SLA) of Web servers is a challenging problem. In this paper, we propose an improved scheme for aut...
CCGRID
2007
IEEE
14 years 1 months ago
2007
IEEE
Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system ut...