Bibliography

Bap99

Lauren M. Baptist.
Two algorithms for performing multidimensional, multiprocesso r, out-of-core FFTs.
Technical Report PCS-TR99-350, Dartmouth College Department of Computer Science, June 1999.

BC99

Lauren M. Baptist and Thomas H. Cormen.
Multidimensional, multiprocessor, out-of-core FFTs with distributed memory and parallel disks.
In Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, pages 242-250, June 1999.

CC02

Geeta Chaudhry and Thomas H. Cormen.
Getting more from out-of-core columnsort.
In 4th Workshop on Algorithm Engineering and Experiments (ALENEX 02), pages 143-154, January 2002.

CC03

Geeta Chaudhry and Thomas H. Cormen.
Stupid columnsort tricks.
Technical Report TR2003-444, Dartmouth College Department of Computer Science, April 2003.

CC04

Geeta Chaudhry and Thomas H. Cormen.
Slabpose columnsort: A new oblivious algorithm for out-of-core sorting on distributed-memory clusters.
Submitted to Algorithmica, 2004.

CCH

Geeta Chaudhry, Thomas H. Cormen, and Elizabeth A. Hamon.
Parallel out-of-core sorting: The third way.
Cluster Computing.
To appear.

CCW01

Geeta Chaudhry, Thomas H. Cormen, and Leonard F. Wisniewski.
Columnsort lives! An efficient out-of-core sorting program.
In Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 169-178, July 2001.

CD04

Thomas H. Cormen and Elena Riccio Davidson.
FG: A framework generator for hiding latency in parallel programs running on clusters.
In Proceedings of the 17th International Conference on Parallel and Distributed Computing Systems (PDCS-2004), pages 137-144, September 2004.

CDC03

Thomas H. Cormen, Elena Riccio Davidson, and Siddhartha Chatterjee.
Asynchronous buffered computation design and engineering framework generator (ABCDEFG).
In High-End Computing Revitalization Task Force Workshop, June 2003.
White paper.

Cha04

Geeta Chaudhry.
Parallel Out-of-Core Sorting: The Third Way.
PhD thesis, Dartmouth College, 2004.

CHC03

Geeta Chaudhry, Elizabeth A. Hamon, and Thomas H. Cormen.
Relaxing the problem-size bound for out-of-core columnsort.
In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, June 2003.
SPAA Revue paper.

CLL02

Thomas H. Cormen, Clara Lee, and Erica Lin.
Instructor's Manual to Accompany Introduction to Algorithms, Second Edition.
The MIT Press and McGraw-Hill, 2002.
Available only by contacting the publishers.

CLRS01

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
Introduction to Algorithms.
The MIT Press and McGraw-Hill, second edition, 2001.

Cor03a

Thomas H. Cormen.
The clrscode package for L^ATEX2e.
http://www.cs.dartmouth.edu/~thc/clrscode/, June 2003.

Cor03b

Thomas H. Cormen.
Java implementations of algorithms from Introduction to Algorithms, second edition.
http://www.cs.dartmouth.edu/~thc/clrsjava/ (password-protected website), October 2003.

DCa

Elena Riccio Davidson and Thomas H. Cormen.
Asynchronous Buffered Computation Design and Engineering Framework Generator (ABCDEFG): Tutorial and Reference.
Dartmouth College Department of Computer Science.
Available at http://www.cs.dartmouth.edu/FG/.

DCb

Elena Riccio Davidson and Thomas H. Cormen.
FG.
http://www.cs.dartmouth.edu/FG/.

DC05a

Elena Riccio Davidson and Thomas H. Cormen.
Building on a framework: Using FG for more flexibility and improved performance in parallel programs.
In 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005), April 2005.
To appear.

DC05b

Elena Riccio Davidson and Thomas H. Cormen.
The FG programming environment: Reducing source code size for parallel programs running on clusters.
In Second Workshop on Productivity and Performance in High-End Computing (P-PHEC), February 2005.

Fin01

Jeremy Fineman.
Optimizing the dimensional method for performing multidimensional, multiprocessor, out-of-core FFTs.
Technical Report TR2001-402, Dartmouth College Department of Computer Science, June 2001.

Ham03

Elizabeth A. Hamon.
Enhancing asynchronous parallel computing.
Technical Report TR2003-460, Dartmouth College Department of Computer Science, 2003.

Lei85

Tom Leighton.
Tight bounds on the complexity of parallel sorting.
IEEE Transactions on Computers, C-34(4):344-354, April 1985.

Pea99

Matthew D. Pearson.
Fast out-of-core sorting on parallel disk systems.
Technical Report PCS-TR99-351, Dartmouth College Department of Computer Science, 1999.

Raj01

Sanguthevar Rajasekaran.
A framework for simple sorting algorithms on parallel disk systems.
Theory of Computing Systems, 34(2):101-114, 2001.

Rin01

Michael F. Ringenburg.
Applying the vector radix method to multidimensional, multiprocessor, out-of-core fast Fourier transforms.
Master's thesis, Dartmouth College Department of Computer Science, March 2001.
Also Dartmouth College Department of Computer Science Technical Report TR2001-388.

Won01a

Tiffany M. Wong.
An implementation of object-oriented program transformation for thought-guided debugging.
Technical Report TR2001-395, Dartmouth College Department of Computer Science, 2001.

Won01b

Tiffany M. Wong.
Implementing a database information system for an electronic baseball scorecard.
Technical Report TR2001-396, Dartmouth College Department of Computer Science, 2001.