{"title":"Aviva sorting network","authors":"Avinash Bansal","doi":"10.1109/ICPEN.2012.6492330","DOIUrl":null,"url":null,"abstract":"A sorting network is a mathematical model which can be used as a multiple-input, multiple-output switching network [1]. Sorting network has been one of the most critical applications on parallel computing machines. Many classic textbooks on algorithms like Thomas H. Cormen, therefore considered this problem in great detail and listed many sorting network for this purpose [2]. Sorting networks CLR90, Sav98 turned out to be convenient mean to describe certain parallel sorting algorithms [2]. In this paper we have introduced a new sorting network having time complexity (log2N)2 of theoretically and practically, where N is the number of elements. This network has a special feature it will always give the data in the required sequence (ascending or descending order) and feed the input from any direction (moving from left to right or from right to left).","PeriodicalId":336723,"journal":{"name":"2012 1st International Conference on Power and Energy in NERIST (ICPEN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 1st International Conference on Power and Energy in NERIST (ICPEN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPEN.2012.6492330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A sorting network is a mathematical model which can be used as a multiple-input, multiple-output switching network [1]. Sorting network has been one of the most critical applications on parallel computing machines. Many classic textbooks on algorithms like Thomas H. Cormen, therefore considered this problem in great detail and listed many sorting network for this purpose [2]. Sorting networks CLR90, Sav98 turned out to be convenient mean to describe certain parallel sorting algorithms [2]. In this paper we have introduced a new sorting network having time complexity (log2N)2 of theoretically and practically, where N is the number of elements. This network has a special feature it will always give the data in the required sequence (ascending or descending order) and feed the input from any direction (moving from left to right or from right to left).
排序网络是一种可以作为多输入、多输出交换网络的数学模型[1]。分拣网络已经成为并行计算机上最关键的应用之一。因此,许多关于算法的经典教科书,如Thomas H. Cormen,都非常详细地考虑了这个问题,并列出了许多用于此目的的排序网络[2]。排序网络CLR90、Sav98被证明是描述某些并行排序算法的方便代名词[2]。本文介绍了一种新的排序网络,其时间复杂度(log2N)为理论和实践的2,其中N为元素个数。这个网络有一个特殊的特性,它总是按照所需的顺序(升序或降序)提供数据,并从任何方向(从左到右或从右到左)提供输入。