Designing Sorting Networks
A New Paradigm
(Sprache: Englisch)
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.
Voraussichtlich lieferbar in 3 Tag(en)
versandkostenfrei
Buch (Kartoniert)
54.99 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Designing Sorting Networks “
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.
Klappentext zu „Designing Sorting Networks “
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.
Inhaltsverzeichnis zu „Designing Sorting Networks “
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.
Bibliographische Angaben
- Autoren: Sherenaz W. Al-Haj Baddar , Kenneth E. Batcher
- 2011, 2011, XII, 136 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Verlag: Springer, Berlin
- ISBN-10: 1489989900
- ISBN-13: 9781489989901
Sprache:
Englisch
Kommentar zu "Designing Sorting Networks"
Schreiben Sie einen Kommentar zu "Designing Sorting Networks".
Kommentar verfassen