Sciweavers

254 search results - page 21 / 51
» Approximation Algorithms for Scheduling Parallel Jobs
Sort
View
95
Voted
HPCC
2007
Springer
15 years 5 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...
JSSPP
2007
Springer
15 years 5 months ago
A Self-optimized Job Scheduler for Heterogeneous Server Clusters
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
Elad Yom-Tov, Yariv Aridor
WSC
2008
15 years 1 months ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky
APPT
2009
Springer
15 years 2 months ago
MaGate Simulator: A Simulation Environment for a Decentralized Grid Scheduler
Abstract. This paper presents a simulator for of a decentralized modular grid scheduler named MaGate. MaGate’s design emphasizes scheduler interoperability by providing intellige...
Ye Huang, Amos Brocco, Michèle Courant, B&e...
IPPS
2006
IEEE
15 years 5 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan