A Lower Bound For Sorting Networks That Use The Divide Sort Merge Strategy PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download A Lower Bound For Sorting Networks That Use The Divide Sort Merge Strategy PDF full book. Access full book title A Lower Bound For Sorting Networks That Use The Divide Sort Merge Strategy.
Author | : Stanford University. Stanford Electronics Laboratories. Digital Systems Laboratory |
Publisher | : |
Total Pages | : 52 |
Release | : 1971 |
Genre | : Sorting (Electronic computers) |
ISBN | : |
Download A lower bound for sorting networks that use the divide-sort-merge strategy Book in PDF, ePub and Kindle
Let M sub g (g sup(K+1)) represent the minimum number of comparators required by a network that merges g ordered sets containing g sup K members each. In the paper the author proves that M sub g(g(sup K+1))>or= g(m sub g)(g supK)+ the summation from i=2 to g of ((i-1)g/i). From this relation the author is able to show that an N-sorter which uses the g-way divide-sort-merge strategy recursively must contain about N(log to the base 2 of N) squared comparators. (Author).
Author | : D. C. Van Voorhis |
Publisher | : |
Total Pages | : 90 |
Release | : 1971 |
Genre | : Sorting (Electronic computers) |
ISBN | : |
Download A generalization of the divide-sort-merge strategy for sorting networks Book in PDF, ePub and Kindle
Author | : David Curtis Van Voorhis |
Publisher | : |
Total Pages | : 404 |
Release | : 1971 |
Genre | : Sorting (Electronic computers) |
ISBN | : |
Download Efficient Sorting Networks Book in PDF, ePub and Kindle
Author | : Sherenaz W. Al-Haj Baddar |
Publisher | : Springer Science & Business Media |
Total Pages | : 132 |
Release | : 2012-02-02 |
Genre | : Computers |
ISBN | : 1461418518 |
Download Designing Sorting Networks Book in PDF, ePub and Kindle
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.
Author | : Joseph Y. Hui |
Publisher | : Springer Science & Business Media |
Total Pages | : 356 |
Release | : 2012-12-06 |
Genre | : Technology & Engineering |
ISBN | : 1461532647 |
Download Switching and Traffic Theory for Integrated Broadband Networks Book in PDF, ePub and Kindle
The rapid development of optical fiber transmission technology has created the possibility for constructing digital networks that are as ubiquitous as the current voice network but which can carry video, voice, and data in massive qlJantities. How and when such networks will evolve, who will pay for them, and what new applications will use them is anyone's guess. There appears to be no doubt, however, that the trend in telecommunication networks is toward far greater transmission speeds and toward greater heterogeneity in the requirements of different applications. This book treats some of the central problems involved in these networks of the future. First, how does one switch data at speeds orders of magnitude faster than that of existing networks? This problem has roots in both classical switching for telephony and in switching for packet networks. There are a number of new twists here, however. The first is that the high speeds necessitate the use of highly parallel processing and place a high premium on computational simplicity. The second is that the required data speeds and allowable delays of different applications differ by many orders of magnitude. The third is that it might be desirable to support both point to point applications and also applications involving broadcast from one source to a large set of destinations.
Author | : Stanford University. Stanford Electronics Laboratories |
Publisher | : |
Total Pages | : 82 |
Release | : 1971 |
Genre | : Sorting (Electronic computers) |
ISBN | : |
Download Large (g,d) sorting networks Book in PDF, ePub and Kindle
With only a few exceptions the minimum-comparator N-sorter networks employ the generalized divide-sort-merge strategy. That is, the N inputs are divided among g> or = 2 smaller sorting networks -- of size N1,N2 ..., Ng, where N = summation from k = 1 to g of (N sub k) -- that comprise the initial portion of the N-sorter network. The remainder of the N-sorter is a comparator network that merges the outputs of the N1-, N2- ..., and Ng-sorter networks into a single sorted sequence. The most economical merge networks yet designed, known as the (g, d) merge networks, consist of d smaller merge networks -- where d is a common divisor of N1,N2 ... Ng -- followed by a special comparator network labeled a (g, d) f-network. The paper describes special constructions for ((2 sup r), (2 sup r)) f-networks. (Author).
Author | : |
Publisher | : |
Total Pages | : 946 |
Release | : 1972 |
Genre | : Aeronautics |
ISBN | : |
Download Scientific and Technical Aerospace Reports Book in PDF, ePub and Kindle
Lists citations with abstracts for aerospace related reports obtained from world wide sources and announces documents that have recently been entered into the NASA Scientific and Technical Information Database.
Author | : Gerald Norris Shapiro |
Publisher | : |
Total Pages | : 370 |
Release | : 1974 |
Genre | : Computer engineering |
ISBN | : |
Download A Functional Approach to Structured Combinational-logic Design Book in PDF, ePub and Kindle
Author | : Selim G. Akl |
Publisher | : Academic Press Canada |
Total Pages | : 256 |
Release | : 1985 |
Genre | : Computers |
ISBN | : |
Download Parallel Sorting Algorithms Book in PDF, ePub and Kindle
'Parallel sorting algorithms' is an overview over sorting algorithms for various parallel computer architectures. After introducing the problem of sorting, giving a taxonomy of parallel computer architectures and discussing efficiency concepts in parallel algorithms, various sorting methods on SIMD and MIMD computers are introduced. The author describes and analyzes sorting algorithms on sorting networks, vector machines, the perfect-shuffle, mesh- and cube-connected computers, tree machines and asynchronous MIMD machines. Furthermore, there are chapters on parallel external sorting and general lower bounds for the problem of parallel sorting. The book is very readable and serves as an excellent means to get an overview over methods to solve the important problem of parallel sorting.
Author | : |
Publisher | : |
Total Pages | : 292 |
Release | : 1972 |
Genre | : |
ISBN | : |
Download Stanford University Electronics Research Review Book in PDF, ePub and Kindle
Includes brief descriptions of projects, listings of contracts and grant support, and listings of publications.