liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Energy-Efficient Computing over Streams with Massively Parallel Architectures
Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan. (PELAB)ORCID-id: 0000-0002-1940-3331
2015 (engelsk)Licentiatavhandling, monografi (Annet vitenskapelig)
Abstract [en]

The rise of many-core processor architectures in the high-performance computing market answers to a constantly growing need of processing power to solve more and more challenging problems such as the ones in computing for big data. Fast computation is more and more limited by the very high power required and the management of the considerable heat produced. Many programming models compete to take prot of many-core architectures to improve both execution speed and energy consumption, each with their advantages and drawbacks. The work described in this thesis is based on the dataflow computing approach and investigates the benets of a carefully designed pipelined execution of streaming applications, focusing on particular on off- and on-chip memory accesses. We implement classic and on-chip pipelined versions of mergesort for the SCC. We see how the benets of the on-chip pipelining technique are bounded by the underlying architecture, and we explore the problem of ne tuning streaming applications for manycore architectures to optimize for energy given a throughput budget. We propose a novel methodology to compute schedules optimized for energy eciency for a fixed throughput target. We introduce Schedeval, a tool to test schedules of communicating streaming tasks under throughput constraints for the SCC. We show  that streaming applications based on Schedeval compete with specialized implementations and we use Schedeval to demonstrate performance dierences between schedules that are otherwise considered as equivalent by a simple model.

sted, utgiver, år, opplag, sider
Linköping University Electronic Press, 2015. , 124 s.
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1715
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-114519ISBN: 978-91-7519-089-1 (tryckt)OAI: oai:DiVA.org:liu-114519DiVA: diva2:790715
Presentation
2015-03-23, Alan Turing, E-house, Campus Valla, Linköpings universitet, Linköping, 14:04 (engelsk)
Opponent
Veileder
Forskningsfinansiär
Swedish e‐Science Research Center, OpCoReSSwedish Research Council
Tilgjengelig fra: 2015-03-20 Laget: 2015-02-25 Sist oppdatert: 2015-03-20bibliografisk kontrollert

Open Access i DiVA

omslag(78 kB)32 nedlastinger
Filinformasjon
Fil COVER01.pdfFilstørrelse 78 kBChecksum SHA-512
3ec6ae6ad7e9a099ed8826c5831ce79f06156ebd8fd7fe203e33f261f7ec9aa9d129d1dd41db0c758f5e0d7e67380b3d1ce6d625f758a1eaaf963a855715338a
Type coverMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Melot, Nicolas
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

Totalt: 350 treff
RefereraExporteraLink to record
Permanent link

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