Advertisement
Published in:
2005 | OriginalPaper | Chapter
It’s Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network
Authors : Sanpawat Kantabutra, Wattana Jindaluang, Prapaporn Techa-angkoon
Published in: Parallel and Distributed Processing and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.