Building on a framework: Using FG for more flexibility and improved performance in parallel programs

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages 54-

  Davidson, Elena Riccio ^a   Cormen, Thomas H ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFERS; FRAMEWORK GENERATOR; LINEAR PIPELINE; PARALLEL PROGRAM;

ASYNCHRONOUS SEQUENTIAL LOGIC; AUTOMATIC PROGRAMMING; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL ALGORITHMS; PERFORMANCE; PROFESSIONAL ASPECTS;

PARALLEL PROCESSING SYSTEMS;

EID: 33746277350     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.133     Document Type: Conference Paper

References (13)

1. [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.
2. [CC02] Geeta Chaudhry and Thomas H. Cormen. Getting more from out-of-core columnsort. In 4th Workshop on Algorithm Engineering and Experiments (ALENEX02), pages 143-154, January 2002.
3. [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.
4. [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.
5. [Cha04] Geeta Chaudhry. Parallel Out-of-Core Sorting: The Third Way. PhD thesis, Dartmouth College, 2004.
6. [CSW99] Thomas H. Cormen, Thomas Sundquist, and Leonard F. Wisniewski. Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. SIAM Journal on Computms, 28(1):105-136, 1999.
7. [CWN97] Thomas H. Cormen, Jake Wegmann, and David M. Nicol. Multiprocessor out-of-core FFTs with distributed memory and parallel disks. In Proceedings of the Fifth Workshop on I/O in Parallel and Distributed Systems (10PADS '97), pages 68-78, November 1997.
8. [DC] 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/.
9. [Lei92] F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
10. [SI86] Kazuhiro Sado and Yoshihide Igarashi. Some parallel sorts on a mesh-connected processor array and their time efficiency. Journal of Parallel and Distributed. Computing, 3(3):398-410, September 1986.
11. [SSS86] Isaac D. Scherson, Sandeep Sen, and Adi Shamir. Shear sort: A true two-dimensional sorting technique for VLSI networks. In Proceedings of the 1986 International Conference on Parallel Processing, pages 903-908, August 1986.
12. [Vit01] Jeffrey Scott Vitter. External memory algorithms and data structures: Dealing with MASSIVE DATA. ACM Computing Surveys, 33(2):209-271, June 2001.
13. [VS94] Jeffrey Scott Vitter and Elizabeth A. M. Shriver. Algorithms for parallel memory 1: Two-level memories. Algorithmica, 12(2/3): 110-147, August and September 1994.