Sciweavers

841 search results - page 71 / 169
» Job Scheduling in Rings
Sort
View
HIPC
2004
Springer
15 years 5 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
IPPS
2003
IEEE
15 years 5 months ago
Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources
Fine-grained parallel applications require all their processes to run simultaneously on distinct processors to achieve good efficiency. This is typically accomplished by space sl...
Eitan Frachtenberg, Dror G. Feitelson, Fabrizio Pe...
EVOW
2008
Springer
15 years 1 months ago
A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
Gregory J. Barlow, Stephen F. Smith
CF
2009
ACM
15 years 4 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
WSC
2001
15 years 1 months ago
Using simulation and neural networks to develop a scheduling advisor
The research using artificial intelligence and computer simulation introduces a new approach for solving the job shop-scheduling problem. The new approach is based on the developm...
Thanos Alifantis, Stewart Robinson