• DocumentCode
    1857326
  • Title

    Aviva sorting network

  • Author

    Bansal, Ankur

  • Author_Institution
    CSE, GNIT, Ambala, India
  • fYear
    2012
  • fDate
    28-29 Dec. 2012
  • Firstpage
    1
  • Lastpage
    4
  • 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).
  • Keywords
    computational complexity; mathematical analysis; parallel algorithms; sorting; Aviva sorting network; mathematical model; multiple input switching network; multiple output switching network; parallel computing machines; (N/2)*(log2N)2 Comparators; Parallel Computing; Sorting Network; Time Complexity O(log2N)2;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Power and Energy in NERIST (ICPEN), 2012 1st International Conference on
  • Conference_Location
    Nirjuli
  • Print_ISBN
    978-1-4673-1667-5
  • Type

    conf

  • DOI
    10.1109/ICPEN.2012.6492330
  • Filename
    6492330