Matches in SemOpenAlex for { <https://semopenalex.org/work/W1498628342> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W1498628342 abstract "We propose a new model of asynchronous parallel computation, the A-PRAM, which is a more realistic reflection of shared memory multi-processor systems than the synchronous Parallel Random Access Machine (PRAM) model. The PRAM assumption that all processors operate in lock-step synchrony is expensive to implement for large multi-processor systems.The PRAM model is good for designing algorithms and writing programs. However, its unrealistic assumptions distance it from practical machines. So, one of our goals is to allow programmers to write PRAM programs and then provide an efficient and correct simulation for these programs on realistic machines. We show that any n-processor PRAM program can be simulated on an A-PRAM with no loss in asymptotic efficiency using up to $noverlog n$ processors, provided minor restrictions on the asynchrony are imposed.We achieve these results by using randomization to schedule sub-tasks of a parallel program. We use randomization in a novel way which makes our algorithms fault-tolerant and greatly reduces inefficiency arising out of busy-waiting. The resulting algorithms allow processors to (i) have arbitrary asynchronous behavior; (ii) fail at arbitrary times; (iii) join a computation at any time; and (iv) not require unique identifiers.We develop a performance metric for asynchronous parallel computations which we call work which is the total number of instructions (including busy-waiting) performed by a collection of parallel processors during a computation. We use work as a metric of performance since time is often not meaningful in an asynchronous environment. However, if there are p processors running nearly synchronously, then the time taken would be expected $O({workover p}).$In the A-PRAM setting, we design efficient algorithms for the following problems: computing an associative function, prefix sums, list ranking, sorting, transitive closure and evaluating a bounded degree fan-in circuit.We also propose hardware support for asynchrony, the TPRAM, a tagged A-PRAM. It uses memory tags to handle one of the fundamental problems of asynchrony, a slow write that overwrites a current, correct value. On this stronger model, we can get faster simulations, at the cost of a modest increase in total work." @default.
- W1498628342 created "2016-06-24" @default.
- W1498628342 creator A5078929461 @default.
- W1498628342 date "1992-01-01" @default.
- W1498628342 modified "2023-09-24" @default.
- W1498628342 title "Asynchronous algorithms for shared memory parallel computers" @default.
- W1498628342 hasPublicationYear "1992" @default.
- W1498628342 type Work @default.
- W1498628342 sameAs 1498628342 @default.
- W1498628342 citedByCount "1" @default.
- W1498628342 crossrefType "journal-article" @default.
- W1498628342 hasAuthorship W1498628342A5078929461 @default.
- W1498628342 hasConcept C111919701 @default.
- W1498628342 hasConcept C11413529 @default.
- W1498628342 hasConcept C120373497 @default.
- W1498628342 hasConcept C151319957 @default.
- W1498628342 hasConcept C156891508 @default.
- W1498628342 hasConcept C162324750 @default.
- W1498628342 hasConcept C173608175 @default.
- W1498628342 hasConcept C187736073 @default.
- W1498628342 hasConcept C2779019669 @default.
- W1498628342 hasConcept C2780898871 @default.
- W1498628342 hasConcept C31258907 @default.
- W1498628342 hasConcept C41008148 @default.
- W1498628342 hasConcept C45374587 @default.
- W1498628342 hasConcept C538114610 @default.
- W1498628342 hasConcept C68387754 @default.
- W1498628342 hasConceptScore W1498628342C111919701 @default.
- W1498628342 hasConceptScore W1498628342C11413529 @default.
- W1498628342 hasConceptScore W1498628342C120373497 @default.
- W1498628342 hasConceptScore W1498628342C151319957 @default.
- W1498628342 hasConceptScore W1498628342C156891508 @default.
- W1498628342 hasConceptScore W1498628342C162324750 @default.
- W1498628342 hasConceptScore W1498628342C173608175 @default.
- W1498628342 hasConceptScore W1498628342C187736073 @default.
- W1498628342 hasConceptScore W1498628342C2779019669 @default.
- W1498628342 hasConceptScore W1498628342C2780898871 @default.
- W1498628342 hasConceptScore W1498628342C31258907 @default.
- W1498628342 hasConceptScore W1498628342C41008148 @default.
- W1498628342 hasConceptScore W1498628342C45374587 @default.
- W1498628342 hasConceptScore W1498628342C538114610 @default.
- W1498628342 hasConceptScore W1498628342C68387754 @default.
- W1498628342 hasLocation W14986283421 @default.
- W1498628342 hasOpenAccess W1498628342 @default.
- W1498628342 hasPrimaryLocation W14986283421 @default.
- W1498628342 hasRelatedWork W1607613268 @default.
- W1498628342 hasRelatedWork W1669554023 @default.
- W1498628342 hasRelatedWork W17408180 @default.
- W1498628342 hasRelatedWork W1974158449 @default.
- W1498628342 hasRelatedWork W1975934607 @default.
- W1498628342 hasRelatedWork W1987917925 @default.
- W1498628342 hasRelatedWork W2011704476 @default.
- W1498628342 hasRelatedWork W2033293033 @default.
- W1498628342 hasRelatedWork W2065408834 @default.
- W1498628342 hasRelatedWork W2111669793 @default.
- W1498628342 hasRelatedWork W2116753997 @default.
- W1498628342 hasRelatedWork W2120597980 @default.
- W1498628342 hasRelatedWork W2164403640 @default.
- W1498628342 hasRelatedWork W2186795634 @default.
- W1498628342 hasRelatedWork W2206404388 @default.
- W1498628342 hasRelatedWork W2565802105 @default.
- W1498628342 hasRelatedWork W3101628343 @default.
- W1498628342 hasRelatedWork W834712556 @default.
- W1498628342 hasRelatedWork W838614691 @default.
- W1498628342 hasRelatedWork W984635991 @default.
- W1498628342 isParatext "false" @default.
- W1498628342 isRetracted "false" @default.
- W1498628342 magId "1498628342" @default.
- W1498628342 workType "article" @default.