Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “parallel algorithms”

New parallel prefix algorithms

Yen‐Chun Lin, Li‐Ling Hung · 2009

New families of computation-efficient parallel prefix algorithms for message-passing multicomputers are presented. The first family improves the communication time of a previous family of parallel prefix algorithms; both use only half-duplex communications. Two other families adopt collective communication operations to reduce the communication times of the former two, respectively. These families each provide the flexibility of either fewer computation time steps or fewer communication time steps to achieve the minimal running time depending on the ratio of the time required by a communication step to the time required by a computation step.

Cited by 0

Adaptive parallel aggregation algorithms

Ambuj Shatdal, Jeffrey F. Naughton · 1995

Aggregation and duplicate removal are common in SQL queries. However, in the parallel query processing literature, aggregate processing has received surprisingly little attention; furthermore, for each of the traditional parallel aggregation algorithms, there is a range of grouping selectivities where the algorithm performs poorly. In this work, we propose new algorithms that dynamically adapt, at query evaluation time, in response to observed grouping selectivities. Performance analysis via analytical modeling and an implementation on a workstation-cluster shows that the proposed algorithms are able to perform well for all grouping selectivities. Finally, we study the effect of data skew and show that for certain data sets the proposed algorithms can even outperform the best of traditional approaches.

Cited by 108Open access

Refinement of Parallel Algorithms

Fredrik Degerlund, Kaisa Sere · Chapman & Hall/CRC computational science series/Chapman & Hall/CRC computational science · 2008

Cited by 0

Parallel algorithms for arrangements

Richard Anderson, Paul Beame, Erik Brisson · 1990

Article Parallel algorithms for arrangements Share on Authors: R. Anderson Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, WashingtonView Profile , P. Beame Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, WashingtonView Profile , E. Brisson Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, WashingtonView Profile Authors Info & Claims SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architecturesMay 1990 Pages 298–306https://doi.org/10.1145/97444.97697Online:01 May 1990Publication History 2citation244DownloadsMetricsTotal Citations2Total Downloads244Last 12 Months0Last 6 weeks0 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 SiteGet Access

Cited by 7

PARALLEL WOLFF CLUSTER ALGORITHMS

Seung‐Hwan Bae, Sung-Hoon Ko, Paul Coddington · International Journal of Modern Physics C · 1995

The Wolff single-cluster algorithm is the most efficient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Wolff clusters, this method does not easily lend itself to efficient parallel implementation, so that simulations using this method have thus far been confined to workstations and vector machines. Here we present two parallel implementations of this algorithm, and show that one gives fairly good performance on a MIMD parallel computer.

Cited by 7

Parallel Algorithms on Strings

2007

We present several polylogarithmic-time parallel string algorithms using a high level description of the parallel random access machine (PRAM). We select only basic problems: string matching, construction of the dictionary of basic subwords, suffix arrays, and suffix trees. Especially, the suffix tree is a very useful data structure in string algorithmics, once it is constructed it can be used to solve easily in parallel many other problems expressed in terms of suffix trees. Most problems related to trees are easily computable in parallel.

Cited by 0

Fast Parallel Permutation Algorithms

Jörg Keller, Torben Hagerup, Torben Hagerup · 1993

We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n=p) log n) and an improved algorithm with run time O(n=p+ log n log log(n=p)). Both algorithms require n additional global bits and O(1) local storage per processor. If prefix summation is supported at the instruction level, the run time of the improved algorithm is O(n=p). The algorithms can be used to rehash the address space of a PRAM emulation. Keywords: Parallel Algorithms, Permutations, Shared Memory, Rehashing 1 Introduction Consider the task of permuting n data items on an EREW PRAM with p n processors according to a permutation ß given in the form of a constant-time "black-box" program. The task is trivial if n additional (global or local) memory cells are available: The items are first moved to the additional storage, with each processor handling O(n=p) items, and then written back in permuted order. We res...

Cited by 0