Sciweavers

1536 search results - page 57 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
PADS
1999
ACM
15 years 3 months ago
Scheduling Critical Channels in Conservative Parallel Discrete Event Simulation
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...
Xiao Zhonge, Brian Unger, Rob Simmonds, John G. Cl...
COLOGNETWENTE
2008
15 years 22 days ago
Special Cases of Online Parallel Job Scheduling
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
Johann Hurink, Jacob Jan Paulus
TPDS
1998
124views more  TPDS 1998»
14 years 11 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
FODO
1998
Springer
241views Algorithms» more  FODO 1998»
15 years 3 months ago
2D BubbleUp: Managing Parallel Disks for Media Servers
In this study we present a scheme called two-dimensional BubbleUp (2DB) for managing parallel disks in a multimedia server. Its goal is to reduce initial latency for interactive m...
Edward Y. Chang, Hector Garcia-Molina, Chen Li
MOR
2000
90views more  MOR 2000»
14 years 11 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger