Sciweavers

223 search results - page 32 / 45
» Improving First-Come-First-Serve Job Scheduling by Gang Sche...
Sort
View
CONSTRAINTS
2011
13 years 2 months ago
A global constraint for total weighted completion time for unary resources
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
András Kovács, J. Christopher Beck
IPPS
1999
IEEE
13 years 12 months ago
Communication-Intensive Parallel Applications and Non-dedicated Clusters of Workstations
Time-sharing operating systems may delay application processing of incoming messages because other processes are scheduled when the messages arrive. In this paper, we present a sim...
Kritchalach Thitikamol, Peter J. Keleher
CONCURRENCY
2004
99views more  CONCURRENCY 2004»
13 years 7 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...
ICTCS
2005
Springer
14 years 1 months ago
Laxity Helps in Broadcast Scheduling
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keun...
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 9 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz