Back to Search Start Over

Researchers Simplify Parallel Programming.

Authors :
Anthes, Gary
Source :
Communications of the ACM. Nov2014, Vol. 57 Issue 11, p13-15. 3p.
Publication Year :
2014

Abstract

The article discusses the Massachusetts Institute of Technology (MIT), Microsoft Research and the Israel Institute of Technology's study which showed that lock-free algorithms performed as effectively as wait-free algorithms. Topics discussed include the importance of parallel computing in chip manufacturing and the two types of algorithms as part of class of techniques used in shared-memory systems, the evolution of parallel computation, the use of lock-free algorithms by programmers and the transactional memory as a lock-free control method.

Details

Language :
English
ISSN :
00010782
Volume :
57
Issue :
11
Database :
Academic Search Index
Journal :
Communications of the ACM
Publication Type :
Periodical
Accession number :
99074380
Full Text :
https://doi.org/10.1145/2667109