Logo

Efficient Algorithms for Sorting and Synchronization

Small book cover: Efficient Algorithms for Sorting and Synchronization

Efficient Algorithms for Sorting and Synchronization
by

Publisher: samba.org
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.

Home page url

Download or read it online for free here:
Download link
(410KB, PDF)

Similar books

Book cover: Computer Arithmetic of Geometrical Figures: Algorithms and Hardware DesignComputer Arithmetic of Geometrical Figures: Algorithms and Hardware Design
by - MiC
This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.
(5297 views)
Book cover: Data Structures and Algorithm Analysis in JavaData Structures and Algorithm Analysis in Java
by - Dover Publications
A comprehensive treatment focusing on the creation of efficient data structures and algorithms, explaining how to select the data structure best suited to specific problems. It uses Java programming language and is suitable for second-year courses.
(9183 views)
Book cover: Data Structures and Algorithm Analysis in C++Data Structures and Algorithm Analysis in C++
by - 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.
(10650 views)
Book cover: Algorithms and Data Structures for External MemoryAlgorithms and Data Structures for External Memory
by - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(6793 views)