We present two new algorithms for searching in sorted X Ψ Y Ψ R Ψ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n β«Ψβ¬ O(2 s/4 ), we obtain a
Fast and highly scalable parallel computations for
β Scribed by Keqin Li
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 516 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0920-8542
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A two-dimensional \((h, p)\) finite element scheme for distributed parallel computation is developed. The approach is based on an element-by-element domain decomposition and is implemented on the nCUBE2 system. Example problems are used to demonstrate performance of the algorithm for a range of \((h
A directive-based parallelization tool called the Scalable Modeling System (SMS) is described. The user inserts directives in the form of comments into existing Fortran code. SMS translates the code and directives into a parallel version that runs efficiently on shared and distributed memory high-pe