Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Managing Dynamic Reconfiguration for Fault-tolerance on a Manycore Architecture
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).ORCID iD: 0000-0002-4932-4036
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).ORCID iD: 0000-0001-6625-6533
2012 (English)In: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012, New York, USA: IEEE Computer Society, 2012, 312-319 p., 6270657Conference paper, Published paper (Refereed)
Abstract [en]

With the advent of manycore architectures comprising hundreds of processing elements, fault management has become a major challenge. We present an approach that uses the occam-pi language to manage the fault recovery mechanism on a new manycore architecture, the Platform 2012 (P2012). The approach is made possible by extending our previously developed compiler framework to compile occam-pi implementations to the P2012 architecture. We describe the techniques used to translate the salient features of the occam-pi language to the native programming model of the P2012 architecture. We demonstrate the applicability of the approach by an experimental case study, in which the DCT algorithm is implemented on a set of four processing elements. During run-time, some of the tasks are then relocated from assumed faulty processing elements to the faultless ones by means of dynamic reconfiguration of the hardware. The working of the demonstrator and the simulation results illustrate not only the feasibility of the approach but also how the use of higher-level abstractions simplifies the fault handling. © 2012 IEEE.

Place, publisher, year, edition, pages
New York, USA: IEEE Computer Society, 2012. 312-319 p., 6270657
National Category
Embedded Systems
Identifiers
URN: urn:nbn:se:hh:diva-17336DOI: 10.1109/IPDPSW.2012.38ISI: 000309409400035Scopus ID: 2-s2.0-84867429212OAI: oai:DiVA.org:hh-17336DiVA: diva2:506920
Conference
26th IEEE International Parallel & Distributed Processing Symposium, May 21-25, Regal Shanghai East Asia Hotel Shanghai, China, 2012
Projects
SMECY
Note

The research leading to these results has received funding from the ARTEMIS Joint Undertaking under grant agreement number 100230 and from the national programmes / funding authorities.

Available from: 2012-04-12 Created: 2012-03-01 Last updated: 2017-09-05Bibliographically approved
In thesis
1. Compiling Concurrent Programs for Manycores
Open this publication in new window or tab >>Compiling Concurrent Programs for Manycores
2015 (English)Licentiate thesis, comprehensive summary (Other academic)
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.

Place, publisher, year, edition, pages
Halmstad: Halmstad University Press, 2015. 35 p.
Series
Halmstad University Dissertations, 11
National Category
Embedded Systems
Identifiers
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 (English)
Opponent
Supervisors
Available from: 2015-02-16 Created: 2015-02-13 Last updated: 2015-08-21Bibliographically approved
2. Tools to Compile Dataflow Programs for Manycores
Open this publication in new window or tab >>Tools to Compile Dataflow Programs for Manycores
2017 (English)Doctoral thesis, comprehensive summary (Other academic)
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.

Place, publisher, year, edition, pages
Halmstad: Halmstad University Press, 2017. 35 p.
Series
Halmstad University Dissertations, 33
National Category
Embedded Systems
Identifiers
urn:nbn:se:hh:diva-34883 (URN)978-91-87045-69-1 (ISBN)978-91-87045-68-4 (ISBN)
Public defence
2017-09-27, Wigforssalen, Hus J (Visionen), Kristian IV:s väg 3, Halmstad, 13:15 (English)
Opponent
Supervisors
Available from: 2017-09-06 Created: 2017-09-05 Last updated: 2017-09-06Bibliographically approved

Open Access in DiVA

fulltext(266 kB)327 downloads
File information
File name FULLTEXT01.pdfFile size 266 kBChecksum SHA-512
35654dad250f904f062fcd21995c93d5c459672c3fa3fe2fa48d7b7fe7846aabcc4761ff4b7ee2e886fe917d26246c0255715c9c2c182f83ce6690593bc424cf
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Ul-Abdin, ZainSvensson, Bertil

Search in DiVA

By author/editor
Ul-Abdin, ZainGebrewahid, EssayasSvensson, Bertil
By organisation
Centre for Research on Embedded Systems (CERES)
Embedded Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 327 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 199 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf