Abstract
This paper presents the evaluation of the solution quality of heuristic algorithms developed for scheduling multiprocessor tasks in a class of multiprocessor architecture designed for real-time operations. MIMD parallelism and multiprogramming support are the two main characteristics of multiprocessor architecture considered. The solution methodology includes different techniques including simulated annealing, tabu search, as well as well-known simple priority rule based heuristics. The results obtained by these different techniques are analyzed for different number of jobs and machine configurations.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blażewicz J., Ecker K. H., Pesch E., Schmidt G. and Weglarz J., Scheduling Computer and Manufacturing Processes, Springer-Verlag, Berlin, 1996
Bokhari S. H., Assignment Problems in Parallel and Distributed Computing, Kluwer Academic, Boston (1987)
Choudhary A. N., Patel J. H and Ahuja N., NETRA: A Hierarchical and Partitionable Architecture for Computer Vision Systems, IEEE Trans. Parallel and Distributed Systems, Vol. 4, (1996) 1092–1104
El-Revini H., partitioning and and scheduling, in: A. Y. H. Zomaya (ed.), Parallel and Distributed Computing Handbook, McGraw-Hill, New York, (1996) 239–273
Ercan M. F. and Y. F. Fung, Real-time Image Interpretation on a Multi-layer Architecture, IEEE TENCON’99, Vol. 2, (1999) 1303–1306.
Ercan M. F., C. Oguz and Y. F. Fung, Scheduling Image Processing Tasks in A Multi-layer System, in print Computers and Electrical Engineering.
Glover F. and Laguna, Tabu search, Kluwer Academic Publishers, Boston, (1997)
Johnson S. M., Optimal Two and Three-stage Production Schedules with Setup Times Included, Naval Research Logistic Quarterly, Vol. 1, (1954) 61–68
Kirkpatrick S., Gelatt, C. D., and Vecchi M. P., Optimization by Simulated Annealing, Science, Vol. 220, (1983) 671–680
Lee C. Y and Vairaktarakis G. L., Minimizing Make Span in Hybrid Flow-Shops, Operations Research Letters, Vol. 16, (1994) 149–158
Scala M. L., Bose A., Tylavsky J., and Chai J. S., A Highly Parallel Method for Transient Stability Analysis, IEEE Transactions on Power Systems, Vol. 5, (1990) 1439–1446
Siegel H. J., Siegel L. J., Kemmerer F. C., Mueller P. T., Smalley H. E., and Smith S. D., PASM-A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition, IEEE Trans. Computers, Vol. C-30, (1981) 934–947
Weems C. C., Riseman E. M. and Hanson A. R., Image Understanding Architecture: Exploiting Potential Parallelism in Machine Vision, IEEE Computer, Vol. 25 (1992) 65–68
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ercan, M.F., Oguz, C., Fung, YF. (2001). Performance Evaluation of Heuristics for Scheduling Pipelined Multiprocessor Tasks. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science — ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45545-0_16
Download citation
DOI: https://doi.org/10.1007/3-540-45545-0_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42232-7
Online ISBN: 978-3-540-45545-5
eBook Packages: Springer Book Archive