TY - JOUR

T1 - A nonoblivious bus access scheme yields an optimal partial sorting algorithm

AU - Fujita, Satoshi

AU - Yamashita, Masafumi

PY - 1996/4/10

Y1 - 1996/4/10

N2 - This paper focuses on a linear array of n nodes with multiple shared buses as a practically feasible model for parallel processing. Let k be the number of shared buses. A nonoblivious scheme for mutually exclusive access to k shared buses is proposed. The effectiveness of the scheme is demonstrated by proposing an algorithm for solving a partial sort problem, which can be efficiently executed on the array according to the scheme. The partial sort problem with parameter m is the problem of sorting a subset S′ of a given set S, where S′ is the set of elements less than or equal to the mth smallest element in S. If m = 1, then it is solved by an algorithm for finding the smallest element in S, and if m = n, then it is solved by adapting normal sorting algorithm. The time complexity (9mlk) log2 log2 n + 3.467 √nlk + O(mlk + (nlk)1/4) of the proposed algorithm matches a lower bound Ω (√nlk + mlk) with respect to n and k, if m is small enough to satisfy m = O(√nkllog log n).

AB - This paper focuses on a linear array of n nodes with multiple shared buses as a practically feasible model for parallel processing. Let k be the number of shared buses. A nonoblivious scheme for mutually exclusive access to k shared buses is proposed. The effectiveness of the scheme is demonstrated by proposing an algorithm for solving a partial sort problem, which can be efficiently executed on the array according to the scheme. The partial sort problem with parameter m is the problem of sorting a subset S′ of a given set S, where S′ is the set of elements less than or equal to the mth smallest element in S. If m = 1, then it is solved by an algorithm for finding the smallest element in S, and if m = n, then it is solved by adapting normal sorting algorithm. The time complexity (9mlk) log2 log2 n + 3.467 √nlk + O(mlk + (nlk)1/4) of the proposed algorithm matches a lower bound Ω (√nlk + mlk) with respect to n and k, if m is small enough to satisfy m = O(√nkllog log n).

UR - http://www.scopus.com/inward/record.url?scp=0030577967&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030577967&partnerID=8YFLogxK

U2 - 10.1006/jpdc.1996.0049

DO - 10.1006/jpdc.1996.0049

M3 - Article

AN - SCOPUS:0030577967

VL - 34

SP - 111

EP - 116

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 1

ER -