Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A regular Nnode bounded degree network for sorting N 2 keys with
 

Summary: A regular N­node bounded degree
network for sorting N 2 keys with
optimal speedup
Andreas Bieniek, Michael N¨olle, Gerald Schreiber
Technische Universit¨at Hamburg­Harburg
Technische Informatik I
Harburger Schloßstraße 20
D­21071 Hamburg, Germany
email: [bieniek, noelle, g­schreiber]@tu­harburg.d400.de
URL: http://www.ti1.tu­harburg.de
Proceedings of the Fourth International Workshop on Parallel
Image Analysis (IWPIA'95), S. Miguet and A. Montanvert 1995,
eds., LIP­ENS, Lyon, France, Dec. 1995, 253­­266
Abstract---
In this paper we present a new paral­
lel sorting algorithm called Shuffle Ring
Sort (SRS) for distributed memory sys­
tems with a regular bounded degree in­
terconnection network. Our algorithm
is optimal in the sense that it achieves a

  

Source: Albert-Ludwigs-Universität Freiburg, Institut für Informatik,, Lehrstuhls für Mustererkennung und Bildverarbeitung

 

Collections: Computer Technologies and Information Sciences