Abstract
In this paper, we address two key trends in the synthesis of implementations for embedded multiprocessors – (1) the increasing importance of managing interprocessor communication (IPC) in an efficient manner, and (2) the acceptance of significantly longer compilation time by embedded system designers. The former aspect is evident in the increasing interest among embedded system architects in innovative communication architectures, such as those involving optical interconnection technologies, and hybrid electro-optical structures [7]. The latter aspect results because embedded multiprocessor systems are typically designed as final implementations for dedicated functions. While multiprocessor mapping strategies for general-purpose systems are usually designed with low to moderate complexity as a constraint, embedded system design tools are allowed to employ more thorough and time-consuming optimization techniques.
This research was sponsored by the Defense Advanced Research Projects Agency, and the U. S. National Science Foundation.
Chapter PDF
Similar content being viewed by others
References
R.C. Correa, A. Ferreira, P. Rebreyend, “Scheduling Multiprocessor Tasks with Genetic Algorithms,” IEEE Trans, on Parallel and Distributed Sys., Vol. 0, 825–837, 1999.
E.S. H. Hou, N. Ansari, H. Ren, “A Genetic Algorithm for Multiprocessor Scheduling,” IEEE Trans,on Parallel and Distributed Systems, Vol. 5, 113–120, 1994.
V. Kianzad, S. S. Bhattacharyya, Multiprocessor clustering for embedded system implementation. Tech. report, Inst. for Advanced Computer Studies, UMCP June 2001.
Y. Kwok, I. Ahmad, “Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using A Parallel Genetic Algorithm,” Journal of Parallel and Distributed Computing, 1997.
V. Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, 1989.
G. C. Sih, E. Lee, “A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures.” IEEE Trans, on Parallel and Dist. Sys., Vol. 4, No. 2, 1993.
D. Spencer, J. Kepner, D. Martinez, “Evaluation of advanced optoelectronic interconnect technology,” MIT Lincoln Laboratory August 1999.
T. Yang, A. Gerasoulis, “PYRROS: States scheduling and code generation for message passing multiprocessors,” Proc. of 6th ACM Int. Conf. on Supercomputing, 1992.
P. Wang, W. Korfhage, “Process Scheduling Using Genetic Algorithms,” IEEE Symp. on Parallel andDistributed Processing, 638–641, 1995.
T. Yang, A. Gerasoulis, “DSC: scheduling parallel tasks on an unbounded number of processors,” IEEE Trans, on Parallel and Distributed Sys., Vol. 5, 951–967, 1994.
E. Zitzler, J. Teich, S. S. Bhattacharyya. Optimized software synthesis for DSP using randomization techniques. Tech. report, Swiss Federal Institute of Technology, Zurich, July 1999.
A.Y. Zomaya, C. Ward, B. Macey, “Genetic scheduling for parallel processor systems: comparative studies and performance issues,” IEEE Trans, on Parallel and Dist. Sys., Vol. 10, 795–812, 1999.
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
Kianzad, V., Bhattacharyya, S.S. (2001). Multiprocessor Clustering for Embedded Systems. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_99
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive