Sciweavers

375 search results - page 28 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
JCO
1998
80views more  JCO 1998»
13 years 7 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...
FOCS
2008
IEEE
14 years 2 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
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...
Matthias Englert, Deniz Özmen, Matthias Weste...
TPDS
2008
106views more  TPDS 2008»
13 years 7 months ago
Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters
Security is increasingly becoming an important issue in the design of real-time parallel applications, which are widely used in the industry and academic organizations. However, ex...
Tao Xie 0004, Xiao Qin
IPPS
2000
IEEE
14 years 3 days ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg
HPCC
2007
Springer
14 years 1 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,...