An introduction to parallel algorithms
Citations
1 citations
1 citations
1 citations
1 citations
1 citations
Cites background from "An introduction to parallel algorit..."
...Multicast communication patterns are the messagepassing counterpart of the algorithmically useful “concurrent-read” primitives supported by shared-memory models such as the PRAM [7], and arise in several parallel applications (e....
[...]
...Multicast communication patterns are the messagepassing counterpart of the algorithmically useful “concurrent-read” primitives supported by shared-memory models such as the PRAM [7], and arise in several parallel applications (e.g., matrix computations such as LU decomposition, Gaussian elimination and network/circuit simulations), as well as in the implementation of barrier synchronization and cache-coherence protocols....
[...]
...The complexity gap between the randomized and deterministic cases is intriguing since no such gap exists for most other mesh problems (one notable exception being the PRAM simulation problem as shown in [6])....
[...]
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....
[...]