A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network

Kichul Kim; C. S. Raghavendra

doi:10.1109/IPPS.1991.153810

A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network

Kichul Kim, C. S. Raghavendra

School of Electrical and Computer Engineering

University of Southern California

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

In this paper, we present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Our algorithm is based on balanced matrices and do not require any backtracking. This property is useful when pipelining is used with a single stage network and recirculation of data.

Original language	English
Title of host publication	Proceedings - 5th International Parallel Processing Symposium, IPPS 1991
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	398-403
Number of pages	6
ISBN (Electronic)	0818691670, 9780818691676
DOIs	https://doi.org/10.1109/IPPS.1991.153810
State	Published - 1991
Event	5th International Parallel Processing Symposium, IPPS 1991 - Anaheim, United States Duration: 30 Apr 1991 → 2 May 1991

Publication series

Name	Proceedings - 5th International Parallel Processing Symposium, IPPS 1991

Conference

Conference	5th International Parallel Processing Symposium, IPPS 1991
Country/Territory	United States
City	Anaheim
Period	30/04/91 → 2/05/91

Access to Document

10.1109/IPPS.1991.153810

Cite this

Kim, K., & Raghavendra, C. S. (1991). A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. In Proceedings - 5th International Parallel Processing Symposium, IPPS 1991 (pp. 398-403). Article 153810 (Proceedings - 5th International Parallel Processing Symposium, IPPS 1991). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPPS.1991.153810

@inproceedings{1726820b29ca414abb5f95111b8fc227,

title = "A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network",

abstract = "In this paper, we present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Our algorithm is based on balanced matrices and do not require any backtracking. This property is useful when pipelining is used with a single stage network and recirculation of data.",

author = "Kichul Kim and Raghavendra, {C. S.}",

note = "Publisher Copyright: {\textcopyright} 1991 IEEE.; 5th International Parallel Processing Symposium, IPPS 1991 ; Conference date: 30-04-1991 Through 02-05-1991",

year = "1991",

doi = "10.1109/IPPS.1991.153810",

language = "English",

series = "Proceedings - 5th International Parallel Processing Symposium, IPPS 1991",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "398--403",

booktitle = "Proceedings - 5th International Parallel Processing Symposium, IPPS 1991",

address = "United States",

}

Kim, K & Raghavendra, CS 1991, A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. in Proceedings - 5th International Parallel Processing Symposium, IPPS 1991., 153810, Proceedings - 5th International Parallel Processing Symposium, IPPS 1991, Institute of Electrical and Electronics Engineers Inc., pp. 398-403, 5th International Parallel Processing Symposium, IPPS 1991, Anaheim, United States, 30/04/91. https://doi.org/10.1109/IPPS.1991.153810

A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. / Kim, Kichul; Raghavendra, C. S.
Proceedings - 5th International Parallel Processing Symposium, IPPS 1991. Institute of Electrical and Electronics Engineers Inc., 1991. p. 398-403 153810 (Proceedings - 5th International Parallel Processing Symposium, IPPS 1991).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network

AU - Kim, Kichul

AU - Raghavendra, C. S.

PY - 1991

Y1 - 1991

N2 - In this paper, we present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Our algorithm is based on balanced matrices and do not require any backtracking. This property is useful when pipelining is used with a single stage network and recirculation of data.

AB - In this paper, we present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Our algorithm is based on balanced matrices and do not require any backtracking. This property is useful when pipelining is used with a single stage network and recirculation of data.

UR - http://www.scopus.com/inward/record.url?scp=36349032225&partnerID=8YFLogxK

U2 - 10.1109/IPPS.1991.153810

DO - 10.1109/IPPS.1991.153810

M3 - Conference contribution

AN - SCOPUS:36349032225

T3 - Proceedings - 5th International Parallel Processing Symposium, IPPS 1991

SP - 398

EP - 403

BT - Proceedings - 5th International Parallel Processing Symposium, IPPS 1991

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 5th International Parallel Processing Symposium, IPPS 1991

Y2 - 30 April 1991 through 2 May 1991

ER -

Kim K, Raghavendra CS. A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. In Proceedings - 5th International Parallel Processing Symposium, IPPS 1991. Institute of Electrical and Electronics Engineers Inc. 1991. p. 398-403. 153810. (Proceedings - 5th International Parallel Processing Symposium, IPPS 1991). doi: 10.1109/IPPS.1991.153810

A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this