Table of Contents

• Experimental Evaluation of Performance and Scalability of a Multiprogrammed Shared-Memory MultiprocessorChitra Natarajan, Ravishankar K. Iyer, Sanjay Sharma. 11-18
• Parallel Bidirectional A* Search on a Symmetry MultiprocessorAndrew Sohn. 19-22
• Execution Behavior Analysis and Performance Improvement in Shared-memory MutiprocessorsXiaodong Zhang, Keqiang He, G. Butchee. 23-27
• Correctness of a Directory-Based Cache Coherence Protocol: Early ExperienceFong Pong, Michel Dubois. 37-44
• Cache Design for an Explicit Token Store Data Flow ArchitecturePonnarasu Shanmugam, Shirish Andhare, Krishna M. Kavi, Behrooz Shirazi. 45-50
• Architectural Support for Block Transfers in a Shared-Memory MultiprocessorSteven J. E. Wilton, Zvonko G. Vranesic. 51-55
• A New Theory of Deadlock-free Adaptive Multicast Routing in Wormhole NetworksJosé Duato. 64-71
• Adaptive Wormhole Routing in Hypercube MulticomputersXiaola Lin, Abdol-Hossein Esfahanian, Philip K. McKinley, A. Burago. 72-81
• A Circulant Matrix Based Approach to Storage Schemes for Parallel Memory SystemsCengiz Erbas, Murat M. Tanik, V. S. S. Nair. 92-99
• Parallel Garbage Collection and Graph ReducerWen-Yan Kuo, Sy-Yen Kuo. 100-105
• An Evaluation of Software Multithreading in a Conventional Distributed Memory MultiprocessorMatthew Haines, A. P. Wim Böhm. 106-113
• Analysis of Multithreaded Multiprocessors with Distributed Shared MemoryShashank S. Nemawarkar, Ramaswamy Govindarajan, Guang R. Gao, Vinod K. Agarwal. 114-121
• RICA: Reduced Interprocessor-Communication Architecture - Concept and MechanismsShuichi Sakai, Hiroshi Matsuoka, Yuetsu Kodama, Mitsuhisa Sato, Andrew Shaw, Hideo Hirono, Kazuaki Okamoto, Takashi Yokota. 122-127
• Iterative Parallel Methods for Boundary Value ProblemsG. Kraut, Ian Gladwell. 134-140
• Efficient Parallel Sibling Finding for Quadtree Data StructureDipak Pravin Doctor, Ivan Hal Sudborough. 141-149
• Analysis of Interconnection Networks Based on Simple Cayley Coset GraphsJen-Peng Huang, S. Lakshmivarahan, Sudarshan K. Dhall. 150-157
• An Efficient Routing Scheme for Scalable Hierarchical NetworksHyunmin Park, Dharma P. Agrawal. 158-165
• Evaluation of Idealized Adaptive Routing on k-ary n-cubesAnnette Lagman, Walid A. Najjar, Sumit Sur, Pradip K. Srimani. 166-169
• The B&E Model for Adaptive Wormhole RoutingXiaowei Shen, Y. S. Cheung. 170-175
• Modeling and Measuring of Hot Spots on MIN-Based and HR-Based Shared-Memory ArchitecturesXiaodong Zhang, Yong Yan, Robert Castañeda. 176-183
• Application of Parallel Disks for Efficient Handling of Object-Oriented DatabasesY. C. Chehadeh, Ali R. Hurson, Les L. Miller, Simin H. Pakzad, B. N. Jamoussi. 184-191
• The Parallel State Processor ModelIsrael Gottlieb, L. Biran. 192-199
• Parallel Algorithms for Geometric Problems on Networks of ProcessorsJyh-Jong Tsay. 200-207
• Optimal Parallel Hypercube Algorithms for Polygon ProblemsMikhail J. Atallah, Danny Z. Chen. 208-215
• A Parallel Euclidean Distance Transformation AlgorithmHugo Embrechts, Dirk Roose. 216-225
• An Efficient Algorithm for Group CommunicationRosario Aiello, Elena Pagani, Gian Paolo Rossi. 226-232
• An Efficient Load Balancing Algorithm in Distributed Computing SystemsJea-Cheoul Ryou, Jie-Yong Juang. 233-240
• Assertions about Past and Future: Communication in a High-Performance Distributed System HighwaysMohan Ahuja. 241-244
• Protocol Refinement for Maintaining Replicated Data in Distributed SystemsDavid Shou, Sheng-De Wang. 245-249
• A Methodology for the Performance Prediction of Massively Parallel ApplicationsDaniel A. Menascé, Sam H. Noh, Satish K. Tripathi. 250-257
• Determining External Contention Delay Due to Job Interactions in a 2-D Mesh Wormhole Routed MulticomputerDugki Min, Matt W. Mutka. 258-265
• Simulated Behaviour of Large Scale SCI Rings and ToriH. Cha, R. Daniel Jr., A. Knowles. 266-275
• Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and ColumnsDavid S. Greenberg, James K. Park, Eric J. Schwabe. 276-283
• Deterministic Permutation Routing on MeshesBogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn. 284
• Dilation-5 Embedding of 3-Dimensional Grids into HypercubesMee Yee Chan, Francis Y. L. Chin, C. N. Chu, W. K. Mak. 285-289
• Scalable Duplicate Pruning Strategies for Parallel A* Graph SearchNihar R. Mahapatra, Shantanu Dutt. 290-297
• A Parallel Implementation of a Hidden Markov Model with Duration Modeling for Speech RecognitionC. D. Mitchell, Randall A. Helzerman, Leah H. Jamieson, Mary P. Harper. 298-306
• Performance Comparison of the CM-5 and Intel Touchstone Delta for Data Parallel OperationsZeki Bozkus, Sanjay Ranka, Geoffrey Fox, Alok N. Choudhary. 307-311
• Analysis of Link Traffic in Incomplete HypercubesNian-Feng Tzeng, Harish Kumar. 312-319
• Valved Routing: Efficient Flow Control in Interconnection NetworkWei-Kuo Liao, Chung-Ta King. 327-335
• Computing Global Combine Operations in the Multi-Port Postal ModelAmotz Bar-Noy, Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Baruch Schieber. 336-343
• Broadcasting Multiple Messages in Simultaneous Send/Receive SystemsAmotz Bar-Noy, Shlomo Kipnis. 344-347
• Fault Tolerant Broadcasting in SIMD HypercubesY. Chang. 348-351
• Notes on Maekawa s O(sqrt N) Distributed Mutual Exclusion AlgorithmYe-In Chang. 352-359
• Partitioning and Mapping a Class of Parallel Multiprocessor Simulation ModelsHatem Sellami, Sudhakar Yalamanchili. 360-367
• An Efficient Mapping of Multilayer Perceptron with Backpropagation ANNs on HypercubesQutaibah M. Malluhi, Magdy A. Bayoumi, T. R. N. Rao. 368-375
• Data Partitioning for Networked Parallel ProcessingPhyllis Crandall, Michael J. Quinn. 376-381
• Designing a Coprocessor for Recurrent ComputationsKumar N. Ganapathy, Benjamin W. Wah. 382
• Analysis of Control Parallelism in SIMD Instruction StreamsJames D. Allen, Vivek Garg, David E. Schimmel. 383-390
• Representation of Coherency Classes for Parallel SystemsWalter Hussak, John A. Keane. 391-399
• A Parallel Lattice Basis Reduction for Mesh-Connected Processor Arrays and Parallel ComplexityChristian Heckler, Lothar Thiele. 400-407
• Parallel Network Dual Simplex Method on a Shared Memory MultiprocessorKrishnaiyan Thulasiraman, Prasad R. Chalasani, M. A. Comeau. 408-415
• Parallel Simulated Annealing by Generalized Speculative ComputationAndrew Sohn, Zhihong Wu, Xue Jin. 416-421
• On the Granularity of Events when Modeling Program ExecutionsEric Leu, André Schiper. 422-429
• Measures of Importance and Symmetry in Distributed SystemsMitchell L. Neilsen. 448-455
• Dependability Analysis for Large Systems: A Hierarchical Modeling ApproachTeresa A. Dahlberg, Dharma P. Agrawal. 456-459
• An Adaptive System-Level Diagnosis Approach for Hypercube MultiprocessorsChao Feng, Laxmi N. Bhuyan, Fabrizio Lombardi. 460-469
• How to Share an Object: A Fast Timing-Based SolutionRajeev Alur, Gadi Taubenfeld. 470-477
• Using Induction to Prove Properties of Distributed ProgramsVijay K. Garg, Alexander I. Tomlinson. 478-485
• An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity TestingArt Kazmierczak, Sridhar Radhakrishnan. 486-489
• Group Membership in a Synchronous Distributed SystemGianluigi Alari, Augusto Ciuffoletti. 490-495
• Compiling Distributed C++Harold Carr, Robert R. Kessler, Mark R. Swanson. 496-503
• ALIAS Environment: A Design Tool for Application Specific ArraysJames J. Liu, Milos D. Ercegovac. 504-511
• An Algorithm to Automate Non-Unimodular Transformations of Loop NestsJingling Xue. 512-521
• Genie: An Environment for Partitioning and Mapping in Embedded MultiprocessorsSudhakar Yalamanchili, Lynn E. Te Winkel, David L. Perschbacher, Belle Shenoy. 522-529
• Analysis of Affine Communication SpecificationsSanjay V. Rajopadhye. 530-537
• C-Linda Implementation of Distinct Element ModelSiong K. Tang, Richard Zurawski. 538-547
• Multicasting in Injured Hypercubes Using Limited Global InformationJie Wu, Kejun Yao. 548-555
• Fault-Tolerance Properties of deBruijn and Shuffle-Exchange NetworksMarc Baumslag. 556-563
• Communication Complexity of Fault-Tolerant Information DiffusionLuisa Gargano, Adele A. Rescigno. 564-573
• Exact Solutions to Diameter and Routing Problems in PEC NetworksC. S. Raghavendra, M. A. Sridhar. 574-581
• Folded Peterson Cube Networks: New Competitors for the Hyper CubeSabine R. Öhring, Sajal K. Das. 582-590
• Recursive Diagonal Torus: An Interconnection Network for Massively Parallel ComputersYulu Yang, Hideharu Amano, Hidetomo Shibamura, Toshinori Sueyoshi. 591-595
• A Processor Allocation Strategy Using Cube Coalescing in Hypercube MulticomputersGeunmo Kim, Hyunsoo Yoon. 596-605
• An Efficient Storage Protocol for Distributed Object Oriented DatabasesMin He, Les L. Miller, Ali R. Hurson, D. Sheth. 606-610
• Performance Effects of Synchronization in Parallel ProcessorsRoger D. Chamberlain, Mark A. Franklin. 611-616
• Compiling Distribution Directives in a FORTRAN 90D CompilerZeki Bozkus, Alok N. Choudhary, Geoffrey Fox, Tomasz Haupt, Sanjay Ranka. 617-620
• Parallel Execution of Multiple Sequential Instructions StreamsM. F. Chang, Y. K. Chan. 621-625
• Fast Rehashing in PRAM EmulationsJ. Keller. 626-632
• On the Furthest-Distance-First Principle for Data Scattering with Set-Up TimeYuh-Dauh Lyuu. 633-640
• Zero-One Sorting on the MeshDanny Krizanc, Lata Narayanan. 641-649
• Incremental Garbage Collection for Causal Relationship Computation in Distributed SystemsR. Medina. 650-655
• STAR: A Fault-Tolerant System for Distributed ApplicationsPierre Sens, Bertil Folliot. 656-660
• Flexible User-Definable Performance of Name Resolution Operation in Distributed File SystemsPradeep Kumar Sinha, Mamoru Maekawa. 661-664
• A Layered Distributed Program DebuggerWanlei Zhou. 665-668
• Distributed Algorithms on Edge Connectivity ProblemsShi-Nine Yang, M.-S. Cheng. 669-673
• Task Assignment on Distributed-Memory Systems with Adaptive Wormhole RoutingVibha A. Dixit-Radiya, Dhabaleswar K. Panda. 674-681
• A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel ComputersDebendra Das Sharma, Dhiraj K. Pradhan. 682-689
• Scalable and Non-Intrusive Load Sharing in Owner-Based Distributed SystemsBanu Özden, Aaron J. Goldberg, Abraham Silberschatz. 690-701
• Optimal Communication Algorithms on the Star Interconnection NetworkParaskevi Fragopoulou, Selim G. Akl. 702-711
• Embedding Between 2-D Meshes of the Same SizeWeifa Liang, Qing Hu, Xiaojun Shen. 712-719
• Optimal Information Dissemination in Star and Pancake NetworksAfonso Ferreira, Pascal Berthomé, Stephane Perennes. 720-725
• Extended Distributed Genetic Algorithm for Channel RoutingB. B. Prahlada Rao, R. C. Hansdah. 726-733
• A Data-Parallel Approach to the Implementation of Weighted Medians Technique on Parallel/Super-computersK. P. Lam, Ed. Horne. 734-737
• Matching Dissimilar Images: Model and AlgorithmTianxu Zhang, Weixue Lu. 738-741
• Parallel Implementations of Exclusion JoinsChung-Dak Shum. 742-747
• Point Visibility of a Simple Polygon on Reconfigurable MeshHong-Geun Kim, Yookun Cho. 748-753
• Adaptive Independent Checkpointing for Reducing Rollback PropagationJian Xu, Robert H. B. Netzer. 754-761
• Fast Polylog-Time Reconfiguration of Structurally Fault-Tolerant MultiprocessorsShantanu Dutt. 762-770
• Real-Time Distributed Program Reliability AnalysisDeng-Jyi Chen, Ming-Cheng Sheng, Maw Sheng. 771-779
• Scalable Architectures with k-ary n-Cube Cluster-c organizationDebashis Basak, Dhabaleswar K. Panda. 780-787
• On Partially Dilated Multistage Interconnection Networks with Uniform Traffic and Nonuniform Traffic SpotsMichael Jurczyk, Thomas Schwederski. 788-795
• Scalability of Binary deBruijn NetworksBarun K. Kar, Dhiraj K. Pradhan. 796-799
• A Class of Hypercube-Like NetworksAniruddha S. Vaidya, P. S. Nagendra Rao, S. Ravi Shankar. 800-805