Abstract is missing.
- From Flop to MegaFlops: Java for Technical ComputingJosé E. Moreira, Samuel P. Midkiff, Manish Gupta. 1-17 [doi]
- Considerations in HPJava Language Design and ImplementationGuansong Zhang, Bryan Carpenter, Geoffrey Fox, Xinying Li, Yuhong Wen. 18-33 [doi]
- A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing LocalityMahmut T. Kandemir, J. Ramanujam, Alok N. Choudhary, Prithviraj Banerjee. 34-50 [doi]
- An Integrated Framework for Compiler-Directed Cache Coherence and Data PrefetchingHock-Beng Lim, Pen-Chung Yew. 51-67 [doi]
- I/O Granularity TransformationsGagan Agrawal. 68-82 [doi]
- ::::Stampede::::: A Programming System for Emerging Scalable Interactive Multimedia ApplicationsRishiyur S. Nikhil, Umakishore Ramachandran, James M. Rehg, Robert H. Halstead Jr., Christopher F. Joerg, Leonidas I. Kontothanassis. 83-99 [doi]
- Network-Aware Parallel Computing with RemosBruce Lowekamp, Nancy Miller, Dean Sutherland, Thomas R. Gross, Peter Steenkiste, Jaspal Subhlok. 100-119 [doi]
- Object-Oriented Implementation of Data-Parallelism on Global NetworksJan Borowiec. 120-130 [doi]
- Optimized Execution of Fortran 90 Array Language on Symmetric Shared-Memory MultiprocessorsVivek Sarkar. 131-147 [doi]
- Fortran RED - A Retargetable Environment for Automatic Data LayoutUlrich Kremer. 148-165 [doi]
- Automatic Parallelization of C by Means of Language TranscriptionRichard L. Kennell, Rudolf Eigenmann. 166-180 [doi]
- Improving Compiler and Run-Time Support for Irregular Reductions Using Local WritesHwansoo Han, Chau-Wen Tseng. 181-196 [doi]
- Beyond Arrays - A Container-Centric Approach for Parallelization of Real-World Symbolic ApplicationsPeng Wu, David A. Padua. 197-212 [doi]
- SIPR: A New Framework for Generating Efficient Code for Sparse Matrix ComputationsWilliam Pugh, Tatiana Shpeisman. 213-229 [doi]
- HPF-2 Support for Dynamic Sparse ComputationsRafael Asenjo, Oscar G. Plata, Juan Touriño, Ramon Doallo, Emilio L. Zapata. 230-246 [doi]
- Integrated Instruction Scheduling and Register Allocation TechniquesDavid A. Berson, Rajiv Gupta, Mary Lou Soffa. 247-262 [doi]
- A Spill Code Placement Framework for Code SchedulingDingchao Li, Yuji Iwahori, Tatsuya Hayashi, Naohiro Ishii. 263-274 [doi]
- Copy Elimination for Parallelizing CompilersDavid J. Kolson, Alexandru Nicolau, Nikil D. Dutt. 275-289 [doi]
- Compiling for SIMD Within a RegisterRandall J. Fisher, Henry G. Dietz. 290-304 [doi]
- Automatic Analysis of Loops to Exploit Operator Parallelism on Reconfigurable SystemsNarasimhan Ramasubramanian, Ram Subramanian, Santosh Pande. 305-322 [doi]
- Principles of Speculative Run-Time ParallelizationDevang Patel, Lawrence Rauchwerger. 323-337 [doi]
- The Advantages of Instance-Wise Reaching Definition Analyses in Array (S)SAJean-Francois Collard. 338-352 [doi]
- Dependency Analysis of Recursive Data Structures Using Automatic GroupsD. K. Arvind, T. A. Lewis. 353-366 [doi]
- The I+ TestWeng-Long Chang, Chih-Ping Chu. 367-381 [doi]