SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS

Johan Ersfolk; G Roquier; Johan Lilius; M Mattavelli

doi:10.1109/ICASSP.2012.6288215

SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS

Johan Ersfolk, G Roquier, Johan Lilius, M Mattavelli

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

18 Sitaatiot (Scopus)

Abstrakti

Compile-time scheduling of dynamic dataflow programs is still an open problem. This paper presents how scheduling of dynamic portions of asynchronous dataflow networks described using CAL language can be determined before execution by the analysis of the state space of network partitions. Experiments show that the number of run-time operations employed by dynamic schedulers is largely reduced when the schedules extracted by the state analysis are employed.

Alkuperäiskieli	Ei tiedossa
Otsikko	2012 IEEE International Conference on Acoustics, Speech and Signal Processing
Kustantaja	IEEE
Sivut	1661–1664
Sivumäärä	4
ISBN (painettu)	978-1-4673-0045-2
DOI - pysyväislinkit	https://doi.org/10.1109/ICASSP.2012.6288215
Tila	Julkaistu - 2012
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	IEEE International Conference on Acoustics, Speech and Signal Processing - IEEE International Conference on Acoustics, Speech and Signal Processing Kesto: 25 maalisk. 2012 → 30 maalisk. 2012

Konferenssi

Konferenssi	IEEE International Conference on Acoustics, Speech and Signal Processing
Ajanjakso	25/03/12 → 30/03/12

Keywords

Dataflow programming
MPEG-4 decoder
model checking

Pääsy asiakirjaan

10.1109/ICASSP.2012.6288215

Viittausmuodot

@inproceedings{b2ba785d7b3f4bbeb4600758b116e23b,

title = "SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS",

abstract = "Compile-time scheduling of dynamic dataflow programs is still an open problem. This paper presents how scheduling of dynamic portions of asynchronous dataflow networks described using CAL language can be determined before execution by the analysis of the state space of network partitions. Experiments show that the number of run-time operations employed by dynamic schedulers is largely reduced when the schedules extracted by the state analysis are employed.",

keywords = "Dataflow programming, MPEG-4 decoder, model checking, Dataflow programming, MPEG-4 decoder, model checking, Dataflow programming, MPEG-4 decoder, model checking",

author = "Johan Ersfolk and G Roquier and Johan Lilius and M Mattavelli",

year = "2012",

doi = "10.1109/ICASSP.2012.6288215",

language = "Odefinierat/ok{\"a}nt",

isbn = "978-1-4673-0045-2",

pages = "1661–1664",

booktitle = "2012 IEEE International Conference on Acoustics, Speech and Signal Processing",

publisher = "IEEE",

note = "IEEE International Conference on Acoustics, Speech and Signal Processing ; Conference date: 25-03-2012 Through 30-03-2012",

}

Ersfolk, J, Roquier, G, Lilius, J & Mattavelli, M 2012, SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS. julkaisussa 2012 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, Sivut 1661–1664, IEEE International Conference on Acoustics, Speech and Signal Processing, 25/03/12. https://doi.org/10.1109/ICASSP.2012.6288215

TY - GEN

T1 - SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS

AU - Ersfolk, Johan

AU - Roquier, G

AU - Lilius, Johan

AU - Mattavelli, M

PY - 2012

Y1 - 2012

N2 - Compile-time scheduling of dynamic dataflow programs is still an open problem. This paper presents how scheduling of dynamic portions of asynchronous dataflow networks described using CAL language can be determined before execution by the analysis of the state space of network partitions. Experiments show that the number of run-time operations employed by dynamic schedulers is largely reduced when the schedules extracted by the state analysis are employed.

AB - Compile-time scheduling of dynamic dataflow programs is still an open problem. This paper presents how scheduling of dynamic portions of asynchronous dataflow networks described using CAL language can be determined before execution by the analysis of the state space of network partitions. Experiments show that the number of run-time operations employed by dynamic schedulers is largely reduced when the schedules extracted by the state analysis are employed.

KW - Dataflow programming

KW - MPEG-4 decoder

KW - model checking

KW - Dataflow programming

KW - MPEG-4 decoder

KW - model checking

KW - Dataflow programming

KW - MPEG-4 decoder

KW - model checking

U2 - 10.1109/ICASSP.2012.6288215

DO - 10.1109/ICASSP.2012.6288215

M3 - Konferensbidrag

SN - 978-1-4673-0045-2

SP - 1661

EP - 1664

BT - 2012 IEEE International Conference on Acoustics, Speech and Signal Processing

PB - IEEE

T2 - IEEE International Conference on Acoustics, Speech and Signal Processing

Y2 - 25 March 2012 through 30 March 2012

ER -