Resynchronization of Cyclo-Static Dataflow graphs

Abstract

Parallel stream processing applications are often executed on shared-memory multiprocessor systems. Synchronization between tasks is needed to guarantee correct functional behavior. An increase in the communication granularity of the tasks in the parallel application can decrease the synchronization overhead. However using coarser-grained synchronization can result in deadlock or violation of the throughput constraint for the application in case of cyclic data dependencies. Resynchronization tries to change the synchronization behavior in order to reduce the synchronization overhead. Determining the amount of resynchronization while preventing deadlock and satisfying the throughput constraint of the application, forms a global analysis problem. In this paper we present a Linear Programming (LP) algorithm for minimizing synchronization by means of resynchronization that is based on the properties of dataflow models. We demonstrate our approach with an extended Constant Modulus Algorithm (CMA) in a beam-forming application. For this application we reduce the number of synchronization statements with 30% while having a memory constraint of 200 tokens. The algorithm which calculates this reduction takes less than 20 milliseconds for this problem instance.

DOI: 10.1109/DATE.2011.5763211

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@article{Hausmans2011ResynchronizationOC, title={Resynchronization of Cyclo-Static Dataflow graphs}, author={Joost P. H. M. Hausmans and Marco Bekooij and Henk Corporaal}, journal={2011 Design, Automation & Test in Europe}, year={2011}, pages={1-6} }