Model and complexity results for tree traversals on hybrid platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Model and complexity results for tree traversals on hybrid platforms


We study the complexity of traversing tree-shaped workflows whose tasks require large I/O files. We target a heterogeneous architec- ture with two resource of different types, where each resource has its own memory, such as a multicore node equipped with a dedicated accelera- tor (FPGA or GPU). Tasks in the workflow are tagged with the type of resource needed for their processing. Besides, a task can be processed on a given resource only if all its input files and output files can be stored in the corresponding memory. At a given execution step, the amount of data stored in each memory strongly depends upon the ordering in which the tasks are executed, and upon when communications between both memories are scheduled. The objective is to determine an efficient traver- sal that minimizes the maximum amount of memory of each type needed to traverse the whole tree. In this paper, we establish the complexity of this two-memory scheduling problem, provide inapproximability results, and show how to determine the optimal depth-first traversal. Altogether, these results lay the foundations for memory-aware scheduling algorithms on heterogeneous platforms.
Fichier principal
Vignette du fichier
europar.pdf (168.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00926502 , version 1 (09-01-2014)


  • HAL Id : hal-00926502 , version 1


Julien Herrmann, Loris Marchal, Yves Robert. Model and complexity results for tree traversals on hybrid platforms. HeteroPar - International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms, Aug 2013, Aachen, Germany. ⟨hal-00926502⟩
100 View
160 Download


Gmail Facebook X LinkedIn More