Sciweavers

841 search results - page 82 / 169
» Job Scheduling in Rings
Sort
View
JCO
1998
80views more  JCO 1998»
15 years 6 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...
CONCURRENCY
2004
99views more  CONCURRENCY 2004»
15 years 6 months ago
A performance study of job management systems
Job Management Systems (JMSs) efficiently schedule and monitor jobs in parallel and distributed computing environments. Therefore, they are critical for improving the utilization ...
Tarek A. El-Ghazawi, Kris Gaj, Nikitas A. Alexandr...
QUESTA
2010
107views more  QUESTA 2010»
15 years 5 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...
SCHEDULING
2008
112views more  SCHEDULING 2008»
15 years 6 months ago
Time-constrained project scheduling
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, ...
TPDS
2008
106views more  TPDS 2008»
15 years 6 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