223 search results - page 16 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
GRID
2008
Springer
13 years 8 months ago
2008
Springer
To make the most effective application placement decisions on volatile large-scale heterogeneous Grids, schedulers must consider factors such as resource speed, load, and reliabil...
GCA
2008
13 years 9 months ago
2008
In a Grid Computing environment, there are various important issues, including information security, resource management, routing, fault tolerance, and so on. Among these issues, ...
AOR
2007
13 years 7 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
This paper deals with the load-balancing of machines in a real-world job-shop scheduling problem, with identical machines. The load-balancing algorithm allocates jobs, split into l...
APSCC
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...