
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Eskil Dekker, "Architecture Scalability of Parallel Vector Computers with a Shared Memory," IEEE Transactions on Computers, vol. 47, no. 5, pp. 614624, May, 1998.  
BibTex  x  
@article{ 10.1109/12.677257, author = {Eskil Dekker}, title = {Architecture Scalability of Parallel Vector Computers with a Shared Memory}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {5}, issn = {00189340}, year = {1998}, pages = {614624}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.677257}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Architecture Scalability of Parallel Vector Computers with a Shared Memory IS  5 SN  00189340 SP614 EP624 EPD  614624 A1  Eskil Dekker, PY  1998 KW  Architecture scalability KW  parallel vector computers KW  shared memory KW  sustainable peak performance KW  theoretical peak performance. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—Based on a model of a parallel vector computer with a shared memory, its scalability properties are derived. The processormemory interconnection network is assumed to be composed of crossbar switches of size
[1] C.N. Arnold, "Methods for Performance Evaluation of Algorithms and Computers," Computers in Physics, vol. 4, no. 5, pp. 514520, Sept./Oct. 1990.
[2] G. Bilardi and F.P. Preparata, "Horizons of Parallel Computation," J. Parallel and Distributed Computing, vol. 27, pp. 172182, 1996.
[3] G. Bell, “Ultracomputers: A Teraflop Before Its Time,” Comm. ACM, vol. 35, no. 8, pp. 2647, Aug. 1992.
[4] V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic.New York: Academic Press, 1965.
[5] C. Clos, "A Sudy of NonBlocking Switching Networks," Bell System Technical J., vol. 32, pp. 406424, Mar. 1953.
[6] D.M. Dias and J.R. Jump, "Analysis and Simulation of Buffered Delta Networks," IEEE Trans. Computers, vol. 30, no. 4, pp. 273282, Apr. 1981.
[7] J. Ding and L. Bhuyan,“Finite buffer analysis of multistage interconnection networks,” IEEE Trans. Computers, vol. 43, no. 2, pp. 243246, Feb. 1994.
[8] J.J. Dongarra, “Performance of Various Computers Using Standard Linear Equations Software,” Technical Report CS8985, Computer Science Dept., Univ. of Tennessee, K noxville, 1989.
[9] J.J. Dongarra, "The LINPACK Benchmark: An Explanation," Lecture Notes in Computer Science, vol. 297, pp. 456474.Berlin: Springer, 1988.
[10] T.Y. Feng, "A Survey of Interconnection Networks," Computer, vol. 14, no. 12, pp. 1227, Dec. 1981.
[11] G.H. Golub and C.F. Van Loan, Matrix Computations, second ed., chapter 3. Baltimore: The Johns Hopkins Univ. Press, 1989.
[12] J.J. Hack, "Peak vs. Sustained Performance in Highly Concurrent Vector Machines," Computer, vol. 19, no. 9, pp. 1119, Sept. 1986.
[13] M.D. Hill, "What Is Scalability?" Computer Architecture News, vol. 18, no. 4, pp. 1821, Dec. 1990.
[14] R.W. Hockney, "SuperComputer Architecture," Infotech State of the Art Report: Future Systems 2, pp. 277305.Maidenhead: Infotech, 1977.
[15] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGrawHill, 1993.
[16] V. Kumar and A. Gupta,“Analyzing scalability of parallel algorithms and architectures,”Dep. Comput. Sci., Univ. Minnesota, Minneapolis, MN, Tech. Rep. TR 9118, 1991; to appear inJ. Parallel and Distrib. Comput., 1994. A shorter version appears inProc. 1991 Int. Conf. Supercomput., 1991, pp. 396–405.
[17] D.H. Lawrie, "Access and Alignment of Data in an Array Processor," IEEE Trans. Computers, vol. 24, no. 12, pp. 1,1451,155, Dec. 1975.
[18] G.F. Lev, N. Pippenger, and L.G. Valiant, "A Fast Parallel Algorithm for Routing in Permutation Networks," IEEE Trans. Computers, vol. 30, no. 2, pp. 93100, Feb. 1981.
[19] Y. Mun and H.Y. Youn,“Performance analysis of finite buffered multistage interconnection networks,” IEEE Trans. Computers, vol. 43, no. 2, pp. 153162, Feb. 1994.
[20] D. Nassimi and S. Sahni, "A SelfRouting Benes Network and Parallel Permutation Algorithms," IEEE Trans. Computers, vol. 30, no. 5, pp. 332340, May 1981.
[21] D. Nassimi and S. Sahni, "Parallel Algorithms to SetUp the Benes Permutation Network," Proc. Workshop Interconnection Networks for Parallel and Distributed Processing, pp. 7071, 1980.
[22] D. Nussbaum and A. Agarwal,“Scalability of parallel machines,”Commun. ACM, vol. 34, pp. 57–61, 1991.
[23] J.H. Patel, "Performance of ProcessorMemory Interconnections for Multiprocessors," IEEE Trans. Computers, vol. 30, no. 10, pp. 771780, Oct. 1981.
[24] C.S. Raghavendra and R.V. Boppana,"On selfrouting in Benes and shuffleexchange networks," IEEE Trans. Computers, vol. 40, no. 9, pp.10571064, Sept. 1991.
[25] H.S. Stone, "Parallel Processing with the Perfect Shuffle," IEEE Trans. Computers, vol. 20, no. 2, pp. 153161, Feb. 1971.
[26] Y. Tamir and H.C. Chi, "Symmetric Crossbar Arbiters for VLSI Communication Switches," IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 1, 1993, pp. 1327.
[27] C.L. Wu and T.Y. Feng, "On a Class of Multistage Interconnection Networks," IEEE Trans. Computers, vol. 29, no. 8, pp. 694702, Aug. 1980.
[28] Y.M. Yeh, T.Y. Feng, "On a Class of Rearrangeable Networks," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,3611,379, Nov. 1992.
[29] H.Y. Youn and Y. Mun, "On Multistage Interconnection Networks with Small Clock Cycles," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 8693, Jan. 1995.