This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR
September 2001 (vol. 12 no. 9)
pp. 912-921

Abstract—Constant time solutions for many applications have been obtained on BSR, but some theoretical problems on BSR that were raised when BSR was proposed have not been solved. Three of them are: 1) No lower bound for any problem on BSR is known except trivial constant time, 2) is there any improvement with nonconstant BSR time but still better than the lower bound for CRCW?, and 3) how to characterize problems for which BSR achieves constant time performance. In this paper, we have solved these three problems. For Problem 1, a lower bound on BSR is shown for any computational problem with an optimal sequential solution. An efficient sorting algorithm answers the second problem. A necessary condition is given for the third problem. The Work-Time (WT) Scheduling Principle and optimality for BSR are also introduced for investigating the BSR performance when the number of processors available, p, is different from the input size, n, of problems.

[1] S.G. Akl, Parallel Computation: Models and Methods. Upper Saddle River, N.J.: Prentice Hall, 1997.
[2] S.G. Akl and G.R. Guenther, “Broadcasting with Selective Reduction,” Proc. Int'l Federation Information Processing 11th World Computer Congress, pp. 515-520, 1989.
[3] S.G. Akl and I. Stojmenovic, “Broadcasting with Selective Reduction: A Powerful Model of Parallel Computation,” Parallel and Distributed Computing Handbook, A.Y. Zomaya, ed., pp. 192-222, New York: McGraw-Hill, 1996.
[4] R.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," J. ACM, vol. 21, pp. 201-206, 1974.
[5] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: Addison-Wesley, 1992.
[6] L.F. Lindon and S.G. Akl, “An Optimal Implementation of Broadcasting with Selective Reduction,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 3, pp. 256-269, Mar. 1993.
[7] I. ${\bf Stojmenovi \acute c}$, “Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction from Its Traversals,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 2, pp. 218-224, Feb. 1996.
[8] L. Xiang and K. Ushijima, “ANSV problem on BSRs,” Information Processing Letters, vol. 65, no. 3, pp. 135-138, 1998.
[9] L. Xiang, K. Ushijima, S. G. Akl, and I. Stojmenovic, “An Efficient Implementation for the BROADCAST Instruction of$\rm BSR^{+}$,” IEEE Trans. Parallel Distributed Systems, vol. 10, no. 8, pp. 852-863, Aug. 1999.
[10] L. Xiang and K. Ushijima, “Rearranging Scattered Information on BSR,” Information Processing Letters, vol. 71, no. 1, pp. 43-47, 1999.
[11] L. Xiang and K. Ushijima, “A Theorem on the Relation Between$\rm BSR_k$and$\rm BSR^+$,” Information Processing Letters, vol. 71, no. 2, pp. 71-73, 1999.
[12] L. Xiang and K. Ushijima, “Optimal Parallel Merging Algorithms on BSR,” Proc. 2000 Int'l Symp. Parallel Architectures, Algorithms and Networks, pp. 12-17, 2000.

Index Terms:
PRAM, BSR, parallel algorithms, the WT scheduling principle.
Citation:
Limin Xiang, Kazuo Ushijima, "On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 9, pp. 912-921, Sept. 2001, doi:10.1109/71.954621
Usage of this product signifies your acceptance of the Terms of Use.