Sökning: "Shared Memory"

Visar resultat 31 - 35 av 152 avhandlingar innehållade orden Shared Memory.

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

  3. 32. Den stora gruvstrejken i Malmfälten : En muntlig historia

    Författare :Robert Nilsson Mohammadi; Bo Persson; Inga Sanner; Håkan Blomqvist; Stockholms universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; Oral history; to give voice; memory; narrative; documentary theatre; solidarity; miners’ strike; mining; miners; labour history; LKAB; The Norrbotten ore fields; wild cat strikes; social movements; the new left; Muntlig historia; att ge röst; minne; berättelse; gruppteater; solidaritet; gruvstrejk; gruvarbete; gruvarbetare; arbetslivshistoria; LKAB; Malmfälten; vilda strejker; sociala rörelser; den nya vänstern; History; historia;

    Sammanfattning : This dissertation explores how the miners’ strike in the Norrbotten ore fields 1969–70 has been made meaningful. For a long time, this strike has been a centre of debates and reflections on society, culture, and history in Sweden. LÄS MER

  4. 33. 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. 34. 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

  7. 35. Schemes to Improve the Efficiency of Hardware Transactional Memory Systems

    Författare :Mridha Mohammad Waliullah; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; transactional memory; parallel programming; chip-multiprocessor; multiprocessor;

    Sammanfattning : In todays ubiquitous multiprocessor environment parallel programming becomesan important tool to reap the maximum gain. But the traditional lock-based parallelprogramming model is not attracting average programmers as the level of expertiseneeded is very high. LÄS MER