Distributed computing and the multicore revolution
Authors:
Open Access
- 1 March 2008
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 39 (1) , 62-72
Abstract
Changes in technology can have far-reaching effects on theory. For example, while Turing's work on computability predated the first electronic computers, complexity theory flowered only after computers became a reality. After all, an algorithm's complexity may not matter much in a mathematics journal, but matters quite a bit in a FORTRAN program. We argue that something similar is going on with parallel and concurrent computation: after decades of being respected but not taken seriously, research on multiprocessor algorithms and data structures is going mainstream.Keywords
This publication has 32 references indexed in Scilit:
- Split-ordered listsJournal of the ACM, 2006
- Formal Verification of a Lazy Concurrent List-Based Set Algorithm2006
- Advanced contention management for dynamic software transactional memory2005
- Obstruction-Free Step Complexity: Lock-Free DCAS as an ExampleLecture Notes in Computer Science, 2005
- Thread Scheduling for Multiprogrammed MultiprocessorsTheory of Computing Systems, 2001
- Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory MultiprocessorsJournal of Parallel and Distributed Computing, 1998
- Contention-Free Complexity of Shared Memory AlgorithmsInformation and Computation, 1996
- Shared memory consistency models: a tutorialComputer, 1996
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- A bridging model for parallel computationCommunications of the ACM, 1990