The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Mapping and Scheduling of Dataflow Graphs - A Systematic Map

På svenska

Author

  • Usman Mazhar Mirza
  • Mehmet Ali Arslan
  • Gustav Cedersjö
  • Sardar Muhammad Sulaman
  • Jörn Janneck

Summary, in English

Dataflow is a natural way of modelling streaming applications, such as multimedia, networking and other signal processing applications. In order to cope with the computational and parallelism demands of such streaming applications, multiprocessor systems are replacing uniprocessor systems. Mapping and scheduling these applications on multiprocessor systems are crucial elements for efficient implementation in terms of latency, throughput, power and energy consumption etc. Performance of streaming applications running on multiprocessor systems may widely vary with mapping and scheduling strategy. This paper performs a systematic literature review of available research carried out in the area of mapping and scheduling of dataflow graphs.

Publishing year

2014

Language

English

Document type

Conference paper

Topic

  • Computer Science

Conference name

48th Asilomar Conference on Signals, Systems and Computers, 2014

Conference date

2014-11-02 - 2014-11-05

Conference place

Pacific Grove, California, United States

Status

Published