
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
W. Lin, "Manipulating General Vectors on Synchronous Binary NCube," IEEE Transactions on Computers, vol. 42, no. 7, pp. 863871, July, 1993.  
BibTex  x  
@article{ 10.1109/12.237726, author = {W. Lin}, title = {Manipulating General Vectors on Synchronous Binary NCube}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {7}, issn = {00189340}, year = {1993}, pages = {863871}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.237726}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Manipulating General Vectors on Synchronous Binary NCube IS  7 SN  00189340 SP863 EP871 EPD  863871 A1  W. Lin, PY  1993 KW  general vectors manipulation; encoding; decoding; synchronous binary ncube; arbitrary length; merge; split; rotation; reverse; compression; expansion; data parallelism; image processing; collisionfree vector manipulations; formal network model; collisionfree routine; manipulating functions; data communication; optimal timesingle network cycle; multiprocessor interconnection networks; vector processor systems. VL  42 JA  IEEE Transactions on Computers ER   
The author describes efficient manipulations of general vectors on the synchronous binary ncube structure. A general vector is defined as a set of elements stored in consecutive processors with arbitrary length and starting point, and one element per processor. New routing methods for manipulating general vectors are presented. The author focuses on six major vector manipulating functions: merge, split, rotation, reverse, compression, and expansion. They are frequently used to extract and structure data parallelism in image processing and parallel solutions of linear systems. It is observed that varying the dimension order is a key to collisionfree vector manipulations. A formal network model is developed for determining when link collisions occur. With the aid of this network model dimension orders yielding collisionfree routine for the six manipulating functions are identified. Collisionfree routing allows data communication to complete in the optimal timesingle network cycle. The dimension orders are easy to encode and decode, and they are feasible for physical implementation.
[1] K. Padmanabhan, "Cube structure for multiprocessors,"Commun. ACM, vol. 33, pp. 4352, 1990.
[2] D. H. Lawrie, "Access and alignment of data in array processors,"IEEE Trans. Comput., vol. C24, no. 12, pp. 11451155, Dec. 1975.
[3] M. C. Pease, III, "The indirect binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, no. 5, pp. 458473, May 1977.
[4] Y. Lan and L. Ni, "Relay approach message routing in hypercube multiprocessors," inProc. 3rd Int. Conf. Supercomputing, vol. III, pp. 174182, May 1988.
[5] Y. Saad and M. H. Schultz, "Data communication in hypercubes,"J. Parallel Distributed Comput., vol. 6, pp. 115135, 1989.
[6] C. T. Ho and S. L. Johnsson, "Distributed routing algorithms for broadcasting and personalized communication in hypercubes," inProc. 1986 Int. Conf. Parallel Processing, pp. 640648, Aug. 1986.
[7] T. Szymansky, "On the permutation capability of a circuitswitched hypercube," inProc. 1989 Int. Conf. Parallel Processing, vol. 1, pp. 103110, Aug. 1989.
[8] J. L. Gustafson, G. R. Montry, and R. E. Benner, "Development of parallel methods for a 1024 processor hypercube,"SIAM J. Sci. Stat. Comput., vol. 9, no. 4, pp. 609638, July 1988.
[9] W.J. Dally and C.L. Seitz, "DeadlockFree Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[10] L. W. Tucker and G. G. Robertson, "Architecture and applications of the connection machine,"Computer, pp. 2638, Aug. 1988.
[11] D. Nassimi and S. Sahni, "Optimal BPC permutations on a cube connected SIMD network,"IEEE Trans. Comput., pp. 338341, Apr. 1982.
[12] C. S. Rghavendra and M. A. Sridhar, "Optimal routing of bitpermutes on hypercube machines," inProc. 1990 Int. Conf. Parallel Processing, pp. 286290.
[13] S. Ranka and S. Sahni, "Hypercube algorithms for image transformation," inProc. 1989 Int. Conf. Parallel Processing, Aug. 1989, pp. 2431.
[14] W. Lin, "A dimensionscrambling approach to fast hypercube data permutations," inProc. 1990 Int. Conf. Parallel Processing, Aug. 1990, pp. 119122.
[15] R. K. Montoye and D. H. Lawrie, "A practical algorithm for the solution of triangular systems on a parallel processing system,"IEEE Trans. Comput., vol. C31, no. 11, pp. 10761082, Nov. 1982.