**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

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**11259**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.

(

**10872**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.

(

**10402**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.

(

**10381**views)