FG: A Framework Generator for Hiding Latency in Parallel Programs Running on Clusters

17th ISCA International Conference on Parallel and Distributed Computing Systems 2004, PDCS 2004

Volumn , Issue , 2004, Pages 137-144

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

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

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

ASYNCHRONOUS PIPELINE; BLOCK SIZES; CODE SIZE; DEBUGGING-TIME; IMPROVE PERFORMANCE; INTER PROCESSOR COMMUNICATION; MEMORY HIERARCHY; PARALLEL PROGRAM; PIPELINE STAGES; PROGRAMMING ENVIRONMENT;

PIPELINES;

EID: 85133019100     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Lars Arge, Rakesh Barve, David Hutchinson, Octa-vian Procopiuc, Laura Toma, Darren Erik Vengroff, and Rajiv Wickremesinghe. TPIE User Manual and Reference. Department of Computer Science, Duke University. Draft of August 29, 2002.
2. Maurice J. Bach. The Design of the UNIX Operating System. Prentice-Hall, 1986.
3. Lauren M. Baptist and Thomas H. Gormen. 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.
4. Geeta Chaudhry. Parallel Out-of-Core Sorting: The Third Way. PhD thesis, Dartmouth College, 2004.
5. 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.
6. Geeta Chaudhry, Thomas H. Cormen, and Elizabeth A. Hamon. Parallel out-of-core sorting: The third way. Cluster Computing. To appear.
7. ∗. Technical Report PCS-TR94-243, Dartmouth College Department of Computer Science, November 1994.
8. ∗implementation. Parallel Computing, 23 (4-5) :571-600, June 1997.
9. Thomas H. Cormen and David M. Nicol. Performing out-of-core FFTs on parallel disk systems. Parallel Computing, 24 (l) :5-20, January 1998.
10. Thomas H. Cormen, Thomas Sundquist, and Leonard F. Wisniewski. Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. SIAM Journal on Computing, 28(1):105-136, 1999.
11. 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 (IOPADS '97), pages 68-78, November 1997.
12. Tom Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34 (4) :344-354, April 1985.
13. Streamlt Language Specification, Version 2.0. http://www.cag.lcs.mit.edu/streamit/papers/streamit-lang-spec.pdf, February 2003.
14. Jeffrey-Scott Vitter. External memory algorithms' and data structures: Dealing with MASSIVE DATA. ACM Computing Surveys, 33 (2) :209-271, June 2001.
15. Jeffrey Scott Vitter and Elizabeth A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2/3):110-147, August and September 1994.