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
Design and Analysis of Algorithmsby Herbert Edelsbrunner - Duke University
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
(21831 views)
Modern Computer Arithmeticby Richard P. Brent, Paul Zimmermann - LORIA
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.
(17443 views)
A Practical Introduction to Data Structures and Algorithm Analysisby 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.
(15726 views)
Data Structures and Algorithm Analysis in C++by Clifford A. Shaffer - Dover Publications
A comprehensive treatment focusing on efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ programming language and is suitable for second-year courses.
(27485 views)