Hierarchical synchronization between processes in a high-performance execution support of dataflow process networks on many-core architectures

Abstract : When using vector clocks to synchronize processes in a computation, the problem of the vector clock dimension is well known and an acknowledged difficulty. In dataflow process networks, a compiler can rely on some process properties to create a hierarchical view of inter-process synchronization, achieving bounded vector clock dimension. In this paper, we present two approaches to reduce the vector clock dimensions, these approaches can be clearly combination between them. The first one is mainly based on run length encoding heuristic, the second one is achieved by means of 0/1 integer programming model with modeling into the graph partitioning problem.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01838145
Contributor : Léna Le Roy <>
Submitted on : Friday, July 13, 2018 - 10:29:01 AM
Last modification on : Wednesday, January 23, 2019 - 2:39:33 PM

Identifiers

Collections

CEA | DRT | LIST

Citation

D.P. Nguyen, T.H. Nguyen, P. Dubrulle. Hierarchical synchronization between processes in a high-performance execution support of dataflow process networks on many-core architectures. 2014 Eighth International Conference on Complex, Intelligent and Software Intensive Systems, Jul 2014, Birmingham, United Kingdom. pp.439-444, ⟨10.1109/CISIS.2014.62⟩. ⟨cea-01838145⟩

Share

Metrics

Record views

61