Papers and reports from the Fx project

Papers

• J. Subhlok and B. Yang. A New Model for Integrated Nested Task and Data Parallel Programming. In Proc. of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Las Vegas, NV, Jun, 1997. abstract, postscript.

• B. Yang and D. O'Hallaron. Parallel Breadth-first BDD Construction. In Proc. of the Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Las Vegas, NV, Jun, 1997, pp. 145-156. abstract, postscript.

• A. Adl-Tabatabai Source Level Debugging of Globally Optimized Code, Tech Report CMU-CS-96-133, June, 1996. abstract, postscript.

• D. O'Hallaron, J. Webb, J. Subhlok. Performance issues in HPF implementations of sensor-based programs. Scientific Programming, vol 6, no 1, Spring, 1997, pp. 16-26. abstract, postscript.

• A. Adl-Tabatabai, T. Gross and G.Y. Lueh Code Reuse in an Optimizing Compiler, Proc. SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'96), October 1996, pp. 51-68. abstract, postscript.

• G.Y. Lueh, T. Gross and A. Adl-Tabatabai, Global Register Allocation Based on Graph Fusion, 9th Workshop on Languages and Compilers for Parallel Computing (LCPC'96), August 1996. abstract, postscript.

• J. Subhlok, and G. Vondran. Optimal Latency-Throughput Tradeoffs for Data Parallel Pipelines. In Proc. Eighth Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), Padua, Italy, June 1996, pp. 62--71. abstract, postscript.

• A. Adl-Tabatabai and T. Gross, Source-Level Debugging of Scalar Optimized Code, Proc. ACM SIGPLAN Symp. on Programming Language Design and Implementation, May, 1996. abstract. postscript.

• P. Dinda and D. O'Hallaron. Fast message assembly using compact address relations. In Proc of the Intl. Conf. on Measurement and Modeling of Computer Systems, ACM SIGMETRICS, Philadelphia, PA, May, 1996, pp. 47-56. abstract, postscript.

• P. Dinda, D. O'Hallaron, J. Subhlok, J. Webb, B. Yang, Language and run-time support for network parallel computing. In Proc. 8th International Workshop on Languages and Compilers for Parallel Computing (LCPC95), Columbus, Ohio, August, 1995. abstract, postscript.

• J. Subhlok, and G. Vondran. Optimal Mapping of Sequences of Data Parallel Tasks. In Proc. of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Santa Barbara, CA, July, 1995, pp. 134-143. abstract, postscript.

• T. Stricker, J. Stichnoth, D. O'Hallaron, S. Hinrichs, and T. Gross. Decoupling Synchronization and Data Transfer in Message Passing Systems of Parallel Computers. In Proc. of the 9th International Conference on Supercomputing, ACM, Barcelona, Spain, July, 1995. pp 1-10. abstract, postscript.

• P. Dinda and D. O'Hallaron. The Performance Impact of Address Relation Caching. In Proc. of the Third Workshop on Languages, Compilers, and Run-Time Environments for Scalable Computers. Troy, NY, May 1995. abstract, postscript.

• T. Suzuoka, J. Subhlok, and T. Gross. Performance Debugging based on Scalability Analysis, In Proc. 5th Symposium on the Frontiers of Massively Parallel Computation, McLean, VA, February, 1995, pp. 406-413. abstract, postscript.

• T. Gross, A. Hasegawa, S. Hinrichs, D. O'Hallaron, and T. Stricker. Communication Styles for Parallel Systems. IEEE Computer, vol.27, no. 12, December, 1994, pp. 34-44. abstract. postscript

• T. Gross, D. O'Hallaron, and J. Subhlok. Task parallelism in a High Performance Fortran framework. IEEE Parallel & Distributed Technology, vol 2, no 2, Fall, 1994, pp 16-26. abstract, postscript.

• J. Subhlok, D. O'Hallaron, T. Gross, P. Dinda, J. Webb, Communication and memory requirements as the basis for mapping task and data parallel programs. In Proc. Supercomputing '94, Washington, DC, Nov. 1994, pp. 330-339. abstract, postscript.

• S. Hinrichs, C. Kosak, D. O'Hallaron, T. Stricker, and R. Take. An architecture for optimal all-to-all personalized communication. In Proc. of SPAA '94, ACM, June 1994, pp. 310-319. abstract, postscript. Extended and updated version of paper appears as CMU technical report CMU-CS-94-140. postscript.

• J. Stichnoth, D. O'Hallaron, and T. Gross, Generating communication for array statements: Design, implementation, and evaluation, Journal of Parallel and Distributed Computing, vol. 21, no. 1, Apr, 1994, pp. 150-159. abstract, postscript.

• D. O'Hallaron, P. Lieu, L. Withers, and J. Whelchel, Computing the pipelined phase rotation FFT, Scalable High Performance Computing Conference, Knoxville, TN, May, 1994, pp. 462-469. Also available as Technical Report CMU-CS-93-174, School of Computer Science, Carnegie Mellon University, July, 1993. abstract, postscript.

• A. Adl-Tabatabai and T. Gross, Detection and recovery of endangered variables caused by instruction scheduling, Proc. SIGPLAN Symp. on Programming Language Design and Implementation, June, 1993, 13-25. abstract, postscript.

• A. Adl-Tabatabai and T. Gross, Evicted variables and the interaction of global register allocation and symbolic debugging, Proc. 20th POPL Conf., January, 1993, 371-383. abstract, postscript.

• J. Subhlok, J. Stichnoth, D. O'Hallaron, and T. Gross, Exploiting task and data parallelism on a multicomputer, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, May, 1993, pp 13-22. abstract, postscript.

• B. Yang, J. Webb, J. Stichnoth, D. O'Hallaron, and T. Gross, Do&Merge: Integrating parallel loops and reductions, In Proc. Sixth Workshop on Languages and Compilers for Parallel Computing, volume 768 of Lecture Notes in Computer Science, pages 169-183, Portland, OR, August 1993. Springer Verlag. abstract, postscript.

• S. Hinrichs and T. Gross, Utilizing new communication features in compilation for private-memory machines, Fifth Annual Workshop on Languages and Compilers for Parallel Computing, New Haven, Connecticut, Aug 1992. abstract, postscript.

• T. Gross and S. Hinrichs, Debugging a parallel program: Capturing inter-processor communication in an iWarp torus, Proc. Supercomputer Debugging Workshop '92, Dallas, October, 239-276. abstract, postscript.

Reports

• G.Y. Lueh, Issues in Register Allocation by Graph Coloring, Technical Report CMU-CS-96-171, School of Computer Science, Carnegie Mellon University, November, 1996. abstract, postscript.

• G.Y. Lueh, T. Gross and A. Adl-Tabatabai, Global Register Allocation Based on Graph Fusion, Technical Report CMU-CS-96-106, School of Computer Science, Carnegie Mellon University, March, 1996. abstract, postscript.

• P. Dinda, T. Gross, D. O'Hallaron, E. Segall, J. Stichnoth, J. Subhlok, J. Webb, and B. Yang, The CMU task parallel program suite, Technical Report CMU-CS-94-131, School of Computer Science, Carnegie Mellon University, March, 1994. abstract, postscript.

• A. Adl-Tabatabai and T. Gross, Symbolic debugging of globally optimized code: Data value problems and their solutions Technical Report CMU-CS-94-105, School of Computer Science, Carnegie Mellon University, January, 1994. abstract, postscript,

• J. Subhlok, Automatic mapping of task and data parallel programs for efficient execution on multicomputers, Technical Report CMU-CS-93-212, School of Computer Science, Carnegie Mellon University, November, 1993. abstract, postscript.

• J. Stichnoth, Efficient compilation of array statements for private memory multicomputers, Technical Report CMU-CS-93-109, School of Computer Science, Carnegie Mellon University, February, 1993. abstract, postscript.

Miscellaneous

• MPI Forum, MPI Standard Version 1.1, postscript, html.

• High Performance Fortran Forum, High Performance Fortran language specification, Tech. Rep. CRPC-TR92225, Center for Research on Parallel Computation, Rice University, May, 1993. postscript.