A new strategy for multiprocessor scheduling of cyclic task graphs

International Journal of High Performance Computing and Networking

Volumn 3, Issue 1, 2005, Pages 62-71

  Sandnes, Frode E ^a   Sinnen, Oliver ^b  

^a OSLO METROPOLITAN UNIVERSITY   (Norway)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

cyclic graphs; digital signal processing; genetic algorithms; iterative computation; iterative computations; multiprocessor scheduling; task graphs

Indexed keywords

EID: 33750079333     PISSN: 17400562     EISSN: 17400570     Source Type: Journal    
DOI: 10.1504/IJHPCN.2005.007868     Document Type: Article

References (28)

1. Ahmad, L. and Dhodhi, M.K. (1996) ‘Multiprocessor scheduling in a genetic paradigm’, Parallel Computing, Vol. 22, pp.395–406.
2. Allan, V.H., Jones, R.B., Lee, R.M. and Allan, S.J. (1995) ‘Software pipelining’, ACM Computing Surveys, Vol. 27, No. 3, pp.367–432.
3. Calland, P.Y., Darte, A. and Robert, Y. (1998) ‘Circuit retiming applied to decomposed software pipelining’, IEEE Transactions on Parallel and Distributed Systems, Vol. 9, No. 1, pp.24–35.
4. Chao, L.F. and Sha, E.H.M. (1997) ‘Scheduling data-flow graphs via retiming and unfolding’, IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 12, pp.1259–1267.
5. Cormen, T.H., Leiserson, C.E. and Rivest, R.L. (1990) Introduction to algorithms, MIT Press, pp.477–483.
6. Correa, R.C., Ferreira, A. and Rebreyend, P. (1999) ‘Scheduling multiprocessor tasks with genetic algorithms’, IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 8, pp.825–837.
7. Hanen, C. and Munier, A. (1994) ‘Cyclic scheduling on parallel processors: an overview’, in Chr’etienne, P., Coffman, E.G., Lenstra, J.K. and Liu, Z. (Eds.): Scheduling Theory and its Applications, John Wiley & Sons Ltd, New Jersey, USA, pp.193–226.
8. Jeng, L.G. and Chen, L.G (1992) ‘Rate-optimal static scheduling for recursive DSP algorithms by retiming and unforlding’, International Journal of Electronics, Vol. 73, No. 4, pp.687–701.
9. Kasahara, H. and Narita, S. (1985) ‘Parallel processing of robot-arm control computation on a multiprocessor system’, IEEE Journal of Robotics and Automation, Vol. RA-1, No. 2, pp.104–113.
10. Knijnenburg, P.M.W., Kisuki, T. and O’Boyle, M.F.P. (2003) ‘Combined selection of tile sizes and unroll factors using iterative compilation’, Journal of Supercomputing, Vol. 24, No. 1, pp.43–67.
11. Kohler, W.H. (1975) ‘A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems’, IEEE Transactions on Computers, Vol. C-24, pp.1235–1238.
12. Kung, S.Y. (1988) VLSI Array Processors, Prentice Hall, Information and System Sciences Series.
13. Kwok, Y.C. and Ahmad, I. (1996) ‘Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors’, IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 5, pp.506–521.
14. Lam, M. (1988) ‘Software pipelining: an effective scheduling technique for VLIW machines’, In Proc. of the 8th Int. Conf. on Programming Languages, Design and Implementation, pp.258–267.
15. Lucke, L.E. and Parhi, K.K. (1993) ‘Data-flow transformations for critical path time reduction in highlevel DSP synthesis’, IEEE Transactions on Computer-Aided Design, Vol. 12, No. 7, pp.1063–1068.
16. Manoharan, S. (2001) ‘Effect of task duplication on the assignment of dependency graphs’, Parallel Computing, Vol. 27, No. 3, pp.257–268.
17. Parhi, K.K. and Messerschmitt, D.G. (1991) ‘Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding’, IEEE Transactions on Computing, Vol. 40, No. 2, pp.178–195.
18. Piriyakumar, D.A.L., Levi, P. and Murthy, C.S.R. (1999) ‘Optimal scheduling of iterative data-flow programs onto multiprocessors with non-negligible interprocessor communication’, Proceedings of HPCN Europe, pp.732–743.
19. Reiter, R. (1968) ‘Scheduling parallel computations’, Journal of the ACM, Vol. 15, No. 4, pp.590–599.
20. Sandnes, F.E. (2003) ‘Secure distributed configuration management with randomised scheduling of system-administration tasks’, IEICE Transactions on Information and Systems, Vol. E86-D, No. 9, pp.1601–1610.
21. Sandnes, F.E. and Megson, G.M. (1998) ‘Improved static multiprocessor scheduling using cyclic task graphs: a genetic approach’, Parallel Computing: Fundamentals, Applications and New Directions, North-Holland, Vol. 12, pp.703–710.
22. Shukla, S.B. and Agrawal, D.P. (1994) ‘A framework for mapping periodic real-time applications on multicomputers’, IEEE Transactions on Parallel and Distributed Systems, Vol. 5, No. 7, pp.778–784.
23. Sinnen, O. and Sousa, L. (2003) ‘Experimental evaluation of task scheduling accuracy: implications for the scheduling model’, IEICE Transactions on Information and Systems, Vol. E86-D, No. 9, pp.1620–1627.
24. Tongsima, S., O’Neil, T.W., Chantrapornchai, C. and Sha, E.H.M (2000) ‘Properties and algorithms for unfolding of probabilistic data-flow graphs’, Journal of VLSI Signal Processing Systems for Signal Image and Video Technology, Vol. 25, No. 3, pp.215–233.
25. Wang, C.Y. and Parhi, K.K. (1995) ‘High-level DSP Synthesis using Concurrent transformations, scheduling and allocation’, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, Vol. 14, No. 3, pp.274–295.
26. Wang, D.J. and Hu, Y.H. (1994) ‘Fully static multiprocessor array realizability criteria for real-time recurrent DSP applications’, IEEE Transactions on Signal Processing, Vol. 42, No. 5, pp.1288–1292.
27. Weinblatt, H. (1972) ‘A new algorithm for finding the simple cycles of a finite directed graph’, Journal of the ACM, Vol. 19, No. 1, pp.45–56.
28. Yang, T. and Fu, C. (1997) ‘Heuristic algorithms for scheduling iterative task computations on distributed memory machines’, IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 6, pp.608–622.