| |
Browse All Reviews > Software (D) > Operating Systems (D.4) > Process Management (D.4.1) > Concurrency (D.4.1...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 18
Reviews about "Concurrency (D.4.1...)":
|
Date Reviewed |
| |
Designing a semantic model for a wide-spectrum language with concurrency
Colvin R., Hayes I., Meinicke L. Formal Aspects of Computing 29(5): 853-875, 2017. Type: Article
A concurrent wide-spectrum language combines a concurrent programming language with specification constructs. Colvin et al. provide a unified framework for defining the semantics of such languages. The semantics is trace-based and capt...
|
Jan 10 2018 |
| |
 The scalable commutativity rule: designing scalable software for multicore processors
Clements A., Kaashoek M., Zeldovich N., Morris R., Kohler E. SOSP 2013 (Proceedings of the 24th ACM Symposium on Operating Systems Principles, Farminton, PA, Nov 3-6, 2013) 1-17, 2013. Type: Proceedings
Connections between commutativity and concurrency are well known and well established in the computing literature. Often, commutativity is used to demonstrate the feasibility of executing instructions concurrently. Clements et al. intr...
|
Apr 28 2014 |
| |
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 ...
|
May 13 2008 |
| |
Concurrent and Distributed Garbage Collection of Active Objects
Kafura D., Mukherji M., Washabaugh D. IEEE Transactions on Parallel and Distributed Systems 6(4): 337-350, 1995. Type: Article
This well-written, concise paper discusses an important issue regarding memory management: specifically, the idea that automated garbage collection in an object-oriented runtime environment is preferable to programmer-controlled memory...
|
Oct 1 1996 |
| |
The elusive atomic register
Singh A., Anderson J., Gouda M. Journal of the ACM 41(2): 311-339, 1994. Type: Article
The problem of atomic registers is addressed in this technical paper. In particular, it presents the construction of a single-writer, multiple-reader atomic register from single-writer, single-reader atomic registers. The construction ...
|
May 1 1995 |
| |
Atomic snapshots of shared memory
Afek Y., Attiya H., Dolev D., Gafni E., Merritt M., Shavit N. Journal of the ACM 40(4): 873-890, 1993. Type: Article
Achieving a consistent view of the state of concurrent computations is helpful in verifying the correct operation of those computations. The authors have made a contribution to theory by designing an algorithm that ...
|
Jun 1 1994 |
| |
Adaptable concurrency control for atomic data types
Atkins M., Coady M. ACM Transactions on Computer Systems 10(3): 190-225, 1992. Type: Article
The implementation and performance evaluation of three concurrency control (CC) servers used to access a shared object type, called the semiqueue, within distributed systems are described. The first server uses a purely optimistic poli...
|
Mar 1 1994 |
| |
Scheduling Support for Concurrency and Parallelism in the Mach Operating System
Black D. Computer 23(5): 35-43, 1990. Type: Article
The main data structure of the Mach scheduler includes 32 queues of runnable threads, called run queues. When a processor needs a new thread to run, it consults the run queues to get a thread according to a thread priority sche...
|
Sep 1 1991 |
| |
Competition: a model of AND-parallel execution of logic
Ng K., Leung H. The Computer Journal 33(3): 215-218, 1990. Type: Article
One way to improve the efficiency of logic programs is to allow execution of subgoals in parallel. If two or more subgoals share a variable, however, it is possible that if they are executed in parallel, they will return conflicting an...
|
Jul 1 1991 |
| |
Concurrent operations on priority queues
Jones D. Communications of the ACM 32(1): 132-137, 1989. Type: Article
Jones discusses the use of skew heaps for the concurrent manipulation of shared queues. He produces a concurrent version of the top-down algorithm for a skew heap from the Sleator-Tarjan recursive version, using previously published tr...
|
Sep 1 1989 |
| |
|
|
| |
|
|
