Dynamic parallel memories

DOI10.1016/S0019-9958(83)80003-5zbMath0536.68026OpenAlexW4212854884MaRDI QIDQ3321444

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)

Related Items (7)

An optimal parallel algorithm to construct a deap ⋮ Merging heaps in parallel ⋮ Rubber bands, convex embeddings and graph connectivity ⋮ A complexity theory of efficient parallel algorithms ⋮ Data independence of read, write, and control structures in PRAM computations ⋮ A note on the parallel complexity of anti-unification ⋮ Optimal parallel quicksort on EREW PRAM

This page was built for publication: Dynamic parallel memories