On minimising the processor requirements of LogP schedules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2150, Issue , 2001, Pages 156-166

  Boeres, Cristina ^a   da Cunha, Gerson N ^a   Rebello, Vinod E F ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; HEURISTIC METHODS;

ALGORITHM DESIGN; LOGP MODEL; MAKESPAN; SCHEDULING HEURISTICS; TASK CLUSTERING; TASK REPLICATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 23044530638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44681-8_24     Document Type: Conference Paper

References (14)

1. A. Alexandrov, M. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model-one step closer towards a realistic model for parallel computation. 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA’95), 1995.
2. C. Boeres, A. Nascimento, and V. E. F. Rebello. Scheduling arbitrary task graphs on LogP machines. In P. Amestoy et al., editors, The Proceedings of the 5th International Euro-Par Conference on Parallel Processing (Euro-Par’99), LNCS 1685, pages 340–349, Toulouse, France, August 1999. Springer.
3. C. Boeres, A. P. Nascimento, and V. E. F. Rebello. Cluster-based task scheduling for LogP model. International Journal of Foundations of Computer Science, 10(4):405–424, 1999.
4. C. Boeres and V. E. F. Rebello. A versatile cost modelling approachfor multicomputer task scheduling. Parallel Computing, 25(1):63–86, 1999.
5. C. Boeres and V. E. F. Rebello. On the design of clustering-based scheduling algorithms for realistic machine models. In The Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS’01), San Francisco, USA, April 2001. IEEE Computer Society Press.
6. C. Boeres, V. E. F. Rebello, and D. Skillicorn. Static scheduling using task replication for LogP and BSP models. In D. Pritchard and J. Reeve, editors, The Proc. Of the 4th International Euro-Par Conference on Parallel Processing (Euro-Par’98), LNCS 1470, pages 337–346, Southampton, UK, September 1998. Springer.
7. D. Culler et al.. LogP: Towards a realistic model of parallel computation. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, USA, May 1993.
8. T. Kalinowski, I. Kort, and D. Trystram. List scheduling of general task graphs under LogP. Parallel Computing, 26(9):1109–1128, 2000.
9. W. Lowe and W. Zimmermann. Scheduling balanced task-graphs to LogPmachines. Parallel Computing, 26(9):1083–1108, 2000.
10. R. P. Martin, A. M. Vahdat, D. E. Culler, and T. E. Anderson. Effects of communication latency, overhead, and bandwidth in a cluster architecture. In Proc. Of the 24th International Symposium on Computer Architecture, pages 85–97, June 1997.
11. M. A. Palis, J.-C Liou, and D. S. L. Wei. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems, 7(1):46–55, January 1996.
12. C. H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput., 19:322–328, 1990.
13. A. Tam and C. Wang. Realistic communication model for parallel computing on cluster. In Proc. of the 1st IEEE International Workshop on Cluster Computing, pages 92–101, Melbourne, Australia, December 1999. IEEE Computer Soc. Press.
14. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951–967, 1994.