Sciweavers

466 search results - page 38 / 94
» Using Queue Time Predictions for Processor Allocation
Sort
View
AIPS
1994
13 years 9 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
ARCS
2006
Springer
13 years 11 months ago
The Robustness of Resource Allocations in Parallel and Distributed Computing Systems
This corresponds to the material in the invited keynote presentation by H. J. Siegel, summarizing the research in [2, 23]. Resource allocation decisions in heterogeneous parallel a...
Vladimir Shestak, Howard Jay Siegel, Anthony A. Ma...
ICS
2005
Tsinghua U.
14 years 1 months ago
Power-aware resource allocation in high-end systems via online simulation
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...
Barry Lawson, Evgenia Smirni
ICWS
2007
IEEE
13 years 9 months ago
Capacity Management and Demand Prediction for Next Generation Data Centers
Advances in server, network, and storage virtualization are enabling the creation of resource pools of servers that permit multiple application workloads to share each server in t...
Daniel Gmach, Jerry Rolia, Ludmila Cherkasova, Alf...
ICALP
2007
Springer
14 years 1 months ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...