Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
June 2003 Adaptive Algorithms / Hagit Attiya 1 Algorithms that Adapt toAlgorithms that Adapt to
 

Summary: June 2003 Adaptive Algorithms / Hagit Attiya 1
Algorithms that Adapt toAlgorithms that Adapt to
ContentionContention
Hagit Attiya
Department of Computer Science
Technion
June 2003 Adaptive Algorithms / Hagit Attiya 2
Fast Mutex Algorithm
[Lamport, 1986]
In a well-designed system, most of the time only a
single process tries to get into the critical section...
Will be able to do so in a constant number of steps.
When two processes try to get into the critical section?
O(n) steps!
June 2003 Adaptive Algorithms / Hagit Attiya 3
Asynchronous Shared-Memory
Systems
Need to collect information in order to coordinate...
When only few processes participate, reading one by
one is prohibitive ...

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences