Table of Contents

• Scanning Polyhedra without Do-loopsPierre Boulet, Paul Feautrier. 4-11 [doi]
• Integrating Loop and Data Transformations for Global OptimizationMichael F. P. O Boyle, Peter M. W. Knijnenburg. 12 [doi]
• Optical versus Electronic Bus for Address-Transactions in Future SMP ArchitecturesWissam Hlayhel, Daniel Litaize, Laurent Fesquet, Jacques Collet. 22-29 [doi]
• Origin 2000 Design Enhancements for Communication Intensive ApplicationsGheith A. Abandah, Edward S. Davidson. 30-39 [doi]
• Sirocco: Cost-Effective Fine-Grain Distributed Shared MemoryIoannis Schoinas, Babak Falsafi, Mark D. Hill, James R. Larus, David A. Wood. 40 [doi]
• Design Study of Shared Memory in VLIW Video Signal ProcessorsZhao Wu, Wayne Wolf. 52-59 [doi]
• Exploiting Fine- and Coarse-Grain Parallelism in Embedded ProgramsIreneusz Karkowski, Henk Corporaal. 60-67 [doi]
• Command Vector Memory Systems: High Performance at Low CostJesús Corbal, Roger Espasa, Mateo Valero. 68 [doi]
• Eliminating Bottlenecks on Parallel Systems using Adaptive ObjectsMasahiro Yasugi, Shegeyuki Eguchi, Kazuo Taki. 80-87 [doi]
• Athapascan-1: On-Line Building Data Flow Graph in a Parallel LanguageFrançois Galilée, Jean-Louis Roch, Gerson G. H. Cavalheiro, Mathias Doreille. 88-95 [doi]
• General Parallel Computation can be Performed with a Cycle-Free HeapJack B. Dennis. 96 [doi]
• Code Generation in the Polytope ModelMartin Griebl, Christian Lengauer, Sabine Wetzel. 106-111 [doi]
• Handling Cross Interferences by Cyclic Cache Line ColoringDaniela Genius. 112-117 [doi]
• Capturing the Effects of Code Improving TransformationsClara Jaramillo, Rajiv Gupta, Mary Lou Soffa. 118-123 [doi]
• Fast, Accurate and Flexible Data Locality AnalysisF. Jesús Sánchez, Antonio González. 124-129 [doi]
• Superscalar Execution with Direct Data ForwardingSoner Önder, Rajiv Gupta. 130-135 [doi]
• A Fast Interrupt Handling Scheme for VLIW ProcessorsEmre Özer, Sumedh W. Sathaye, Kishore N. Menezes, Sanjeev Banerjia, Matthew D. Jennings, Thomas M. Conte. 136-141 [doi]
• Dynamic Elimination of Pointer-ExpressionsNitzan Weinberg, David Nagle. 142-147 [doi]
• Efficacy and Performance Impact of Value PredictionBohuslav Rychlik, John Faistl, Bryon Krug, John Paul Shen. 148 [doi]
• A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with ILPAllen Leung, Krishna V. Palem, Amir Pnueli. 158 [doi]
• A New Framework for Integrated Global Local SchedulingSrinivas Mantripragada, Suneel Jain, James C. Dehnert. 167 [doi]
• Exploiting Method-Level Parallelism in Single-Threaded Java ProgramsMichael K. Chen, Kunle Olukotun. 176 [doi]
• The StarT-Voyager Parallel SystemBoon Seong Ang, Derek Chiou, Larry Rudolph, Arvind. 185 [doi]
• Optimistic Register CoalescingJinpyo Park, Soo-Mook Moon. 196-204 [doi]
• Efficient JavaVM Just-in-Time CompilationAndreas Krall. 205 [doi]
• Improving Static Branch Prediction in a CompilerBrian L. Deitrich, Ben-Chung Cheng, Wen-mei W. Hwu. 214-221 [doi]
• Static Methods in Hybrid Branch PredictionDirk Grunwald, Donald C. Lindsay, Benjamin G. Zorn. 222-229 [doi]
• Split Last-Address PredictorEnric Morancho, José M. Llabería, Àngel Olivé. 230 [doi]
• Madeleine: An Efficient and Portable Communication Interface for RPC-Based Multithreaded EnvironmentsLuc Bougé, Jean-François Méhaut, Raymond Namyst. 240-247 [doi]
• Breaking the Barriers: Two Models for MPI ProgrammingJosé L. Roda, Casiano Rodríguez, Daniel González-Morales, Francisco Almeida, Pablo Pulido, Daniel Dorta. 248-255 [doi]
• Adaptive Receiver Notification for Non-Dedicated Workstation ClustersMichael Schmitt, Maximilian Ibel, Anurag Acharya, Klaus E. Schauser. 256-263 [doi]
• Performance of Message-Passing Systems using a Zero-Copy Communication ProtocolPanagiotis Melas, Ed Zaluska. 264 [doi]
• Dynamic Hammock Predication for Non-Predicated Instruction Set ArchitecturesArtur Klauser, Todd M. Austin, Dirk Grunwald, Brad Calder. 278-285 [doi]
• An Direct-Execution Framework for Fast and Accurate Simulation of Superscalar ProcessorsVenkata Krishnan, Josep Torrellas. 286-293 [doi]
• A Matrix-Based Approach to the Global Locality Optimization ProblemMahmut T. Kandemir, Alok N. Choudhary, J. Ramanujam, Prithviraj Banerjee. 306-313 [doi]
• Transformations for Improving Data Access Locality in Non-Perfectly Nested LoopsDattatraya Kulkarni. 314-321 [doi]
• Improving Cache Behavior of Dynamically Allocated Data StructuresD. N. Truong, François Bodin, André Seznec. 322 [doi]
• Instance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free TransductionsAlbert Cohen, Jean-Francois Collard. 332-339 [doi]
• Data Dependence Analysis of Assembly CodeWolfram Amme, Peter Braun, Eberhard Zehendner, François Thomasset. 340 [doi]
• Load Balancing in Individual-Based Spatial ApplicationsFehmina Merchant, Lubomir Bic, Michael B. Dillencourt. 350-357 [doi]
• A New Heuristic for Scheduling Parallel Programs on MultiprocessorJing-Chiou Liou, Michael A. Palis. 358-365 [doi]
• Using Algebraic Transformations to Optimize Expression Evaluation in Scientific CodesJulien Zory, Fabien Coelho. 376-384 [doi]
• Integrated Compilation and Scalability Analysis for Parallel SystemsCelso L. Mendes, Daniel A. Reed. 385-392 [doi]
• Improving Compiler and Run-Time Support for Adaptive Irregular CodesHwansoo Han, Chau-Wen Tseng. 393-400 [doi]
• Parallelization of Benchmarks for Scalable Shared-Memory MultiprocessorsYunheung Paek, Angeles G. Navarro, Emilio L. Zapata, David A. Padua. 401 [doi]
• Efficient Methods for Multi-Dimensional Array RedistributionYeh-Ching Chung, Ching-Hsien Hsu. 410-417 [doi]
• A Multithreaded Runtime Environment with Thread Migration for a HPF Data-Parallel CompilerLuc Bougé, Philip J. Hatcher, Raymond Namyst, Christian Pérez. 418-425 [doi]
• Optimized Code Generation for Heterogeneous Computing Environment using Parallelizing Compiler TINPARShin-ya Goto, Atsushi Kubota, Toshihiko Tanaka, Masahiro Goshima, Shin-ichiro Mori, Hiroshi Nakashima, Shinji Tomita. 426-433 [doi]