A framework for adaptive algorithm selection in STAPL

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2005, Pages 277-288

  Thomas, Nathan ^a   Tanase, Gabriel ^a   Tkachyshyn, Olga ^a   Perdue, Jack ^a   Amato, Nancy M ^a   Rauchwerger, Lawrence ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Adaptive Algorithms; Machine Learning; Matrix Multiplication; Parallel Algorithms; Sorting

Indexed keywords

COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; LEARNING SYSTEMS; MATRIX ALGEBRA; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SORTING;

MATRIX MULTIPLICATION; RUN-TIME ENVIRONMENT; SYSTEM ARCHITECTURE;

ADAPTIVE ALGORITHMS;

EID: 31844454218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065944.1065981     Document Type: Conference Paper

References (38)

1. P. An, A. Jula, S. Rus, S. Saunders, T. Smith, G. Tanase, N. Thomas, N. Amato, and L. Rauchwerger. STAPL: A standard template adaptive parallel C++ library. In Proc. of the Intern. Workshop on Advanced Compiler Technology for High Performance and Embedded Processors (IWACT), Bucharest, Romania, July 2001.
2. P. An, A. Ma, S. Rus, S. Saunders, T. Smith, G. Tanase, N. Thomas, N. Amato, and L. Rauchwerger. STAPL: An adaptive, generic parallel programming library for C++. In Workshop on Languages and Compilers for Parallel Computing (LCPC), Cumberland Falls, KY, August 2001.
3. Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, David E. Culler, Joseph M. Hellerstein, and David A. Patterson. High-performance sorting on networks of workstations. In Proc. ACM Conference on the Management of Data (SIGMOD), pages 243-254, 1997.
4. G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. A comparison of sorting algorithms for the Connection Machine CM-2. In Proc. ACM Symp. Par. Alg. Arch. (SPAA), pages 3-16, 1991.
5. Guy E. Blelloch, Siddhartha Chatterjee, Jonathan C. Hardwick, Jay Sipelstein, and Marco Zagha. Implementation of a portable nested data-parallel language. In Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog. (PPoPP), pages 102-111, 1993.
6. Eric A. Brewer. High-level optimization via automated statistical modeling. In Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog. (PPoPP), pages 80-91, 1995.
7. W.H. Burge. Sorting, trees, and measures of order. Information and Control, 1(3):181-197, 1958.
8. Geeta Chaudhry, Wisniewski Wisniewski, and Thomas H. Cormen. Columnsort lives! an efficient out-of-core sorting program, In Proc. of the 13th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), July 2001.
9. Jaeyoung Choi, J. J. Dongarra, L. S. Ostrouchov, Petitet, A. P., D. W. Walker, and R. C. Whaley. Design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines. Scientific Programming, 5(3): 173-184, Fall 1996.
10. Jaeyoung Choi, Jack J. Dongarra, and David W. Walker. PUMMA: Parallel Universal Matrix Multiplication Algorithms on distributed memory concurrent computers. Concurrency: Practice and Experience, 6(7):543-570, 1994.
11. Curtis R. Cook and Do Jin Kim. Best sorting algorithm for nearly sorted lists. Communications of the ACM, 23(11):620-624, 1980.
12. Edsger W. Dijkstra. Smoothsort, an alternative for sorting in situ. Science of Computer Programming, 1(3):223-233, 1982.
13. Pedro Domingos and Michael Pazzani. On the optimality of the simple bayesian classifier under zero-one loss. Machine Learning, 29:103-130, 1997.
14. Amr Elmasry and Michael L. Fredman. Adaptive sorting and the information theoretic lower bound. In STACS, pages 654-662, 2003.
15. Vladimir Estivill-Castro and Derick Wood. A survey of adaptive sorting algorithms. ACM Computing Surveys, 24(4):441-476, December 1992.
16. G. C. Fox and S. W. Otto. Matrix algorithms on a hypercube I: matrix multiplication.
17. R. A. Van De Geijn and J. Watts. SUMMA: scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience, 9(4):255-274, 1997.
18. C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh. Basic linear algebra subprograms for fortran usage. ACM Trans. Math. Softw., 5(3):308-323, 1979.
19. Hyuk-Jae Lee, James P. Robertson, and Jos A. B. Fortes. Generalized cannon's algorithm for parallel matrix multiplication. In Proc. of the 11th international conference on Supercomputing, pages 44-51. ACM Press, 1997.
20. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput., c-34(4):344-354, 1985.
21. X. Li, M. J. Garzaran, and D. Padua. A dynamically tuned sorting library. In Proc. of the Intern. Symp. on Code Generation and Optimization, pages 111-124, March 2004.
22. D.B. Loveman. High performance fortran. IEEE Parallel and Distributed Technology, 1:25-42, 1993.
23. Tom M. Mitchell. Machine Learning. McGraw-Hill, New York, 1997.
24. David Musser, Gillmer Derge, and Atul Saini. STL Tutorial and Reference Guide, Second Edition. Addison-Wesley, 2001.
25. Marek Olszewski and Michael Voss. Proc. of the international conference on parallel and distributed processing techniques and applications, pdpta '04, June 21-24, 2004, las vegas, nevada, usa, volume 1. In Hamid R. Arabnia, editor, PDPTA. CSREA Press, 2004.
26. Ola Petersson and Alistair Moffat. A framework for adaptive sorting. In Third Scandinavian Workshop on Algorithm Theory (SWAT), pages 422-433, 1992.
27. Of Signal Processing. SPIRAL: A generator for platform-adapted libraries.
28. J. Ross Quinlan. Induction of decision trees. Machine Learning, 1(1):81-106, 1986.
29. L. Rauchwerger, F. Arzu, and K. Ouchi. Standard Templates Adaptive Parallel Library. In Proc. of the 4th Intern. Workshop on Languages, Compilers and Run-Time Systems for Scalable Computers (LCR), Pittsburgh, PA, May 1998.
30. J. R. Rice. The algorithm selection problem. Advances in Computers, 15:65-118, 1976.
31. D. Rumelhart, G. Hinton, and R. Williams. Learning internal representations by error propagation. IEEE Transactions on Parallel and Distributed Systems: Explorations in the Microstructure of Cognition, 1, 1986.
32. Steven Saunders and Lawrence Rauchwerger. ARMI: an adaptive, platform independent communication library. In Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog. (PPoPP), pages 230-241. ACM Press, 2003.
33. Steven Saunders, Nathan Thomas, Nancy Amato, and Lawrence Rauchwerger. Adaptive parallel sorting in the STAPL library. Technical Report TR01-005, Parasol Laboratory, Texas A&M University, November 2001.
34. Jeremy G. Siek and Andrew Lumsdaine. The matrix template library: A generic programming approach to high performance numerical linear algebra. In ISCOPE, pages 59-70, 1998.
35. R. Vuduc, J. Demmel, and J. Bilmes. Statistical models for empirical search-based performance tuning. Int. Journal of High Performance Computing Applications, 18(1):65-94, February 2004.
36. R. Clint Whaley, Antoine Petitet, and J. Dongarra. Automated empirical optimizations of software and the ATLAS project. Parallel Computing, 27(1-2):3-35, January 2001.
37. Hao Yu and Lawrence Rauchwerger. Adaptive reduction parallelization techniques. In Proc. of the 14th ACM Intern. Conference on Supercomputing (ICS), pages 66-77, New York, NY, USA, 2000. ACM Press.
38. Hao Yu, Dongmin Zhang, and Lawrence Rauchwerger. An adaptive algorithm selection framework. In Proceedings of the Parallel Architecture and Compilation Techniques, 13th International Conference on (PACT'04), pages 278-289. IEEE Computer Society, 2004.