IEEE Transactions on Parallel and Distributed Systems, Volume 2

Volume 2, Number 1, January-March 1991

• Tse-Yun Feng:
  Editor's Notice. 1-2
  

• Isaac D. Scherson:
  Orthogonal Graphs for the Construction of a Class of Interconnection Networks. 3-19
  
• Jong Kim, Chita R. Das, Woei Lin:
  A Top-Down Processor Allocation Scheme for Hypercube Computers. 20-30
  
• Ahmed El-Amawy, Shahram Latifi:
  Properties and Performance of Folded Hypercubes. 31-42
  
• David T. Harper III:
  Block, Multistride Vector, and FFT Accesses in Parallel Memory Systems. 43-51
  
• Ajit Singh, Jonathan Schaeffer, Mark Green:
  A Template-Based Approach to the Generation of Distributed Applications Using a Network of Workstations. 52-67
  
• Ian T. Foster:
  Automatic Generation of Self-Scheduling Programs. 68-78
  
• Albert C. Chen, Chuan-lin Wu:
  A Parallel Execution Model of Logic Programs. 79-92
  
• Maurice Herlihy, Jeannette M. Wing:
  Specifying Graceful Degradation. 93-104
  
• Sridhar Madala, James B. Sinclair:
  Performance of Synchronous Parallel Algorithms with Regular Structures. 105-116
  

• M. Sultan Alam, Rami G. Melhem:
  An Efficient Modular Spare Allocation Scheme and Its Application to Fault Tolerant Binary Hypercubes. 117-126
  

Volume 2, Number 2, April-June 1991

• Sanjay Ranka, Sartaj Sahni:
  Clustering on a Hypercube Multicomputer. 129-137
  
• Rajiv Gupta, Mary Lou Soffa:
  Compile-Time Techniques for Improving Scalar Access Performance in Parallel Memories. 138-148
  
• Zhenqiang Fan, Kam-Hoi Cheng:
  A Generalized Simultaneous Access Dictionary Machine. 149-159
  
• Daniel Barbará, Richard J. Lipton:
  A Class of Randomized Strategies for Low-Cost Comparison of File Copies. 160-170
  
• Divyakant Agrawal, Arthur J. Bernstein:
  A Nonblocking Quorum Consensus Protocol for Replicated Data. 171-179
  
• John Zahorjan, Edward D. Lazowska, Derek L. Eager:
  The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Systems. 180-198
  
• Sieteng Soh, Suresh Rai:
  CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks. 199-213
  
• Fred J. Meyer, Dhiraj K. Pradhan:
  Consensus With Dual Failure Modes. 214-222
  
• Edward A. Lee:
  Consistency in Dataflow Graphs. 223-235
  
• David R. O'Hallaron:
  Uniform Approach for Solving some Classical Problems on a Linear Array. 236-241
  
• Amir Averbuch, Samuel Itzikowitz, Tal Kapon:
  Parallel Implementation of Multiple Model Tracking Algorithms. 242-252
  

• Kevin Donovan:
  Performance of Shared Memory in a Parallel Computer. 253-256
  

Volume 2, Number 3, July-September 1991

• Tse-Yun Feng:
  Editor's Notice. 257-260
  

• David A. Padua, Benjamin W. Wah, Pen-Chung Yew:
  Guest Editor's Introduction. 261-263
  

• Eric Mohr, David A. Kranz, Robert H. Halstead Jr.:
  Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs. 264-280
  
• V. Prasad Krothapalli, P. Sadayappan:
  Removal of Redundant Dependences in DOACROSS Loops with Constant Dependences. 281-289
  
• Mark A. Nichols, Howard Jay Siegel, Henry G. Dietz, Russell W. Quong, Wayne G. Nation:
  Eliminating Memory for Fragmentation Within Partitionable SIMD/SPMD Machines. 290-303
  
• Jang-Ping Sheu, Chih-Yung Chang:
  Synthesizing Nested Loop Algorithms Using Nonlinear Transformation Method. 304-317
  
• Santosh G. Abraham, David E. Hudak:
  Compile-Time Partitioning of Iterative Parallel Loops to Reduce Cache Coherency Traffic. 318-328
  
• Ken Kennedy, Kathryn S. McKinley, Chau-Wen Tseng:
  Interactive Parallel Programming using the ParaScope Editor. 329-341
  
• Xiangyun Kong, David Klappholz, Kleanthis Psarris:
  The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization. 342-349
  
• Paul Havlak, Ken Kennedy:
  An Implementation of Interprocedural Bounded Regular Section Analysis. 350-360
  
• Jingke Li, Marina C. Chen:
  Compiling Communication-Efficient Programs for Massively Parallel Machines. 361-376
  

• Philip J. Hatcher, Michael J. Quinn, Anthony J. Lapadula, Bradley K. Seevers, Ray J. Anderson, Robert R. Jones:
  Data-Parallel Programming on MIMD Computers. 377-383
  

Volume 2, Number 4, October-December 1991

• Krishnan Padmanabhan:
  Design and Analysis of Even-Sized Binary Shuffle-Exchange Networks for Multiprocessors. 385-397
  
• Anant Agarwal:
  Limits on Interconnection Network Performance. 398-412
  
• Keqin Li, Kam-Hoi Cheng:
  Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme. 413-422
  
• Stephan Olariu, Zhaofang Wen:
  Optimal Parallel Initialization Algorithms for a Class of Priority Queues. 423-429
  
• Jang-Ping Sheu, Tsu-Huei Thai:
  Partitioning and Mapping Nested Loops on Multiprocessor Systems. 430-439
  
• Charles Koelbel, Piyush Mehrotra:
  Compiling Global Name-Space Parallel Loops for Distributed Execution. 440-451
  
• Michael E. Wolf, Monica S. Lam:
  A Loop Transformation Theory and an Algorithm to Maximize Parallelism. 452-471
  
• J. Ramanujam, P. Sadayappan:
  Compile-Time Techniques for Data Distribution in Distributed Memory Machines. 472-482
  
• Ellen E. Witte, Roger D. Chamberlain, Mark A. Franklin:
  Parallel Simulated Annealing using Speculative Computation. 483-494
  
• Jorge L. Aravena, Abdulkader O. Barbir:
  A Class of Low Complexity High Concurrence Algorithms. 495-502
  

• Philip J. Bernhard, Daniel J. Rosenkrantz:
  Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. 503-507