
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Haigeng Wang, Alexandru Nicolau, KaiYeng S. Siu, "The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints," IEEE Transactions on Computers, vol. 45, no. 11, pp. 12571271, November, 1996.  
BibTex  x  
@article{ 10.1109/12.544482, author = {Haigeng Wang and Alexandru Nicolau and KaiYeng S. Siu}, title = {The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {11}, issn = {00189340}, year = {1996}, pages = {12571271}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.544482}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints IS  11 SN  00189340 SP1257 EP1271 EPD  12571271 A1  Haigeng Wang, A1  Alexandru Nicolau, A1  KaiYeng S. Siu, PY  1996 KW  Parallel prefix computation KW  scan operator resourceconstrained parallel algorithms KW  strict timeoptimal schedules KW  loop parallelization KW  loopcarried dependences KW  associative operations KW  treeheight reduction KW  Pascal's Triangle KW  combinatorial optimization. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—
[1] R.K. Agarwal, "Computational Fluid Dynamics on Parallel Processors," tutorial, McDonnell Douglas Research Laboratories, Proc. Sixth ACM SigArch Int'l Conf. Supercomputing,Washington, D.C., July 1992.
[2] A.V. Aho, R. Sethi, and J.D. Ullman, Compilers, Principles, Techniques and Tools.New York: AddisonWesley, 1985.
[3] G. Almasi and A. Gottlieb, Highly Parallel Computing, chap. 4. Benjamin/Cummings, 1989.
[4] U. Banerjee, R. Eigenmann, A. Nicolau, and D.A. Padua, "Automatic Program Parallelization," Proc. IEEE, vol. 81, Feb. 1993.
[5] A. Bilgory and D. Gajski, "A Heuristic for Suffix Solutions," IEEE Trans. Computers, vol. 35, no. 1, Jan. 1986.
[6] R. Cole and U. Vishkin, "Faster Optimal Parallel Prefix Sums and List Ranking," Information and Computation, vol. 81, no. 3, pp. 334352, 1989.
[7] O. Egecioglu and C.K. Koc, "Parallel Prefix Computation with Few Processors," Computers and Mathematics with Applications, vol. 24, no. 4, pp. 7784, 1992.
[8] F.E. Fich, "New Bounds for Parallel Prefix Circuits," Proc. 15th ACM STOC, pp. 100109, 1983.
[9] C. Kruskal, L. Rudolph, and M. Snir, "The Power of Parallel Prefix," IEEE Trans. Computers, vol. 34, no. 10, Oct. 1985.
[10] D. Kuck, The Structure of Computers and Computations, vol. 1. New York: John Wiley and Sons, 1978.
[11] P. Kogge and H. Stone, "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations," IEEE Trans. Computers, vol. 22, no. 8, Aug. 1973.
[12] R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation," J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[13] S. Lakshmivarahan and S.K. Dhall, Parallel Computing Using the Prefix Problem. Oxford Univ. Press, 1994.
[14] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[15] Y. Muraoka, "Parallelism Exposure and Exploitation in Programs," PhD thesis, Dept. of Computer Science, Univ. of Illinois at UrbanaChampaign, Report No. 424, Feb. 1971.
[16] A. Nicolau and H. Wang, "Optimal Schedules for Parallel Prefix Computation with Bounded Resources," SIGPLAN Notices and Proc. Third ACM SIGPLAN Symp. Principles and Practice of Parallel Programming,Williamsburg, Va., Apr.2124, 1991.
[17] Y. Ofman, "On the Algorithmic Complexity of Discrete Functions," Cybernetics and Control Theory, Soviet Physics Doklady, vol. 7, no. 7, pp. 589591, Jan. 1963.
[18] M. Snir, "DepthSize TradeOffs for Parallel Prefix Computation," J. Algorithms, vol. 7, pp. 185201, 1986.
[19] H. Wang, "Parallelization of Programs Containing LoopCarried Dependences with Resource Constraints," PhD thesis, Dept. of Information and Computer Science, Univ. of California, Irvine, Sept. 1994.