Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile

Research output: Contribution to conferencePaperAcademic

64 Downloads (Pure)

Abstract

An architecture for a hand-held multimedia device requires components that are energy-efficient, flexible, and provide high performance. In the CHAMELEON [4] project we develop a coarse grained reconfigurable device for DSP-like algorithms, the so-called Field Programmable Function Array (FPFA). The FPFA devices are reminiscent to FPGAs, but with a matrix of Processing Parts (PP) instead of CLBs. The design of the FPFA focuses on: (1) Keeping each PP small to maximize the number of PPs that can fit on a chip; (2) providing sufficient flexibility; (3) Low energy consumption; (4) Exploiting the maximum amount of parallelism; (5) A strong support tool for FPFA-based applications. The challenge in providing compiler support for the FPFA-based design stems from the flexibility of the FPFA structure. If we do not use the characteristics of the FPFA structure properly, the advantages of an FPFA may become its disadvantages. The GECKO1project focuses on this problem. In this paper, we present a mapping and scheduling scheme for applications running on one FPFA tile. Applications are written in C and C code is translated to a Directed Acyclic Graphs (DAG) [4]. This scheme can map a DAG directly onto the reconfigurable PPs of an FPFA tile. It tries to achieve low power consumption by exploiting locality of reference and high performance by exploiting maximum parallelism.
Original languageUndefined
Pages57-65
Number of pages9
Publication statusPublished - Oct 2002
Event3rd PROGRESS Workshop on Embedded Systems 2002 - Utrecht, Netherlands
Duration: 24 Oct 200224 Oct 2002
Conference number: 3

Workshop

Workshop3rd PROGRESS Workshop on Embedded Systems 2002
Abbreviated titlePROGRESS
CountryNetherlands
CityUtrecht
Period24/10/0224/10/02

Keywords

  • CAES-EEA: Efficient Embedded Architectures
  • IR-66351
  • EWI-6912

Cite this

Guo, Y., & Smit, G. J. M. (2002). Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile. 57-65. Paper presented at 3rd PROGRESS Workshop on Embedded Systems 2002, Utrecht, Netherlands.
Guo, Y. ; Smit, Gerardus Johannes Maria. / Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile. Paper presented at 3rd PROGRESS Workshop on Embedded Systems 2002, Utrecht, Netherlands.9 p.
@conference{b15ba714fb464a9fb7678066c1b66dce,
title = "Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile",
abstract = "An architecture for a hand-held multimedia device requires components that are energy-efficient, flexible, and provide high performance. In the CHAMELEON [4] project we develop a coarse grained reconfigurable device for DSP-like algorithms, the so-called Field Programmable Function Array (FPFA). The FPFA devices are reminiscent to FPGAs, but with a matrix of Processing Parts (PP) instead of CLBs. The design of the FPFA focuses on: (1) Keeping each PP small to maximize the number of PPs that can fit on a chip; (2) providing sufficient flexibility; (3) Low energy consumption; (4) Exploiting the maximum amount of parallelism; (5) A strong support tool for FPFA-based applications. The challenge in providing compiler support for the FPFA-based design stems from the flexibility of the FPFA structure. If we do not use the characteristics of the FPFA structure properly, the advantages of an FPFA may become its disadvantages. The GECKO1project focuses on this problem. In this paper, we present a mapping and scheduling scheme for applications running on one FPFA tile. Applications are written in C and C code is translated to a Directed Acyclic Graphs (DAG) [4]. This scheme can map a DAG directly onto the reconfigurable PPs of an FPFA tile. It tries to achieve low power consumption by exploiting locality of reference and high performance by exploiting maximum parallelism.",
keywords = "CAES-EEA: Efficient Embedded Architectures, IR-66351, EWI-6912",
author = "Y. Guo and Smit, {Gerardus Johannes Maria}",
year = "2002",
month = "10",
language = "Undefined",
pages = "57--65",
note = "null ; Conference date: 24-10-2002 Through 24-10-2002",

}

Guo, Y & Smit, GJM 2002, 'Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile' Paper presented at 3rd PROGRESS Workshop on Embedded Systems 2002, Utrecht, Netherlands, 24/10/02 - 24/10/02, pp. 57-65.

Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile. / Guo, Y.; Smit, Gerardus Johannes Maria.

2002. 57-65 Paper presented at 3rd PROGRESS Workshop on Embedded Systems 2002, Utrecht, Netherlands.

Research output: Contribution to conferencePaperAcademic

TY - CONF

T1 - Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile

AU - Guo, Y.

AU - Smit, Gerardus Johannes Maria

PY - 2002/10

Y1 - 2002/10

N2 - An architecture for a hand-held multimedia device requires components that are energy-efficient, flexible, and provide high performance. In the CHAMELEON [4] project we develop a coarse grained reconfigurable device for DSP-like algorithms, the so-called Field Programmable Function Array (FPFA). The FPFA devices are reminiscent to FPGAs, but with a matrix of Processing Parts (PP) instead of CLBs. The design of the FPFA focuses on: (1) Keeping each PP small to maximize the number of PPs that can fit on a chip; (2) providing sufficient flexibility; (3) Low energy consumption; (4) Exploiting the maximum amount of parallelism; (5) A strong support tool for FPFA-based applications. The challenge in providing compiler support for the FPFA-based design stems from the flexibility of the FPFA structure. If we do not use the characteristics of the FPFA structure properly, the advantages of an FPFA may become its disadvantages. The GECKO1project focuses on this problem. In this paper, we present a mapping and scheduling scheme for applications running on one FPFA tile. Applications are written in C and C code is translated to a Directed Acyclic Graphs (DAG) [4]. This scheme can map a DAG directly onto the reconfigurable PPs of an FPFA tile. It tries to achieve low power consumption by exploiting locality of reference and high performance by exploiting maximum parallelism.

AB - An architecture for a hand-held multimedia device requires components that are energy-efficient, flexible, and provide high performance. In the CHAMELEON [4] project we develop a coarse grained reconfigurable device for DSP-like algorithms, the so-called Field Programmable Function Array (FPFA). The FPFA devices are reminiscent to FPGAs, but with a matrix of Processing Parts (PP) instead of CLBs. The design of the FPFA focuses on: (1) Keeping each PP small to maximize the number of PPs that can fit on a chip; (2) providing sufficient flexibility; (3) Low energy consumption; (4) Exploiting the maximum amount of parallelism; (5) A strong support tool for FPFA-based applications. The challenge in providing compiler support for the FPFA-based design stems from the flexibility of the FPFA structure. If we do not use the characteristics of the FPFA structure properly, the advantages of an FPFA may become its disadvantages. The GECKO1project focuses on this problem. In this paper, we present a mapping and scheduling scheme for applications running on one FPFA tile. Applications are written in C and C code is translated to a Directed Acyclic Graphs (DAG) [4]. This scheme can map a DAG directly onto the reconfigurable PPs of an FPFA tile. It tries to achieve low power consumption by exploiting locality of reference and high performance by exploiting maximum parallelism.

KW - CAES-EEA: Efficient Embedded Architectures

KW - IR-66351

KW - EWI-6912

M3 - Paper

SP - 57

EP - 65

ER -

Guo Y, Smit GJM. Mapping and Scheduling of Directed Acyclic Graphs on An FPFA Tile. 2002. Paper presented at 3rd PROGRESS Workshop on Embedded Systems 2002, Utrecht, Netherlands.