An introduction to parallel algorithms
Citations
9 citations
9 citations
Cites background from "An introduction to parallel algorit..."
...Recently, Chlebus, Gambin and Indyk [4] and Berenbrink, Meyer auf der Heide and Stemann [1] obtained several simulations of EREW PRAM on DMM for static and dynamic models of faults....
[...]
...Most of theoretical research on parallel computation has focused on shared-memory models such as PRAM [15] or specific interconnection network models such as the hypercube [23]....
[...]
...Diks and Pelc [9] developed efficient simulation algorithms for EREW PRAM under the probabilistic processor-fault model....
[...]
...Chlebus, Ga̧sieniec and Pelc [5] presented a deterministic simulation ofn-processor EREW PRAM on-processor EREW PRAM prone to processor and memory failures, with step overheadO(logn) and preprocessing timeO(log2 n)....
[...]
...Buss et al. [2] developed deterministic PRAM simulations under the model of restartable failures....
[...]
9 citations
9 citations
9 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....
[...]