Sökning: "Memory Hierarchy"

Visar resultat 11 - 15 av 31 avhandlingar innehållade orden Memory Hierarchy.

  1. 11. Parallelizing the Method of Conjugate Gradients for Shared Memory Architectures

    Författare :Henrik Löf; Jarmo Rantakokko; Erik Hagersten; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Beräkningsvetenskap; Scientific Computing;

    Sammanfattning : Solving Partial Differential Equations (PDEs) is an important problem in many fields of science and engineering. For most real-world problems modeled by PDEs, we can only approximate the solution using numerical methods. Many of these numerical methods result in very large systems of linear equations. LÄS MER

  3. 12. Towards Runtime-Assisted Cache Management for Task-Parallel Programs

    Författare :Madhavan Manivannan; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; task parallelism; cache hierarchy; runtime system; dead blocks; multi-core architecture; sharing patterns;

    Sammanfattning : Architects have adopted the shared memory model that implicitly manages cache coherence and cache capacity in hardware, mainly to aid programmability of multi-core architectures. The hardware mechanisms are however prone to inefficiencies because they are not tailored to the behavior of individual parallel applications. LÄS MER

  4. 13. Understanding Task Parallelism : Providing insight into scheduling, memory, and performance for CPUs and Graphics

    Författare :Germán Ceballos; David Black-Schaffer; Erik Hagersten; Samuel Thibault; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Task-based programming; Task Scheduling; Analytical Cache Model; Scheduling; Runtime Systems; Computer Graphics rendering ; Computer Science; Datavetenskap;

    Sammanfattning : Maximizing the performance of computer systems while making them more energy efficient is vital for future developments in engineering, medicine, entertainment, etc. However, the increasing complexity of software, hardware, and their interactions makes this task difficult. LÄS MER

  5. 14. Efficient methods for application performance analysis

    Författare :David Eklöv; Erik Hagersten; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Computer Science;

    Sammanfattning : To reduce latency and increase bandwidth to memory, modern microprocessors are designed with deep memory hierarchies including several levels of caches. For such microprocessors, the service time for fetching data from off-chip memory is about two orders of magnitude longer than fetching data from the level-one cache. LÄS MER

  7. 15. Locality-aware Scheduling and Characterization of Task-based Programs

    Författare :Ananya Muddukrishna; Mats Brorsson; Christoph Kessler; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Locality-aware; Task scheduling; OpenMP; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Modern computer architectures expose an increasing number of parallel features supported by complex memory access and communication structures. Currently used task scheduling techniques perform poorly since they focus solely on balancing computation load across parallel features and remain oblivious to locality properties of support structures. LÄS MER