eugene@orville.nas.nasa.gov (Eugene Miya) (09/22/88)
[ Please see Eugene's earlier note about corrections, et cetera --steve ] %A J. C. Browne %A S. J. Kim %Z U. Texas %T A General Approach to the Mapping of Parallel Computations upon Multiprocessor Architectures %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 1-8 %K Computational Complexity, MIMD, partitioning, linear cluster merging, dominant request tree, homogeneous versus heterogeneous mapping, Sieve of Erathosthenes on iPSC, Gaussian elimination on Sequent Balance, molecular dynamics, %A Joseph JaJa %A Shing-Chong Chang %Z U. Maryland %T Parallel Algorithms for River Routing %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 9-13 %K Computational Complexity, CREW-PRAM, VLSI, separation problem, planar net wiring, routability metric, %X Extended abstract. %A Kazuo Sugihara %A Ichiro. Suzuki %T Nearly Optimal Clock Synchronization under Unbounded Message Transmission Time %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 14-17 %K Computational Complexity, network of processes, message passing, %X Extended abstract. %A Joseph JaJa %A Shing-Chong Chang %Z U. Maryland %T Parallel Algorithms for Channel Routing in the Knock-Knee Model %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 18-25 %K Applications, CREW-PRAM, VLSI, diagonal diagram, partition grid, layer assignment, %A Y. M. Huang %A M. Sarrafzadeh %Z NW U. %T Parallel Algorithm for Minimum Dual-Cover with Application to CMOS Layout %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 26-33 %K Applications, VLSI, PRAM, planar graphs, series parallel (SP) graphs, dual Euler trail (DET), optimal dual cover, graph separator theory, trailhunt, tree separation, %A Richard M. Fujimoto %Z U. Utah %T Lookahead in Parallel Discrete Event Simulation %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 34-41 %K Applications, BBN Butterfly, logical processes, deadlock avoidance, detection, recovery, performance metrics: speedup, null message ratio, deadlock ratio, message avalanche, queueing network, FCFS, PRIO, PREEMPT, PRIORITY, communication %A David E. Foulser %Z Yale U. %T A Blocked Jacobi Method for the Symmetric Eigenproblem %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 42-46 %K Numeric Algorithms, blocked classical Jacobi (BCJ), compared with block Brewnt-Luk symmetric Eigensolvers, hypermatrix adaptation, %A G. R. Gao %A S. J. Thomas %Z McGill %T An Optimal Parallel Jacobi-Like Solution Method for the Singular Value Decomposition %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 47-53 %K Numeric Algorithms, SVD, nearest neighbor ring topology, divide and exchange, single sided computation, hypercube, perfect shuffle, iPSC, Matlab, %X Simulator was used. %A V. Visvanathan %A P. Sadayappan %T Modeling and Optimal Scheduling of Parallel Sparse Gaussian Estimation %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 54-61 %K Numeric Algorithms, Directed Acyclic Graphs (DAGs), Minimally Constrained Task Graphs (MCTG), Gaussian Elimination (GE), idealized concurrent read exclusive write (CREW), clique property, common children property, algorithm for level assignment (ALA), %A Sridhar Madala %A James B. Sinclair %Z Rice U. %T Performance of Parallel Partitioning Algorithms %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 62-68 %K Non-Numeric Algorithms, task graphs, distribution driven simulation, merge, Rice Parallel Processing Testbed (RPPT), divide and conquer, independent path (IP) method, type I iterative approximation, independent paths normal approximation (IPN), example: parallel mergesort, partitioning structure, %A Virendra K. Janakiram %A Dharma P. Agrawal %A Ravi Mehrotra %Z NCSU, Raleigh, NC %T A Randomized Parallel Branch and Bound Algorithm %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 69-75 %K Non-Numeric Algorithms, b and b tree, MANIP, model, theorem, speedup, simulation, MPSIM PRAM-CREW, rsbb algorithm, knapsack problem, %X Little interprocessor communication. %A Sakti Pramanik %A Myoung Ho Kim %Z Michigan State %T Generalized Parallel Processing Model for Database Systems %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 76-83 %K Non-Numeric Algorithms, match retrieval search algorithms, single and multiple query (queries) with hits and relations, throughput maximization, minimum response time, Fieldwise eXclusive (FX) model, hashing, generalized disk modulo method (GDM), %A Sanjay Ranka %A Sartaj Sahni %Z U. Minn. %T Image Template Matching on SIMD Hypercube Multicomputers %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 84-91 %K Image Analysis & Geometry, hypercube multicomputers, image template matching, SIMD and MIMD computers, one and two dimensional convolution, data manipulation, memory access, C1D, C2D, circulation, grid embedding, %X See following companion MIMD paper. %A Sanjay Ranka %A Sartaj Sahni %Z U. Minn. %T Image Template Matching on MIMD Hypercube Multicomputers %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 92-99 %K Image Analysis & Geometry, hypercube multicomputers, medium grain template matching, SIMD and MIMD computers, one and two dimensional convolution, data manipulation, memory access, Kirsch templates, C2D, grid embedding, NCUBE, CRAY2, %A Ivan Stojmenovic %Z U. Miami %T Computational Geometry on a Hypercube %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 100-103 %K Image Analysis & Geometry, convex hull, Voronoi diagram, intersection problem, ECDF searching, maximal elements, dominance counting, parallel prefix, broadcast, merging slopes technique, CREW PRAM, planar point locating, closest points, %A Quentin F. Stout %Z U. Mich. %T Constant-Time Geometry on PRAMs %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 104-107 %K Image Analysis & Geometry, parallel random access machines, CRCW, CRDW, collision detection, convex hull, detecting write (DW) versus concurrent write (CW) or exclusive write (EW), %X Preliminary version printed. %A David R. O'Hallaron %A Radhakisan S. Baheti %Z GE R&D Center, Schenectady, NY %T Parallel Implementation of a Kalman Filter on the Warp Computer %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 108-111 %K Applications, systolic array, mapping, sample time, W2 language, %X This article is not very detailed. It appears to be a "here I am use me" article. Sales rather than some new results. %A H. F. Ho %A G. H. Chen %A S. H. Lin %Z Taiwan %A J. P. Sheu %T Solving Linear Programming on Fixed-Size Hypercubes %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 112-116 %K Applications, simplex method, pipelined broadcasting, basic/nonbasic variables, optimality condition, feasibility condition, pivot row/column, theory, %A Floyd B. Hanson %Z Argonne NL %T Parallel Computation for Stochastic Dynamic Programming: Row Versus Column Code Orientation %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 117-119 %K Applications, Bellman's curse of dimensionality, optimal control of nonlinear, continuous time dynamical systems, vector processors/computers, machine computational model method Alliant FX/8, concurrent outer-vector inner (COVI) model, Fortran, %A G. H. Atwood %Z U. Alberta %T Parallel Langrangian Interpolation %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 120-123 %K Applications, divided differences, polynomial, Newtonian interpolation, evaluation, derivation, theory, PRAM, shared memory architecture, %X The case presented by this paper is a bit weak. It could be improved perhaps it was too shortened. %A Winsre E. Alexander %A Seong-Mo Park %A Jung H. Kim %T A New Approach to the Implementation of Multidimensional Signal Processing Algorithms %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 124-127 %K Applications, N dimensional state space (N-D), discrete, linear, shift-invariant (DLSI), VLSI, pipelining, %A Vipin Kumar %A V. Nageshwara Rao %A K. Kamesh %Z U. Texas %T Parallel Depth First Search on a Ring Architecture %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 128-132 %K Applications, depth first search (DFS), iso-efficiency, %A Gary D. Hachtel %A Peter H. Moceyunas %Z U. Colorado %T Parallel Algorithms for Answering the Tautology Question %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 133-140 %K Artificial Intelligence, Encore multimax, iPSC, unit parallel efficiency, speed up, divide and conquer, COFACTOR, DPUP, GRAIL, dynamic processor assignment, %A Michael Greenberg %A Janice E. Cuny %Z U. Mass. %T Parallelism in Knowledge Base Systems with Inheritance %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 141-145 %K Artificial Intelligence, memory access, MIMD, metric: maximum arrival rate, single query, parallel inferential distance algorithm, %A Stephen D. Simmes %A Charles J. Turner %Z SAIC, Tucson %T Associative Memories on the Connection Machine %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 146-150 %K Artificial Intelligence, Hopfield, CM-1, Hamming distance metric, asynchronous and synchronous update, image processing example, %A Manuel E. Bermudez %A George Logothetis %A Richard Newman-Wolfe %Z U. FL. %T Parallel Generation of LR Parsers %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 151-155 %K Artificial Intelligence, push down automata, SLR(1), FOLLOW, %A Ashok Goel %A P. Sadayappan %A John R. Josephson %Z OSU %T Concurrent Design of Composite Explanatory Hypotheses %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 156-160 %K Artificial Intelligence, synthesis, abductive inference, distributed hypothesis generation and testing, interactions: associativity, additivity, incompatibility, %A Jim Armstrong %Z Convex %T Algorithm and Performance Notes for Block LU Factorization %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 161-164 %K Numeric Algorithms, Gaussian elimination, dense systems, matrix-vector algorithms, Fortran, linear algebra, %A D. C. S. Allison %A S. Harimoto %A L. T. Watson %Z Virginia Poly %T The Granularity of Parallel Homotopy Algorithms for Polynomial Systems of Equations %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 165-168 %K Numeric Algorithms, linear algebra, homogenization, HOMPACK, %A Shie-Tung Peng %A Moon S. Jun %Z U. Maryland, Baltimore %T A New VLSI 2-D Systolic Array for Matrix Multiplication and Its Applications %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 169-172 %K Numeric Algorithms, partition, shortest weight path, mapping, %X Short architectural description included. %A Shie-Tung Peng %A Thomas F. Hudson %Z U. Maryland, Baltimore %T Parallel Algorithms for Multiplying Very Large Integers %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 173-176 %K Numeric Algorithms, exclusive read write (EREW PRAM), parallel random access memory, fast fourier transform (FFT), addition, global shared memory, ring-of-integers, complex field, %A Gita Alaghband %Z U. Colorado, Denver %T A Parallel Pivoting Algorithm on a Shared Memory Multiprocessor with Controlled Fill-in %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 177-180 %K Numeric Algorithms, LU decomposition, MIMD, linear systems, proposed HEP use, %A M. Whelan %A Gao R. Guang %A T. K. Yum %Z Philips Labs, NY %T Optimal Decomposition of Matrix Multiplication on Multiprocessor Architectures %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 181-185 %K Numeric Algorithms, computation communication overlap, partitioning, simulation, speedup, %A Mukesh Singhal %Z OSU %T Performance Analysis of an Optimistic Concurrency Control Algorithm in Replicated Database Systems %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 186-189 %K Non-Numeric Algorithms, Thomas Write Rule (TWR), approximate, iterative performance model, update-commit, validation, response time, suspend queue, %A Oscar H. Ibarra %A Ting-Chuen Pong %A Stephen M. Sohn %Z U. Minn %T Hypercube Algorithms for Some String Comparison Problems %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 190-193 %K Non-Numeric Algorithms, NCUBE, minimum length time warp problem, longest common subsequence (LCS), edit distance, weighted Levenshtein distance, block partitioning, SIMD, aligned longest common substring (ALCG), %A Yijie Han %A Yoshihide Igaraski %T Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 194-197 %K Non-Numeric Algorithms, chain theorem, snake-like indexing, region cardinality, %A E. Altmann %A T. A. Marsland %A T. Breitkreutz %Z U. Alberta %T Accounting for Parallel Tree Search Overheads %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 198-201 %K Non-Numeric Algorithms, loosely coupled architectures, vertex cover problem, synchronization loss, MANIP, configurations, message passing, overheads: communication, search, synchronization, master alone process, overrun method, %A Peter Varman %A Kshitij Doshi %Z Rice U. %T Sorting with Linear Speedup on a VLSI Network %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 202-206 %K Non-Numeric Algorithms, pipelined packet switch interconnection of processors and memories, communications graph (CG), hypercube, conflict free routing, coarse merge, mapping, %A V. Nageshwara Rao %A Vipin Kumar %Z U. Texas %T Concurrent Insertions and Deletions in a Priority Queue %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 207-211 %K Non-Numeric Algorithms, BBN Butterfly, heap, path, window, concurrent access, branch and bound, %A Sanjay Ranka %A Sartaj Sahni %Z U. Minn. %T Convolution on SIMD Mesh Connected Multicomputers %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 212-217 %K Image Analysis & Geometry, convolution, mesh multicomputer, shift, memory, pairing, %X Authors want it known that these algorithms do not assume any broadcasting. %A Guy E. Blelloch %A James J. Little %Z MIT %T Parallel Solutions to Geometric Problems on the Scan-Model of Computation %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 218-222 %K Image Analysis & Geometry, connection machine, SIMD, vector model, k-D tree algorithm, line drawing, line-of-sight, convex hull, segments, recursive splitting, %X Authors emphasize they don't want CREW P-RAM models (many times). %A Xiaqing Qu %A Xiaobo Li %Z U. Alberta %T Parallel Template Matching Algorithms %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 223-226 %K Image Analysis & Geometry, SIMD, hypercube interconnection, one (single) permute multiply phase, local address computation, %A S. K. Nandy %A R. Moona %A S. Rajagopalan %Z India Inst. Science, Bangalore, India %T Linear Quadtree Algorithms on the Hypercube %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 227-229 %K Image Analysis & Geometry, neighbor finding (NFA), boundary following (BFA), block embedding, %A J. B. G. Roberts %A J. S. Ward %Z Royal Signals and Radar Est., Malvern, England %T Optimising a Reconfigurable MIMD Transputer Machine for Line-of-Sight Calculations on Large Digital Maps %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 230-234 %K Image Analysis & Geometry, OCCAM, CSP, reconfigurable transputer processor (RTP), SuperNode, 72 x 72 crossbar, visibility, shading, 256 KB per PE in prototype, T880, look up, %X Not a high quality paper, does not say a great deal. %A Raad Fatoohi %A Chester E. Grosch %T Implementation and Analysis of a Navier-Stokes Algorithm on Parallel Computers %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 235-242 %K Applications, SIMD, MIMD comparison, MPP, Cray-2, FLEX/32, ADI scheme, relaxation, performance, instruction/operation count, %A Mark E. Braaten %Z GE R&D %T Solution of Viscous Fluid Flows on a Distributed Memory Concurrent Computer %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 243-250 %K Applications, Navier Stokes equations, 2-D laminar flow, CFD, computational dynamics, iPSC, %A Herb Schwetman %A Stephen Burdick %Z MCC %T Parallelizing an Electron Transport Monte Carlo Simulator (MOCASIN 2.0) %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 251-256 %K Applications, drift diffusion, PPL, Sequent C, MESFET, timing, speedup, scattering, %A Eric Lander %A Jill P. Mesirov %A Washington Taylor, IV %T Protein Sequence Comparison on a Data Parallel Computer %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 257-263 %K Applications, biochemistry, connection machine, CM-2, matching, subsequence scoring matching metrics, data mapping, inner loops, timing, %A Craig B. Stunkel %Z CSL, U. Ill. %T Linear Optimization Via Message-Based Parallel Processing %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 264-271 %K Applications, iPSC, simplex method, row/column partitioning, search, global minimum/maximum (extrema), communication/computation overlap, %A Marc D. Diamond %A Jim Newhouse %A Jeff Kimbel %Z FMC, Minn. %T Results of a Multiprocessor Implementation for Sequential Decision Processes %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 272-281 %K Applications, dynamic programming, simplex, decision graph, "informed model," minimax, timed Markov, termination/initiation, deadlock/race conditions, %A Greg N. Frederickson %A Ravi Janardan %T Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 282-289 %K Graph Theory, interval routing, multiple node and edge faults, %X Preliminary version published. %A C. S. George Lee %A P. R. Chang %Z Purdue %T A Decomposition Approach for Balancing Large-Scale Acyclic Data Flow Graphs %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 290-294 %K Graph Theory, (ADFG, DFG), COordinate Rotation DIgital Computer (CORDIC), queueing, ILEG, ILCE, %A M. Y. Chan %Z U. Texas at Dallas %T Dilation-2 Embeddings of Grids into Hypercubes %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 295-298 %K Graph Theory, 2-Dimensions, coloring, %A S. Vishwanathan %A M. A. Sridhar %Z U. So. Carolina %T Some Results on Graph Coloring in Parallel %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 299-303 %K Graph Theory, Brooks coloring, c-index, chromatic number, %A Andrzej Lingas %Z Linkoping U., Sweden %T Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in NC %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 304-307 %K Graph Theory, CRCW PRAM, SEP, %A R. E. Cypher %A J. L. C Sanz %T Optimal Sorting Algorithm on Reduced Architectures %J Proceedings of the 1988 International Conference on Parallel Processing %V III, Algorithms and Applications %I Penn State %C University Park, Penn %D August 1988 %P 308-311 %K Computational Complexity, priority CRCW PRAM, cubesort,