research-article

Scheduling outtrees of height one in the LogP model

Author: Jacques VerrietAuthors Info & Claims

Volume 26, Issue 9

Pages 1065 - 1082

https://doi.org/10.1016/S0167-8191(00)00029-6

Published: 01 July 2000 Publication History

Abstract

We study the complexity of scheduling fork graphs in the LogP model of parallel computation. This model is a model that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of processors P. It will be proved that constructing minimum-length schedules for fork graphs in the LogP model is a strongly NP-hard optimisation problem. We also present a polynomial-time algorithm that constructs schedules that are at most twice as long as minimum-length schedules. Moreover, we prove that if all tasks of a fork graph have the same execution length, then a minimum-length schedule can be constructed in polynomial time.

References

[1]

M. Adler, J.W. Byers, R.M. Karp, Parallel sorting with limited bandwidth, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 129–136

[2]

P. Chrétienne, C. Picouleau, Scheduling with communication delays: a survey, in: P. Chrétienne, E.G. Coffman, Jr., J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and its Applications, Wiley, Chichester, UK, 1995, pp. 65–90 (Chapter 4)

[3]

T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.

Digital Library

[4]

D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proceedings of the Fourth ACM-SIGPLAN Symposium on Principles and Practice of Parallel Processing, 1993, pp. 1–12

[5]

D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, E.E. Santos, K.E. Schauser, R. Subramonian, T. von Eicken, LogP: a practical model of parallel computation, Communications of the ACM 39 (11) (1996) 78–85.

[6]

A.C. Dusseau, D.E. Culler, K.E. Schauser, R.P. Martin, Fast parallel sorting under LogP: experience with the CM-5, IEEE Transactions on Parallel and Distributed Systems 7 (8) (1996) 791–805.

[7]

S. Fortune, J. Wyllie, Parallelism in random access machines, in: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978, pp. 114–118

[8]

M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.

Digital Library

[9]

R.L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45 (1966) 1563–1581.

[10]

R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM Journal on Applied Mathematics 17 (2) (1969) 416–429.

Digital Library

[11]

R.M. Karp, A. Sahay, E.E. Santos, K.E. Schauser, Optimal broadcast and summation in the LogP model, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 142–153

[12]

I. Kort, D. Trystram, Some results on scheduling trees of height one under logp, Unpublished manuscript

[13]

W. Löwe, W. Zimmermann, Upper time bounds for executing PRAM-programs on the LogP-machine, in: Proceedings of the Ninth ACM International Conference on Supercomputing, 1995, pp. 41–50

[14]

W. Löwe, W. Zimmermann, J. Eisenbiegler, On linear schedules for task graphs for generalized LogP-machines, in: C. Lengauer, M. Griebl, S. Gorlatch (Eds.), Proceedings of the Third Euro-Par Conference, Lecture Notes in Computer Science, vol. 1300, Springer, Berlin, 1997, pp. 895–904

[15]

J. Verriet, Scheduling with communication for multiprocessor computation, Ph.D. Thesis, Utrecht University, Utrecht, the Netherlands, June 1998

[16]

W. Zimmermann, W. Löwe, An approach to machine-independent parallel programming, in: B. Buchberger, J. Volkert (Eds.), Proceedings of the Third Joint Conference on Vector and Parallel Processing, Lecture Notes in Computer Science, vol. 854, Springer, Berlin, 1994, pp. 277–288

Cited By

Bosque JPastor L(2006)A Parallel Computational Model for Heterogeneous ClustersIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2006.16517:12(1390-1400)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.1109/TPDS.2006.165

Index Terms

Scheduling outtrees of height one in the LogP model
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Index terms have been assigned to the content through auto-classification.

Recommendations

Scheduling Parallel Tasks with Communication Overhead in an Environment with Multiple Machines

This paper investigates the problem of nonpreemptively scheduling independent parallel tasks in an environment with multiple machines, which is motivated from the recent studies in scheduling tasks in a multi-machine environment. In this scheduling ...
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

We investigate the problem of online scheduling of jobs to minimize flow time and stretch on m identical machines. We consider the case where the algorithm is given either (1+ε)m machines or m machines of speed (1+ε), for arbitrarily small ε > 0. We ...
Modeling parallel communication
IPPS '95: Proceedings of the 9th International Symposium on Parallel Processing

The LogP model provides a framework for analyzing the performance of algorithms on distributed-memory multiprocessors. The model takes into account both the cost of computation and the cost of communication. It describes a multiprocessor in terms of ...

Comments

Information & Contributors

Information

Published In

cover image Parallel Computing

Parallel Computing Volume 26, Issue 9

Jul 2000

167 pages

ISSN:0167-8191

Issue’s Table of Contents

Elsevier Science B.V.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 July 2000

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bosque JPastor L(2006)A Parallel Computational Model for Heterogeneous ClustersIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2006.16517:12(1390-1400)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.1109/TPDS.2006.165

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents