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
A Practical Introduction to Data Structures and Algorithm Analysis
by Clifford A. Shaffer - Virginia Tech
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.
(13212 views)
by Clifford A. Shaffer - Virginia Tech
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.
(13212 views)
Problems on Algorithms, 2nd edition
by Ian Parberry, William Gasarch - Prentice Hall
A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.
(18622 views)
by Ian Parberry, William Gasarch - Prentice Hall
A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.
(18622 views)
Algorithms
by Jeff Erickson - University of Illinois at Urbana-Champaign
These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.
(17394 views)
by Jeff Erickson - University of Illinois at Urbana-Champaign
These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.
(17394 views)
Data Structures and Algorithms
by John Morris
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.
(14994 views)
by John Morris
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.
(14994 views)