It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network

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

全面介紹

Saved in:
書目詳細資料
Main Authors: Kantabutra S., Jindaluang W., Techa-angkoon P.
格式: Conference or Workshop Item
語言:English
出版: 2014
在線閱讀:http://www.scopus.com/inward/record.url?eid=2-s2.0-33646680497&partnerID=40&md5=79fd5918f7a9c65708ef2b5db480d7dd
http://cmuir.cmu.ac.th/handle/6653943832/4911
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Chiang Mai University
語言: English
id th-cmuir.6653943832-4911
record_format dspace
spelling th-cmuir.6653943832-49112014-08-30T02:55:56Z It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network Kantabutra S. Jindaluang W. Techa-angkoon P. 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. 2014-08-30T02:55:56Z 2014-08-30T02:55:56Z 2005 Conference Paper 3540297693; 9783540297697 03029743 10.1007/11576235_30 67303 http://www.scopus.com/inward/record.url?eid=2-s2.0-33646680497&partnerID=40&md5=79fd5918f7a9c65708ef2b5db480d7dd http://cmuir.cmu.ac.th/handle/6653943832/4911 English
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
language English
description 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.
format Conference or Workshop Item
author Kantabutra S.
Jindaluang W.
Techa-angkoon P.
spellingShingle Kantabutra S.
Jindaluang W.
Techa-angkoon P.
It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
author_facet Kantabutra S.
Jindaluang W.
Techa-angkoon P.
author_sort Kantabutra S.
title It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
title_short It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
title_full It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
title_fullStr It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
title_full_unstemmed It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
title_sort it's elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network
publishDate 2014
url http://www.scopus.com/inward/record.url?eid=2-s2.0-33646680497&partnerID=40&md5=79fd5918f7a9c65708ef2b5db480d7dd
http://cmuir.cmu.ac.th/handle/6653943832/4911
_version_ 1681420326047580160