Schimmler, M., Parallel strong orientation on a mesh connected computer, Parallel Computing 17 (1991) 657-664. We present a solution for the following problem: given an undirected bridgeless connected graph G = (V, E), find an orientation of each edge such that the resulting directed graph is stron
โฆ LIBER โฆ
Mesh-connected parallel computer PAX for scientific applications
โ Scribed by Tsutomu Hoshino; Tomonori Shirakawa; Keiichi Tsuboi
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 909 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Parallel strong orientation on a mesh co
โ
Manfred Schimmler
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 411 KB
Parallel processing of linear quadtrees
โ
Yubin Hung; Azriel Rosenfeld
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 423 KB
Reducing communication costs for sorting
Reducing communication costs for sorting on mesh-connected and linearly connected parallel computers
โ
Arvin Park; K. Balasubramanian
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 503 KB
An improved parallel algorithm for const
โ
Chang-Sung Jeong
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 455 KB
Parallel B-Spline Surface Fitting on Mes
โ
Kuo-Liang Chung; Wen-Ming Yan
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 257 KB
Processor Allocation Using Partitioning
โ
Prasant Mohapatra
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 326 KB
Several processor allocation schemes for mesh connected parallel computers have been proposed in the literature. These schemes aim at improving system performance by reducing internal fragmentation or by enhancing submesh recognition ability. In this paper, we propose a system partitioning approach