Abstract is missing.
- Embedding and Reconfiguration of Binary Trees in Faulty HypercubesPei-Ji Yang, C. S. Raghavendra. 2-9
- A Structuring Technique for Compute-Aggregate-Broadcast Algorithms on Distributed Memory ComputersAndrew W. Kwan, Lubomir Bic. 10-17
- Adaptive Graph Computations with a Connection MachineA. Aggarwal, W. T. Ma, G. V. H. Sandri, S. Sarkar. 18-21
- Quadtree Building Algorithms on an SIMD HypercubeOscar H. Ibarra, Myung Hee Kim. 22-27
- Exploiting Concurrency among Tasks in Partitionable Parallel Processing SystemsWayne G. Nation, Anthony A. Maciejewski, Howard Jay Siegel. 30-38
- A Latency-Hiding Scheme for Multiprocessors with Buffered Multistage NetworksPer Stenström. 39-42
- A Hierarchical Directory Scheme for Large-Scale Cache-Coherent MultipmcessorsYeong-Chang Maa, Dhiraj K. Pradhan, Dominique Thiébaut. 43-46
- Properties and Performance of the Hierarchical HypercubeQutaibah M. Malluhi, Magdy A. Bayoumi. 47-50
- The Seamless Approach to Reconciling Communication and Locality in Distributed-Memory Parallel SystemsSamuel A. Fineberg, Thomas L. Casavant, Brent H. Pease. 51-56
- Efficient Process Migration in the EMPS Multiprocessor SystemG. J. W. van Dijk, M. J. van Gils. 58-66
- Dominant Representations: A Paradigm for Mapping Parallel ComputationsAjay Mohindra, Sudhakar Yalamanchili. 67-71
- Assignment of ADT Modules to ProcessorsLonnie R. Welch. 72-75
- Multiprocessor Scheduling of Periodic Tasks in a Hard Real-Time EnvironmentAshok Khemka, R. K. Shyamasundar. 76-81
- The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing AlgorithmYosi Ben-Asher, Aviad Cohen, Assaf Schuster, Jop F. Sibeyn. 82-85
- Efficient Parallel Shortest Path Algorithms for K-Chordal GraphsPinaki Mitra. 88-94
- Generalized Compressed Tree MachinesAjay K. Gupta, Hong Wang. 95-102
- Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn NetworksXiaoxiong Zhong, Sanjay V. Rajopadhye, Virginia Mary Lo. 103-107
- Efficient Parallel Algorithms for Selection and Searching on Sorted MatricesR. Sarnath, Xin He. 108-111
- A Parallel Algorithm for Recognizing the Shuffle of Two StringsAhmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar. 112-115
- Routing BPS Permutations in VLSIHussein M. Alnuweiri. 116-119
- Nearly Logarithmic Time Parallel Algorithms for the Class of /pm2^b ASCEND Computations on a SIMD HypercubeDavid Nassimi. 122-129
- An Optimal Sorting Algorithm on Reconfigurable MeshJu-wook Jang, Viktor K. Prasanna. 130-137
- An Optimal Parallel Algorithm for Finding the Smallest Enclosing Rectangle on a Mesh-Connected ComputerChang-Sung Jeong, Jung-Ju Choi. 138-141
- An Efficient Convex Hull Computation on the Reconfigurable MeshDionisios I. Reisis. 142-145
- The Bus-Usage Method for the Analysis of Reconfiguring Networks AlgorithmsYosi Ben-Asher, Assaf Schuster. 146-149
- A New Parallel Algorithm for Breadth-First Search on Interval GraphsSajal K. Das, Calvin Ching-Yuen Chen. 150-153
- Conflict-Free Scheduling of Nested Loop Algorithms on Lower Dimensional Processor ArraysZhenhui Yang, Weijia Shang, José A. B. Fortes. 156-164
- Scheduling Conditions for Concttrrent Real-Time Readers and WritersMin-Ih Chen, Ching-Chih Han, Kwei-Jay Lin. 165-168
- A Fast Parallel Scheduler for Resource Requests Implemented Using Optical DevicesT. V. Lakshman, A. Bagchi, K. Rastani. 169-172
- Analyzing Performance of Sequencing Mechanisms for Simple Layered Task SystemsAthar B. Tayyab, Jon G. Kuhl. 173-178
- Optimal Deterministic Task Distribution in MultiprocessorsIsrael Gottlieb. 179-185
- Processor Assignment in Heterogeneous Parallel ArchitecturesDaniel A. Menascé, Stella C. S. Porto, Satish K. Tripathi. 186-191
- Profiling Based Task MigrationJeff Baxter, Janak H. Patel. 192-195
- Two-State Self-Stabilizing AlgorithmsMitchell Flatebo, Ajoy Kumar Datta. 198-203
- Formal Derivation of an Efficient Parallel 2-D Gauss-Siedel MethodJ. Allan Yang, Young-il Choo. 204-207
- Memory Requirements to Balance Thus Asymptotically Full-Speedup FFT Computation on Processor ArraysJiann-Cherng Shieh. 208-211
- An Optimal Parallel Algorithm for Arithmetic Expression ParsingWeian Deng, S. Sitharama Iyengar. 212-215
- Supporting Matrix Operations in Vector ArchitecturesHua Bi, Wolfgang K. Giloi. 216-219
- IDPS: A Massively Parallel Heuristic Search AlgorithmAmbuj Mahanti, Charles J. Daniels. 220-223
- Banyan Heap MachineMohammad Reza Meybodi. 224-231
- Determining Maximum itk-Width Connectivity on MeshesSusanne E. Hambrusch, Frank K. H. A. Dehne. 234-241
- Scalable Parallel Arc Consistency Algorithms for Shared-Memory ComputersJames M. Conrad, Dharma P. Agrawal, Dennis Bahler. 242-249
- Vector Hartley Transform Employing MultiprocessorsRabi N. Mahapatra, Akhilesh Kumar. 250-253
- Analytical Modeling of a Parallel Branch-and-Bound Algorithm on MIN-Based MultiprocessorsMyung K. Yang, Chita R. Das. 254-257
- Fast Computer Vision Algorithms for Reconfigurable MeshesStephan Olariu, James L. Schwing, Jingyuan Zhang. 258-261
- A Near-Optimal Parallel Algorithm for Edge-Coloring Outerplanar GraphsYuval Caspi, Eliezer Dekel. 262-266
- Implementation of Parallel Processors with Wafer Scale IntegrationThomas K. Callaway, Earl E. Swartzlander Jr.. 268-274
- Space-Optimal Linear Processor Allocation for Systolic Arrays SynthesisYiwan Wong, Jean-Marc Delosme. 275-282
- A Systolic Algorithm and Architecture for Galois Field ArithmeticMario Kovac, N. Ranganathan, M. Varanasi. 283-288
- VLSI Implementation of a 256 x 256 Crossbar Interconnection NetworkKyusun Choi, William S. Adams. 289-293
- VLSI Architectures for Recursive and Multiple-Window Order Statistic FilteringM. Reza Hakami, Peter J. Warter, Charles G. Boncelet Jr., David Nassimi. 294-297
- A Software Tool for Cellular Mapping of Discrete Unitary TransformsGeorge Miel, Evangelos A. Yfantis. 298-304
- Optimal Algorithms for the Vertex Updating Problem of a Minimum Spanning TreeDonald B. Johnson, Panagiotis Takis Metaxas. 306-314
- Parallel Heap Operations on EREW PRAM: Summary of ResultsWeixiong Zhang, Richard E. Korf. 315-318
- A Distributed Data-Balanced Dictionary Based on the B-Link TreeTheodore Johnson, Adrian Colbrook. 319-324
- Serial and Parallel Algorithms for the Medial Axis TransformJing-Fu Fu Jenq, Sartaj Sahni. 326-333
- A Parallel Approach to Hybrid Range Image SegmentationNicholas Giolmas, Daniel W. Watson, David M. Chelberg, Howard Jay Siegel. 334-342
- Optimal Aspect Ratio and Number of Separable Row/Column Buses for Mesh-Connected Parallel ComputersMauricio J. Serrano, Behrooz Parhami. 343-347
- Design and Analysis of Fault-Detecting and Fault-Locating Schedules for Computation DAGsShalini Yajnik, Niraj K. Jha. 348-351
- A Model of Objects and Communication for Massively Parallel ProgrammingMichael F. Kilian. 354-357
- A Computational Model for Message PassingAnand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran. 358-361
- Evaluation of Connected Component Labeling Algorithms on Shared and Distributed Memory MultiprocessorsAlok N. Choudhary, Rajeev Thakur. 362-365
- Building Families of Object-Based Multiprocessor KernelsKarsten Schwan, Ahmed Gheith, Hongyi Zhou. 366-369
- Using a Functional Language id Graph Reduction to Program Multiprocessor Machines, or Functional Control of Imperative ProgramsLal George, Gary Lindstrom. 370-373
- Automatic Parallelization of Programs with Tools of Trace TheoryChristophe Cérin. 374-378
- Bussed Interconnection Networks from TreesCharles M. Fiduccia. 380-389
- On-Line Communication on Circuit-Switched Fixed Routing MeshesAbdou Youssef. 390-397
- Fault-Tolerant Multiprocessor System Routing Using Incomplete Diagnostic InformationDouglas M. Blough, Shahriar Najand. 398-402
- Permutation Routing in Restricted Access NetworksAbdou Youssef, Brian D. Alleyne, Isaac D. Scherson. 403-406
- Multipath E-Cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in itk-ary itn-CubesJeffrey T. Draper, Joydeep Ghosh. 407-410
- Asymmetrical Multiconnection Three-Stage Clos NetworksAnujan Varma, Suresh Chalasani. 411-414
- Solving Linear Recurrences with Loop RakingGuy E. Blelloch, Siddhartha Chatterjee, Marco Zagha. 416-424
- Histogramming on a Reconfigurable Mesh ComputerJing-Fu Fu Jenq, Sartaj Sahni. 425-432
- Householder Transformation for the Regularized Least Square Problem on iPSX/860Jianping Zhu. 433-436
- A Superior Class of Networks for Reconfigurable MeshesRichard Mazzaferri, Heiko Schröder. 437-442
- Parallel Implementation of the Auction Algorithm on the Intel HypercubeNader Bagherzadeh, Kent Hawk. 443-447
- Parallel Heap: Improved and SimplifiedSushil K. Prasad, Narsingh Deo. 448-451
- Language Constructs for Structured Parallel ProgrammingZhiwei Xu, Kai Hwang. 454-461
- Cluster-M Parallel Programming ModelMary Mehrnoosh Eshaghian. 462-465
- Associative Parallel LexingChandra R. Asthagiri, Jerry L. Potter. 466-469
- Compile-Time Estimation of Communication Costs on MulticomputersManish Gupta, Prithviraj Banerjee. 470-475
- Prototyping N-Body Simulation in ProteusPeter Mills, Lars S. Nyland, Jan Prins, John H. Reif. 476-482
- A Library Environment for Distributed-Memory MultiprocessorsM. Kishore Kumar, P. Sreenivasa Kumar, A. Basu. 483-486
- Performability Studies of Hypercube ArchitecturesSamir M. Koriem, Lalit M. Patnaik. 488-495
- A Functional Execution Model for a Non-Dataflow Tagged Token ArchitectureGlenn Jennings. 496-501
- The Vesicular Dataflow ModelRoman Podraza, Dariusz Turlej, Krzysztof Piorun. 502-507
- The Interplay between Granularity, Performance, and Availability in a Replicated Linda Tuple SpaceSrikanth Kambhatla, Jonathan Walpole. 508-511
- Adaptive Deadlock-Free Worrnhole Routing in HypercubesLuis Gravano, Gustavo D. Pifarré, Gustavo Denicolay, Jorge L. C. Sanz. 512-515
- Optimal Allocation of Shared Data over Distributed Memory HierarchiesEmile Haddad. 518-526
- A Conceptual Framework for Implementing Neural Networks on Massively Parallel MachinesMagali E. Azema-Barac. 527-530
- The Effects of Communication Overhead on the Speedup of Parallel 3-D Finite Element ApplicationsValerie E. Taylor, Bahram Nour-Omid, David G. Messerschmitt. 531-536
- Parallel Coprocessor for Kohonen s Self-Organizing Neural NetworkJukka Saarinen, Martti Lindroos, Jouni Tomberg, Kimmo Kaski. 537-542
- Load Balancing for Distributed Branch and Bound AlgorithmsReinhard Lüling, Burkhard Monien. 543-548
- The Odd-Even Expansion Storage Scheme and Its Implementation IssuesZhiyong Liu, Jia-Huai You, Xiaobo Li. 550-557
- Matching Algorithms and Architecture in Hierarchical Shared-Memory Multiprocessor (HMS) SystemsAshfaq A. Khokhar, Michel Dubois. 558-561
- Performance Analysis of Two Address Space Allocation Schemes for an Optically Interconnected Distributed Shared-Memory SystemKalyani Bogineni, Patrick W. Dowd. 562-566
- Some Architectural and Compilation Issues in the Design of Hierarchical Shared-Memory MultiprocessorsD. N. Jayasimha, Jeff D. Martens. 567-572
- CCHIME: A Cache Coherent Hybrid Interconnected Memory ExtensionMatthew K. Farrens, Arvin Park, Allison Woodruff. 573-577
- The Impact of Wiring Constraints on Hierarchical Network PerformanceWilliam Tsun-Yuk Hsu, Pen-Chung Yew. 580-588
- Distributed Algorithms for Shortest-Path Deadlock-Free Routing and Broadcasting in a Class of Interconnection TopologiesJen-Shiuh Liu, Wen-Jing Hsu. 589-596
- An Improved Multiple-Path Deadlock-Free Routing Algorithm in Binary HypercubesQiang Li. 597-601
- Multipacket Selection on Mesh-Connected Processor ArraysDanny Krizanc, Lata Narayanan. 602-605
- Visualization of a Simple Routing Scheme for MeshesNelson Ge, John K. Antonio, Sharada V. Vitalpur. 606-609
- The Möbus Cubes: Improved Cubelike Networks for Parallel ComputationPaul Cull, Shawn M. Larson. 610-613
- Hierarchically Organized Petri Net State Space for Reachability and Deadlock AnalysisMasato Notomi, Tadao Murata. 616-623
- Modeling and Control of Distributed Asynchronous ComputationsLongsong Lin, John K. Antonio. 624-631
- Distributed Consensus in Semi-Synchronous SystemsPiotr Berman, Anupam A. Bharali. 632-635
- A Paradigm for Distributed Deadlock Avoidance in Multicomputer NetworksJ. P. Samantarai. 636-639
- A Scheme for State Change in a Distributed Environment Using Weighted Throw CountingKazuaki Rokusawa, Nobuyuki Ichiyoshi. 640-645
- A More Efficient Message-Optimal Algorithm for Distributed Termination DetectionTen-Hwang Lai, Yu-Chee Tseng, Xuefeng Dong. 646-649
- The Combining Dag: A Technique for Parallel DataMow AnalysisRobert Kramer, Rajiv Gupta, Mary Lou Soffa. 652-655
- Scalable Reader-Writer Locks for Parallel SystemsWilson C. Hsieh, William E. Weihl. 656-659
- Hash Table in Massively Parallel SystemsI-Ling Yen, Farokh B. Bastani. 660-664
- Preventing Recursion Deadlock in Concurrent Object-Oriented SystemsEric A. Brewer, Carl A. Waldspurger. 665-670
- Comparisons and Analysis of Massively Parallel SIMD Architectures for Parallel Logic SimulationEunmi Choi, Moon-Jung Chung, Yunmo Chung. 671-674
- Exploiting SIMD Computers for General Purpose ComputationPhilip A. Wilsey, Debra A. Hensgen. 675-679
- Hybrid Loop Interchange: Optimization for Parallel ProgramsGuohua Jin, Fujie Chen. 680-685
- Aroma: Language Support for Distributed ObjectsHiroshi Nishikawa, Peter Steenkiste. 686-690