Very Efficient Cyclic Shifts on Hypercubes

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.


Cyclic shifts are intrinsic operations in many parallel algorithms. Therefore, it is important to execute them efficiently. In this note, we present and analyze an algorithm for the cyclic shift operation on n -dimensional (distributed memory) hypercubes. On asynchronous hypercubes, we have shown that all previously known algorithms for cyclic shifts need local message buffers. In order to overcome this, we present an algorithm that always uses link-disjoint paths for routing. We prove that by using this algorithm, any cyclic shift can be realized by using at most n steps, without using any local message buffers.

Document Type: Research Article

Affiliations: 1: Industrial Technology Research Institute, Computer & Communication Research Lab, 195 Chung Hsing Rd., Hsinchu, Taiwan, 31015, Republic of China 2: Courant Institute, New York University, 251 Mercer Street, New York, New York, 10012

Publication date: November 1, 1996

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more