SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:research.chalmers.se:a92ce3c4-92f8-4ede-abed-d065baa39e97"
 

Sökning: id:"swepub:oai:research.chalmers.se:a92ce3c4-92f8-4ede-abed-d065baa39e97" > A Study of the Beha...

A Study of the Behavior of Synchronization Methods in Commonly Used Languages and Systems

Cederman, Daniel, 1981 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Chatterjee, Bapi, 1982 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Nguyen, Dang Nhan, 1983 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
visa fler...
Nikolakopoulos, Ioannis, 1986 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Papatriantafilou, Marina, 1966 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Tsigas, Philippas, 1967 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
visa färre...
 (creator_code:org_t)
ISBN 9780769549712
2013
2013
Engelska.
Ingår i: Proceedings of the 27th IEEE International Parallel & Distributed Processing Symposium. - 1530-2075. - 9780769549712 ; , s. 1309-1320
  • Konferensbidrag (refereegranskat)
Abstract Ämnesord
Stäng  
  • Synchronization is a central issue in concurrency and plays an important role in the behavior and performance of modern programmes. Programming languages and hardware designers are trying to provide synchronization constructs and primitives that can handle concurrency and synchronization issues efficiently. Programmers have to find a way to select the most appropriate constructs and primitives in order to gain the desired behavior and performance under concurrency. Several parameters and factors affect the choice,through complex interactions among (i) the language and the language constructs that itsupports, (ii) the system architecture, (iii) possible run-time environments,virtual machine options and memory management support and(iv) applications.We present a systematic study ofsynchronizationstrategies, focusing on concurrent data structures.We have chosen concurrent data structures with different number of contention spots.We consider both coarse-grain and fine-grain locking strategies, as well as lock-free methods.We have investigated synchronization-aware implementations in C++, C# (.NET and Mono) and Java.Considering the machine architectures, we have studied the behavior of theimplementations on both Intel's Nehalem and AMD's Bulldozer.The properties that we study are throughput and fairness under different workloads and multiprogramming execution environments.For NUMA architectures fairness is becoming as important as the typically considered throughput property.To the best of our knowledge this is the first systematic and comprehensive study of synchronization-aware implementations.This paper takes steps towards capturing a number of guidingprinciples and concerns for the selection of the programming environmentand synchronization methods in connection to the application and the system characteristics.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Publikations- och innehållstyp

kon (ämneskategori)
ref (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy