Table of Contents

• Efficient Implementations of a Class of ± 2:::::::b::::::: Parallel Computations on a SIMD HypercubeDavid Nassimi, Yuh-Dong Tsai. 2-9
• Triangulation in a Plane and 3-D Convex Hull on Mesh-Connected Arrays and HypercubesJ. Andrew Holey, Oscar H. Ibarra. 10-17
• The Effects of Communication Latency Upon Synchronization and Dynamic Load Balance on a HypercubeDan C. Marinescu, John R. Rice. 18-25
• Improved Graph Computations on the Reconfigurable MeshDionisios I. Reisis. 26-29
• Design Guidelines for Parallel Algorithms Using Continuous Job ProfilesLinda F. Wilson, Mario J. Gonzalez. 30-36
• An Inherently Fault Tolerant Sorting AlgorithmI-Ling Yen, Farokh B. Bastani, Ernst L. Leiss. 37-42
• Performance Analysis of Algorithms on a Message Passing MultiprocessorAnupam Basu, S. Srinivas, Kamlesh G. Kumar, Arogyaswami Paulraj, Lalit M. Patnaik. 43-50
• Routing Algorithms in Interval and Circular-Arc NetworksM. A. Sridhar, Shri K. Goyal. 51-55
• Generalized Formulation and Hypercube Algorithms for Relaxation LabelingEva Leung, Xiaobo Li. 64-69
• General Asynchrony Is Not Expensive for PRAMsJeffrey C. Becker, Charles U. Martel, Arvin Park. 70-75
• Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the HypercubeOscar H. Ibarra, Myung Hee Kim. 76-83
• Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar GraphsHillel Gazit. 84-91
• Scalability of Parallel Sorting on Mesh MulticomputersVineet Singh, Vipin Kumar, Gul Agha, Chris Tomlinson. 92-101
• An Algorithm for Generating Node Disjoint Routes in Kautz DigraphsGerard J. M. Smit, Paul J. M. Havinga, Pierre G. Jansen. 102-107
• A Neural-Type Parallel Algorithm for Fast Matrix InversionMarios M. Polycarpou, Petros A. Ioannou. 108-113
• Parallel Multiple SearchZhaofang Wen. 114-119
• A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAMCalvin Ching-Yuen Chen, Sajal K. Das. 132-137
• A Parallel Approximation Algorithm for Solving One-Dimensional Bin Packing ProblemsJudith O. Berkey, Pearl Y. Wang. 138-143
• Fully Normal Algorithms for Incomplete HypercubesVenkata K. Prabhala, Naveed A. Sherwani. 144-150
• Refining Algorithm Mappings for Linear Systolic ArraysRavi Varadarajan, Bhavani Ravichandran. 151-154
• Analysis of Parallel Mixed-Mode Simulation AlgorithmsRoger D. Chamberlain, Mark A. Franklin. 155-160
• Implementation of an Oversize Neural Network on DAP-510S. N. Gupta, Mohammad Zubair, C. E. Grosch. 161-164
• Trade-Offs In Mapping FFT Computations onto Fixed Size Mesh Processor ArrayJu-wook Jang, K. Wojtek Przytula. 170-177
• Parallel Vision Integration on the AMT Distributed Array ProcessorScott T. Toborg, Kai Hwang. 178-185
• Functional Characterization of Sensor Integration in Distributed Sensor NetworksLakshman Prasad, S. Sitharama Iyengar, Rangasami L. Kashyap, R. N. Madan. 186-193
• Connected Components with Split and MergeJames J. Kistler, Jon A. Webb. 194-201
• Otpical Content Addressable Memories for Data/Knowledge Base ProcessingSelim Akyokus, P. Bruce Berra. 202-207
• Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template MatchingJing-Fu Fu Jenq, Sartaj Sahni. 208-215
• Parallel Implementation of Image Understanding Tasks on Gated-Connection NetworksDavid B. Shu, J. Greg Nash, K. Kim. 216-223
• Special Features of a VLIW ArchitectureArthur Abnous, Nader Bagherzadeh. 224-227
• A Neural Algorithm for Variable Thresholding of ImagesZhen-Ping Lo, Behnam Bavarian. 228-233
• Design of an Optical Content-Addressable Parallel Processor with Applications to Fast Searching and Information RetrievalAhmed Louri. 234-239
• A Parallel Processing Approach to Incremental Conceptual ClusteringPeter Wohl, Thomas W. Christopher. 240-245
• Analysis of Neighborhood Interaction in Kohonen Neural NetworksZhen-Ping Lo, Masahiro Fujita, Behnam Bavarian. 246-249
• On a Binary Relation Inference NetworkK. P. Lam, C. J. Su. 250-255
• MCMR: A Multiple Rule Firing Production System ModelSteve Kuo, Dan I. Moldovan, Seungho Cha. 256-259
• Guided Scheduling Schemes for Image Understanding Tasks for Shared and Distributed Memory MultiprocessorsAlok N. Choudhary, Ravi Ponnusamy. 260-264
• Optical Database Machine Using Spatial Light RebroadcastersSoon Myoung Chung. 265-268
• Prototype Implementation of a Highly Parallel Dataflow Machine EM-4Shuichi Sakai, Yuetsu Kodama, Yoshinori Yamaguchi. 278-286
• Proteus System Architecture and OrganizationArun K. Somani, Craig M. Wittenbrink, Robert M. Haralick, Linda G. Shapiro, Jenq-Neng Hwang, Chung-Ho Chen, Robert Johnson, Kenneth Cooper. 287-294
• Instruction Execution Trade-Offs for SIMD vs. MIMD vs. Mixed Mode ParallelismThomas B. Berg, Howard Jay Siegel. 301-308
• An Effective Synchronization Network for Large Multiprocessor SystemsWilliam Tsun-Yuk Hsu, Pen-Chung Yew. 309-317
• Input/Output Operations for Hybrid Data-Flow/Control-Flow SystemsParaskevas Evripidou, Jean-Luc Gaudiot. 318-323
• A Linked List Cache Coherence Protocol: Verifying the Bottom LayerStein Gjessing, Stein Krogdahl, Ellen Munthe-Kaas. 324-329
• An Approach to Solve the Cache Thrashing ProblemZhixi Fang, Mi Lu, Hua Lin. 330-335
• Parallel Multi-Context Architecture with High-Speed Synchronization MechanismKenji Toda, Kenji Nishida, Yoshinobu Uchibori, Shuichi Sakai, Toshio Shimada. 336-343
• Systolic Rank Updating and the Solution of Non-Linear EquationsGraham M. Megson. 344-351
• On the Design of Optimal Fault-Tolerant Systolic Array ArchitecuresMichael Ogbonna Esonu, Asim J. Al-Khalili, Salim Hariri. 352-357
• From Algorithms to Parallel Architectures: A Formal ApproachKhaled M. Elleithy, Magdy A. Bayoumi. 358-363
• Systolic Array Architecture for Adaptive Eigenstructure Decomposition of Correlation MatricesS. Erlich, K. Yao. 371-376
• State Variable Model for a Class of Multiprocessor SystemsG. M. Chaudhry, J. S. Bedi. 377-380
• Parallel I/O Subsystems for Distributed-Memory MulticomputersJoydeep Ghosh, Bipul Agarwal. 381-384
• Amstrong II: A Loosely Coupled Multiprocessor with a Reconfigurable Communications ArchitecturePeter M. Athanas, Harvey F. Silverman. 385-388
• Multidimensional Access Shared Memory Parallel Processing SystemsIsaac D. Scherson. 390-397
• A Simple Algorithm to Route Arbitrary Permuations on 8-Input 5-Stage Shuffle/Exchange NetworkKichul Kim, C. S. Raghavendra. 398-403
• Characterization of Node Disjoint (Parallel) Path in Star GraphsJung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall. 404-409
• Efficient Randomized Routing on Clos NetworksAbdou Youssef. 410-415
• On Optimal Embeddings into Incomplete HypercubesAjay K. Gupta, Alfred J. Boals, Naveed A. Sherwani. 416-423
• Distributed Hierarchical Optimal Routing Using Aggregation/Disaggergation and Decomposition/Composition TechniquesSung-Woo Park, Wei Kang Tsai. 424-431
• A Note on Orthogonal GraphsSeshu V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall. 432-437
• Choosing the Interconnect of Distributed Memory Systems by Cost and Blocking BehaviorWolfgang K. Giloi, Sergio Montenegro. 438-444
• Optimum Embeddings of End-Around Meshes into Pyramid NetworksAdam Dingle, H. Barada. 445-451
• Link Augmented Binary (LAB)-Tree: Its Structure, Routing and Fault Tolerance PropertiesRavi Mittal, Bijendra N. Jain, Rakesh K. Patney. 452-457
• Congestion and Fault Tolerance of Binary Tree Embeddings on HypercubeKemal Efe, Kumar Ramaiyer. 458-463
• Multi-level Hypercube NetworkMokhtar Aboelaze. 475-480
• A Resilient Decentralized Commit ProtocolShyan-Ming Yuan. 481-486
• Greedy Partitioning Strategy for Banyan-Hypercube NetworksAbdelghani Bellaachia, Abdou Youssef. 487-490
• High-Performance Parallel Pipelined Voting NetworksBehrooz Parhami. 491-494
• Modeling and Performance Analysis for Processor-to-Processor Communications Unit Using a 100 Mb/s Optical Token RingTohru Matsunaga, Ikuro Oyaizu, E. Uozumi, T. Hoshiko, Y. Kimura. 495-498
• A Scheduling Algorithm for Parallelizable Dependent TasksKrishna P. Belkhale, Prithviraj Banerjee. 500-506
• Scheduling and Optimization for Multiprocessor SystemsChiun-Chieh Hsu. 507-512
• A System for Algorithm-Architecture Mapping Based on Dependence Graph Matching and HypergraphsJuan Li, Leah H. Jamieson. 513-518
• A Message Segmentation Technique to Minimize Task Completion TimeSukil Kim, Santosh Pande, Dharma P. Agrawal, Jon Mauney. 519-524
• Load Balancing on a HypercubeJinwoon Woo, Sartaj Sahni. 525-530
• Scheduling Parallelizable Imprecise Computations on MultiprocessorsAlbert Chuang-shi Yu, Kwei-Jay Lin. 531-536
• Improved Algorithms for Load Balancing in Circuit-Switched HypercubesC. S. Raghavendra, Suresh Chalasani, Rajendra V. Boppana. 537-542
• Implementation of a Parallel Prolog Interpreter on MultiprocessorsLaxmikant V. Kalé, Balkrishna Ramkumar. 543-548
• Data Prefetching Strategies for Vector Cache MemoriesJohn W. C. Fu, Janak H. Patel. 555-560
• Use of PARADISE: A Meta-Tool for Visualizing Parallel SystemsJames Arthur Kohl, Thomas L. Casavant. 561-567
• Chief: A Parallel Simulation Environment for Parallel SystemsJohn D. Bruner, Hoichi Cheong, Alexander V. Veidenbaum, Pen-Chung Yew. 568-575
• Confining Imperative Languages for Parallel ProcessingKechang Dai, Wolfgang K. Giloi. 576-581
• A Geometrical Coding to Compile Affine Recurrence Equations on Regular ArraysCatherine Mongenet, Philippe Clauss, Guy-René Perrin. 582-590
• A Load Sharing Interconnection Network for Hard Real-Time SystemsAlberto Avritzer, Mario Gerla, Jack W. Carlyle. 591-598
• Loop Partitioning Unimodular Transformations for Distributed Memory MultiprocessorsDattatraya Kulkarni, Kamlesh G. Kumar, Anupam Basu, Arogyaswami Paulraj. 599-604
• Execution of Regular DO Loops on Asynchronous MultiprocessorsPei Ouyang. 605-610
• Process Migration in the GALAXY Distributed Operating SystemPradeep Kumar Sinha, Kyu Sung Park, Xiaohua Jia, Kentaro Shimizu, Mamoru Maekawa. 611-618
• An Analysis of Recurrence Relations in Fortran Do-loops for Vector ProcessingChih-Ping Chu, Doris L. Carver. 619-625
• PRESHAK: A Generic Tool to Implement Application Specific Message-Passing Communication Kernels for Concurrent MachinesAlok Srivastava, Sanjay C. Kshetramade. 626-629
• Parallelizing Tightly Nested LoopsKi-Chang Kim, Alexandru Nicolau. 630-633
• A Simulation of Demand-Driven Dataflow: Translation from Lucid into MDC LanguageGeorge K. Thiruvathukal, Thomas W. Christopher. 634-637
• PMACS: An Environment for Parallel ProgrammingB. Dehbonei, Christophe Laurent, Nadia Tawbi, R. S. Kulkarni. 638-641
• How Do We Make Parallel Processing a Reality? Bridging the Gap Between Theory and PracticeAlfred Brenner, Richard F. Freund, R. Stockton Gaines, Rob Kelly, Louis Lome, Richard McAndrew, Alexandru Nicolau, Janak H. Patel, Thomas Probert, John H. Reif, Jorge L. C. Sanz, Howard Jay Siegel, Jon A. Webb. 648-653