Apress Windows 10 Release Sale

Designing Sorting Networks

A New Paradigm

By Sherenaz W. Al-Haj Baddar , Kenneth E. Batcher

  • eBook Price: $69.99
Buy eBook Buy Print Book

Designing Sorting Networks Cover Image

This book helps improve the efficiency of sorting networks using 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an intuitive manner. Offers tips and techniques for designing faster sorting networks using Sortnet.

Full Description

  • Add to Wishlist
  • ISBN13: 978-1-4614-1850-4
  • 146 Pages
  • User Level: Professionals
  • Publication Date: February 2, 2012
  • Available eBook Formats: PDF

Related Titles

  • Information Systems and Neuroscience
  • BPM - Driving Innovation in a Digital World
  • Data-Driven Process Discovery and Analysis
  • Physical Asset Management
  • Transactions on Large-Scale Data- and Knowledge-Centered Systems XVIII
  • UML @ Classroom
  • AIDA-CMK: Multi-Algorithm Optimization Kernel Applied to Analog IC Sizing
  • Computational Color Imaging
  • Uncertainty Quantification in Computational Fluid Dynamics and Aircraft Engines
  • Non-Linear Finite Element Analysis in Structural Mechanics
Full Description
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.
Table of Contents

Table of Contents

  1. Preface.
  2. Early History.
  3. Software Implementations.
  4. POSETS.
  5. The 0/1
  6. Principle.
  7. A 16
  8. Key Sorting Network.
  9. The Sortnet Program.
  10. Divide & Conquer.
  11. Counting Strangers.
  12. Finding Better Networks.
  13. Lattice Theory.
  14. The AKS Sorting Network.
  15. Ideas For Faster Networks.
  16. BOOL(N).
  17. Sorting Networks For Large N.
  18. Another Way Of Handling Strangers.
  19. Thoughts On Minimizing Strangers.
  20. Case Studies.
  21. Appendix I: Proofs of Theorems.
  22. Index.

Please Login to submit errata.

No errata are currently published


    1. Pro SQL Server Internals


      View Details

    2. Beginning 3D Game Development with Unity 4


      View Details

    3. Beginning iPhone Development with Swift


      View Details

    4. Financial Modeling for Business Owners and Entrepreneurs


      View Details