Cantitate/Preț
Produs

Designing Sorting Networks: A New Paradigm

Autor Sherenaz W. Al-Haj Baddar, Kenneth E. Batcher
en Limba Engleză Paperback – 25 ian 2014
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 31589 lei  43-57 zile
  Springer – 25 ian 2014 31589 lei  43-57 zile
Hardback (1) 32183 lei  43-57 zile
  Springer – 4 noi 2011 32183 lei  43-57 zile

Preț: 31589 lei

Preț vechi: 39486 lei
-20% Nou

Puncte Express: 474

Preț estimativ în valută:
6046 6302$ 5033£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781489989901
ISBN-10: 1489989900
Pagini: 148
Ilustrații: XII, 136 p.
Dimensiuni: 155 x 235 x 8 mm
Greutate: 0.22 kg
Ediția:2011
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States

Public țintă

Professional/practitioner

Cuprins

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.

Caracteristici

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