Efficient Algorithms for Sorting and Synchronization

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.

[1]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[2]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[3]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[4]  S. Lakshmivarahan,et al.  Parallel Sorting Algorithms , 1984, Adv. Comput..

[5]  Selim G. Akl,et al.  Parallel Sorting Algorithms , 1985 .

[6]  Adi Shamir,et al.  An optimal sorting algorithm for mesh connected computers , 1986, STOC '86.

[7]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[8]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[9]  Michael A. Langston,et al.  Practical in-place merging , 1987, CACM.

[10]  Geoffrey C. Fox,et al.  Solving problems on concurrent processors: vol. 2 , 1990 .

[11]  Ronald L. Rivest,et al.  The MD4 Message-Digest Algorithm , 1990, RFC.

[12]  Lasse Natvig,et al.  Logarithmic time cost optimal parallel sorting is not yet fast in practice , 1990, Proceedings SUPERCOMPUTING '90.

[13]  Guy E. Blelloch,et al.  A comparison of sorting algorithms for the connection machine CM-2 , 1991, SPAA '91.

[14]  Jeffrey Scott Vitter,et al.  Optimal Deterministic Sorting in Parallel Memory Hierarchies , 1992 .

[15]  Andrew Tridgell,et al.  Alternative preprocessing techniques for discrete hidden Markov model phoneme recognition , 1992, ICSLP.

[16]  A. Orlitsky.  Interactive Communication of Balanced Distributions and of Correlated Files , 1993, SIAM J. Discret. Math..

[17]  Keith Bostic,et al.  Engineering Radix Sort , 1993, Comput. Syst..

[18]  Richard P. Brent,et al.  AN IMPLEMENTATION OF A GENERAL-PURPOSE PARALLEL SORTING ALGORITHM , 1993 .

[19]  Toshiyuki Shimizu,et al.  Architecture for the AP1000 highly parallel computer , 1993 .

[20]  Richard P. Brent,et al.  Efficient implementation of sorting algorithms on asynchronous distributed-memory machines , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[21]  Alok Aggarwal,et al.  Optimal parallel sorting in multi-level storage , 1994, SODA '94.

[22]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[23]  Richard P. Brent,et al.  A General-Purpose Parallel Sorting Algorithm , 1995, Int. J. High Speed Comput..

[24]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[25]  David A. Bader,et al.  A Randomized Parallel Sorting Algorithm with an Experimental Study , 1998, J. Parallel Distributed Comput..

[26]  Rittwik Jana,et al.  Checksum Testing of Remote Synchronisation Tool. , 1998 .

[27]  Josh Macdonald,et al.  Versioned File Archiving, Compression, and Distribution , 1999 .

[28]  David Thomas,et al.  The Art in Computer Programming , 2001 .