Sökning: "Lock-free"

Visar resultat 11 - 15 av 19 avhandlingar innehållade ordet Lock-free.

  1. 11. Applications of Non-Blocking Data Structures to Real-Time Systems

    Författare :Håkan Sundell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; shared memory; wait-free; snapshot; real-time; synchronisation; lock-free; timing information; non-blocking;

    Sammanfattning : This thesis is a major part of the results within a project called "Applications of wait/lock-free protocols to real-time systems". This project is funded by the national Swedish Real-Time Systems research initiative ARTES (www.artes.uu. LÄS MER

  3. 12. Reactive Shared Objects for Interprocess Synchronization

    Författare :Phuong Ha; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; non-blocking; distributed data structures; online algorithms; trees; reactive synchronization; practical; lock-free;

    Sammanfattning : In parallel processing environments such as multiprocessor systems, processes are synchronized using concurrent objects, which allow many concurrent processes to access them at the same time. The performance of these concurrent objects heavily relies on the load conditions of the surrounding environment (e.g. LÄS MER

  4. 13. Adaptiveness and Lock-free Synchronization in Parallel Stochastic Gradient Descent

    Författare :Karl Bäckström; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; parallelism; machine learning; Stochastic gradient descent;

    Sammanfattning : The emergence of big data in recent years due to the vast societal digitalization and large-scale sensor deployment has entailed significant interest in machine learning methods to enable automatic data analytics. In a majority of the learning algorithms used in industrial as well as academic settings, the first-order iterative optimization procedure Stochastic gradient descent (SGD), is the backbone. LÄS MER

  5. 14. Concurrent Algorithms and Data Structures for Many-Core Processors

    Författare :Daniel Cederman; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; composition; sorting; graphics processors; lock-free; software transactional memory; parallel; load balancing; multi-core;

    Sammanfattning : The convergence of highly parallel many-core graphics processors with conventional multi-core processorsis becoming a reality.To allow algorithms and data structures to scale efficiently on these new platforms,several important factors needs to be considered. LÄS MER

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