FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
HPDC
2009
IEEE
13 years 11 months ago
2009
IEEE
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
CCGRID
2009
IEEE
13 years 11 months ago
2009
IEEE
We describe our experiences from implementing and integrating a new job scheduling algorithm in the gLite Grid middleware and present experimental results that compare it to the e...
SC
2009
ACM
13 years 11 months ago
2009
ACM
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...