A Unified theory of interconnection network structure
Theoretical Computer Science
Better understanding of Batcher's merging networks
Discrete Applied Mathematics
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Transactions on Programming Languages and Systems (TOPLAS)
A high-speed sorting procedure
Communications of the ACM
Notes on merging networks (Prelimiary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A logarithmic time sort for linear size networks
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
The new class of g-chain periodic sorters
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Journal of the ACM (JACM)
A combinatorial treatment of balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A combinatorial treatment of balancing networks
Journal of the ACM (JACM)
Contention in shared memory algorithms
Journal of the ACM (JACM)
A framework for simple sorting algorithms on parallel disk systems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Contention in balancing networks resolved (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Sorting and counting networks of small depth and arbitrary width
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Distributed algorithms visualisation for educational purposes
ITiCSE '99 Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education
Periodification scheme: constructing sorting networks with constant period
Journal of the ACM (JACM)
Periodic, random-fault-tolerant correction networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A note on constructing binary heaps with periodic networks
Information Processing Letters
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
The Design and Verification of a Sorter Core
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Self-Stabilizing Smoothing and Counting
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Counting networks with arbitrary fan-out
Distributed Computing
Fast and approximate stream mining of quantiles and frequencies using graphics processors
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Fast periodic correction networks
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Research note: Networks for sorting multitonic sequences
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Cache-efficient numerical algorithms using graphics hardware
Parallel Computing
CellSort: high performance sorting on the cell processor
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The impact of randomization in smoothing networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A Practical Quicksort Algorithm for Graphics Processors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Smoothed Analysis of Balancing Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A randomized, o(log w)-depth 2 smoothing network
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Evolving compare-exchange networks using grammars
Artificial Life
Simulating the bitonic sort using P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Expressive array constructs in an embedded GPU kernel programming language
DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
Sorting on GPUs for large scale datasets: A thorough comparison
Information Processing and Management: an International Journal
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
A periodic sorting network consists of a sequence of identical blocks. In this paper, the periodic balanced sorting network, which consists of log n blocks, is introduced. Each block, called a balanced merging block, merges elements on the even input lines with those on the odd input lines.The periodic balanced sorting network sorts n items in O([log n]2) time using (n/2)(log n)2 comparators. Although these bounds are comparable to many existing sorting networks, the periodic structure enables a hardware implementation consisting of only one block with the output of the block recycled back as input until the output is sorted. An implementation of our network on the shuffle exchange interconnection model in which the direction of the comparators are all identical and fixed is also presented.