
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D.A. Carlson, "ModifiedMesh Connected Parallel Computers," IEEE Transactions on Computers, vol. 37, no. 10, pp. 13151321, October, 1988.  
BibTex  x  
@article{ 10.1109/12.5998, author = {D.A. Carlson}, title = {ModifiedMesh Connected Parallel Computers}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {10}, issn = {00189340}, year = {1988}, pages = {13151321}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.5998}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  ModifiedMesh Connected Parallel Computers IS  10 SN  00189340 SP1315 EP1321 EPD  13151321 A1  D.A. Carlson, PY  1988 KW  meshconnected parallel computers; application programs; global mesh structures; interprocessor communication; tree computations; prefix computations; sorting; pyramid; Xtree; meshoftrees; parallel processing; trees (mathematics). VL  37 JA  IEEE Transactions on Computers ER   
[1] A. Aggarwal, "A comparative study of Xtree, pyramid, and related machines," inProc. 25th IEEE Symp. Foundations Comput. Sci., Oct. 1984, pp. 8999.
[2] A. Aggarwal, "Optimal bounds for finding maximum on array of processors withkglobal buses,"IEEE Trans. Comput., vol. C35, pp. 6264, Jan. 1986.
[3] G. H. Barnes, R. Brown, M. Kato, D. Kuck, D. Slotnick, and R. Stokes, "The Illiac IV computer,"IEEE Trans. Comput., vol. C17, pp. 746757, 1968.
[4] S. H. Bokhari, "Finding maximum on an array processor with a global bus,"IEEE Trans. Comput., vol. C33, pp. 133139, Feb. 1984.
[5] R. P. Brent and H. T. Kung, "A regular layout for parallel adders,"IEEE Trans. Comput., vol. C31, pp. 260264, Mar. 1982.
[6] D. A. Carlson, "Parallel processing of treelike computations," inProc. 4th Int. Conf. Distributed Comput. Syst., May 1984, pp. 192200.
[7] D. A. Carlson, "Performing tree and prefix computations on modified meshconnected parallel computers," inProc. 1985 Int. Conf. Parallel Processing, Feb. 1985, pp. 714717.
[8] D. A. Carlson, "Solving linear recurrence systems on meshconnected computers with multiple global buses," submitted toJ. Parallel Distributed Comput., Jan. 1986.
[9] D. A. Carlson and B. Sugla, "Time and processor efficient parallel algorithms for recurrence equations and related problems," inProc. 1984 Int. Conf. Parallel Processing, Aug. 1984, pp. 310314.
[10] S. C. Chen and D. J. Kuck, "Time and parallel processor bounds for linear recurrence systems,"IEEE Trans. Comput., vol. C24, pp. 707717, July 1975.
[11] A. M. Despain and D. A. Patterson, "Xtree: A tree structured multiprocessor computer architecture," inProc. Fifth Int. Symp. Comput. Architecture, Apr. 1978, pp. 144151.Comput. Architecture, pp. 2128, Dec. 1973.
[12] D. D. Gajski, "An algorithm for solving linear recurrence systems on parallel and pipelined machines,"IEEE Trans. Comput., vol. C30, pp. 190206, Mar. 1981.
[13] L. M. Goldschlager, "A universal interconnection pattern for parallel computers,"J. ACM, vol. 29, pp. 10731086, Oct. 1982.
[14] A. G. Greenberg, R. E. Ladner, M. S. Paterson, and Z. Galil, "Efficient parallel algorithms for linear recurrence computation,"Inform. Processing Lett., vol. 15, pp. 3135, Aug. 1982.
[15] S. E. Hambrusch, "VLSI algorithms for the connected components problem,"SIAM J. Comput., vol. 12, pp. 354365, May 1983.
[16] D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, "Computing connected components on parallel computers,"Commun. Assoc. Comput. Mach., pp. 461464, 1979.
[17] J. JaJa, "The VLSI complexity of selected graph problems,"J. ACM, vol. 31, pp. 377391, Apr. 1984.
[18] P. M. Kogge and H. S. Stone, "A parallel algorithm for the efficient solution of a general class of recurrence equations,"IEEE Trans. Comput., vol. C22, pp. 786793, Aug. 1973.
[19] C. P. Kruskal, L. Rudolph, and M. Snir, "The power of parallel prefix,"IEEE Trans. Comput., vol. C34, pp. 965968, Oct. 1985.
[20] V. K. P. Kumar and M. M. Eshaghian, "Parallel geometric algorithms for digitized pictures on mesh of trees (preliminary version)," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 270273.
[21] V. K. PrasannaKumar and C. S. Raghavendra, "Array processor with multiple broadcasting," inProc. Annu. Symp. Computer Architecture, June 1985.
[22] R. E. Ladner and M. J. Fischer, "Parallel prefix computation,"J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[23] F. T. Leighton, "New lower bound techniques for VLSI," inProc. 22nd IEEE Symp. Foundations Comput. Sci., Oct. 1981, pp. 112.
[24] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 3860, 1987.
[25] J. I. Munro and M. S. Paterson, "Optimal algorithms for parallel polynomial evaluation,"J. Comput. Syst. Sci., vol. 7, pp. 189198, 1973.
[26] D. Nassimi and S. Sahni, "Bitonic sort on a meshconnected parallel computer,"IEEE Trans. Comput., vol. C27, pp. 27, Jan. 1979.
[27] D. Nassimi and S. Sahni, "Finding connected components and connected ones on a meshconnected parallel computer,"SIAM J. Comput., vol. 9, pp. 744 757, Nov. 1980.
[28] D. Nath, S. N. Maheshwari, and P. C. P. Bhat, "Efficient VLSI networks for parallel processing based on orthogonal trees,"IEEE Trans. Comput., vol. C32, pp. 569581, June 1983.
[29] M. Snir, "Depthsize tradeoffs for parallel prefix computation,"J. Algorithms, vol. 7, pp. 165201, June 1986.
[30] J. Stevens, "A fast Fourier transform subroutine for the Illiac IV," Center for Advanced Computation, Univ. Illinois, Tech. Rep., 1971.
[31] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.
[32] Q. F. Stout, "Sorting, merging, selecting, and filtering on tree and pyramid machines (preliminary version)," inProc. 1983 Int. Conf. Parallel Processing, Aug. 1983, pp. 214221.
[33] Q. F. Stout, "Meshconnected computers with broadcasting,"IEEE Trans. Comput., vol. C32, pp. 826830, Sept. 1983.
[34] C. D. Thompson, "The VLSI complexity of sorting,"IEEE Trans. Comput., vol. C32, pp. 11711184, Dec. 1983.
[35] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263271, 1972.
[36] J. D. Ullman,Computational Aspects of VLSI, Rockville, MD: Computer Science Press, 1984.