Sökning: "shared memory parallelism"

Visar resultat 1 - 5 av 23 avhandlingar innehållade orden shared memory parallelism.

  1. 1. 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

  3. 2. Shared Memory Objects as Synchronization Abstractions: Algorithmic Implementations and Concurrent Applications

    Författare :Ioannis Nikolakopoulos; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; concurrent data structures; parallelism; lock-free synchronization; data stream processing; iteration;

    Sammanfattning : Multicore and many-core architectures have penetrated the vast majority of computing systems, from high-end servers to low-energy embedded devices. From the hardware's perspective, performance scalability comes in the form of increasing numbers of cores. Nevertheless, fully utilizing this power is still an open research and engineering issue. LÄS MER

  4. 3. Efficient and Practical Non-Blocking Data Structures

    Författare :Håkan Sundell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; shared data structure; abstract data type; snapshot; lock-free; priority queue; synchronization; non-blocking; skip list; shared memory; deque; real-time; doubly linked list; dictionary; wait-free; shared register;

    Sammanfattning : This thesis deals with how to design and implement efficient, practical and reliable concurrent data structures. The design method using mutual exclusion incurs serious drawbacks, whereas the alternative non-blocking techniques avoid those problems and also admit improved parallelism. LÄS MER

  5. 4. Efficient concurrent data structure access parallelism techniques for increasing scalability

    Författare :Adones Rukundo; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; FIFO queue; parallelism; performance modelling; design framework; semantic relaxation; Data structure; multi-access; lock free; performance analysis; counter; concurrency; search tree.; stack; multi-core processor; priority queue;

    Sammanfattning : Multi-core processors have revolutionised the way data structures are designed by bringing parallelism to mainstream computing. Key to exploiting hardware parallelism available in multi-core processors are concurrent data structures. LÄS MER

  7. 5. Language Constructs for Safe Parallel Programming on Multi-Cores

    Författare :Johan Östlund; Tobias Wrigstad; Ludovic Henrio; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Programming Languages; Type Systems; Ownership Types; Concurrency; Parallelism; Actors; Active Objects; Structured Parallelism; Data Race-Freedom; Immutability; Uniqueness; Datavetenskap; Computer Science;

    Sammanfattning : The last decade has seen the transition from single-core processors to multi-cores and many-cores. This move has by and large shifted the responsibility from chip manufacturers to programmers to keep up with ever-increasing expectations on performance. LÄS MER