Concurrency Analysis in Dynamic Dataflow Graphs
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Emerging Topics in Computing"
DOI: 10.1109/tetc.2018.2799078
Abstract: Dynamic dataflow scheduling enables effective exploitation of concurrency while making parallel programming easier. To this end, analyzing the inherent degree of concurrency available in dataflow graphs is an important task, since it may aid compilers… read more here.
Keywords: concurrency; dynamic dataflow; dataflow graphs; graphs ... See more keywords