Sciweavers

206 search results - page 1 / 42
» Parallel Job Scheduling with Overhead: A Benchmark Study
Sort
View
IWNAS
2008
IEEE
13 years 10 months ago
Parallel Job Scheduling with Overhead: A Benchmark Study
We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a j...
Richard A. Dutton, Weizhen Mao, Jie Chen, William ...
PDP
2009
IEEE
13 years 10 months ago
Effects of Job and Task Placement on Parallel Scientific Applications Performance
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
Javier Navaridas, Jose Antonio Pascual, José...
TPDS
2008
106views more  TPDS 2008»
13 years 3 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
COR
2011
12 years 10 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diï¬...
Luis Fanjul-Peyro, Rubén Ruiz
EPS
1997
Springer
13 years 7 months ago
Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems
This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better trans...
Shyh-Chang Lin, Erik D. Goodman, William F. Punch ...