6. IPPS 1992: Beverly Hills, California, USA

Viktor K. Prasanna, Larry H. Canter (Eds.): Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, USA, March 1992. IEEE Computer Society 1992, ISBN 0-8186-2672-0

Algorithms-I

Pei-Ji Yang, C. S. Raghavendra: Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes. 2-9
Andrew W. Kwan, Lubomir Bic: A Structuring Technique for Compute-Aggregate-Broadcast Algorithms on Distributed Memory Computers. 10-17
A. Aggarwal, W. T. Ma, G. V. H. Sandri, S. Sarkar: Adaptive Graph Computations with a Connection Machine. 18-21
Oscar H. Ibarra, Myung Hee Kim: Quadtree Building Algorithms on an SIMD Hypercube. 22-27

Architectures-I

Wayne G. Nation, Anthony A. Maciejewski, Howard Jay Siegel: Exploiting Concurrency among Tasks in Partitionable Parallel Processing Systems. 30-38
Per Stenström: A Latency-Hiding Scheme for Multiprocessors with Buffered Multistage Networks. 39-42
Yeong-Chang Maa, Dhiraj K. Pradhan, Dominique Thiébaut: A Hierarchical Directory Scheme for Large-Scale Cache-Coherent Multipmcessors. 43-46
Qutaibah M. Malluhi, Magdy A. Bayoumi: Properties and Performance of the Hierarchical Hypercube. 47-50
Samuel A. Fineberg, Thomas L. Casavant, Brent H. Pease: The Seamless Approach to Reconciling Communication and Locality in Distributed-Memory Parallel Systems. 51-56

Mapping/Scheduling-I

G. J. W. van Dijk, M. J. van Gils: Efficient Process Migration in the EMPS Multiprocessor System. 58-66
Ajay Mohindra, Sudhakar Yalamanchili: Dominant Representations: A Paradigm for Mapping Parallel Computations. 67-71
Lonnie R. Welch: Assignment of ADT Modules to Processors. 72-75
Ashok Khemka, R. K. Shyamasundar: Multiprocessor Scheduling of Periodic Tasks in a Hard Real-Time Environment. 76-81
Yosi Ben-Asher, Aviad Cohen, Assaf Schuster, Jop F. Sibeyn: The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing Algorithm. 82-85

Algorithms-II

Pinaki Mitra: Efficient Parallel Shortest Path Algorithms for K-Chordal Graphs. 88-94
Ajay K. Gupta, Hong Wang: Generalized Compressed Tree Machines. 95-102
Xiaoxiong Zhong, Sanjay V. Rajopadhye, Virginia Mary Lo: Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn Networks. 103-107
R. Sarnath, Xin He: Efficient Parallel Algorithms for Selection and Searching on Sorted Matrices. 108-111
Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar: A Parallel Algorithm for Recognizing the Shuffle of Two Strings. 112-115
Hussein M. Alnuweiri: Routing BPS Permutations in VLSI. 116-119

Applications-I

David Nassimi: Nearly Logarithmic Time Parallel Algorithms for the Class of \pm2^b ASCEND Computations on a SIMD Hypercube. 122-129
Ju-wook Jang, Viktor K. Prasanna: An Optimal Sorting Algorithm on Reconfigurable Mesh. 130-137
Chang-Sung Jeong, Jung-Ju Choi: An Optimal Parallel Algorithm for Finding the Smallest Enclosing Rectangle on a Mesh-Connected Computer. 138-141
Dionisios I. Reisis: An Efficient Convex Hull Computation on the Reconfigurable Mesh. 142-145
Yosi Ben-Asher, Assaf Schuster: The Bus-Usage Method for the Analysis of Reconfiguring Networks Algorithms. 146-149
Sajal K. Das, Calvin Ching-Yuen Chen: A New Parallel Algorithm for Breadth-First Search on Interval Graphs. 150-153

Mapping/Scheduling-II

Zhenhui Yang, Weijia Shang, José A. B. Fortes: Conflict-Free Scheduling of Nested Loop Algorithms on Lower Dimensional Processor Arrays. 156-164
Min-Ih Chen, Ching-Chih Han, Kwei-Jay Lin: Scheduling Conditions for Concttrrent Real-Time Readers and Writers. 165-168
T. V. Lakshman, A. Bagchi, K. Rastani: A Fast Parallel Scheduler for Resource Requests Implemented Using Optical Devices. 169-172
Athar B. Tayyab, Jon G. Kuhl: Analyzing Performance of Sequencing Mechanisms for Simple Layered Task Systems. 173-178
Israel Gottlieb: Optimal Deterministic Task Distribution in Multiprocessors. 179-185
Daniel A. Menascé, Stella C. S. Porto, Satish K. Tripathi: Processor Assignment in Heterogeneous Parallel Architectures. 186-191
Jeff Baxter, Janak H. Patel: Profiling Based Task Migration. 192-195

Algorithms-III

Mitchell Flatebo, Ajoy Kumar Datta: Two-State Self-Stabilizing Algorithms. 198-203
J. Allan Yang, Young-il Choo: Formal Derivation of an Efficient Parallel 2-D Gauss-Siedel Method. 204-207
Jiann-Cherng Shieh: Memory Requirements to Balance Thus Asymptotically Full-Speedup FFT Computation on Processor Arrays. 208-211
Weian Deng, S. Sitharama Iyengar: An Optimal Parallel Algorithm for Arithmetic Expression Parsing. 212-215
Hua Bi, Wolfgang K. Giloi: Supporting Matrix Operations in Vector Architectures. 216-219
Ambuj Mahanti, Charles J. Daniels: IDPS: A Massively Parallel Heuristic Search Algorithm. 220-223
Mohammad Reza Meybodi: Banyan Heap Machine. 224-231

Applications-II

Susanne E. Hambrusch, Frank K. H. A. Dehne: Determining Maximum itk-Width Connectivity on Meshes. 234-241
James M. Conrad, Dharma P. Agrawal, Dennis Bahler: Scalable Parallel Arc Consistency Algorithms for Shared-Memory Computers. 242-249
Rabi N. Mahapatra, Akhilesh Kumar: Vector Hartley Transform Employing Multiprocessors. 250-253
Myung K. Yang, Chita R. Das: Analytical Modeling of a Parallel Branch-and-Bound Algorithm on MIN-Based Multiprocessors. 254-257
Stephan Olariu, James L. Schwing, Jingyuan Zhang: Fast Computer Vision Algorithms for Reconfigurable Meshes. 258-261
Yuval Caspi, Eliezer Dekel: A Near-Optimal Parallel Algorithm for Edge-Coloring Outerplanar Graphs. 262-266

Special-Purpose Architectures

Thomas K. Callaway, Earl E. Swartzlander Jr.: Implementation of Parallel Processors with Wafer Scale Integration. 268-274
Yiwan Wong, Jean-Marc Delosme: Space-Optimal Linear Processor Allocation for Systolic Arrays Synthesis. 275-282
Mario Kovac, N. Ranganathan, M. Varanasi: A Systolic Algorithm and Architecture for Galois Field Arithmetic. 283-288
Kyusun Choi, William S. Adams: VLSI Implementation of a 256 x 256 Crossbar Interconnection Network. 289-293
M. Reza Hakami, Peter J. Warter, Charles G. Boncelet Jr., David Nassimi: VLSI Architectures for Recursive and Multiple-Window Order Statistic Filtering. 294-297
George Miel, Evangelos A. Yfantis: A Software Tool for Cellular Mapping of Discrete Unitary Transforms. 298-304

Algorithms-IV

Donald B. Johnson, Panagiotis Takis Metaxas: Optimal Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree. 306-314
Weixiong Zhang, Richard E. Korf: Parallel Heap Operations on EREW PRAM: Summary of Results. 315-318
Theodore Johnson, Adrian Colbrook: A Distributed Data-Balanced Dictionary Based on the B-Link Tree. 319-324

Applications-III

Jing-Fu Fu Jenq, Sartaj Sahni: Serial and Parallel Algorithms for the Medial Axis Transform. 326-333
Nicholas Giolmas, Daniel W. Watson, David M. Chelberg, Howard Jay Siegel: A Parallel Approach to Hybrid Range Image Segmentation. 334-342
Mauricio J. Serrano, Behrooz Parhami: Optimal Aspect Ratio and Number of Separable Row/Column Buses for Mesh-Connected Parallel Computers. 343-347
Shalini Yajnik, Niraj K. Jha: Design and Analysis of Fault-Detecting and Fault-Locating Schedules for Computation DAGs. 348-351

Software-I

Michael F. Kilian: A Model of Objects and Communication for Massively Parallel Programming. 354-357
Anand Sivasubramaniam, Umakishore Ramachandran, H. Venkateswaran: A Computational Model for Message Passing. 358-361
Alok N. Choudhary, Rajeev Thakur: Evaluation of Connected Component Labeling Algorithms on Shared and Distributed Memory Multiprocessors. 362-365
Karsten Schwan, Ahmed Gheith, Hongyi Zhou: Building Families of Object-Based Multiprocessor Kernels. 366-369
Lal George, Gary Lindstrom: Using a Functional Language id Graph Reduction to Program Multiprocessor Machines, or Functional Control of Imperative Programs. 370-373
Christophe Cérin: Automatic Parallelization of Programs with Tools of Trace Theory. 374-378

Networks-I

Charles M. Fiduccia: Bussed Interconnection Networks from Trees. 380-389
Abdou Youssef: On-Line Communication on Circuit-Switched Fixed Routing Meshes. 390-397
Douglas M. Blough, Shahriar Najand: Fault-Tolerant Multiprocessor System Routing Using Incomplete Diagnostic Information. 398-402
Abdou Youssef, Brian D. Alleyne, Isaac D. Scherson: Permutation Routing in Restricted Access Networks. 403-406
Jeffrey T. Draper, Joydeep Ghosh: Multipath E-Cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in itk-ary itn-Cubes. 407-410
Anujan Varma, Suresh Chalasani: Asymmetrical Multiconnection Three-Stage Clos Networks. 411-414

Applications-IV

Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha: Solving Linear Recurrences with Loop Raking. 416-424
Jing-Fu Fu Jenq, Sartaj Sahni: Histogramming on a Reconfigurable Mesh Computer. 425-432
Jianping Zhu: Householder Transformation for the Regularized Least Square Problem on iPSX/860. 433-436
Richard Mazzaferri, Heiko Schröder: A Superior Class of Networks for Reconfigurable Meshes. 437-442
Nader Bagherzadeh, Kent Hawk: Parallel Implementation of the Auction Algorithm on the Intel Hypercube. 443-447
Sushil K. Prasad, Narsingh Deo: Parallel Heap: Improved and Simplified. 448-451

Software-II

Zhiwei Xu, Kai Hwang: Language Constructs for Structured Parallel Programming. 454-461
Mary Mehrnoosh Eshaghian: Cluster-M Parallel Programming Model. 462-465
Chandra R. Asthagiri, Jerry L. Potter: Associative Parallel Lexing. 466-469
Manish Gupta, Prithviraj Banerjee: Compile-Time Estimation of Communication Costs on Multicomputers. 470-475
Peter Mills, Lars S. Nyland, Jan Prins, John H. Reif: Prototyping N-Body Simulation in Proteus. 476-482
M. Kishore Kumar, P. Sreenivasa Kumar, A. Basu: A Library Environment for Distributed-Memory Multiprocessors. 483-486

Architectures-II

Samir M. Koriem, Lalit M. Patnaik: Performability Studies of Hypercube Architectures. 488-495
Glenn Jennings: A Functional Execution Model for a Non-Dataflow Tagged Token Architecture. 496-501
Roman Podraza, Dariusz Turlej, Krzysztof Piorun: The Vesicular Dataflow Model. 502-507
Srikanth Kambhatla, Jonathan Walpole: The Interplay between Granularity, Performance, and Availability in a Replicated Linda Tuple Space. 508-511
Luis Gravano, Gustavo D. Pifarré, Gustavo Denicolay, Jorge L. C. Sanz: Adaptive Deadlock-Free Worrnhole Routing in Hypercubes. 512-515

Applications-V

Emile Haddad: Optimal Allocation of Shared Data over Distributed Memory Hierarchies. 518-526
Magali E. Azema-Barac: A Conceptual Framework for Implementing Neural Networks on Massively Parallel Machines. 527-530
Valerie E. Taylor, Bahram Nour-Omid, David G. Messerschmitt: The Effects of Communication Overhead on the Speedup of Parallel 3-D Finite Element Applications. 531-536
Jukka Saarinen, Martti Lindroos, Jouni Tomberg, Kimmo Kaski: Parallel Coprocessor for Kohonen's Self-Organizing Neural Network. 537-542
Reinhard Lüling, Burkhard Monien: Load Balancing for Distributed Branch and Bound Algorithms. 543-548

Systems

Zhiyong Liu, Jia-Huai You, Xiaobo Li: The Odd-Even Expansion Storage Scheme and Its Implementation Issues. 550-557
Ashfaq A. Khokhar, Michel Dubois: Matching Algorithms and Architecture in Hierarchical Shared-Memory Multiprocessor (HMS) Systems. 558-561
Kalyani Bogineni, Patrick W. Dowd: Performance Analysis of Two Address Space Allocation Schemes for an Optically Interconnected Distributed Shared-Memory System. 562-566
D. N. Jayasimha, Jeff D. Martens: Some Architectural and Compilation Issues in the Design of Hierarchical Shared-Memory Multiprocessors. 567-572
Matthew K. Farrens, Arvin Park, Allison Woodruff: CCHIME: A Cache Coherent Hybrid Interconnected Memory Extension. 573-577

Networks-II

William Tsun-Yuk Hsu, Pen-Chung Yew: The Impact of Wiring Constraints on Hierarchical Network Performance. 580-588
Jen-Shiuh Liu, Wen-Jing Hsu: Distributed Algorithms for Shortest-Path Deadlock-Free Routing and Broadcasting in a Class of Interconnection Topologies. 589-596
Qiang Li: An Improved Multiple-Path Deadlock-Free Routing Algorithm in Binary Hypercubes. 597-601
Danny Krizanc, Lata Narayanan: Multipacket Selection on Mesh-Connected Processor Arrays. 602-605
Nelson Ge, John K. Antonio, Sharada V. Vitalpur: Visualization of a Simple Routing Scheme for Meshes. 606-609
Paul Cull, Shawn M. Larson: The Möbus Cubes: Improved Cubelike Networks for Parallel Computation. 610-613

Distributed Systems

Masato Notomi, Tadao Murata: Hierarchically Organized Petri Net State Space for Reachability and Deadlock Analysis. 616-623
Longsong Lin, John K. Antonio: Modeling and Control of Distributed Asynchronous Computations. 624-631
Piotr Berman, Anupam A. Bharali: Distributed Consensus in Semi-Synchronous Systems. 632-635
J. P. Samantarai: A Paradigm for Distributed Deadlock Avoidance in Multicomputer Networks. 636-639
Kazuaki Rokusawa, Nobuyuki Ichiyoshi: A Scheme for State Change in a Distributed Environment Using Weighted Throw Counting. 640-645
Ten-Hwang Lai, Yu-Chee Tseng, Xuefeng Dong: A More Efficient Message-Optimal Algorithm for Distributed Termination Detection. 646-649

Software-III

Robert Kramer, Rajiv Gupta, Mary Lou Soffa: The Combining Dag: A Technique for Parallel DataMow Analysis. 652-655
Wilson C. Hsieh, William E. Weihl: Scalable Reader-Writer Locks for Parallel Systems. 656-659
I-Ling Yen, Farokh B. Bastani: Hash Table in Massively Parallel Systems. 660-664
Eric A. Brewer, Carl A. Waldspurger: Preventing Recursion Deadlock in Concurrent Object-Oriented Systems. 665-670
Eunmi Choi, Moon-Jung Chung, Yunmo Chung: Comparisons and Analysis of Massively Parallel SIMD Architectures for Parallel Logic Simulation. 671-674
Philip A. Wilsey, Debra A. Hensgen: Exploiting SIMD Computers for General Purpose Computation. 675-679
Guohua Jin, Fujie Chen: Hybrid Loop Interchange: Optimization for Parallel Programs. 680-685
Hiroshi Nishikawa, Peter Steenkiste: Aroma: Language Support for Distributed Objects. 686-690

Last update Tue May 21 17:22:08 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page