Matrix transpose on meshes with buses

In this paper we analyze the matrix transpose problem for 2- and 3-dimensional mesh architectures with row and column buses. First we consider the 2-dimensional problem, and we give a lower bound of approximately 0.45n for the number of steps required by any matrix transpose algorithm on an n×n mesh...

Full description

Saved in:
Bibliographic Details
Published in:Journal of parallel and distributed computing Vol. 96; pp. 194 - 201
Main Authors: Békési, József, Galambos, Gábor
Format: Journal Article
Language:English
Published: Elsevier Inc 01.10.2016
Subjects:
Algorithm analysis
Algorithms
Architecture
Buses (vehicles)
Computer networks
Distributed processing
Lower bounds
Matrix transpose
Mesh architecture
Matrix transpose
Mesh architecture
Algorithm analysis
ISSN:0743-7315, 1096-0848
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we analyze the matrix transpose problem for 2- and 3-dimensional mesh architectures with row and column buses. First we consider the 2-dimensional problem, and we give a lower bound of approximately 0.45n for the number of steps required by any matrix transpose algorithm on an n×n mesh with buses. Next we present an algorithm which solves this problem in less than 0.5n+9 steps. Finally, we prove that the given lower bound remains valid for the 3-dimensional case as well. •We analyze the matrix transpose problem for 2- and 3-dimensional mesh architectures with row- and column-buses.•We give a lower bound of approximately 0.45n for the number of steps required by any matrix transpose algorithm on an n x n mesh with buses.•We present an algorithm which solves this problem in less than 0.5n+9 steps.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0743-7315
1096-0848
DOI:10.1016/j.jpdc.2016.05.015