• Home
  1. Home
  2. Tabu search for partitioning dynamic dataflow programs
Scientific article
OA Policy
English

Tabu search for partitioning dynamic dataflow programs

Contributors

Michalska, Malgorzata; Zufferey, Nicolas; Mattavelli, Marco

Published in

Procedia computer science, vol. 80, p. 1577-1588

Publication date

2016

Abstract

An important challenge of dataflow programming is the problem of partitioning dataflow components onto a target architecture. A common objective function associated to this problem is to find the maximum data processing throughput. This NP-complete problem is very difficult to solve with high quality close-to-optimal solutions for the very large size of the design space and the possibly large variability of input data. This paper introduces four variants of the tabu search metaheuristic expressly developed for partitioning components of a dataflow program. The approach relies on the use of a simulation tool, capable of estimating the performance for any partitioning configuration exploiting a model of the target architecture and the profiling results. The partitioning solutions generated with tabu search are validated for consistency and high accuracy with experimental platform executions.

Keywords

  • Tabu search
  • Dataflow
  • Partitioning
  • Design space exploration

UNIGE affiliation entities

Citation (ISO format)

MICHALSKA, Malgorzata, ZUFFEREY, Nicolas, MATTAVELLI, Marco. Tabu search for partitioning dynamic dataflow programs. In: Procedia computer science, 2016, vol. 80, p. 1577–1588. doi: 10.1016/j.procs.2016.05.486

Main files (1)

Article (Accepted version)

Identifiers

Journal ISSN

1877-0509
491views
274downloads

Technical informations

Creation

11/01/2017 17:57:00

First validation

11/01/2017 17:57:00

Update

15/03/2023 01:17:28

Status update

15/03/2023 01:17:28

Last indexation

31/10/2024 05:53:26
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated