Fully polynomial time approximation schemes for scheduling divisible loads

Authors:
Joanna Berlińska
Affiliations:
Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland
Venue:
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Year:
2009

Citing 10
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Partitioning Techniques for Large-Grained Parallelism

IEEE Transactions on Computers
Distributed processing of divisible jobs with communication startup costs

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Minimization of Half-Products

Mathematics of Operations Research
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays

IEEE Transactions on Parallel and Distributed Systems
Experiments with Scheduling Divisible Tasks in Clusters of Workstations

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Ten Reasons to Use Divisible Load Theory

Computer
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems

IEEE Transactions on Parallel and Distributed Systems
Practical Divisible Load Scheduling on Grid Platforms with APST-DV

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study divisible loads scheduling in heterogeneous systems with high bandwidth. Divisible loads represent computations which can be arbitrarily divided into parts and performed independently in parallel. We propose fully polynomial time approximation schemes for two optimization problems. The first problem consists in finding the maximum load which can be processed in a given time. It turns out that this problem can be reduced to minimization of a halfproduct. The second problem is computing the minimum time required to process load of a given size. The FPTAS solving this problem uses a dual approximation algorithm approach.