Sciweavers

1536 search results - page 86 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
SC
2003
ACM
15 years 4 months ago
BCS-MPI: A New Approach in the System Software Design for Large-Scale Parallel Computers
Buffered CoScheduled MPI (BCS-MPI) introduces a new approach to design the communication layer for largescale parallel machines. The emphasis of BCS-MPI is on the global coordinat...
Juan Fernández, Eitan Frachtenberg, Fabrizi...
WSC
1998
15 years 21 days ago
Combining Optimism Limiting Schemes in Time Warp Based Parallel Simulations
The Time Warp protocol is considered to be an effective synchronization mechanism for parallel discrete event simulation (PDES). However, it is widely recognized that it suffers o...
Kevin G. Jones, Samir Ranjan Das
PPAM
2005
Springer
15 years 4 months ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
Krzysztof Giaro, Marek Kubale
ICMAS
1998
15 years 22 days ago
Multi-Machine Scheduling - A Multi-Agent Learning Approach
Multi-machine scheduling, that is, the assigment of jobs to machines such that certain performance demands like cost and time effectiveness are fulfilled, is a ubiquitous and comp...
Wilfried Brauer, Gerhard Weiß
EOR
2002
105views more  EOR 2002»
14 years 11 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler