A Model for Asynchronous Shared Memory Parallel Computation

Traditional theoretical shared memory parallel models have been based on a number of assumptions which simultaneously simplify solutions to problems and distance the models from actual parallel machines. One such assumption is that processors work together in a synchronous fashion. Recent work has f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on computing Ročník 23; číslo 6; s. 1231 - 1252
Hlavní autor: Nishimura, Naomi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1994
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Automata. Abstract machines. Turing machines
Computer science; control theory; systems
Exact sciences and technology
Schedules
Theoretical computing
Parallel algorithm
Parallel computation
Asynchronous regime
Computational complexity
Shared memory
ISSN:0097-5397, 1095-7111
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Traditional theoretical shared memory parallel models have been based on a number of assumptions which simultaneously simplify solutions to problems and distance the models from actual parallel machines. One such assumption is that processors work together in a synchronous fashion. Recent work has focused on finding a model that captures the essence of computation by processors communicating asynchronously through shared memory. In this paper, a general framework and set of criteria used to analyze these models, including the complexity analysis of several fundamental algorithmic paradigms, are considered. A general asynchronous model is introduced and how it satisfies these criteria is demonstrated. In this model, $O(\log p)$ algorithms are demonstrated for solving $p$-input versions of the problems of AND, OR, parity, maximum, minimum, and list ranking. To handle list ranking, a technique of analyzing algorithms is developed in which the set of tasks that are to be executed depends on the processor schedules.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539791219670