Sciweavers

794 search results - page 79 / 159
» Stackelberg scheduling strategies
Sort
View
CONCUR
2007
Springer
15 years 7 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
ICS
2005
Tsinghua U.
15 years 7 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
RTAS
2007
IEEE
15 years 7 months ago
Real-Time Divisible Load Scheduling for Cluster Computing
Cluster computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various real...
Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Godda...
CCGRID
2005
IEEE
15 years 7 months ago
GangSim: a simulator for grid scheduling studies
Large distributed Grid systems pose new challenges in job scheduling due to complex workload characteristics and system characteristics. Due to the numerous parameters that must b...
Catalin Dumitrescu, Ian T. Foster
ECAI
2000
Springer
15 years 5 months ago
Dispatchability Conditions for Schedules with Consumable Resources
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be ...
Richard J. Wallace, Eugene C. Freuder