Journal ArticleDOI
Relations between concurrent-write models of parallel computation
Reads0
Chats0
TLDR
This work extensively study the relationship between four shared memory models of parallel computation that allow simultaneous read/write access, and proves nontrivial separations and simulation results among them.Abstract:
Shared memory models of parallel computation (e.g., parallel RAMs) that allow simultaneous read/write access are very natural and already widely used for parallel algorithm design. The various models differ from each other in the mechanism by which they resolve write conflicts. To understand the effect of these communication primitives on the power of parallelism, we extensively study the relationship between four such models that appear in the literature, and prove nontrivial separations and simulation results among them.read more
Citations
More filters
Book ChapterDOI
Parallel algorithms for shared-memory machines
TL;DR: In this paper, the authors discuss parallel algorithms for shared-memory machines and discuss the theoretical foundations of parallel algorithms and parallel architectures, and present a theoretical analysis of the appropriate logical organization of a massively parallel computer.
Book ChapterDOI
A catalog of complexity classes
TL;DR: This chapter discusses the concepts needed for defining the complexity classes, a set of problems of related resource-based complexity that can be solved by an abstract machine M using O(f(n) of resource R, where n is the size of the input.
MonographDOI
Introduction to Parallel Computing
TL;DR: In this article, a comprehensive introduction to parallel computing is provided, discussing theoretical issues such as the fundamentals of concurrent processes, models of parallel and distributed computing, and metrics for evaluating and comparing parallel algorithms, as well as practical issues, including methods of designing and implementing shared-and distributed-memory programs, and standards for parallel program implementation.
Journal ArticleDOI
A Taxonomy for Multi-Agent Robotics*
TL;DR: A taxonomy that classifies multi-agent systems according to communication, computational and other capabilities is presented, and it is demonstrated that a collective can be demonstrably more powerful than a single unit of the collective.
Book
Introduction to the theory of complexity
TL;DR: 1. Mathematical Preliminaries, Elements of Computability Theory, and Space-Complexity Classes: Algorithms and Complexity Classes.