SwePub
Sök i LIBRIS databas

  Utökad sökning

(L4X0:1651 6214) srt2:(2020-2024) pers:(Kaxiras Stefanos Professor)
 

Sökning: (L4X0:1651 6214) srt2:(2020-2024) pers:(Kaxiras Stefanos Professor) > Finding and Exploit...

Finding and Exploiting Memory-Level-Parallelism in Constrained Speculative Architectures

Tran, Kim-Anh (författare)
Uppsala universitet,Avdelningen för datorteknik
Jimborean, Alexandra, Associate Professor (preses)
Uppsala universitet,Datalogi,Datorarkitektur och datorkommunikation,Datorteknik
Kaxiras, Stefanos, Professor (preses)
Uppsala universitet,Datorarkitektur och datorkommunikation,Avdelningen för datorteknik,Datorteknik
visa fler...
Pouchet, Louis-Noël, Associate Professor (opponent)
Colorado State University
visa färre...
 (creator_code:org_t)
ISBN 9789151308609
Uppsala : Acta Universitatis Upsaliensis, 2020
Engelska 50 s.
Serie: Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, 1651-6214 ; 1897
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)
Abstract Ämnesord
Stäng  
  • One of the main performance bottlenecks of processors today is the discrepancy between processor and memory speed, known as the memory wall. While the processor executes instructions at a high pace, the memory is too slow to provide data in a timely manner. Load instructions that require an access to memory are referred to as long-latency or delinquent loads. To prevent the processor from stalling, independent instruction past the load may execute, including independent loads. Overlapping load operations and thus their latency is referred to as memory-level parallelism. Memory-level parallelism (MLP) can significantly improve performance. Today's out-of-order processors are therefore equipped with complex hardware that allows them to look into the future and to select independent loads that can be overlapped. However, the ability to choose future instructions and speculatively execute them in advance introduces complexity, increased power consumption and potential security risks. In this thesis we look at constrained speculative architectures that struggle to hide memory latencies as they are constrained by design, by their resources, or by security. We investigate ways for the compiler to help them in finding MLP, with the ultimate goal to avoid processor stalls as much as possible. This includes small energy-efficient processors that lack the ability to look-ahead far enough to find independent loads, but also large processors that are disallowed to speculatively execute independent loads due to enforced security measures to circumvent side-channel attacks. We identify the reason for their limitation and propose software transformations and hardware extensions to overcome their restrictions.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Memory-level-parallelism
Energy-efficiency
Performance
Compiler
Instruction Scheduling
SW/HW Co-Design
Computer Science
Datavetenskap

Publikations- och innehållstyp

vet (ämneskategori)
dok (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy