This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Augmented Data Manipulator Network in SIMD Environments
May 1988 (vol. 37 no. 5)
pp. 574-584
Formulas for the number of the augmented-data-manipulator (ADM)-passable permutations were given previously as cross-recurrence relations for the cardinalities of three specific subsets of such permutations. More concise, transparent recurrence formulas are derived utilizing a novel and conceptually simple model of the ADM. As a byproduct, a global control algorithm for the inverse ADM (IADM) i

[1] G. B. Adams and H. J. Siegel, "On the number of permutations performable by the augmented data manipulator networks,"IEEE Trans. Comput., vol. C-31, pp. 270-277, Apr. 1982.
[2] T. Feng, "Data manipulating functions in parallel processors and their implementations,"IEEE Trans. Comput., vol. C-23, pp. 309-318, Mar. 1974.
[3] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-25, pp. 1145-1155, Dec. 1975.
[4] M. D. Palmer Leland, "Properties and comparison of multistage interconnection networks for SIMD machines," Ph.D. dissertation, Univ. Wisconsin, Dec. 1983.
[5] M. D. Palmer Leland, "On the power of the augmented data manipulator network," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 74-78.
[6] R. J. McMillen and H. J. Siegel, "Dynamic rerouting tag schemes for the augmented data manipulator network," inProc. Symp. Comput. Architecture, 1980, pp. 505-516.
[7] R. J. McMillen and H. J. Siegel, "Routing schemes for the augmented data manipulator network in an MIMD system,"IEEE Trans. Comput., vol. C-31, pp. 184- 196, Dec. 1982.
[8] M. J. O'Donnell and C. H. Smith, "A combinatorial problem concerning processor interconnection networks,"IEEE Trans. Comput., vol. C-31, pp. 163-164, Feb. 1982.
[9] D. S. Parker and C. S. Raghavendra, "The Gamma network: A multiprocessor interconnnection network with redundant paths," inProc. 9th Annu. Symp. Comput. Architecture, Apr. 1982, pp. 73-80.
[10] H. J. Siegel and S. D. Smith, "Study of multistage SIMD interconnection networks," inProc. 5th Annu. Symp. Comput. Architecture, Apr. 1978, pp. 223-229.
[11] H. J. Siegel, "Interconnection networks for SIMD machines,"Computer, vol. 12, pp. 57-65, June 1979.
[12] H. J. Siegel, "The theory underlying the partitioning of permutation network,"IEEE Trans. Comput., vol. C-29, pp. 791-800, Sept. 1980.
[13] H. J. Siegel and R. J. McMillen, "Using the augmented data manipulator network in PASM,"Computer, pp. 25-33, Feb. 1981.
[14] H. J. Siegel and R. J. McMillen, "The multistage cube: A versatile interconnection network,"Computer, pp. 65-75, Dec. 1981.
[15] S. D. Smith, H. J. Siegel, R. J. McMillen, and G. B. Adams, "Use of the augmented data manipulator multistage network for SIMD machines," inProc. 1980 Int. Conf. Parallel Processing, Aug. 1980, pp. 75-78.

Index Terms:
omega passable permutations; ADM-passable permutations; augmented data manipulator network; cross-recurrence relations; transparent recurrence formulas; global control algorithm; inverse ADM; IADM-passable permutations; local control algorithms; signed bit difference tag control; destination tag control; multiprocessor interconnection networks; parallel processing.
Citation:
K.Y. Lee, D. Lee, "On the Augmented Data Manipulator Network in SIMD Environments," IEEE Transactions on Computers, vol. 37, no. 5, pp. 574-584, May 1988, doi:10.1109/12.4608
Usage of this product signifies your acceptance of the Terms of Use.