Efficient Algorithms for Sorting and Synchronization

Efficient Algorithms for Sorting and Synchronization (2000)

by Andrew Tridgell

Citations:

90 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Algorithms for Sorting and Synchronization	user correction - Legacy Corrections
AUTHOR NAME	Andrew Tridgell	SVM HeaderParse 0.1
ABSTRACT	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.	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	3 found	ParsCit 1.0