Sciweavers

2355 search results - page 90 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
137
Voted
CLUSTER
2004
IEEE
15 years 9 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
15 years 5 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
SPAA
1990
ACM
15 years 9 months ago
Low Overhead Parallel Schedules for Task Graphs
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
Richard J. Anderson, Paul Beame, Walter L. Ruzzo
WSC
2008
15 years 7 months ago
Optimizing staffing schedule in light of patient satisfaction for the whole outpatient hospital ward
The waiting time for patients in outpatient departments of hospitals is a problem throughout the world. In this context, a discrete-event-simulation model was developed to examine...
Soemon Takakuwa, Athula Wijewickrama
HPCC
2007
Springer
15 years 11 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,...