2017/09/25 by Orlando Moreira, Moreira, Orlando, Merten Popp +3
Computer Science · Engineering · #Data Structures and Algorithms (cs.DS) #Embedded Systems Design Techniques #FOS: Computer and information sciences #Interconnection Networks and Systems #Neural and Evolutionary Computing (cs.NE) #VLSI and FPGA Design Techniques #cs.DS #cs.NE
paper · pdf · doi:10.48550/arxiv.1709.08563
arxiv created 2017/09/25 · openalex publication_date 2017/09/25 · arxiv updated 2017/09/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for multiprocessor architectures. However due to resource restrictions, an acyclicity constraint on the partition is necessary when mapping streaming applications to an embedded multiprocessor. Here, we contribute a multi-level algorithm for the acyclic graph partitioning problem. Based on this, we engineer an evolutionary algorithm to further reduce communication cost, as well as to improve load balancing and the scheduling makespan on embedded multiprocessor architectures.