A versatile cost modelling approach for multicomputer task scheduling

Parallel Computing

Volumn 25, Issue 1, 1999, Pages 63-86

  Boeres, Cristina ^a   Rebello, Vinod E F ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

Clustering; Communication overheads; Latency; Multi stage scheduling heuristic; Task replication; Task scheduling

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; RESPONSE TIME (COMPUTER SYSTEMS);

MULTICOMPUTER TASK SCHEDULING; MULTISTAGE SCHEDULING APPROACH (MSA);

PARALLEL PROCESSING SYSTEMS;

EID: 0032674377     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00103-3     Document Type: Article

References (25)

1. T.E. Anderson, D.E. Culler, D.A. Patterson, A case for NOW (Networks of Workstations), IEEE Micro 15 (1) (1995) 23-39.
2. F.D. Anger, J.-J. Hwang, Y.-C. Chow, Scheduling with sufficient loosely coupled processors, Journal of Parallel and Distributed Computing 9 (1990) 87-92.
3. C. Boeres, Versatile communication cost modelling for multicomputer task scheduling heuristics. Ph.D. Thesis, Department of Computer Science, University of Edinburgh, May 1997.
4. C. Boeres, G. Chochia, P. Thanisch, On the scope of applicability of the ETF algorithm, in: Afonso Ferreira, Jose Rolim (Eds.), The Second International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR'95), Lyon, France, LNCS 980, Springer, Berlin, September 1995, pp. 159-164.
5. C. Boeres, V.E.F. Rebello, Versatile task scheduling of binary trees for realistic machines, in: C. Lengauer, M. Grièld, S. Gorlatch (Eds.), Proceedings of the Third International Euro-Par Conference on Parallel Processing (Euro-Par'97), Passau, Germany, LNCS 1300, Springer, Berlin, August 1997, pp. 913-921.
6. R.P. Brent, The parallel evaluation of general arithmetic expressions, J. ACM 21 (1974) 201-206.
7. G. Chochia, C. Boeres, M. Norman, P. Thanisch, Analysis of multicomputer schedules in a cost and latency model of communication, in: Proceedings of The Third Workshop on Abstract Machine Models for Parallel and Distributed Computing, Leeds, UK, IOS press, April 1996.
8. 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 Programming, San Diego, CA, May 1993.
9. B. Di Martino, G. Ianello, Parallelization on non-simultaneous iterative methods for systems of linear equations, in: Parallel Processing (CONPAR'94-VAPP VI), LNCS 854, Springer, Berlin, 1994, pp. 254-264.
10. J. Eisenbiergler, W. Lowe, A. Wehrenpfennig, On the optimization by redundancy using an extended LogP model, in: Proceedings of The International Conference on Advances in Parallel and Distributed Computing (APDC'97), IEEE Computer Soc. Press, New York, 1997, pp. 149-155.
11. H. El-Rewini, T.G. Lewis, Scheduling parallel program tasks onto arbitrary target machines, Journal of Parallel and Distributed Computing 9 (1990) 138-153.
12. A. Gerasoulis, S. Venugopol, T. Yang, Clustering task graphs for message passing architectures, in: Proceedings of The International Conference on Supercomputing, Amsterdam, The Netherlands, June 1990, pp. 447-456.
13. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimisation and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics 5 (1979) 236-287.
14. F.W. Howell, Reverse profiling, in: Innes Jelly, Ian Gorton, Peter Croll (Eds.), Software Engineering for Parallel and Distributed Systems, Chapman & Hall, London, March 1996, pp. 244-255.
15. J.-J. Hwang, Y.-C. Chow, F.D. Anger, C.-Y. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput. 18 (2) (1989) 244-257.
16. H. Jung, L. Kirousis, P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays, in: Proc. ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 254-264.
17. S.J. Kim, J.C. Browne, A general approach to mapping of parallel computations upon multiprocessor architectures, in: Proceedings of The Third International Conference on Parallel Processing, 1988, pp. 1-8.
18. W. Lowe, W. Zimmermann, J. Eisenbiergler, Optimization of parallel programs on machines with expensive communication, in: L. Bouge, P. Fraigniaud, A. Mignotte, Y. Robert (Eds.), Proc. 2nd International Euro-Par Conference on Parallel Processing (Euro-Par'96), Lyon, France, LNCS 1124, Springer, Berlin, August 1996, pp. 602-610.
19. R.P. Martin, A.M. Vahdat, D.E. Culler, T.E. Anderson, Effects of communication latency, overhead, and bandwidth in a cluster architecture, in: Proceedings of the 24th Annual International Symposium on Computer Architecture, June 1997, pp. 85-97.
20. M. Norman, Static allocation of computation to processors in multicomputers, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1993.
21. M.A. Palis, J.-C. Liou, D.S.L. Wei, Task clustering and scheduling for distributed memory parallel architectures, IEEE Transactions on Parallel and Distributed Systems 7 (1) (1996) 46-55.
22. C.H. Papadimitriou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM J. Comput. 19 (1990) 322-328.
23. D.A. Patterson, Observations on massively parallel processors: a case for a new theoretical model: LogP, in: The DIMACS Workshop of Models, Architectures, and Technologies for Parallel Computation, Rutgers, NJ, USA, September 1993.
24. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, Pitman, London, 1989.
25. T. Yang, A. Gerasoulis, DSC: Scheduling parallel tasks on an unbounded number of processors, IEEE Transactions on Parallel and Distributed Systems 5 (9) (1994) 951-967.