
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rong Lin, Stephan Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 1, pp. 93102, January, 1995.  
BibTex  x  
@article{ 10.1109/71.363407, author = {Rong Lin and Stephan Olariu}, title = {Reconfigurable Buses with Shift Switching: Concepts and Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {1}, issn = {10459219}, year = {1995}, pages = {93102}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.363407}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Reconfigurable Buses with Shift Switching: Concepts and Applications IS  1 SN  10459219 SP93 EP102 EPD  93102 A1  Rong Lin, A1  Stephan Olariu, PY  1995 VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] A. Aggarwal,“Optimal bounds for finding maximum on array of processors with$k$global buses,”IEEE Trans. Comput., vol. C35, 62–64, 1986.
[2] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[3] H. M. Alnuweiri, M. Alimuddin, and Aljunaidi,“Switch models and reconfigurable networks: Tutorial and partial survey,”Proc. Workshop on Reconfigurable Architectures: 8th Int. Parallel Processing Symp., Cancun, Mexico, 1994.
[4] Y. BenAsher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139153, Oct. 1991.
[5] G. Bilardi, M. Pracchi, and F. P. Preparata,“A critique of network speed in VLSI models of computation,”IEEE Trans. SolidState Circuits, vol. SC17, pp. 696–702, 1982.
[6] S. H. Bokhari,“Finding maximum on an array processor with a global bus,”IEEE Trans. Comput., vol. C33, pp. 133–139, 1984.
[7] J. J. F. Cavanaugh,Digital Computer Arithmetic Design and Implementation. New York: McGrawHill, 1984.
[8] D. G. Feitelson,Optical Computing. Cambridge, MA: MIT, 1988.
[9] J. Jang and V. K. Prasanna,“An optimal sorting algorithm on reconfigurable mesh,”inProc. Int. Parallel Process. Symp., 1992, pp. 130–137.
[10] J. Jang, H. Park, and V. K. Prasanna,“A bit model of the reconfigurable mesh,”Proc. Workshop on Reconfigurable Architectures, 8th Int. Parallel Processing Symp., Cancun, Mexico, 1994.
[11] H. T. Kung and C. E. Leiserson,“Algorithms for VLSI processor arrays,”in C. Mead and L. Conway, Eds.,Introduction to VLSI Systems. Reading, MA: AddisonWesley, 1980.
[12] D. Kim and K. Hwang,“Meshconnected array processors with bypass capability for signal/image processing,”inProc. HICSS, 1988.
[13] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[14] H. Li and M. Maresca,“Polymorphictorus network,”IEEE Trans. Comput., vol. 38, pp. 1345–1351, Sept. 1989.
[15] ——,“Polymorphictorus architecture for computer vision,”IEEE Trans. Pattern Anal. and Machine Intell., vol. 11, pp. 233–243, Mar. 1989.
[16] H. Li and Q. Stout,Reconfigurable Massively Parallel Computers.Englewood Cliffs, NJ: PrenticeHall, 1991.
[17] R. Lin,“Reconfigurable buses with shift switching: VLSI radix sort,”Proc. Int. Conf. Parallel Processing, vol. III, 1992, pp. 2–9.
[18] R. Lin and S. Olariu,“Computing the inner product on reconfigurable buses with shift switching,”Proc. Int. Conf. Parallel Processing, Vector and Parallel Processors, 1992, pp. 181–192.
[19] ——, Reconfigurable buses with shift switching: Architectures and applications,”Proc. Int. Phoenix Conf. Comput. Commun., 1993, pp. 23–29.
[20] R. Lin, S. Olariu, J. Schwing, and J. Zhang,“Sorting in$O(1)$time on an reconfigurable mesh,”Proc. 9th Eur. Workshop on Parallel Computing, 1992, pp. 16–27.
[21] M. Maresca, H. Li, and P. Baglietto,“Hardware support for fast reconfigurability in processor arrays,”Proc. Int. Conf. Parallel Processing, vol. I, 1993, pp. 282–289.
[22] R. Miller, V. K. P. Kumar, D. Reisis, and Q. F. Stout,“Parallel computations on reconfigurable meshes,”IEEE Trans. Comput., vol. 42, pp. 678–692, 1993.
[23] M. Nigam and S. Sahni,“Sorting$n$numbers on$n \times n$reconfigurable mesh with buses,”Tech. Rep. TR9204CIS, Univ. of Florida, 1992.
[24] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173190, 1987.
[25] J. Rothstein,“Bus automata, brains, and mental models,”IEEE Trans. Syst., Man, Cybernetics, vol. 18, pp. 522–531, 1988.
[26] D. B. Shu and J. G. Nash,“The gated interconnection network for dynamic programming,”in S. K. Tewsburget al., Eds.,Concurrent Computations. New York: Plenum, 1988.
[27] D. B. Shu, L. W. Chow, and J. G. Nash,“A constant addressable, bit serial associate processor,”Proc. IEEE Workshop on VLSI Signal Processing, Monterey CA, Nov. 1988.
[28] E. E. Swartzlander,Computer Arithmetic,, vol. 1. Los Alamitos, CA: IEEE Computer Society, 1990.
[29] ——,“Parallel counters,”IEEE Trans. Comput., vol. C22, pp. 1021–1024 1973.
[30] J. D. Ullman,Computational Aspects of VLSI. Potomac, MD: Computer Science Press, 1983.
[31] B. F. Wang, C. J. Lu, and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor array with reconfigurable bus system,”IEEE Trans. Parallel Distrib. Syst., vol. 1, pp. 500–507, 1990.