Abstract
The paper concerns program design methods for a new kind of parallel embedded systems in which communication infrastructure is dynamically run-time adaptable to particular application program needs. The new system architecture assumes a fairly large number of autonomous communication links in each executive processor. Inter-processor link connections are subdue to dynamic reconfiguration according to the compile-time elaborated strategy based on the application program graph analysis. Automatic program structuring methods are used for defining the structuring of reconfigurable processor link sets which enables the look-ahead connection reconfiguration that overlaps with the current program execution including data communication. Algorithms for respective program task scheduling and dynamic program decomposition into sections executed with the look-ahead created connections of subsets of processor links are presented. Simulation experiment results with structuring of parallel numerical programs of matrix multiplication are presented. The experiments compare program structuring quality of the look ahead connection reconfiguration based on multiple crossbar switches with the quality of reconfiguration in a single crossbar switch but with the use of multiple link subsets reconfigured in advance.
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
Chen, J., Watson, W.: User-level communication on Alpha Linux Systems. In: Intl. Symp. On Parallel Architectures, Algorithms and Networks, ISPAN, IEEE Cs Press, Los Alamitos (2000)
Tanabe, N., et al.: Low Latency Communication on DIMNET-I network Interface Plugged into a DIMM slot. In: Intl. Conf. On Parallel Computing in Electrical Engineering, Warsaw, pp. 9–14. IEEE CS press, Los Alamitos (2002)
Tudruj, M.: Look-Ahead Dynamic Reconfiguration of Link Connections in Multi-Processor Architectures. In: Parallel Computing 1995, Gent, September 1995, pp. 539–546 (1995)
Hwang, J.-J., Chow, Y.-C., Angers, F.D., Lee, C.-Y.: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. Siam J. Comput. 18(2) (1989)
Laskowski, E.: New Program Structuring Heuristics for Multi-Processor Systems with Redundant Communication Resources. In: Proceedings of PARELEC 2002, Warsaw, September 2002, pp. 183–188 (2002)
Laskowski, E.: Program Scheduling in Look-Ahead Reconfigurable Parallel Systems with Multiple Communication Resources. In: Proceedings of PARELEC 2004, Dresden, September 2004, pp. 256–261 (2004)
Laskowski, E., Tudruj, M.: Efficient Parallel Embedded Computing Through Look-Ahead Configured Dynamic Inter-Processor Connections. In: Proceedings of 5-th International Symposium on Parallel Computing in Electrical Engineering PARELEC 2006, Białystok, Poland, September 13-17 (2006) ©2006 IEEE
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laskowski, E., Tudruj, M. (2008). Inter-processor Communication Optimization in Dynamically Reconfigurable Embedded Parallel Systems. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-68111-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68105-2
Online ISBN: 978-3-540-68111-3
eBook Packages: Computer ScienceComputer Science (R0)