Sciweavers

1536 search results - page 30 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
15 years 16 days ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
IPPS
2006
IEEE
15 years 5 months ago
A parallel memetic algorithm applied to the total tardiness machine scheduling problem
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
Vinícius Garcia, Paulo M. França, Al...
ISPAN
2005
IEEE
15 years 4 months ago
A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars
Most high-end switches use an input-queued or a combined input- and output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling syst...
Kevin F. Chen, Edwin Hsing-Mean Sha, S. Q. Zheng
CLOUDCOM
2010
Springer
14 years 8 months ago
Scheduling Hadoop Jobs to Meet Deadlines
User constraints such as deadlines are important requirements that are not considered by existing cloud-based data processing environments such as Hadoop. In the current implementa...
Kamal Kc, Kemafor Anyanwu
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 2 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde