Preface.- Early History.- Software Implementations.- POSETS.- The 0/1-Principle.- A 16-Key Sorting Network.- The Sortnet Program.- Divide & Conquer.- Counting Strangers.- Finding Better Networks.- Lattice Theory.- The AKS Sorting Network.- Ideas For Faster Networks.- BOOL(N).- Sorting Networks For Large N.- Another Way Of Handling Strangers.- Thoughts On Minimizing Strangers.- Case Studies.- Appendix I: Proofs of Theorems.- Index.
Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an easy, intuitive manner.
This book also outlines new ideas and techniques for designing faster sorting networks using Sortnet, and illustrates how these techniques were used to design faster 12-key and 18-key sorting networks through a series of case studies.
Finally, it examines and explains the mysterious behavior exhibited by the fastest-known 9-step 16-key network. Designing Sorting Networks: A New Paradigm is intended for advanced-level students, researchers and practitioners as a reference book. Academics in the fields of computer science, engineering and mathematics will also find this book invaluable.
Illustrates recent proofs of Bitonic and Odd-Even merge sorting algorithms, presented directly by the original developer of these parallel sorting algorithms
Provides an in-depth analysis of the use of 0/1 cases, partial order sets and Haase diagrams in designing and analyzing sorting networks
Outlines new ideas and techniques for designing faster sorting networks using Sortnet, and highlights how these techniques helped design faster 12-key and 18-key sorting networks