Sciweavers

1380 search results - page 193 / 276
» scheduling 2008
Sort
View
108
Voted
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 3 months ago
Randomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
Martin Josef Geiger
129
Voted
GRID
2008
Springer
15 years 3 months ago
Market-oriented Grids and Utility Computing: The State-of-the-art and Future Directions
Traditional resource management techniques (resource allocation, admission control and scheduling) have been found to be inadequate for many shared Grid and distributed systems th...
James Broberg, Srikumar Venugopal, Rajkumar Buyya
122
Voted
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 3 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
121
Voted
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase
147
Voted
TC
2008
15 years 3 months ago
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in ...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo