Imagen de Portada
Código QR

Researchers Simplify Parallel Programming.

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 manu...

Descripción completa

Publicado en:Communications of the ACM Vol. 57; no. 11; pp. 13 - 16
Autor principal: Anthes, Gary
Formato: Artículo
Publicado: Association for Computing Machinery Nov2014
Materias:
Computer science research
Algorithms
Computer programming
Computer logic
Integrated circuits manufacturing
Computer storage devices
Acceso en línea:Ver este registro en EBSCOhost
Sumario: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.