Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Look up keyword or section
Like this
1Activity

Table Of Contents

0 of .
Results for:
No results containing your search query
P. 1
Shared Memory Concurrency and Fast, Biased Locks

Shared Memory Concurrency and Fast, Biased Locks

Ratings: (0)|Views: 21 |Likes:
An essay for the 2011 Undergraduate Awards Competition by Jimmy Cleary. Originally submitted for Final Year Project at Trinity College, Dublin, with lecturer David Gregg in the category of Computer Sciences & Information Studies
An essay for the 2011 Undergraduate Awards Competition by Jimmy Cleary. Originally submitted for Final Year Project at Trinity College, Dublin, with lecturer David Gregg in the category of Computer Sciences & Information Studies

More info:

Published by: Undergraduate Awards on Aug 29, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
See more
See less

10/27/2013

 
1
Shared Memory Concurrency and Fast, Biased Locks 
 
2
 Abstract
 This project discusses the shared-memory concurrency problem, analyses the challengesfaced when implementing correct, concurrent algorithms on modern architectures, andexplores the special case of lopsided access patterns to a critical section (that is, when onethread is dominant i.e. has far more accesses to the critical section than any other thread). Inparticular, biased and asymmetric locking algorithms described by Vasudevan et al (PACT,2010) are implemented and experimented with and a new variation to their asymmetricalgorithm is presented. Also, a new, novel approach to this particular situation andassociated biased locking algorithms are described, discussed and similarly implemented andexperimented with.
 
3
 Table of Contents

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->