Cited By
View all- Oruç AThirumalai A(1989)A Systematic Design of Cellular Permutation ArraysIEEE Transactions on Computers10.1109/12.3583838:10(1447-1451)Online publication date: 1-Oct-1989
Linear-time algorithms for programming cellular permutation arrays
Pages 129 - 136
References
[1]
S. Bandyopadhyayo S. Basu and K. Choudhury, "A cellular permuter stray," IEEE Trans. Comput., Vol. C-21, pp. 1116- 1119, Oct. 1972.
[2]
~. G. Bones, }!it}tltlltlill lhAixli ol Connectint HO. LKRLkl and Telephone T, tStiit, Academic Press Pub. Company, Nov York, lOSS.
[3]
V. E. Banes, .Permutation groups, complexes, and rearrangeable connecting networks," BST3, Vol. 43, pp. 1619-1640, luly 1964.
[4]
T. Fang, "A survey of interoonnection networks," Computer, Vol. 14, pp. 12-27, Dos. 1981.
[5]
J'. Gecsei, "Interoonnection networks from three-state cells," IEEE Trans. Comput., Vol. C-26, pp. 705-711. Aug. 1977.
[6]
7. Geosei and 3.-P. Btassard, "The topology of cellular partitioning networks," iEEE Trans. Comput., Vol. C-30, pp. 164-168, Feb. 1981.
[7]
#. Hall, 7r., Tb~ ThtRi:I Ri G;,RURI, Chelsea Pub, Company, New York, 1976.
[8]
A. E. loel, "On permutation switching network.," BST~, pp. 813-822. a 8 y- ~ u n ~ 1968.
[9]
W. B. Kautz, r. N. Levitt and A. Waksman, "Cellular interconnection arrays," IEEE Trans. Comput., Vol. C-17, pp. 443-451, May 1968.
[10]
G. F. Lev, N. Pippenger and L. G. Valiant, 'A fast parallel algorithm for routing in permutation networks,tl IEEE Trans. Comput., Vol. C-30, pp. 93-100, Feb. 1981.
[11]
S. A. Nadkarni, "The design and performance evaluation of hybrid cellular interconnection arrays," M. Sc. Thesis, Rensselaer Polytechnic Institute, Troy, N.Y., Aug. 1985.
[12]
D. Nass imi and S. Sahni, 'Para 1 1 ~ 1 algorithms to set up the Benes permutation network," IEEE Trans. Comput., Vol. C-31, pp. 148-154, Feb. 1982.
[13]
D. C. Opferman and N. T. Tsao-Wu, "On a class of zearrangeable switching networks," BSTT, pp. 1579-1618, May-Tune 1971.
[14]
Y. A. Ozuc, "Designing cellular permutation arrays through decomposition of symmetric groups into cosets,' Submitted for publication.
[15]
~. A. Oruc and D. Prakash, "Routing algorithms for cellular interconnection arrays," 1}~EE Trans. Comput., Vol. C-33, pp. 769-762, Aug. 1984.
[16]
Y. A. Oruc and M. Mittal, J~New algorithms for realizing paths and permutations through cube-connected networks." These Proceedings.
[17]
D. S. Parker, 3r., otes on shuffle/exchange-type switching networks," iEBE Trans. Comput., Vol. C-29, pp. 213- 222, Mar. 1980.
[18]
D. S. Parker, 7r., "New points of view on three-stage rearrangeable switching networks, In Prec. of Workshop on Interconnect ion Networks," 1980, IEEE Comp. Society Pub., pp. 56-63.
[19]
H. S. Stone, '~Parallel processing with the perfect shuffle," IEEE Trans. Comput., Vol. C-20, pp.153-161, Feb. 1971.
[20]
K. 7. Thurbor, ermutation switching networks," In Prec. of the 1971 Computer Designers' Conference, pp. 7-24, 7an. 1971.
[21]
r. 7. Thuzber, 'Intezconnection networks- A survey and assessment," In Prec. of Nat'1 Comp. Conf., 1974, pp. 909-919.
[22]
K. 7. Thurber, "Circuit switching technology: A state of the art survey,fi In Prec. of COMPCON, Fall 1978, pp. 116-124, Sept. 1978.
[23]
W. A. Waksman, A permutation network," 7ACM, pp. 159-163, May 1968.
[24]
C. W. Wu and T. Feng, "The reverseexchange interconnection network," IEEE Trans. Comput., Vol. C-29, pp. 801-811, Sept. 1980.
[25]
C. W. Wu and T. Feng, "The universality of shuffle-exchange network," IEEE Trans. Comput., Vol. C-30, pp. 324-332, May 1981.
Recommendations
Routing Algorithms for Cellular Interconnection Arrays
The paper describes an algebraic model which provides a means for realizing an arbitrary permutation through various cellular-array-type networks. The model views a cellular array as an ordered set of transposition maps where each transposition ...
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
It is shown by simulation that every language accepted within time $n^d$ by a nondeter-ministic one-dimensional Turing machine is accepted in linear time by a nondeterministic d-dimensional iterative array. Conversely, every language accepted in linear ...
Permutation Cellular Automata
Permutation cellular automata are cellular automata defined by using finite maximal prefix codes. The overall dynamics of onesided and twosided permutation cellular automata is studied. For some classes of permutation cellular automata including the ...
Comments
Information & Contributors
Information
Published In
Copyright © 1986 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 1986
Check for updates
Qualifiers
- Article
Conference
ICMI05
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 163Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)4
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
Cited By
View all- Oruç AThirumalai A(1989)A Systematic Design of Cellular Permutation ArraysIEEE Transactions on Computers10.1109/12.3583838:10(1447-1451)Online publication date: 1-Oct-1989
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in