Efficient Algorithms for Sorting and Synchronization

Efficient Algorithms for Sorting and Synchronization

Presents efficient algorithms for internal and external parallel sorting and remote data update.

Publication date: 01 Feb 1999

ISBN-10: n/a

ISBN-13: n/a

Paperback: 115 pages

Views: 29,069

Type: N/A

Publisher: n/a

License: n/a

Post time: 11 Jun 2005 07:23:01

Efficient Algorithms for Sorting and Synchronization

Efficient Algorithms for Sorting and Synchronization Presents efficient algorithms for internal and external parallel sorting and remote data update.
Tag(s): Algorithms and Data Structures
Publication date: 01 Feb 1999
ISBN-10: n/a
ISBN-13: n/a
Paperback: 115 pages
Views: 29,069
Document Type: N/A
Publisher: n/a
License: n/a
Post time: 11 Jun 2005 07:23:01
Thesis Abstract:

This is a thesis submitted by the author for the degree of Doctor of Philosophy at The Australian National University. 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.

The remote data update algorithm, rsync, operates by exchanging block signature information followed by a simple hash search algorithm for block matching at arbitrary byte boundaries. The last chapter of the thesis examines a number of related algorithms for text compression, differencing and incremental backup.

Contents:
1. Internal Parallel Sorting
2. External Parallel Sorting
3. The rsync algorithm
4. rsync enhancements and optimizations
5. Further applications for rsync
6. Conclusion




About The Author(s)


No information is available for this author.

Andrew Tridgell

No information is available for this author.


Book Categories
Sponsors
Icons8, a free icon pack