Overview
- 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
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (17 chapters)
-
Front Matter
-
Back Matter
Keywords
About this book
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.
Authors and Affiliations
Bibliographic Information
Book Title: Designing Sorting Networks
Book Subtitle: A New Paradigm
Authors: Sherenaz W. Al-Haj Baddar, Kenneth E. Batcher
DOI: https://doi.org/10.1007/978-1-4614-1851-1
Publisher: Springer New York, NY
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Science+Business Media, LLC 2011
Hardcover ISBN: 978-1-4614-1850-4
Softcover ISBN: 978-1-4899-8990-1
eBook ISBN: 978-1-4614-1851-1
Edition Number: 1
Number of Pages: XII, 136
Topics: Data Structures, Arithmetic and Logic Structures, Models and Principles