๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Variation in efficiency of parallel algorithms

โœ Scribed by Akiko Hayashi; Robert J. Melosh; Senol Utku; Moktar Salama

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
867 KB
Volume
21
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improving the efficiency of parallel min
Improving the efficiency of parallel minimum spanning tree algorithms
โœ Ka Wong Chong; Yijie Han; Yoshihide Igarashi; Tak Wah Lam ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 203 KB

This paper presents results which improve the e ciency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(log n) time with O((m+n) log n) operations. Our CRCW PRAM algorithm runs in O(log n) time with O((m

An efficient parallel sorting algorithm
An efficient parallel sorting algorithm
โœ Xiaoqing Liu; Junguk L. Kim ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB
Efficient parallel k selection algorithm
Efficient parallel k selection algorithm
โœ Jang-Ping Sheu; Jyh-Shyan Tang ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB
Efficient Parallel Algorithms for Permut
Efficient Parallel Algorithms for Permutation Graphs
โœ K. Arvind; V. Kamakoti; C.P. Rangan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 641 KB

In this paper, we present optimal \(O(\log n)\) time, \(O(n / \log n)\) processor EREW PRAM parallel algorithms for finding the connected components, cut vertices, and bridges of a permutation graph. We also present an \(O(\log n)\) time, \(O(n)\) processor, CREW PRAM model parallel algorithm for fi