Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Partitioning and Mapping Dynamic Dataflow Programs

In English

Författare

Summary, in English

Partitioning and mapping are important design decisions in exploiting the parallelism of programs that are to be run on systems with multiple processing elements. In this paper we introduce a fast, incremental approach for mapping dynamic dataflow programs to multiprocessor systems. We use causation traces and architecture descriptions as input for the mapping process that devises several heuristics for reaching a short makespan for the given trace. We evaluate our approach by comparing our results to two different lower bounds and another algorithm used often in solving mapping problems: simulated annealing.

Publiceringsår

2012

Språk

Engelska

Sidor

1452-1456

Publikation/Tidskrift/Serie

[Host publication title missing]

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Computer Science

Nyckelord

  • partitioning
  • mapping
  • scheduling
  • dataflow
  • traces

Conference name

46th Annual Asilomar Conference on Signals, Systems, and Computers, 2012

Conference date

2012-11-04 - 2012-11-07

Conference place

Pacific Grove, California, United States

Status

Published

Projekt

  • High Performance Embedded Computing

Forskningsgrupp

  • EDSLab

ISBN/ISSN/Övrigt

  • ISSN: 1058-6393