Abstract
The multiprocessor scheduling problem is stated as finding a schedule for a task graph to be executed on a multiprocessor system such that the execution time of the graph can be minimized. This problem is known to be NP-hard, in all but a few restricted cases. To solve the problem, we apply the well-known state space reduction algorithm, A*. To alleviate the impediments of large space and time requirements, we employ three new techniques, processor isomorphism, task isomorphism, and node isomorphism. We demonstrate the effectiveness of our algorithm using several computer vision tasks as benchmarks. Finally, we also present an efficient Heuristic algoritlun for solving the problem in a reasonable amount of computation time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.R.Gary and D.S.Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.Freeman and Co., 1979.
R.Sethi, “Scheduling Graphs on Two Processors”, SIAM Journal of Computing, vol.5, no.1, pp.73–82, 1976.
B.Shirazi, M.Wang, and G.Pathak, “Analysis and Evaluation of Heuristic Methods for Static Scheduling”, Journal of Parallel and Distributed Computing, vol.10, pp.222–232, 1990.
G.C.Sih and E.A.Lee, “A Compile-tune Scheduling Heuristic for Interconnection-constrained Heterogeneous Processor Architectures”, IEEE Trans. on Parallel and Distributed Systems, vol.4, no.2, pp.75–87, 1993.
G.L.Djordjevic and M.B.Tosic, “A Compile-time Scheduling Heuristic for Multiprocessor Architectures”, The Computer Journal, vol.39, no.8, pp.664–667, 1996.
H.J.Siegel, J.B.Armstrong, and D.W.Watson, “Mapping Computer-Vision Related Tasks onto Reconfigurable Parallel-Processing Systems”, IEEE Computer, vol.25, no.2, pp.54–63, 1992.
N.J.Nilson, Principles of Artificial Intelligence, Springer-Verlag, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Piriyakumar, D.A.L., Murthy, C.S.R., Levi, P. (1998). A new A * based optimal task scheduling in heterogeneous multiprocessor systems applied to computer vision. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037158
Download citation
DOI: https://doi.org/10.1007/BFb0037158
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64443-9
Online ISBN: 978-3-540-69783-1
eBook Packages: Springer Book Archive