hh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Realizing Efficient Execution of Dataflow Actors on Manycores
Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
Department of Computer Science, Lund University, Lund, Sweden.
Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).ORCID-id: 0000-0002-4932-4036
Visa övriga samt affilieringar
2014 (Engelska)Ingår i: Proceedings: 2014 International Conference on Embedded and Ubiquitous Computing: EUC 2014: August 2014, Milano, Italy / [ed] Randall Bilof, Los Alamitos, CA: IEEE Computer Society, 2014, s. 321-328, artikel-id 6962305Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE.

Ort, förlag, år, upplaga, sidor
Los Alamitos, CA: IEEE Computer Society, 2014. s. 321-328, artikel-id 6962305
Nyckelord [en]
dataflow languages, compilation framework, code generation, manycore, CAL
Nationell ämneskategori
Inbäddad systemteknik
Identifikatorer
URN: urn:nbn:se:hh:diva-26991DOI: 10.1109/EUC.2014.55ISI: 000358149800046Scopus ID: 2-s2.0-84908625634ISBN: 978-0-7695-5249-1 (tryckt)ISBN: 978-1-4799-7609-6 (digital)OAI: oai:DiVA.org:hh-26991DiVA, id: diva2:761174
Konferens
The 12th IEEE International Conference on Embedded and Ubiquitous Computing (EUC 2014), Milan, Italy, Aug. 26-28, 2014
Projekt
HiPEC
Forskningsfinansiär
KK-stiftelsenStiftelsen för strategisk forskning (SSF)Tillgänglig från: 2014-11-05 Skapad: 2014-11-05 Senast uppdaterad: 2018-03-22Bibliografiskt granskad
Ingår i avhandling
1. Compiling Concurrent Programs for Manycores
Öppna denna publikation i ny flik eller fönster >>Compiling Concurrent Programs for Manycores
2015 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The arrival of manycore systems enforces new approaches for developing applications in order to exploit the available hardware resources. Developing applications for manycores requires programmers to partition the application into subtasks, consider the dependence between the subtasks, understand the underlying hardware and select an appropriate programming model. This is complex, time-consuming and prone to error.

In this thesis, we identify and implement abstraction layers in compilation tools to decrease the burden of the programmer, increase programming productivity and program portability for manycores and to analyze their impact on performance and efficiency. We present compilation frameworks for two concurrent programming languages, occam-pi and CAL Actor Language, and demonstrate the applicability of the approach with application case-studies targeting these different manycore architectures: STHorm, Epiphany and Ambric.

For occam-pi, we have extended the Tock compiler and added a backend for STHorm. We evaluate the approach using a fault tolerance model for a four stage 1D-DCT algorithm implemented by using occam-pi’s constructs for dynamic reconfiguration, and the FAST corner detection algorithm which demonstrates the suitability of occam-pi and the compilation framework for data-intensive applications. We also present a new CAL compilation framework which has a front end, two intermediate representations and three backends: for a uniprocessor, Epiphany, and Ambric. We show the feasibility of our approach by compiling a CAL implementation of the 2D-IDCT for the three backends. We also present an evaluation and optimization of code generation for Epiphany by comparing the code generated from CAL with a hand-written C code implementation of 2D-IDCT.

Ort, förlag, år, upplaga, sidor
Halmstad: Halmstad University Press, 2015. s. 35
Serie
Halmstad University Dissertations ; 11
Nationell ämneskategori
Inbäddad systemteknik
Identifikatorer
urn:nbn:se:hh:diva-27789 (URN)978-91-87045-25-7 (ISBN)978-91-87045-24-0 (ISBN)
Presentation
2015-03-20, Haldasalen, House Visionen, Halmstad University, Halmstad, 10:15 (Engelska)
Opponent
Handledare
Tillgänglig från: 2015-02-16 Skapad: 2015-02-13 Senast uppdaterad: 2018-03-22Bibliografiskt granskad
2. Tools to Compile Dataflow Programs for Manycores
Öppna denna publikation i ny flik eller fönster >>Tools to Compile Dataflow Programs for Manycores
2017 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

The arrival of manycore systems enforces new approaches for developing applications in order to exploit the available hardware resources. Developing applications for manycores requires programmers to partition the application into subtasks, consider the dependence between the subtasks, understand the underlying hardware and select an appropriate programming model. This is complex, time-consuming and prone to error. In this thesis, we identify and implement abstraction layers in compilation tools to decrease the burden of the programmer, increase program portability and scalability, and increase retargetability of the compilation framework. We present compilation frameworks for two concurrent programming languages, occam-pi and CAL Actor Language, and demonstrate the applicability of the approach with application case-studies targeting these different manycore architectures: STHorm, Epiphany, Ambric, EIT, and ePUMA. For occam-pi, we have extended the Tock compiler and added a backend for STHorm. We evaluate the approach using a fault tolerance model for a four stage 1D-DCT algorithm implemented by using occam-pi's constructs for dynamic reconguration, and the FAST corner detection algorithm which demonstrates the suitability of occam-pi and the compilation framework for data-intensive applications. For CAL, we have developed a new compilation framework, namely Cal2Many. The Cal2Many framework has a front end, two intermediate representations and four backends: for a uniprocessor, Epiphany, Ambric, and a backend for SIMD based architectures. Also, we have identied and implemented of CAL actor fusion and fission methodologies for efficient mapping CAL applications. We have used QRD, FAST corner detection, 2D-IDCT, and MPEG applications to evaluate our compilation process and to analyze the limitations of the hardware.

Ort, förlag, år, upplaga, sidor
Halmstad: Halmstad University Press, 2017. s. 35
Serie
Halmstad University Dissertations ; 33
Nationell ämneskategori
Inbäddad systemteknik
Identifikatorer
urn:nbn:se:hh:diva-34883 (URN)978-91-87045-69-1 (ISBN)978-91-87045-68-4 (ISBN)
Disputation
2017-09-27, Wigforssalen, Hus J (Visionen), Kristian IV:s väg 3, Halmstad, 13:15 (Engelska)
Opponent
Handledare
Tillgänglig från: 2017-09-06 Skapad: 2017-09-05 Senast uppdaterad: 2017-09-06Bibliografiskt granskad

Open Access i DiVA

fulltext(422 kB)313 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 422 kBChecksumma SHA-512
cec774fd68832a1f23d485d48b66f1831db3b72c6e8a6304fa653499f8ab7b9d1a7ea4858fe44099859281ebb3f7281d6dbeceb0191fa2c089b4166398da8181
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Essayas, GebrewahidYang, MingkunUl-Abdin, ZainGaspes, VeronicaSvensson, Bertil

Sök vidare i DiVA

Av författaren/redaktören
Essayas, GebrewahidYang, MingkunUl-Abdin, ZainGaspes, VeronicaSvensson, Bertil
Av organisationen
Centrum för forskning om inbyggda system (CERES)Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE)
Inbäddad systemteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 313 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 1470 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf