Dynamic parallel memories

DOI10.1016/S0019-9958(83)80003-5MaRDI QIDQ3321444zbMATH OpenOpenAlexFDO

Authors Uzi Vishkin

Publication date 1983

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(83)80003-5

zbMATH Keywords

parallel algorithmprocessorsshared memory locations

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 522833
• Efficient algorithms for dynamic allocation of distributed memory
• On saving space in parallel computation
• Exploiting storage redundancy to speed up randomized shared memory simulations
• How to share memory in a distributed system

Cited in

(13)

• A note on the parallel complexity of anti-unification
• Parallel `go with the winners' algorithms in distributed memory models.
• A complexity theory of efficient parallel algorithms
• On saving space in parallel computation
• Optimal parallel quicksort on EREW PRAM
• The parallel hierarchical memory model
• Parallel algorithm ``conveyer processing with a minimal memory usage
• An optimal parallel algorithm to construct a deap
• Parallelism versus memory allocation in pipelined router forwarding engines
• Running ASCEND, DESCEND and PIPELINE algorithms in parallel using small processors
• Merging heaps in parallel
• Data independence of read, write, and control structures in PRAM computations
• Rubber bands, convex embeddings and graph connectivity

This page was built for publication: Dynamic parallel memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3321444)