Abstract
A new graph structuring algorithm for look-ahead reconfigurable multi-processor systems based on multiple crossbar switches is presented. It is based on list scheduling and a new iterative clustering heuristics for graph partitioning. Look-ahead dynamic inter-processor connection reconfiguration is a multi-processor architectural model, which has been proposed to eliminate connection reconfiguration time overheads. It consists in preparing link connections in advance in parallel with program execution. An application program is partitioned into sections, which are executed using redundant communication resources, i.e. crossbar switches. Parallel program scheduling in such a kind of environment incorporates graph partitioning problem. The experimental results are presented, which compare the performance of several graph partitioning algorithms for such a kind of environment.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hwang, J.-J., Chow, Y.-C., Angers, F., 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: Proc. of PARELEC 2002 Intl. Conference, Warsaw, Poland (2002)
Laskowski, E., Tudruj, M.: A Testbed for Parallel Program Execution with Dynamic Look-Ahead Inter-Processor Connections. In: Proc. of PPAM 1999, Kazimierz Dolny, Poland (September 1999)
El-Rewini, H., Lewis, T.G., Ali, H.H.: Task Scheduling in Parallel and Distributed Systems. Prentice Hall, Englewood Cliffs (1994)
Tudruj, M.: Look-Ahead Dynamic Reconfiguration of Link Connections in Multi- Processor Architectures. In: Parallel Computing 1995, Gent, September 1995, pp. 539–546 (1995)
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
Laskowski, E. (2004). Program Structuring Heuristics for Parallel Systems Based on Multiple Crossbar Switches. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive