Efficient Algorithms for Sorting and Synchronization
by Andrew Tridgell
Publisher: samba.org 1999
Number of pages: 115
Description:
This thesis presents efficient algorithms for internal and external parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on highly efficient but incorrect algorithms followed by a cleanup phase that completes the sort.
Download or read it online for free here:
Download link
(410KB, PDF)
Similar books
Problem Solving with Algorithms and Data Structures Using Python
by Brad Miller, David Ranum - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(17619 views)
by Brad Miller, David Ranum - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(17619 views)
Knapsack Problems: Algorithms and Computer Implementations
by Silvano Martello, Paolo Toth - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(17687 views)
by Silvano Martello, Paolo Toth - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(17687 views)
Algorithms: Fundamental Techniques
by Macneil Shonle, Matthew Wilson, Martin Krischik - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
(16673 views)
by Macneil Shonle, Matthew Wilson, Martin Krischik - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
(16673 views)
Algorithms
by Ian Craw, John Pulham - University of Aberdeen
This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.
(15191 views)
by Ian Craw, John Pulham - University of Aberdeen
This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.
(15191 views)