Parallel hashing
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A probabilistic scheme for implementing shared memory on a bounded-degree network of processors that enables n processors to store and retrieve an arbitrary set of n data items in O(logn) parallel steps is presented.
Abstract
article Free AccessParallel hashing: an efficient implementation of shared memory Authors: Anna R. Karlin Stanford Univ., Stanford, CA Stanford Univ., Stanford, CAView Profile , Eli Upfal IBM Almaden Research Center, Almaden, CA IBM Almaden Research Center, Almaden, CAView Profile Authors Info & Claims Journal of the ACMVolume 35Issue 4Oct. 1988 pp 876–892https://doi.org/10.1145/48014.350550Published:01 October 1988Publication History 42citation557DownloadsMetricsTotal Citations42Total Downloads557Last 12 Months24Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF