
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A.Y. Sips, M. Lin, "Setup Algorithms for CubeConnected Parallel Computers Using Recursive Karnaugh Maps," IEEE Transactions on Computers, vol. 40, no. 2, pp. 217221, February, 1991.  
BibTex  x  
@article{ 10.1109/12.73592, author = {A.Y. Sips and M. Lin}, title = {Setup Algorithms for CubeConnected Parallel Computers Using Recursive Karnaugh Maps}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {2}, issn = {00189340}, year = {1991}, pages = {217221}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.73592}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Setup Algorithms for CubeConnected Parallel Computers Using Recursive Karnaugh Maps IS  2 SN  00189340 SP217 EP221 EPD  217221 A1  A.Y. Sips, A1  M. Lin, PY  1991 KW  setup algorithms; cubeconnected parallel computers; recursive Karnaugh maps; paths; transpositions; cycles; onepass permutations; transportations; cycles; time complexities; computational complexity; parallel algorithms. VL  40 JA  IEEE Transactions on Computers ER   
Optimal setup procedures for cubeconnected networks are described. The setup patterns include paths, transpositions, cycles, and onepass permutations. It is shown that for an Ninput cubeconnected network, the procedure for paths requires O(log/sub 2/ N) steps and O(N) space, the procedure for transportations and cycles requires O(N) steps and O(N) space, and the procedure for permutations takes O(N log/sub 2/ N) steps and O(N) space. It is also shown that the time complexities of the setup procedures for transpositions, cycles, and permutations can be improved as O(log/sub 2/ N) by using O(N) processors.
[1] L. N. Bhuyan and D. P. Agrawal, "Design and performance of generalized interconnection networks,"IEEE Trans. Comput., vol. C32, no. 12, pp. 10811090, Dec. 1983.
[2] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C33, no. 4, pp. 323333, Apr. 1983.
[3] T. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, no. 12, pp. 1217, Dec. 1981.
[4] J. P. Hayeset al., "A microprocessorbased hypercube supercomputer,"IEEE Micro, vol. 6, pp. 617, Oct. 1986.
[5] S.T. Huang and S. K. Tripathi, "Finite state model and compatibility theory: New analysis tools for permutation networks,"IEEE Trans. Comput., vol. C35, no. 7, pp. 591601, July 1986.
[6] M. Karnaugh, "The map method for synthesis of combinational logic circuits,"AIEE Trans., vol. 72, no. 9, pp. 593599, Sept. 1953.
[7] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, no. 12, pp. 11451155, Dec. 1975.
[8] K. Y. Lee, "On the rearrangeability of 2(log2N)  1 stage permutation networks,"IEEE Trans. Comput., vol. C34, no. 5, pp. 412425, May 1985.
[9] A. Y. Oruçand M. Mittal, "New algorithms for realizing paths and permutations through cubeconnected networks," inProc. ACM Comput. Sci. Conf., Cincinnati, OH, Feb. 1986, pp. 137146.
[10] J. H. Patel, "Performance of processormemory interconnections for muItiprocessors,"IEEE Trans. Comput., vol. C30, no. 10, pp. 771780, Oct. 1981.
[11] M. C. Pease, "The indirect binaryNcube multiprocessor array,"IEEE Trans. Comput., vol. C26, no. 5, pp. 458473, May 1977.
[12] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[13] H. J. Siegel,Interconnection Networks for LargeScale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[14] D. Steinberg, "Invariant properties of the shuffleexchange and simplified costeffective version of the omega network,"IEEE Trans. Comput., vol. C32, no. 5, pp. 444450, May 1983.
[15] C.L. Wu and T. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C29, no. 8, pp. 694702, Aug. 1980.
[16] C.L. Wu and T. Feng, "The reverseexchange interconnection network,"IEEE Trans. comput., vol. C29, no. 9, pp. 801810, Sept. 1980.