Supporting multidimensional arrays in Java
暂无分享,去创建一个
[1] Ronald F. Boisvert,et al. Developing numerical libraries in Java , 1998, Concurr. Pract. Exp..
[2] Samuel P. Midkiff,et al. From flop to megaflops: Java for technical computing , 1998, TOPL.
[3] David A. Padua,et al. Advanced compiler optimizations for supercomputers , 1986, CACM.
[4] Mithuna Thottethodi,et al. Recursive array layouts and fast parallel matrix multiplication , 1999, SPAA '99.
[5] Monica S. Lam,et al. A Loop Transformation Theory and an Algorithm to Maximize Parallelism , 1991, IEEE Trans. Parallel Distributed Syst..
[6] Vivek Sarkar,et al. ABCD: eliminating array bounds checks on demand , 2000, PLDI '00.
[7] Katherine A. Yelick,et al. Titanium: A High-performance Java Dialect , 1998, Concurr. Pract. Exp..
[8] Matthias Schwab,et al. Algebraic Java classes for numerical optimization , 1998, Concurr. Pract. Exp..
[9] Michael Philippsen,et al. Complex numbers for Java , 2000 .
[10] Fred G. Gustavson,et al. Recursion leads to automatic variable blocking for dense linear-algebra algorithms , 1997, IBM J. Res. Dev..
[11] Wei Li,et al. Just‐in‐time optimizations for high‐performance Java programs , 1997 .
[12] Keshav Pingali,et al. Data-centric multi-level blocking , 1997, PLDI '97.
[13] Vivek Sarkar,et al. Automatic selection of high-order transformations in the IBM XL FORTRAN compilers , 1997, IBM J. Res. Dev..
[14] Vladimir Getov,et al. High-Performance Parallel Programming in Java: Exploiting Native Libraries , 1998, Concurr. Pract. Exp..
[15] Samuel P. Midkiff,et al. Java programming for high-performance numerical computing , 2000, IBM Syst. J..
[16] Samuel P. Midkiff,et al. Efficient support for complex numbers in Java , 1999, JAVA '99.
[17] Samuel P. Midkiff,et al. Automatic loop transformations and parallelization for Java , 2000, ICS '00.