International Journal of Parallel Programming, Volume 25

Volume 25, Number 1, February 1997

• Frank Dehne, Siang W. Song:
  Randomized parallel list ranking for distributed memory multiprocessors. 1-16
  
• Christoph W. Keßler, Helmut Seidl:
  The Fork95 parallel programming language: Design, implementation, application. 17-50
  

Volume 25, Number 2, April 1997

• Kemal Ebcioglu:
  From the guest editors. 51-52
  
• Vasanth Bala, Norman Rubin:
  Efficient instruction scheduling using finite state automata. 53-82
  
• Thomas M. Conte, Sumedh W. Sathaye:
  Optimization of VLIW compatibility systems employing dynamic rescheduling. 83-112
  
• Richard E. Hank, Wen-mei W. Hwu, B. Ramakrishna Rau:
  Region-based compilation: Introduction, motivation, and initial experience. 113-146
  

Volume 25, Number 3, June 1997

• Michael S. Schlansker, Vinod Kathail:
  Techniques for critical path reduction of scalar programs. 147-181
  
• Marco Fillo, Stephen W. Keckler, William J. Dally, Nicholas P. Carter, Andrew Chang, Yevgeny Gurevich, Whay Sing Lee:
  The M-machine multicomputer. 183-212
  
• Gary S. Tyson, Matthew K. Farrens, John Matthews, Andrew R. Pleszkun:
  Managing data caches using selective cache line replacement. 213-242
  

Volume 25, Number 4, August 1997

• Walid A. Najjar, Gabriel M. Silberman:
  Foreword to the special issues. 243-244
  
• Chris J. Newburn, John Paul Shen:
  Post-pass partitioning of signal processing programs. 245-280
  
• Stephen Jenks, Jean-Luc Gaudiot:
  Exploiting locality and tolerating remote memory access latency using thread migration. 281-304
  
• Laurie J. Hendren, Xinan Tang, Yingchun Zhu, Shereen Ghobrial, Guang R. Gao, Xun Xue, Haiying Cai, Pierre Ouellet:
  Compiling C for the EARTH multithreaded architecture. 305-338
  

Volume 25, Number 5, October 1997

• Po-Yung Chang, Marius Evers, Yale N. Patt:
  Improving branch prediction accuracy by reducing pattern history table interference. 339-362
  
• Stéphan Jourdan, Jared Stark, Tse-Hao Hsing, Yale N. Patt:
  Recovery requirements of branch prediction storage structures in the presence of mispredicted-path execution. 363-383
  
• Lorenz Huelsbergen:
  Dynamic resolution: A runtime technique for the parallelization of modifications to directed acyclic graphs. 385-417
  
• Daeyeon Park, Rafael H. Saavedra, Sungdo Moon:
  Adaptive granularity: Transparent integration of fine- and coarse-grain communication. 419-446
  

Volume 25, Number 6, December 1997

• Alain Darte, Frédéric Vivien:
  Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs. 447-496
  
• Catherine Mongenet:
  Affine Dependence Classification for Communications Minimization. 497-524
  
• Vincent Loechner, Doran K. Wilde:
  Parameterized Polyhedra and Their Vertices. 525-549
  

Last update Sat May 25 20:31:39 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page