Sökning: "Shared Memory Synchronization"

Visar resultat 1 - 5 av 27 avhandlingar innehållade orden Shared Memory Synchronization.

  1. 1. Software Techniques for Distributed Shared Memory

    Författare :Zoran Radovic; Erik Hagersten; Sandhya Dwarkadas; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; synchronization; distributed shared memory; write permission cache; nonuniform communication architecture; node affinity; locality; hardware-software trade-off; profiling; flexibility; trap-based memory architecture; Computer engineering; Datorteknik; Data- och systemvetenskap; Computer Systems Sciences;

    Sammanfattning : In large multiprocessors, the access to shared memory is often nonuniform, and may vary as much as ten times for some distributed shared-memory architectures (DSMs). This dissertation identifies another important nonuniform property of DSM systems: nonuniform communication architecture, NUCA. LÄS MER

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

  3. 3. Concurrency Aware Shared Memory Data Structures

    Författare :Ioannis Nikolakopoulos; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; concurrency; lock-free; consistency; data structures; iteration; aggregation; synchronization; multi-core; data streaming;

    Sammanfattning : .... LÄS MER

  4. 4. Reactive Concurrent Data Structures and Algorithms for Synchronization

    Författare :Phuong Ha; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; non-blocking; reactive; multi-word atomic primitives; online algorithms; shared memory; concurrent data structures; distributed data structures; randomization; online financial problems; synchronization; spin-locks;

    Sammanfattning : Parallelism plays a significant role in high-performance computing systems, from large clusters of computers to chip-multithreading (CMT) processors. Performance of the parallel systems comes not only from concurrently runningmore processing hardware but also from utilizing the hardware efficiently. LÄS MER

  5. 5. Algorithms for synchronization and consistency in concurrent system services

    Författare :Anders Gidenstam; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; threading; plausible clocks; memory management; event ordering; lock-free; optimistic causal order; nonblocking; group communication; synchronization; memory reclamation; time stamping system; logical clocks; atomic registers.;

    Sammanfattning : Synchronization, consistency and scalability are important issues in the design of concurrent computer system services. In this thesis we study the application of optimistic and scalable methods in concurrent system services. LÄS MER