Optimizing Matlab through just-in-time specialization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6011 LNCS, Issue , 2010, Pages 46-65

  Chevalier Boisvert, Maxime ^a   Hendren, Laurie ^a   Verbrugge, Clark ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NATURE; JUST IN TIME; KEY COMPONENT; MATHWORKS; ON-THE-FLY; OPEN IMPLEMENTATION; OPEN-SOURCE; PROPRIETARY SYSTEMS; PROTOTYPING; RUNTIMES; SHAPE INFORMATION; STATIC COMPILER; TYPE INFERENCE ALGORITHM; VIRTUAL MACHINES;

COMPUTER SOFTWARE; DYNAMIC PROGRAMMING; EMBEDDED SYSTEMS; INFERENCE ENGINES; MATLAB; OPTIMIZATION; PROGRAM INTERPRETERS; SOFTWARE PROTOTYPING;

PROGRAM COMPILERS;

EID: 77951587034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11970-5_4     Document Type: Conference Paper

References (27)

1. Lattner, C.: LLVM: An infrastructure for multi-stage optimization. Master's thesis, Comp. Sci. Dept., U. of Illinois at Urbana-Champaign (December 2002)
2. Boehm, H., Spertus, M.: Transparent programmer-directed garbage collection for C++ (2007)
3. Biggar, P., de Vries, E., Gregg, D.: A practical solution for scripting language compilers. In: SAC 2009, pp. 1916-1923. ACM, New York (2009)
4. Almási, G., Padua, D.: MaJIC: compiling MATLAB for speed and responsiveness. In: PLDI 2002, pp. 294-303. ACM, New York (2002) (Pubitemid 34991527)
5. Elphick, D., Leuschel, M., Cox, S.: Partial evaluation of MATLAB. In: Pfenning, F., Smaragdakis, Y. (eds.) GPCE 2003. LNCS, vol. 2830, pp. 344-363. Springer, Heidelberg (2003)
6. Derose, L., Rose, L.D., Gallivan, K., Gallivan, K., Gallopoulos, E., Gallopoulos, E., Marsolf, B., Marsolf, B., Padua, D., Padua, D.: FALCON: A MATLAB interactive restructuring compiler. In: Huang, C.-H., Sadayappan, P., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1995. LNCS, vol. 1033, pp. 269-288. Springer, Heidelberg (1996)
7. Birkbeck, N., Levesque, J., Amaral, J.N.: A dimension abstraction approach to vectorization in MATLAB. In: CGO 2007, pp. 115-130. IEEE Computer Society, Los Alamitos (2007) (Pubitemid 47214303)
8. Joisha, P.G., Banerjee, P.: A translator system for the MATLAB language: Research articles. Softw. Pract. Exper. 37(5), 535-578 (2007)
9. Rose, L.D., Padua, D.: A MATLAB to Fortran 90 translator and its effectiveness. In: ICS 1996, pp. 309-316. ACM, New York (1996)
10. Joisha, P.G., Banerjee, P.: An algebraic array shape inference system for MATLAB R®. ACM Trans. Program. Lang. Syst. 28(5), 848-907 (2006)
11. Haldar, M., Nayak, A., Kanhere, A., Joisha, P., Shenoy, N., Choudhary, A., Banerjee, P.: Match virtual machine: An adaptive runtime system to execute MATLAB in parallel. In: ICPP 2000, pp. 145-152 (2000)
12. Jones, N.D., Gomard, C.K., Sestoft, P.: Partial evaluation and automatic program generation. Prentice-Hall, Inc., Englewood Cliffs (1993)
13. Cooper, K.D., Hall, M.W., Kennedy, K.: Procedure cloning. Computer Languages, 96-105 (1992)
14. Chauhan, A., McCosh, C., Kennedy, K., Hanson, R.: Automatic type-driven library generation for telescoping languages. In: SC 2003, vol. 1, pp. 58113-58695 (1917)
15. Chambers, C., Ungar, D.: Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language. SIGPLAN Not. 24(7), 146-160 (1989)
16. Kennedy, A., Syme, D.: Design and implementation of generics for the .NET Common Language Runtime. In: PLDI 2001, pp. 1-12. ACM, New York (2001) (Pubitemid 33723832)
17. Shankar, A., Sastry, S.S., Bodík, R., Smith, J.E.: Runtime specialization with optimistic heap analysis. SIGPLAN Not. 40(10), 327-343 (2005) (Pubitemid 43176852)
18. Schultz, U., Consel, C.: Automatic program specialization for Java. ACM Trans. Program. Lang. Syst. 25(4), 452-499 (2003)
19. Rigo, A.: Representation-based just-in-time specialization and the Psyco prototype for Python. In: PEPM 2004, pp. 15-26. ACM, New York (2004)
20. Carette, J., Kucera, M.: Partial evaluation of Maple. In: PEPM 2007, pp. 41-50. ACM, New York (2007)
21. Gal, A., Eich, B., Shaver, M., Anderson, D., Mandelin, D., Haghighat, M.R., Kaplan, B., Hoare, G., Zbarsky, B., Orendorff, J., Ruderman, J., Smith, E.W., Reitmaier, R., Bebenita, M., Chang, M., Franz, M.: Trace-based just-in-time type specialization for dynamic languages. In: PLDI 2009, pp. 465-478. ACM, New York (2009)
22. Duggan, D., Bent, F.: Explaining type inference. Science of Computer Programming, 37-83 (1996)
23. Bacon, D.F., Sweeney, P.F.: Fast static analysis of C++ virtual function calls. In: OOPSLA 1996, pp. 324-341. ACM, New York (1996)
24. Tip, F., Palsberg, J.: Scalable propagation-based call graph construction algorithms. In: OOPSLA 2000, pp. 281-293. ACM, New York (2000) (Pubitemid 32396366)
25. Singer, J.: Sparse bidirectional data flow analysis as a basis for type inference. In: Web proceedings of the Applied Semantics Workshop (2004)
26. Joisha, P.G., Banerjee, P.: Correctly detecting intrinsic type errors in typeless languages such as MATLAB. In: APL 2001, pp. 7-21. ACM, New York (2001)
27. Furr, M., An, J.h.D., Foster, J.S., Hicks, M.: Static type inference for Ruby. In: SAC 2009, pp. 1859-1866. ACM, New York (2009)