List scheduling of general task graphs under LogP

Parallel Computing

Volumn 26, Issue 9, 2000, Pages 1109-1128

  Kalinowski, Tomasz ^a   Kort, Iskander ^b   Trystram, Denis ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

^b Domaine Universitaire   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS;

LIST SCHEDULING; TASK GRAPHS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033705838     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00031-4     Document Type: Article

References (26)

1. C. Boeres, Versatile communication cost modelling for multicomputer task scheduling heuristics, Ph.D. Thesis, University of Edinburgh, 1996.
2. P. Chrétienne, Task scheduling over distributed memory machines, Technical Report 253, MASI, Pierre and Marie Curie University, Paris, 1988.
3. P. Chrétienne, Complexity of tree-scheduling with interprocessor communication delays, Technical Report 90.5, MASI, Pierre and Marie Curie University, Paris, 1990.
4. P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and Its Applications, Wiley, New York, 1995.
5. D.E. Culler, et al., LogP: a practical model of parallel computation, Communications of the ACM 39 (11), November 1996, 78-85.
6. D.E. Culler, L.T. Liu, R.P. Martin, C. Yoshikawa, LogP performance assessment of fast network interfaces, IEEE Micro, February 1996.
7. S. Fortune, J. Wyllie, Parallelism in random access machines, in: Proceedings of the 10th ACM Symposium on Theory of Computing, 1978, pp. 114-118.
8. P.B. Gibbons, Y. Matias, V. Ramachandran, Can a shared-memory model serve as a bridging model for parallel computation? in: Proceedings of the Nineth Annual ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island, June 22-25, 1997, pp. 72-83, SIGACT/SIGARCH and EATCS.
9. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM J. Applied Mathematic. 17:1969;416-429.
10. Hu T.C. Parallel sequencing and assembly line problems. Operational Research. 9:1961;841-848.
11. J.J. Hwang, Y.C. Chow, F.D. Anger, C.Y. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM Journal of Computing 18 (2), (1989) 244-257.
12. K.K. Keeton, T.E. Anderson, D.A. Patterson, Logp quantified: the case for low-overhead local area networks, in: Hot Interconnects III: A Symposium on High Performance Interconnects, Stanford University, Stanford, CA, August 1995, pp. 10-12.
13. I. Kort, D. Trystram, Assessing LogP model parameters for the IBM-SP, in: EUROPAR'98, Southampton, UK, September 1998.
14. I. Kort, D. Trystram, Some results on scheduling flat trees in LogP model, Journal of Information Systems and Operational Research (INFOR) (1998), to appear.
15. Lewis T., El-Rewini H. Parallax: A tool for parallel program scheduling. IEEE Parallel and Distributed Technology. 1(2):1993;62-72.
16. W. Löwe, M. Middendorf, W. Zimmermann, Scheduling inverse trees under the communication model of the LogP-Machine, Theoretical Computer Science (1997), to appear.
17. W. Löwe, W. Zimmermann, J. Eisenbiegler, On linear schedules of task graphs on generalized LogP-Machines, in: Europar'97: Parallel Processing, LNCS 1300, 1997, pp. 895-904.
18. Papadimitriou C.H., Yannakakis M. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing. 19(2):1990;322-328.
19. Rayward-Smith V.J. UET scheduling with unit interprocessor communication delays. Discrete Applied Mathematics. 18:1997;55-71.
20. B. Shirazi, H.B. Chen, K. Kavi, J. Marquis, A.R. Hurson, PARSA: A parallel program software development tool, in: IEEE CS Press (Ed.), Symposium on Assesment of Quality Software Develompemnt Tools, 1994, pp. 96-111.
21. Valiant L. A bridging model for parallel computation. Communication of the ACM. 33:1990;103-111.
22. J. Verriet, Scheduling tree-structured programs in the LogP model, Technical Report UU-CS-1997-18, Department of Computer Science, Utrecht University, 1997.
23. Wu M.Y., Gajski D.D. Hypertool: a programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems. 1(3):1990;330-343.
24. T. Yang, A. Gerasoulis, PYRROS: static task scheduling and code generation for message-passing multiprocessors, in: Proceedings of the Sixth ACM International Conference on Supercomputing, Washington, DC, July 1992, pp. 428-437.
25. Zimmermann W., Loewe W. An approach to machine-independent parallel programming. Lecture notes in Computer Science. 1994;854.
26. Zimmermann W., Middendoff M., Loewe W. On optimal k-linear scheduling of tree-like task graphs for Log-Machines. Lecture notes in Computer Science. 1998;1470.