Katherine A. Yelick
- {1} A. Black, N. Hutchinson, E. Jul, H. Levy, and L. Carter. Distribution and abstract types in emerald. IEEE Transactions on Software Engineering, pages 65-76, January 1987. Google Scholar
Digital Library
- {2} M. Heath, E. Ng, and B. Peyton. Parallel algorithms for sparse linear systems. Parallel Algorithms for Matrix Computations, 1990.Google ScholarCross Ref
- {3} D. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, T. Von Eicken, K. Yelick. Introduction to Split-C. In preparation.Google Scholar
- {4} S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiler optimizations for Fortran D on MIMD distributed-memory machines. In Proceedings of the 1991 International Conference on Supercomputing , 1991. Google ScholarDigital Library
- {5} L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690-691, September 1979.Google ScholarDigital Library
- {6} S. Lin, E. Kuh, and M. Marek-Sadowska. A New Accurate and Efficient Timing Simulator. In proceedings of VLSI Design. January, 1992.Google Scholar
- {7} S. Lucco and D. Anderson. Tarmac: A language system substrate based on mobile memory. In International Conference on Distributed Computing Systems. IEEE, 1990.Google ScholarCross Ref
- {8} B. Mishra and C. Yap. Notes on Gröbner bases. Information Sciences, 48:219-252, 1989. Google ScholarDigital Library
- {9} D. Shasha and M. Snir. Efficient and correct execution of parallel programs that share memory. ACM Transactions on Programming Languages and Systems, 10(2):282-312, April 1988. Google ScholarDigital Library
- {10} J.-P. Vidal. The computation of Gröbner bases on shared memory multiprocessors. Technical Report CMU-CS-90-163, School of Computer Science, Carnegie Mellon University, Pittsburg, PA, 1990.Google ScholarCross Ref
- {11} T. Von Eicken, D. E. Culler, S. C. Goldstein, and K. E. Schauser. Active messages: a mechanism for integrated communication and computation. In International Symposium on Computer Architecture, 1992. Google ScholarDigital Library
Index Terms
- Programming models for irregular applications
Recommendations
Irregular applications: architectures & algorithms
IA3 '11: Proceedings of the 1st Workshop on Irregular Applications: Architectures and AlgorithmsIrregular applications are characterized by irregular data structures, control and communication patterns. Novel irregular high performance applications which deal with large data sets and require have recently appeared. Unfortunately, current high ...
Optimizing irregular shared-memory applications for distributed-memory systems
PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programmingIn prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to MPI. In the case of irregular applications, the performance of this ...
Comments