Sökning: "Data Cache"

Visar resultat 16 - 20 av 110 avhandlingar innehållade orden Data Cache.

1. 16. Techniques to Cancel Execution Early to Improve Processor Efficiency

   Författare :Mafijul Islam; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; processor design; energy-efficiency; narrow-width cache; instruction reuse; zero-value cache; resource-efficient; narrow-width load; complexity-effective; small value locality; register file cache; frequent value locality; trivial instruction; silent load; high-performance; zero load;

   Sammanfattning : The evolution of computer systems to continuously improve execution efficiency has traditionally embraced various approaches across microprocessor generations. Unfortunately, contemporary processors still suffer from several inefficiencies although they offer an unprecedented level of computing capabilities. LÄS MER

3. 17. Toward Next-generation Data Centers : Principles of Software-Defined “Hardware” Infrastructures and Resource Disaggregation

   Författare :Amir Roozbeh; Dejan Kostic; Gerald Q. Maguire Jr.; Fetahi Wuhib; Boris Grot; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; cloud computing; next-generation data centers; resource disaggregation; TCO; last level cache; Informations- och kommunikationsteknik; Information and Communication Technology;

   Sammanfattning : The cloud is evolving due to additional demands introduced by new technological advancements and the wide movement toward digitalization. Therefore, next-generation data centers (DCs) and clouds are expected (and need) to become cheaper, more efficient, and capable of offering more predictable services. LÄS MER

4. 18. Exploiting Fine-grain Parallelism in Concurrent Constraint Languages

   Författare :Johan Montelius; RISE; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Implicit parallelism; Concurrent Constraint Programming; Cache performance; Logic programming; Abstract machine; Parallel execution; Scheduling; Multiprocessor; Shared memory;

   Sammanfattning : This dissertation presents the design, implementation, and evaluation of a system that exploits fine-grain implicit parallelism in concurrent constraint programming language. The system is able to outperform a C implementation of an algorithm with complex dependencies without any user annotations. LÄS MER

5. 19. Fault Injection for Studying Error Behavior and Validation of Error Detecting Mechanisms

   Författare :Marcus Rimén; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; concurrent error detection; functional error model; control flow error; error detection coverage; permanent faults; data error; error detection latency; simulation-based fault injection; transient faults; physical fault injection; dependability evaluation;

   Sammanfattning : This thesis deals with the design and validation of low-cost error detecting mechanisms that can be used to implement self-checking computers. The research objectives of the thesis are three-fold: (i) to investigate and develop a simulation-based fault injection technique that can be used on a wide range of VHDL simulation models, (ii) to investigate error propagation mechanisms in microprocessors in order to understand how to design low-cost error detecting mechanisms and (iii) to design and validate error detecting mechanisms. LÄS MER

7. 20. Scheduling of parallel matrix computations and data layout conversion for HPC and Multi-Core Architectures

   Författare :Lars Karlsson; Bo Kågström; Erik Elmroth; Charles Van Loan; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer and systems science; Data- och systemvetenskap; data- och systemvetenskap; computer and systems sciences;

   Sammanfattning : Dense linear algebra represents fundamental building blocks in many computational science and engineering applications. The dense linear algebra algorithms must be numerically stable, robust, and reliable in order to be usable as black-box solvers by expert as well as non-expert users. LÄS MER