Please use this identifier to cite or link to this item:
Title: It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
Authors: Sanpawat Kantabutra
Wattana Jindaluang
Prapaporn Techa-angkoon
Keywords: Computer Science
Issue Date: 1-Dec-2005
Abstract: Several parallel architectures exist in computer science literature. Motivated by the experimental overlapping connectivity network, we propose a new theoretical network called a completely overlapping network (CON). This network is an extension of the overlapping connectivity network with multiple buses. In this paper we investigate some properties of this network and demonstrate the use of CON and its usefulness by solving two toy problems: decimal number and one-digit binary number sortings. © Springer-Verlag Berlin Heidelberg 2005.
ISSN: 16113349
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.

Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.