Abstract
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established DAG multiprocessor scheduling algorithms. In this paper, we investigate the inefficiencies of schedules acquired using DFS cycle removal. Further, an improved randomised DFS cycle removal algorithm is proposed that produces significantly improved results with acceptable computational overheads.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, D.J., Hu, Y.H.: Fully static multiprocessor array realizability criteria for real-time recurrent dsp applications. IEEE transactions on signal processing 42, 1288–1292 (1994)
Luh, J.Y.S., Lin, C.S.: Scheduling of Parallel Computation for a Computer-Controlled Mechanical Manipulator. IEEE Transactions on Systems, Man and Cybernetics SMC-12(2), 214–234 (1982)
Bozic, S.M.: Digital and Kalman Filtering. Edward Arnold, London (1979)
Kasahara, H., Narita, S.: Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing. IEEE Transactions on Computers C-33(11), 1023–1029 (1984)
Aydin, H., Melhem, R., Mosse, D., Mejia-Alvarez, P.: Power-aware scheduling for periodic real-time tasks. IEEE Transactions on Computers 53, 584–600 (2004)
Liu, J.F., Chou, P.H., Bagherzadeh, N.: Power-aware task motion for enhancing dynamic range of embedded systems with renewable energy sources. In: Falsafi, B., VijayKumar, T.N. (eds.) PACS 2002. LNCS, vol. 2325, pp. 84–98. Springer, Heidelberg (2003)
Zhu, D.K., Melhem, R., Childers, B.R.: Scheduling with dynamic voltage/speed adjustment using slack reclamation in multiprocessor real-time systems. IEEE Transactions on Parallel and Distributed Systems 14, 686–700 (2003)
Malloy, B.A., Lloyd, E.E., Soffa, M.L.: Scheduling DAG’s for Asynchronous Multiprocessor Execution. IEEE Transactions on Parallel and Distributed Systems 5(5), 498–508 (1994)
Kwok, Y.K., Ahmad, I.: Dynamic Critical Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE transactions on Parallel and Distributed Processing 7(5), 506–521 (1996)
Parhi, K.K., Messerschmitt, D.G.: Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding. IEEE Transactions on Computing 40(2), 178–195 (1991)
Yang, T., Fu, C.: Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines. IEEE Transactions on Parallel and Distributed Systems 8(6) (1997)
Sandnes, F.E., Megson, G.M.: Improved static multiprocessor scheduling using cyclic task graphs: A genetic approach. Parallel Computing: Fundamentals, Applications and New Directions 12, 703–710 (1998)
Sandnes, F.E., Sinnen, O.: A new scheduling algorithm for cyclic graphs. International Journal of High Performance Computing and Networking 1 (2004)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms, pp. 477–483. MIT Press, Cambridge (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sandnes, F.E., Sinnen, O. (2004). Stochastic DFS for Multiprocessor Scheduling of Cyclic Taskgraphs. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_75
Download citation
DOI: https://doi.org/10.1007/978-3-540-30501-9_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24013-6
Online ISBN: 978-3-540-30501-9
eBook Packages: Computer ScienceComputer Science (R0)