eugene@orville.nas.nasa.gov (Eugene Miya) (09/19/88)
%A Jie-Yong Juang %A Ting-Lu Huang %A Ed Freeman %T Parallelism in Connection-Graph-Based Logic Inference %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 1-8 %K Logic Programming, predicate connection graph, resolution, logical inconsistency, Bernstein condition, search, pruning, lock-and-withdraw synchronization, snowball propagation, partitioning, %A Ian Foster %Z Imperial College, London %T Parallel Implementation of Parlog %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 9-17 %K Logic Programming, logical variable, control call, distributed unification, read, ns_read, unify algorithms, distributed control, termination, deadlock, %A M. V. Hermenegildo %A E. Tick %T Memory Performance of AND-parallel Prolog on Shared-Memory Architectures %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 18-21 %K Logic Programming, Warren Abstract Machine (RAP-WAM AND-parallel Prolog), cache coherence, simulation, Sequent Balance, %A Arvind K. Bansal %A Leon S. Sterling %Z CWRU, Cleveland %T Compiling Enumerate-And-Filter Programs for Efficient Execution Under Committed-Choice and-Parallelism %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 22-25 %K Logic Programming, AND-parallelism, committed-choice, compilation, enumerate-and-filter, generate-and-test, logic program, OR-program, stream parallelism, static and dynamic enumeration, %A Weijia Shang %A Jose A. B. Fortes %Z Purdue %T On The Independent Partitioning of Algorithms With Uniform Data Dependencies %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 26-33 %K Compilers, index set, dependence vectors, greatest common divisor (GCD) method, minimum distance method, proof, %A Harlan E Husmann %A David J. Kuck %A David A. Padua %Z CSRD, U. Ill. %T Automatic Compound Function Definition for Multiprocessors %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 33-41 %K Compilers, program graph, compound functions (CF), control functions (CTF), [original, additional, candidate] computation functions (CPF), block access-no overlap architecture, loop parallelism CF definition, optimal CF definition, Fortran, DoAll, DoAcross, iterative control structures, program restructuring, benchmark experiments (Eispack and Linpack), Parafrase, %A Gyungho Lee %Z U. of SW Louisiana %T Automatic Restructuring of Conditional Cyclic Loops %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 42-45 %K Compilers, shared memory machines, CREW PRAM, postfix-IF, linear mixed recurrence, binary tree representation, path selection, %A Mary L. Bailey %A David Socha %A David Notkin %Z U. Washington %T Parallel Debugging Using Graphical Views %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 46-49 %K Software Tools, Voyeur, MIMD, shared memory, icon, vector simulator views, X window system, micro-VAX, %A Thomas Bemmerl %Z Tech. Univ. Munich %T An Integrated and Portable Tool Environment for Parallel Computers %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 50-53 %K Software Tools, Multiprocessor Monitoring Systems (MMS), debugging, VAXstation Ultrix, iPSC, TCP/IP, C %X Very Mac-like. %A Charles E. McDowell %Z UCSC %T Viewing Anomalous States in Parallel Programs %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 54-57 %K Software Tools, concurrency history graph (CHG), probe (Heisenberg) effect, ART, static analysis, control flow, synchronization augmented flowgraph (SAF), parallel access anomaly, %A Kevin Smith %A William F. Appelbe %Z GA Tech. %T PAT -- An Interactive Fortran Parallelizing Tool %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 58-62 %K Software Tools, parallelizer, static and dynamic analysis, PTOOL-like, control flow graph (CFG), dependence graph, loop analysis and restructuring, %A Pradip Bose %Z IBM TJW %T Heuristic, Rule-Based Program Transformations for Enhanced Vectorization %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 63-66 %K Software Tools, IBM 3090 VF, Expert Advisor for VEctorization (EAVE), RPTOOL, parallel Fortran (PF), loop interchange (restructuring), %A Sherryl Tomboulian %A Thomas W. Crockett %A David Middleton %Z ICASE %T A Visual Programming Environment for the Navier-Stokes Computer %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 67-71 %K Software Tools, NSC, singlets, computational fluid dynamics (CFD), %X Current version 640 MFLOPS, 64 nodes (32 functional units per), 128 GBytes, 40 GFLOPS, reconfigurable, visual programming environment. %A P. David Stotts %Z U. Maryland %T The PFG Language: Visual Programming for Concurrent Computation %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 72-79 %K Languages, parallel flow graphs, timed Petri nets, free-choice class, HG software model, data model, static program model, control flow model, h-graph selector, cbranch, nbranch, fork,-join, deadlock and reachability, SUN workstation, %A S. Sobek %A M. Azam %A J. C. Browne %Z U. Texas %T Architectural and Language Independent Parallel Programming: A Feasibility Demonstration %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 80-83 %K Languages, Ada C, Fortran, Sequent Balance, VAX cluster, iPSC Hypercube, Cray X-MP, SUN front-end, declarative hierarchies, computation-oriented display environment (CODE), schedulable units of computation (SUC), dependence, encapsulation, Translator Of A Declaration (TOAD), %A Allan L. Fisher %A Peter T. Highnam %Z CMU %T Communication and code optimization in SIMD programs %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 84-88 %K Languages, OPS5, directionals (UP, DOWN, LEFT, RIGHT), SASS, scan line array processor, %A Lenore M. Restifo Mullin %A Ashok Krishnamurthi %A Deepa Iyengar %Z NPAC, Syracuse, U. %T The Design and Development of a Basis, $alpha sub L$, for Formal Functional Programming Languages with Arrays based on A Mathematics of Arrays %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 89-93 %K Languages, APL, Alliant, fork, %A Kai Li %Z Princeton %T IVY: A Shared Virtual Memory System for Parallel Computing %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 94-101 %K Distributed Software, Apollo loosely coupled ring network DOMAIN, process migration and mapping, scheduling, event counters, remote procedure call, operating system, measurements on 3D PDE solver, linear equations, %A Nicholas Bowen %A Christos Nikolaou %A Arif Ghafoor %Z IBM TJW %T Workload Allocation for Distributed Systems %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 102-109 %K Distributed Software, software communication topology, selection, hierarchical clustering, allocation, interference, mapping, throughput, response time metrics, branch and bound examples, %A Tom Geigel %A Mike Pagan %Z GE/RCA, Moorestown, NJ %T A Distributed Application for the PHARROS Project %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 110-113 %K Distributed Software, dataflow graph (DFG), BBN Butterfly, Connection Machine (CM), Unix, signal processing graph notation (SPGN), Parallel Heterogeneous Architecture, Reliable Realtime Operating System, omnipotent controllers (OC), ACOS/ECOS, ASP Common Operational Support software/EMSP Common Operational Support, %A Henry G. Dietz %Z Purdue %T Finding Large-Grain Parallelism In Loops With Serial Control Dependencies %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 114-121 %K Compilers, control precomputation, transformation, closure loop, synchronization, iteration, restructuring, %X Paper should have summarized comparison to DOALL and FORALL loops. Needs to speak more about loop exception handling or branching. Proposes a way to "straighten out" loops. %A Lee Badger %A Mark Weiser %T Minimizing Communication for Synchronizing Parallel Dataflow Programs %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 122-126 %K Compilers, MIMD, splitting, slicing, hammock graph, correctness proof, splicing, %X Misprint of pages (out of sequence in my copy). %A Bruno R. Preiss %A V. Carl Hamacher %Z Waterloo and Toronto %T Semi-Static Dataflow %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 127-134 %K Compilers, graph splicing, static and dynamic dataflow, low level process, context, activity, communication, parameter passing, iteration, termination, Occam, simulation, examples: matrix multiplication, FFT, Cholesky decomposition, congruence transformation, %A Tom W. Bennet %Z U. Maryland %T Using Control States for Parallelism Extraction %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 135-139 %K Software, do loops, streams, iteration, at-variables (@-variables), control trees, processor application, %X Author should have cited HEP work. %A K. S. Natarajan %A Vivek Sarkar %Z IBM TJW %T Processor Scheduling Algorithms for Constraint-Satisfaction Search Problems %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 140-149 %K Software, forward checker algorithm, threshold depth-first priority (TDFP), breadth first list scheduling (BFLS), parallel backtracking/search algorithms, eight Queens example, %A Ryszard Janicki %A Peter E. Lauer %Z McMaster U., Ontario %T On the Semantics of Priority Systems %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 150-156 %K Software, constraints, concurrent system (COSY), starvation, occam, multiple sequence semantics, [infinite] multiple firing sequences (IMFS/MFS), %X CSP-like. %A Kenneth G. Krauss %A Samuel L. Gulden %T A Petri Net Method for the Formal Verification of Parallel Processes %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 157-160 %K Software, mutual exclusion, selection, iteration, %A Michael Weiss %A C. Robert Morgan %A Peter Belmont %A Zhixi Fang %T Dynamic Scheduling and Memory Management for Parallel Programs %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 161-165 %K Shared Memory Software, DOALL, fork join DAG, Fortran, scheduling, process descriptors, loops, memory management, %X Confusing terminology. Article makes OS => tasks (what others call processes), mini-OS=> [light weight] processes. These people are not using Unix so watch the words. %A Albert J. Musciano %A Thomas L. Sterling %Z Harris %T Efficient Dynamic Scheduling of Medium-Grained Tasks for General Purpose Parallel Processing %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 166-175 %K Shared Memory Software, simultaneous Pascal in Concert (SPOC), computing environment, runtime, threads, frames, forall, fork, synchronization, traverse, examples: Mandlebrot, Gaussian elimination, performance degradation, %A Hwa-Chung Feng %A Richard M. Fujimoto %T A Shared Memory Algorithm and Performance Evaluation of the Generalized Alternative Construct in CSP %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 176-179 %K Shared Memory Software, communicating sequential processes, message passing, locks, atomic operations, BBN Butterfly, adaptive sleeping, %A Silvano Rivoira %Z U. Perugia, Italy %T Design Strategies for the Run-Time Support to The ADA Rendezvous %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 180-187 %K Shared Memory Software, modular architecture (MODIAC), Pascal based operating systems (MODOSK), rendezvous (RV), communication, local/global descriptors, "Order of Arrival" implementation, %A T. M. Ravi %A David Jefferson %Z UCLA %T A Basic Protocol for Routing Messages to Migrating Processes %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 188-197 %K Information Spreading, broadcast, communication, synchronization, policy versus mechanics, basic routing and migration (BRM), layered model, correctness, %X iPSC implementation in progress. %A Yijie Han %A Raphael Finkel %Z U. Ky. %T An Optimal Scheme for Disseminating Information %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 198-203 %K Information Spreading, broadcast, fault tolerance, relability, reorganization, reconfigurability, synchronization, %A Philip K. McKinley %Z U. Ill. %T Multicast Routing in Spanning Bus Hypercubes %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 204-211 %K Information Spreading, broadcast, virtual circuits, traffic congestion, greedy algorithm, tree forwarding, separate/multidestination addressing, single-tree routing schemes, simple shortest path/centered routing, %A Vincent A. Guarna, Jr. %Z CSRD, U. Ill. %T A Technique For Analyzing Pointer and Structure References in Parallel Restructuring Compilers %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 212-220 %K Compilers, C, dependence graphs, aliasing, generated variables GEN()s, KILL set, syntax tree matching, loop equivalence, %A Zhiyuan Li %A Pen-Chung Yew %Z CSRD, U. Ill. %T Interprocedural Analysis for Parallel Computing %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 221-228 %K Compilers, do loops, atom images, data dependence graphs and analysis, binding, call graph, aliasing, GEN(), region test, recurrence, %A Ron Cytron %A Steve Karlovsky %A Kevin P. McAuliffe %Z IBM TJW %T Automatic Management of Programmable Caches %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 229-238 %K Compilers, shared memory, PTRAN, partitioning, data dependence, scheduling/direction vector, flush (post and invalidate), data flow, optimization, eviction, line size, processor allocation, %Z Extended abstract. This paper also uses different terminoogy than some readers many have used. %A Virgina M. Lo %Z U. Oregon %T Algorithms for Task Assignment and Contraction in Distributed Computing Systems %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 239-244 %K Operating Systems, mapping problem: contraction and layout, symmetric contraction, graph partitioning, Simplex, Latin squares voting, ethernet-based broadcast systems, Algorithm H heuristic, simulation, %A Robert H. Thomas %A Will Crowther %Z BBN Advanced Computer %T The Uniform System: An approach to runtime support for large scale shared memory parallel processors %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 245-254 %K Operating Systems, BBN Butterfly, Chrysalis OS, uniform memory access (UMA), NUMA, process and task generation, runtime environment, memory management, MACH 1000, eight queens example in C, %A Michael L. Scott %A Thomas J. LeBlanc %A Brian D. Marsh %Z U. Rochester %T Design Rationale for Psyche, a General-Purpose Multiprocessor Operating System %J Proceedings of the 1988 International Conference on Parallel Processing %V II, Software %I Penn State %C University Park, Penn %D August 1988 %P 255-262 %K Operating Systems, non-uniform memory access (NUMA), shared memory, flexibility, protection, performance, BBN Butterfly, lightweight processes, realm, thread, scheduling, keys, access lists, locality, %X The authors are trying to encourage this work with portability to NUMA and UMA architectures.