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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of parallel and distributed computing Jg. 96; S. 194 - 201
Hauptverfasser:	Békési, József, Galambos, Gábor
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.10.2016
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!