An introduction to parallel algorithms
Citations
39 citations
Cites background or methods from "An introduction to parallel algorit..."
..., n] [33] to group all the nodes, and then (2) sorting the nodes within each group using a parallel comparison sort [24]....
[...]
...They present an implementation of tree contraction based on the standard algorithm that only rakes leaves [24]....
[...]
...The question is: What does this dependence structure look like? Also, can the above approach be used to derive a highly parallel, work-efficient parallelization of the sequential algorithm? In this paper, we study these questions for three fundamental problems: random permutation, list contraction and tree contraction [25, 24, 36]....
[...]
...The level numbers for the nodes can be computed using leaffix operations or Euler tours [24] in linear work and O(log n) depth....
[...]
...The tree contraction problem is to contract a tree into a single node (possibly combining node values), and again has many applications [28, 29, 24]....
[...]
39 citations
Cites methods from "An introduction to parallel algorit..."
...Third, we explore scenarios under which two very highlevel models for algorithm design, the EREW PRAM (e.g., [ 32 ]) and the stronger QRQW PRAM [25], can be effectively mapped onto high-bandwidth machines (small g) when properly accounting for memory bank delay....
[...]
...The QRQW PRAM [25] is a variant of the well-studied PRAM model (see, e.g., [ 32 ], [34]) that allows for concurrent reading and writing to shared memory locations, but assumes that multiple reads/writes to a location queue up and are serviced one at a time (named the “queue-read queue-write (QRQW)” contention rule in [25])....
[...]
39 citations
38 citations
38 citations
References
2,895 citations
"An introduction to parallel algorit..." refers background in this paper
...Multiprocessorbased computers have been around for decades and various types of computer architectures [2] have been implemented in hardware throughout the years with different types of advantages/performance gains depending on the application....
[...]
...Every location in the array represents a node of the tree: T [1] is the root, with children at T [2] and T [3]....
[...]
...The text by [2] is a good start as it contains a comprehensive description of algorithms and different architecture topologies for the network model (tree, hypercube, mesh, and butterfly)....
[...]
1,410 citations
"An introduction to parallel algorit..." refers background in this paper
...Parallel architectures have been described in several books (see, for example, [18, 29])....
[...]
1,000 citations
"An introduction to parallel algorit..." refers background in this paper
...Recent work on the mapping of PRAM algorithms on bounded-degree networks is described in [3,13,14, 20, 25], Our presentation on the communication complexity of the matrix-multiplication problem in the sharedmemory model is taken from [1], Data-parallel algorithms are described in [15]....
[...]
951 citations
"An introduction to parallel algorit..." refers background in this paper
...Rigorous descriptions of shared-memory models were introduced later in [11,12]....
[...]
864 citations
"An introduction to parallel algorit..." refers methods in this paper
...The WT scheduling principle is derived from a theorem in [7], In the literature, this principle is commonly referred to as Brent's theorem or Brent's scheduling principle....
[...]