Scheduling cyclic task graphs with SCC-map

• Type: Article in International Conference Proceedings Book
• Date: 2012

Authors

Sardinha, A (Author) Other; Alves, TAO (Author) Other; Marzulo, LAJ (Author) Other; Franca, FMG (Author) Other; Barbosa, VC (Author) Other; Costa, VS (Author) FCUP

Conference proceedings International

Title: Proceedings - 3rd Workshop on Applications for Multi-Core Architecture, WAMCA 2012

Pages: 54-59

3rd Workshop on Applications for Multi-Core Architecture, WAMCA 2012

New York, NY, 24 October 2012 through 25 October 2012

Indexing

Scopus - 3 Citations

Other information

Authenticus ID: P-008-8F6

DOI: 10.1109/wamca.2012.8

Abstract (EN): The Dataflow execution model has been shown to be a good way of exploiting TLP, making parallel programming easier. In this model, tasks must be mapped to processing elements (PEs) considering the trade-off between communication and parallelism. Previous work on scheduling dependency graphs have mostly focused on directed a cyclic graphs, which are not suitable for dataflow (loops in the code become cycles in the graph). Thus, we present the SCC-Map: a novel static mapping algorithm that considers the importance of cycles during the mapping process. To validate our approach, we ran a set of benchmarks in on our dataflow simulator varying the communication latency, the number of PEs in the system and the placement algorithm. Our results show that the benchmark programs run significantly faster when mapped with SCC-Map. Moreover, we observed that SCC-Map is more effective than the other mapping algorithms when communication latency is higher. © 2012 IEEE.

Language: English

Type (Professor's evaluation): Scientific