Abstract
A new program structuring algorithm for dynamically look–ahead reconfigurable multi–processor systems is presented in the paper. The presented algorithm uses a new kind of graph representation of parallel programs with conditional branches (Branching Task Graph, BTG). The BTG captures the data–flow and control–flow properties of parallel programs. It extends the scope of parallel programs optimized for execution in look–ahead reconfigurable systems beyond static DAG graphs. The new program graph structuring algorithm for BTG graphs is based on a two–phase approach. It consists of a new list task scheduling heuristics, which incorporates branch optimization techniques such as detection of mutually–exclusive subgraphs and scheduling of most–often–used paths based on branch probabilities. In the second phase, program partitioning into sections executed with the look–ahead created connections is done, based on the modified iterative clustering heuristics.
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., et al.: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. Siam J. Comput. 18(2) (1989)
Tudruj, M.: Look–Ahead Dynamic Reconfiguration of Link Connections in Multi–Processor Architectures. In: Parallel Computing 1995, Gent, September, pp. 539–546 (1995)
Laskowski, E., Tudruj, M.: A Testbed for Parallel Program Execution with Dynamic Look–Ahead Inter–Processor Connections. In: Proc. of the PPAM 1999 (September 1999)
Laskowski, E.: Program Structuring Algorithms for Dynamically Reconfigurable Parallel Systems Based on Redundant Connection Switches. In: Proc. of the 3rd Int. Symposium on Parallel and Distributed Computing, Cork, Ireland, pp. 248–255 (2004)
Wu, D., Al–Hashimi, B., Eles, P.: Scheduling and Mapping of Conditional Task Graph for the Synthesis of Low Power Embedded Systems. IEEE Proceedings – Computers and Digital Techniques 150(5), 303–312 (2003)
Xie, Y., Wolf, W.: Allocation and scheduling of conditional task graph in hardware/software co–synthesis. In: DATE 2001, pp. 620–625 (2001)
Murphy, C., Wang, X.: Most Often Used Path Scheduling Algorith. In: Proc. of the 5th World Multi–Conference on Systemics, Cybernetics and Informatics (SCI 2001), Orlando, USA, July 22-25, 2001, vol. XII, pp. 289–295 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laskowski, E., Tudruj, M. (2006). Task Scheduling for Look–Ahead Reconfigurable Systems in Presence of Conditional Branches. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_104
Download citation
DOI: https://doi.org/10.1007/11752578_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)