AN EFFICIENT PERMUTATION-BASED PARALLEL RANGE-JOIN ALGORITHM ON N-DIMENSIONAL TORUS COMPUTERS

Authors
CHEN SD SHEN H TOPOR R
Citation
Sd. Chen et al., AN EFFICIENT PERMUTATION-BASED PARALLEL RANGE-JOIN ALGORITHM ON N-DIMENSIONAL TORUS COMPUTERS, Information processing letters, 52(1), 1994, pp. 35-38
Citations number
5
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
52
Issue
1
Year of publication
1994
Pages
35 - 38
Database
ISI
SICI code
0020-0190(1994)52:1<35:AEPPRA>2.0.ZU;2-O
Abstract
This paper proposes a parallel algorithm to compute the range-join of two relations on N-dimensional torus computers. The algorithm efficien tly permutes all subsets of one relation to each processor in turn, wh ere they are joined with the subset of the other relation at that proc essor using a local range-join algorithm. The analysis shows that the torus algorithm is more efficient than a previous algorithm for N-dime nsional mesh computers.