Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Software (D) > Operating Systems (D.4) > Process Management (D.4.1) > Mutual Exclusion (D.4.1...)  
 
Options:
 
  1-10 of 41 Reviews about "Mutual Exclusion (D.4.1...)": Date Reviewed
  JThread, a deadlock-free mutex library
Grande J., Boudol G., Serrano M.  PPDP 2015 (Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy,  Jul 14-16, 2015) 149-160, 2015. Type: Proceedings

Toilers in the orchards of multi-threaded programming can only reap the fruits of concurrent execution through the hard work of access synchronization. This paper describes the jThread library, designed to simplify correct synchronization and enha...

Aug 12 2015
  Concurrent programming without locks
Fraser K., Harris T.  ACM Transactions on Computer Systems 25(2): 5-es, 2007. Type: Article

Transactional memory technology reduces the granularity of synchronization from the relatively coarse level of mutual exclusion locks to the finer level of memory access. This comprehensive paper contains valuable insights and working code to ass...

May 13 2008
  Note: an efficient distributed token-based mutual exclusion algorithm with central coordinator
Wu M., Shu W.  Journal of Parallel and Distributed Computing 62(10): 1602-1613, 2002. Type: Article

Consider a distributed system, consisting of N connected nodes, with no shared memory, that communicates by message passing. Many mutual-exclusion algorithms exist to coordinate the resource sharing of objects by these N nodes. ...

May 15 2003
  k-Arbiter
Manabe Y., Baldoni R., Raynal M. (ed), Aoyagi S.  Theoretical Computer Science 193(1-2): 97-112, 1998. Type: Article

The mutual exclusion problem has provided a rich field of research for computer scientists. The problem is easy to state, has real-world application in operating systems, and generalizes in a variety of interesting ways depending on the interproce...

Nov 1 1998
  Computing global virtual time in shared-memory multiprocessors
Fujimoto R., Hybinette M.  ACM Transactions on Modeling and Computer Simulation 7(4): 425-446, 1997. Type: Article

Design and implementation of algorithms to compute global virtual time (GVT) on shared-memory parallel computers is the topic of this paper. GVT is a mechanism that enables one to identify those computations and information that are not prone to f...

Sep 1 1998
  A hybrid distributed mutual exclusion algorithm
Chang Y.  Microprocessing and Microprogramming 41(10): 715-731, 1996. Type: Article

The existing mutual exclusion algorithms in distributed systems can be categorized as token-based or non-token-based. Some of these algorithms focus on reducing message traffic, others on minimizing time delay. However, there is no single algorith...

Oct 1 1997
  Trapping mutual exclusion in the box calculus
Esparza J., Bruns G.  Theoretical Computer Science 153(1-2): 95-128, 1996. Type: Article

Box calculus is a new process algebra that seems to have a relatively simple Petri net semantics. The purpose of this new algebra is to be able to translate real-life parallel programs into a set of algebraic rules and then to prove interesting pr...

Jul 1 1997
  Efficient fault-tolerant algorithms for distributed resource allocation
Choy M., Singh A.  ACM Transactions on Programming Languages and Systems 17(3): 535-559, 1995. Type: Article

Three distributed algorithms for solving a generalized version of the dining philosophers problem are presented. The solutions are based on the concept of doorways, that is, code fragments that block subsequent conflicting processes once one proce...

Sep 1 1996
  Composing first-class transactions
Haines N., Kindred D., Morrisett J., Nettles S., Wing J.  ACM Transactions on Programming Languages and Systems 16(6): 1719-1736, 1994. Type: Article

A computation is undoable if it can revert to its pre-execution state at any time before it ends; it is persistent if its results remain after it has successfully ended; and it is serializable if it produces the same results independent of other c...

May 1 1996
  A bounded first-in, first-enabled solution to the l-exclusion problem
Afek Y., Dolev D., Gafni E., Merritt M., Shavit N.  ACM Transactions on Programming Languages and Systems 16(3): 939-953, 1994. Type: Article

Consider a system consisting of n processes, where each process has a segment of code called a critical section. The important feature of the system is that, when one process is executing in its critical section, no other proces...

Oct 1 1995
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy