Formal Construction of Joel's Permutation Networks and Their Setting Algorithms
Summary :
Formal descriptions for constructing a Joel's permutation network are discussed. We show that a setting algorithm of the network can be described in terms of bipartite graphs. We then study a fast parallel algorithm for setting the network. We show that it can be implemented by a parallel computer with N processors in O((log2 N)2) time, where N is the size of permutations produced on the network.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E64-E No.4 pp.235-242
- Publication Date
- 1981/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Automata and Languages
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shoji SAKURAZAWA, Yoshihide IGARASHI, "Formal Construction of Joel's Permutation Networks and Their Setting Algorithms" in IEICE TRANSACTIONS on transactions,
vol. E64-E, no. 4, pp. 235-242, April 1981, doi: .
Abstract: Formal descriptions for constructing a Joel's permutation network are discussed. We show that a setting algorithm of the network can be described in terms of bipartite graphs. We then study a fast parallel algorithm for setting the network. We show that it can be implemented by a parallel computer with N processors in O((log2 N)2) time, where N is the size of permutations produced on the network.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e64-e_4_235/_p
Copy
@ARTICLE{e64-e_4_235,
author={Shoji SAKURAZAWA, Yoshihide IGARASHI, },
journal={IEICE TRANSACTIONS on transactions},
title={Formal Construction of Joel's Permutation Networks and Their Setting Algorithms},
year={1981},
volume={E64-E},
number={4},
pages={235-242},
abstract={Formal descriptions for constructing a Joel's permutation network are discussed. We show that a setting algorithm of the network can be described in terms of bipartite graphs. We then study a fast parallel algorithm for setting the network. We show that it can be implemented by a parallel computer with N processors in O((log2 N)2) time, where N is the size of permutations produced on the network.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Formal Construction of Joel's Permutation Networks and Their Setting Algorithms
T2 - IEICE TRANSACTIONS on transactions
SP - 235
EP - 242
AU - Shoji SAKURAZAWA
AU - Yoshihide IGARASHI
PY - 1981
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E64-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1981
AB - Formal descriptions for constructing a Joel's permutation network are discussed. We show that a setting algorithm of the network can be described in terms of bipartite graphs. We then study a fast parallel algorithm for setting the network. We show that it can be implemented by a parallel computer with N processors in O((log2 N)2) time, where N is the size of permutations produced on the network.
ER -
English
