Sciweavers

1257 search results - page 63 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
ICC
2009
IEEE
200views Communications» more  ICC 2009»
16 years 23 days ago
Fast Distributed Multi-Cell Scheduling with Delayed Limited-Capacity Backhaul Links
— Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a c...
Ralf Bendlin, Yih-Fang Huang, Michel T. Ivrlac, Jo...
IPPS
2003
IEEE
15 years 11 months ago
Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
Josep M. Banús, Alex Arenas, Jesús L...
IPPS
2003
IEEE
15 years 11 months ago
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
Yang Yang, Henri Casanova
PPSN
1998
Springer
15 years 10 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
IPPS
2006
IEEE
16 years 1 days 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...