An introduction to parallel algorithms
Citations
1 citations
1 citations
1 citations
Cites background or methods from "An introduction to parallel algorit..."
...Using merge sort algorithm, sorting a sequence of n elements can be done optimally in O(logn log (log n )) (JaJa, 1992)....
[...]
...…• The resulting implementations are practical and do not require complex data structures • Parallelism is present as the approach is inherited from Mergesort (JaJa, 1992) In the proposed technique, at first, the disorderness of the data is checked and partitioned in a single pass over the data set....
[...]
...According to Simple Merge Sort (JaJa, 1992), the running time of this algorithm is O(logn log (log n)) and the total number of operations used is O(n log n) (where PRAM model will be CREW PRAM)....
[...]
...The design of generic sorting algorithms results in several advantages (Estivill-Castro and Wood, 1992a), for example: • The algorithm designer can focus the efforts on the combinatorial properties of the measures of disorder of interest rather than in the combinatoril properties of the algorithm • The designer can regulate the trade-off between the number of measures for adaptivity and the amount of machinery required • The resulting implementations are practical and do not require complex data structures • Parallelism is present as the approach is inherited from Mergesort (JaJa, 1992) In the proposed technique, at first, the disorderness of the data is checked and partitioned in a single pass over the data set....
[...]
...The number of ascending runs is directly related to the measure Runs, Natural Mergesort takes O(|n| (1 + log[Runs(n) + 1])) time....
[...]
1 citations
Cites background from "An introduction to parallel algorit..."
...For shared memory models, the most prevalent theoretical model is the Parallel Random Access Machine (PRAM) model [23]....
[...]
1 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....
[...]