Sciweavers

628 search results - page 41 / 126
» Scheduling Algorithm with Potential Behaviors
Sort
View
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 10 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
GRID
2007
Springer
14 years 3 months ago
Multi-state grid resource availability characterization
—The functional heterogeneity of non-dedicated computational grids will increase with the inclusion of resources from desktop grids, P2P systems, and even mobile grids. Machine f...
Brent Rood, Michael J. Lewis
ATC
2009
Springer
14 years 3 months ago
Management without (Detailed) Models
We present a resource management algorithm based upon guided “walks” within a system state space. Walks are guided via simple predictions of optimum behavior whose accuracy inc...
Alva L. Couch, Mark Burgess, Marc Chiarini
HIPEAC
2010
Springer
14 years 6 months ago
Combining Locality Analysis with Online Proactive Job Co-scheduling in Chip Multiprocessors
Abstract. The shared-cache contention on Chip Multiprocessors causes performance degradation to applications and hurts system fairness. Many previously proposed solutions schedule ...
Yunlian Jiang, Kai Tian, Xipeng Shen
INFOCOM
2006
IEEE
14 years 3 months ago
Flow Scheduling for End-Host Multihoming
Abstract— Fueled by the competing DSL and Cable technologies, residential broadband access has seen a significant spread in availability to the point that many users have a choi...
Nathanael Thompson, Guanghui He, Haiyun Luo