This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
364 Globus: A Metacomputing Infrastructure Toolkit - Foster (1996)(Correct)
Emerging high-performance applications require the ability to exploit diverse, geographically distributed resources. These applications use high-speed networks to integrate supercomputers, large datab... / in distributed systems. As in parallel computing metacomputing applications br the applicability of current parallel computing tools and techniques.
258 Parallel Programming in Split-C - Culler (1993)(Correct)
We introduce the Split-C language, a parallel extension
of C intended for high performance programming
on distributed memory multiprocessors, and demonstrate
the use of the language in optimizing para... / as a teaching tool in parallel computing courses and hosts a wide br units. Spread Arrays Parallel computation on arrays is supported
223 High Performance Messaging on Workstations: Illinois Fast Messages.. - Pakin, Lauria, Chien (1995)(Correct)
ing with credit is permitted. To
copy otherwise, to republish, to post on servers or to redistribute to
lists, requires prior specific permission and/or a fee. Request Permissions
from Publication Dep... / on a broader range of parallel computations. Achieving efficient br overhead .As a result parallel computing on workstation clusters has
196 TreadMarks: Shared Memory Computing on Networks of Workstations - Amza (1996)(Correct)
TreadMarks supports parallel computing on networks of workstations by providing the application
with a shared memory abstraction. Shared memory facilitates the transition from sequential to
parallel p... / TreadMarks supports parallel computing on networks of workstations br appealing vehicle for parallel computing. By relying solely on
162 Performance of Various Computers Using Standard Linear Equations.. - Dongarra (1991)(Correct)
This report compares the performance of different computer systems in solving dense systems
of linear equations. The comparison involves approximately a hundred computers, ranging from
a CRAY Y-MP to ... / part. Massively Parallel Computing ith the arrival of br ith the arrival of masssively parallel computers there is a need to
137 Network Based Concurrent Computing on the PVM System - Geist, Sunderam (1991)(Correct)
Concurrent computing environments based on loosely coupled networks have
proven effective as resources for multiprocessing. Experiences with and
enhancements to PVM (Parallel Virtual Machine) are desc... / as a general and flexible parallel computing resource that supports br of Age Supercomputer Level Parallel Computations at Caltech
123 The Nexus Approach to Integrating Multithreading and Communication - Foster (1996)(Correct)
Lightweight threads have an important role to play in parallel systems: they can be used to exploit shared-memory parallelism, to mask communication and I/O latencies, to implement remote memory acces... / distributed-memory parallel computing in large part because the br interest in multithreading in parallel computing environments notably more
118 The Paradyn Parallel Performance Measurement Tools - Miller, Callaghan (1995)(Correct)
Paradyn is a performance measurement tool for parallel and distributed programs. Paradyn uses several novel technologies so that it scales to long running programs (hours or days) and large (thousand ... / measure programs on massively parallel computers workstation clusters and br environments Parallel computing environments range from
115 PVM: Parallel Virtual Machine - Geist, Beguelin, Dongarra, Jiang.. (1994)(Correct)
this reporting is to be turned on (1) or turned off (0) for subsequent
calls. A value of (2) will cause the program to exit after printing the error message (not
implemented in 3.2). The default is re... / Saltz and Robert Voigt Parallel Computational Fluid Dynamics br and Tutorial for Networked Parallel Computing by Al Geist Adam
114 Fine-grain Parallelism with Minimal Hardware Support: A.. - Culler, Sah, Schauser, von Eicken.. (1991)(Correct)
In this paper, we present a relatively primitive execution model for fine-grain parallelism, in which all synchronization, scheduling, and storage management is explicit and under compiler control. Th... / the key to general purpose parallel computing because it allows the br issues for general purpose parallel computing. In this paper we have
101 Fine-grain Access Control for Distributed Shared Memory - Schoinas (1994)(Correct)
This paper discusses implementations of fine-grain memory
access control, which selectively restricts reads and
writes to cache-block-sized memory regions. Fine-grain
access control forms the basis of... / Introduction Parallel computing is becoming widely available br Tunnel Virtual Prototyping of Parallel Computers. In Proceedings of the
94 Scans as Primitive Parallel Operations - Blelloch (1987)(Correct)
In most parallel random-access machine (P-RAM) models, memory references are assumed
to take unit time. In practice, and in theory, certain scan operations, also known as prefix
computations, can exec... / Scan Parallel Algorithms Parallel Computing Prefix Computations PRAM br We consider a processor parallel computer with processors on each
91 iWarp: An Integrated Solution to High-Speed Parallel Computing - Borkar (1988)(Correct)
an iWarp cell; up to 64 MBytes of memory are directly
addressable. A large array of iWarp cells will deliver an iWarp is a system architecture for high speed signal, image
enormous computing bandwidth... / Solution to High-Speed Parallel Computing Shekhar Borkar Robert br architecture profited memory parallel computing systems and to demonstrate
87 Building Brains for Bodies - Rodney Brooks (1994)(Correct)
We describe a project to capitalize on newly available levels of computational resources in order to understand human
cognition. We are building an integrated physical system including vision, sound i... / often assumed for large scale parallel computers. If ratified such a br technology is massively parallel computing our brain has large
87 Compiler Optimizations for Fortran D on MIMD Distributed-Memory.. - Hiranandani, Kenney, Tseng (1991)(Correct)
Massively parallel MIMD distributed-memory machines
can provide enormous computation power.
However, the difficulty of developing parallel programs
for these machines has limited their accessibility. ... / Center for Research on Parallel Computation Rice University P.O. br It is widely recognized that parallel computing represents the only
82 Supporting Systolic and Memory Communication in iWarp - Borkar (1990)(Correct)
TM general computing; whereas systolic communication is iWarp is a parallel architecture developed jointly by efficient and well suited for speed critical applications. Carnegie Mellon University and ... / the title Research on Parallel Computing ARPA Order No. br iWarp is a distributed parallel computing system under Three iWarp
78 Unicast-Based Multicast Communication in Wormhole-Routed Networks - McKinley, Xu, Esfahanian, Ni (1993)(Correct)
Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported m... / increasingly demanded in parallel computing. System supported multicast br wormhole routing massively parallel computer direct network hypercube
78 Alex - a Global Filesystem - Cate (1992)(Correct)
The Alex filesystem provides users and applications transparent read access to files in Internet anonymous
FTP sites. Today there are thousands of anonymous FTP sites with a total of a few million fil... / under the title Research on Parallel Computing ARPA Order No.
76 Integrating Message-Passing and Shared-Memory: Early Experience - Kranz, Johnson, Agarwal.. (1993)(Correct)
This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programming model can be impl... / Researchers in parallel computing generally agree that it is br MIMD SIMD parallelization. Parallel Computing .
74 Programming Parallel Algorithms - Blelloch (1996)(Correct)
This paper is also available on the World-Wide Web at: unknown Programming Parallel Algorithms
Guy E. Blelloch
Keywords: Data-parallel, parallel algorithms, supercomputers, nested parallelism, PRAM mo... / to account for the costs. In parallel computing the most common models are br An important advance in parallel computing was the introduction of the
68 Automatic Program Parallelization - Banerjee, Eigenmann, Nicolau (1993)(Correct)
This paper presents an overview of automatic program
parallelization techniques. It covers dependence analysis
techniques, followed by a discussion of program transformations,
including straight-line ... / has seen the coming of age of parallel computing. Many different classes of br the future direction of parallel computing is not clearly defined in
67 The Interaction of Parallel and Sequential Workloads on a Network of.. - Arpaci (1995)(Correct)
This paper examines the plausibility of using a network of
workstations (NOW) for a mixture of parallel and sequential
jobs. Through simulations, our study examines issues that arise
when combining th... / interest in using NOWs for parallel computing Gelernter Kronenberg br to support distributed and parallel computing. Theimer and his colleagues
67 Graphical Development Tools for Network-Based Concurrent.. - Beguelin, Dongarra, Geist, Manchek.. (1991)(Correct)
This paper describes an X-window based software
environment called HeNCE (Heterogeneous Network
Computing Environment) designed to assist scientists
in developing parallel programs that run on a netwo... / debugging and analyzing the parallel computation. Central to HeNCE is a br toolkit for fault tolerant parallel computing over a network of
67 Convergence Analysis of Canonical Genetic Algorithms - Rudolph (1994)(Correct)
This paper analyzes the convergence properties of the canonical genetic
algorithm (CGA) with mutation, crossover and proportional reproduction
applied to static optimization problems. It is proved by ... / by the Research Initiative Parallel Computing of the Ministry of Science
65 Charlotte: Metacomputing on the Web - Baratloo (1996)(Correct)
The World Wide Web has the potential of being used as
an inexpensive and convenient metacomputing resource.
This brings forward new challenges and invalidates many
of the assumptions made in offering ... / of local area networks as a parallel computing platform has been br provable methods for executing parallel computations on abstract
64 Compiler Support for Machine-Independent Parallel Programming in.. - Hiranandani, Kennedy, Tseng (1991)(Correct)
Because of the complexity and variety of parallel architectures, an efficient machine-independent parallel programming model is needed to make parallel computing truly usable for scientific programmer... / Center for Research on Parallel Computation Rice University P.O. br model is needed to make parallel computing truly usable for scientific
60 Dissemination Of Information In Interconnection Networks.. - Hromkovic, Klasing, Monien, Peine (1996)(Correct)
this article follows the aims stated above. The first section introduces this research area. The basic definitions are given and the fundamental, simple observations concerning the relations among the... / science is devoted to parallel computing. Here we would like to br of the network for parallel computing. This follows simply from
59 Task Parallelism in a High Performance Fortran Framework - Gross, Hallaron, Subhlok (1994)(Correct)
High Performance Fortran (HPF) has emerged as a standard dialect of Fortran for data parallel computing.
However, for a wide variety of applications, both task and data parallelism must be exploited t... / dialect of Fortran for data parallel computing. However for a wide br Compilation of programs for parallel computers has received considerable
57 A Case for NOW (Networks of Workstations) - Anderson, Culler, Patterson, team (1994)(Correct)
In this paper, we argue that because of recent technology advances, networks of workstations (NOWs) are poised to become the primary computing infrastructure for science and engineering, from low en... / finally multiple CPUs for parallel computing. We describe the technical br Workstations Communications Parallel Computing Message Passing File
54 Generating Communication for Array Statements: Design.. - Stichnoth (1994)(Correct)
Array statements as included in Fortran 90 or High Performance Fortran (HPF) are a wellaccepted way to specify data parallelism in programs. When generating code for such a data parallel program for a... / under the title Research on Parallel Computing ARPA Order No. . Work br solution to high-speed parallel computing. In Proceedings of
54 Adaptive Parallelism and Piranha - Carriero, Freeman, Gelernter.. (1995)(Correct)
Under "adaptive parallelism," the set of processors executing a parallel program may grow or shrink as the program runs. Potential gains include the capacity to run a parallel program on the idle wo... / to all nodes within a parallel computing environment-for example br Languages and Compilers for Parallel Computing . CG Nicholas
54 General Purpose Parallel Computing - McColl (1993)(Correct)
A major challenge for computer science in the 1990s is to determine the extent to
which general purpose parallel computing can be achieved. The goal is to deliver both
scalable parallel performance an... / General Purpose Parallel Computing W F McColl br to which general purpose parallel computing can be achieved. The goal is
53 Models of Machines and Computation for Mapping in Multicomputers - Norman, Thanisch (1993)(Correct)
It is now more than a quarter of a century since researchers started publishing
papers on mapping strategies for distributing computation across the
computation resources of multiprocessor systems. Th... / Michael G. Norman Edinburgh Parallel Computing Centre University of br Furthermore changes in parallel computing technology have made some of
52 Parallel Processing on Dynamic Resources with CARMI - Pruyne (1995)(Correct)
In every production parallel processing environment, the set of resources potentially available to an application fluctuate due to changes in the load on the system. This is true for clusters of works... / popular platform for parallel computing. Today's parallel br programming system Parallel Computing vol. pp. -
51 JPVM: Network Parallel Computing in Java - Ferrari (1997)(Correct)
The JPVM library is a software system for explicit message-passing based parallel programming in Java. The library supports an interface similar to the C and Fortran interface of the Parallel Virtual ... / JPVM Network Parallel Computing in Java Adam J. Ferrari br excluded from network parallel computing systems such as Macintosh
51 Utopia: A Load Sharing Facility for Large, Heterogeneous Distributed.. - Zhou (1993)(Correct)
Load sharing in large, heterogeneous distributed systems allows users to access vast amount of computing resources scattered around the system and may provide substantial performance improvements to a... / load index remote execution parallel computing distributed computer br dedicated distributed memory parallel computers such as the Intel
50 MPI: A Message Passing Interface - Forum (1993)(Correct)
This paper presents an overview of mpi, a proposed
standard message passing interface for MIMD distributed
memory concurrent computers. The design
of mpi has been a collective effort involving researc... / the Center for Research on Parallel Computing held April - in br interface not a complete parallel computing programming environment.
49 The Implementation of the Cilk-5 Multithreaded Language - Frigo, Leiserson, Randall (1998)(Correct)
The fifth release of the multithreaded language Cilk uses a provably good "work-stealing" scheduling algorithm similar to the first system, but the language has been completely redesigned and the runt... / path multithreading parallel computing programming language br respect to performance. On a parallel computer Cilk control constructs
49 High-Performance Parallel Programming in Java: Exploiting Native.. - Getov (1998)(Correct)
With most of today's fast scientific software written in Fortran and C, Java has
a lot of catching up to do. In this paper we discuss how new Java programs can
capitalize on high-performance libraries... / results confirm that fast parallel computing in Java is indeed possible. br international benchmarks for parallel computers. Scientific Programming
48 The Galley Parallel File System - Nieuwejaar (1996)(Correct)
this paper is organized as follows. In Section 2 we describe
the specific goals Galley was designed to satisfy. In Section 3 we discuss a
new, three-dimensional way to structure files in a multiproces... / To appear in Parallel Computing . Available at URL br most components of massively parallel computers have been steadily
47 Compiling Fortran D for MIMD Distributed-Memory Machines - Hiranandani (1992)(Correct)
Fortran D, a version of Fortran extended with
data decomposition specifications, is designed to provide
a machine-independent data-parallel programming
model. This paper describes analysis, optimizati... / Introduction Parallel computing represents the only br and engineers. However parallel computers are not likely to be
46 Exploiting Task and Data Parallelism on a Multicomputer - Subhlok (1993)(Correct)
For many applications, achieving good performance on
a private memory parallel computer requires exploiting
data parallelism as well as task parallelism. Depending
on the size of the input data set an... / on a private memory parallel computer requires exploiting data br under the title Research on Parallel Computing ARPA Order No. . Work
46 Design of a Parallel Nonsymmetric Eigenroutine Toolbox, Part I - Bai, Demmel (1993)(Correct)
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solve effectively on massively parallel machines. Rather than trying to design a "black box" eigenroutine in the sp... / a tradeoff not uncommon in parallel computing Of all these br Note to appear in Parallel Computing. J. Dongarra R.
45 Detecting Coarse-Grain Parallelism Using an Interprocedural.. - Hall, Amarasinghe, Murphy, Liao, Lam (1995)(Correct)
This paper presents an extensive empirical evaluation of an interprocedural parallelizing compiler, developed as part of the Stanford SUIF compiler system. The system incorporates a comprehensive and ... / advances make pervasive parallel computing a possibility it is ever br that automatically locates parallel computations in sequential programs
44 Automatic Blocking of Nested Loops - Schreiber, Dongarra (1990)(Correct)
Blocked algorithms have much better properties of data locality and therefore
can be much more efficient than ordinary algorithms when a memory hierarchy is
Supported by the NAS Systems Division an... / Keywords block algorithm parallel computing compiler optimization br computing especially parallel computing is that computation is
44 Scalable Computing - McColl (1996)(Correct)
Scalable computing will, over the next few years, become
the normal form of computing. In this paper we present a unified framework,
based on the BSP model, which aims to serve as a foundation for
t... / of General Purpose Parallel Computing efficient universality br would be superseded by parallel computing. This has not yet happened
43 Adding Threads to Standard ML - Cooper, Morrisett (1990)(Correct)
We have added multiple threads of control to the Standard ML programming language. Standard
ML's support for first-class functions and automatic storage management influenced the design in
a number of... / under the title Research on Parallel Computing ARPA Order No.
43 Scheduling From the Perspective of the Application - Berman, Wolski (1996)(Correct)
Metacomputing is the aggregation of distributed and
high-performance resources on coordinated networks. With
careful scheduling, resource-intensive applications can be
implemented efficiently on metac... / to examine the role that parallel computing has played. Parallel br computing has played. Parallel computing has enabled scientists and
43 Direct Search Methods On Parallel Machines - Dennis, Jr., Torczon (1991)(Correct)
This paper describes an approach to constructing derivative-free algorithms for unconstrained optimization that are easy to implement on parallel machines. A special feature of this approach is the ... / might be easily adapted to a parallel computing environment precisely br by the Center for Research on Parallel Computation Rice University
43 Maximizing Parallelism and Minimizing Synchronization with Affine.. - Lim, Lam (1998)(Correct)
This paper presents an algorithm to find the optimal affine partitions that maximize the degree of parallelism and minimize the degree of synchronization in programs with arbitrary loop nestings and a... / Z. Parallel Computing - br Languages and Compilers for Parallel Computing . wx D.
42 Evaluation of Compiler Optimizations for Fortran D on MIMD.. - Hiranandani, Kennedy, Tseng (1992)(Correct)
The Fortran D compiler uses data decomposition specifications
to automatically translate Fortran programs for execution
on MIMD distributed-memory machines. This paper
introduces and classifies a numb... / Center for Research on Parallel Computation Rice University P.O. br Introduction Parallel computing represents the only
41 ParaWeb: Towards World-Wide Supercomputing - Tim Brecht (1996)(Correct)
In this paper, we describe the design of a system, called ParaWeb, for utilizing Internet or intra-net
computing resources in a seamless fashion. The goal is to allow users to execute serial programs ... / heterogeneous distributed or parallel computing. ParaWeb extends the br with mechanisms for parallel computation within the Java
41 Maximizing Loop Parallelism and Improving Data Locality via Loop.. - Kennedy, McKinley (1994)(Correct)
Loop fusion is a program transformation that merges multiple
loops into one. It is effective for reducing the synchronization overhead
of parallel loops and for improving data locality. This paper p... / by the Center for Research on Parallel Computation a NSF Science and br Languages and Compilers for Parallel Computing. The MIT Press . .
41 An Object-Oriented Concurrent Reflective Language for Dynamic.. - Masuhara (1994)(Correct)
this paper proposes an object-oriented concurrent reflective language unknown (in IPSJ SIG Notes, 94-PRG-18, pp.57--64, 1994)
23567?;!ABD9-E4?=@?
:/C,35GKIFHJ81.0
NP)R
SWX"
ZOO(`[]Y+VT+LQ
nlpl~aszhiy... / Management in Highly Parallel Computing Hidehiko Masuhara br are designed for highly parallel computers. A major target of such
41 The LRPD Test: Speculative Run-Time Parallelization of Loops with.. - Rauchwerger, Padua (1995)(Correct)
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have
complex or statically insufficiently defined access patterns. As parallelizable loops a... / realize the full potential of parallel computing it has become clear that br most complex programs making parallel computing attractive. Acknowledgment
41 Beowulf: Harnessing the Power of Parallelism in a Pile-of-PCs - Ridge (1997)(Correct)
The rapid increase in performance
of mass market commodity microprocessors and
significant disparity in pricing between PCs and
scientific workstations has provided an opportunity
for substantial gain... / languages and compilers and parallel computing libraries. These are br proving a successful path to parallel computing there are many issues in
40 Scientific Computing on Bulk Synchronous Parallel Architectures - Bisseling And (1993)(Correct)
this paper we theoretically and experimentally analyse the efficiency
with which a wide range of important scientific computations can be performed on
BSP architectures. The computations considered in... / of general purpose parallel computing systems. In this paper we br the development of scalable parallel computing systems. It offers a robust
40 The Torus-Wrap Mapping For Dense Matrix Calculations On Massively.. - Hendrickson, Womble (1994)(Correct)
Dense linear systems of equations are quite common in science and engineering, arising in boundary element methods, least squares problems and other settings. Massively parallel computers will be ne... / Calculations On Massively Parallel Computers Bruce A. Hendrickson br and other settings. Massively parallel computers will be necessary to solve
39 Interactive Parallel Programming Using the ParaScope Editor - Kennedy, McKinley, Tseng (1991)(Correct)
The ParaScope project is developing an integrated collection of tools to help scientific programmers
implement correct and efficient parallel programs. The centerpiece of this collection
is the ParaSc... / to the problem of programming parallel computers. A substantial amount of br Sequent Symmetry The Parallel Computing Forum is developing PCF
38 Dynamic File-Access Characteristics of a Production Parallel.. - David Kotz (1994)(Correct)
Multiprocessors have permitted astounding increases in computational performance, but
many cannot meet the intense I/O requirements of some scientific applications. An important
component of any solut... / activity on a massively parallel computer was recorded. Our br from a variety of production parallel computing platforms and sites. The
38 Processor Coupling: Integrating Compile Time and Runtime Scheduling.. - Keckler (1992)(Correct)
The technology to implement a single-chip node composed of 4 high-performance floating-point ALUs will be available by 1995. This paper presents processor coupling,a mechanism for controlling multiple... / such a node serves well in a parallel computing environment since many br processing node for a highly parallel computer. Tech. Rep.
37 Fail-safe PVM: A portable package for distributed programming with.. - Leon (1993)(Correct)
Many scientific problems benefit from computationsthat are parallel at a coarse grain. Collections of looselycoupled, heterogeneous computers are increasingly being applied to these problems. While in... / under the title Research on Parallel Computing ARPA Order No. br for distributed memory parallel computers. In Proceedings of the
36 Software Libraries For Linear Algebra Computations On High.. - Dongarra, Walker (1995)(Correct)
This paper discusses the design of linear algebra libraries for high performance computers.
Particular emphasis is placed on the development of scalable algorithms for MIMD distributed
memory concurre... / are reviewed. Key words Parallel computing linear algebra software br linear algebra computations on parallel computers. For example if Q
36 Communication-Efficient Parallel Sorting - Goodrich (1996)(Correct)
We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication roun... / But as more and more parallel computer systems are being built br is a prime bottleneck in parallel computing e.g.see Aggarwal et al.
34 Distributed Packet Switching in Arbitrary Networks - Rabani, Tardos (1996)(Correct)
In a seminal paper Leighton, Maggs, and Rao consider
the packet scheduling problem when a single packet has
to traverse each path. They show that there exists a
schedule where each packet reaches its ... / issues in large scale parallel computing. Designing efficient packet
34 Falcon: On-line Monitoring and Steering of Large-Scale Parallel.. - Gu (1995)(Correct)
Falcon is a system for on-line monitoring and steering of large-scale parallel programs. The purpose of such interactive steering is to improve its performance or to affect its execution behavior. The... / Falcon addresses both single parallel computing platforms running threads
34 Compiler-Controlled Multithreading for Lenient Parallel Languages - Schauser, Culler, von Eicken (1991)(Correct)
Tolerance to communication latency and inexpensive synchronization are critical for general-purpose
computing on large multiprocessors. Fast dynamic scheduling is required for powerful non-strict pa... / ingredient in general purpose parallel computing systems. Many researchers br Programming Generality and Parallel Computers. In Proc. of the Fourth
33 Communication Issues in Parallel Computing across ATM Networks - Huang (1994)(Correct)
Cluster-based computing, which exploits the aggregate power of networked collections
of computers, has drawn increasing attention in the parallel processing community.
The success of cluster-based com... / Communication Issues in Parallel Computing across ATM Networks
33 Balancing Domain Decomposition - Mandel (1993)(Correct)
The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with unstructured subdomains for iterative solution of finite element discretizations of difficult probl... / words. Domain Decomposition Parallel Computing Elliptic Boundary Value
33 A Fast Mach Network IPC Implementation - Barrera (1991)(Correct)
This paper describes an implementation of network Mach IPC optimized for clusters of processors connected by a fast network, such as workstations connected by an Ethernet or processors in a non-shared... / under the title Research on Parallel Computing ARPA Order No.
33 The J-Machine Multicomputer: An Architectural Evaluation - Noakes (1993)(Correct)
The MIT J-Machine multicomputer has been constructed to study the role of a set of primitive mechanisms in providing efficient support for parallel computing. Each J-Machine node consists of an integr... / efficient support for parallel computing. Each J-Machine node br with a number of contemporary parallel computers. It is difficult to compare
33 Javelin: Internet-Based Parallel Computing Using Java - Cappello, Christiansen, Ionescu.. (1997)(Correct)
Java offers the basic infrastructure needed to integrate computers connected to the Internet into a
seamless parallel computational resource: a flexible, easily-installed infrastructure for running co... / Javelin Internet-Based Parallel Computing Using Java Peter br the Internet into a seamless parallel computational resource a flexible
32 Scheduling Large-Scale Parallel Computations on Networks of.. - Blumofe (1994)(Correct)
Workstation networks are an underutilized yet valuable resource for solving large-scale parallel problems. In this paper, we present "idle-initiated" techniques for efficiently scheduling large-scale ... / Scheduling Large-Scale Parallel Computations on Networks of br scheduling large-scale parallel computations on workstation
31 An Overview of the Fortran D Programming System - Hiranandani, Kenney, Koelbel.. (1991)(Correct)
The success of large-scale parallel architectures is
limited by the difficulty of developing machineindependent
parallel programs. We have developed
Fortran D, a version of Fortran extended
with data ... / Center for Research on Parallel Computation Rice University P.O. br Languages and Compilers for Parallel Computing Santa Clara CA August
31 Adaptive and Reliable Parallel Computing on Networks of Workstations - Blumofe (1997)(Correct)
In this paper, we present the design of Cilk-NOW, a
runtime system that adaptively and reliably executes
functional Cilk programs in parallel on a network of
UNIX workstations. Cilk (pronounced "silk"... / Adaptive and Reliable Parallel Computing on Networks of Workstations br of workstations NOWs as parallel-computation platforms and
31 BSP Programming - McColl (1994)(Correct)
The Bulk Synchronous Parallel (BSP) model provides a unified
framework for the design and programming of general purpose parallel
computing systems. In this paper we describe some programming langua... / of general purpose parallel computing systems. In this paper we br unified approach to scalable parallel computing. . The BSP Model A
30 The Parallel Multipole Method on the Connection Machine - Zhao, Johnsson (1991)(Correct)
This paper reports on a fast implementation of the three-dimensional nonadaptive Parallel Multipole Method (PMM) on the Connection Machine system model CM--2. The data interactions within the decompos... / Keywords N-body algorithm parallel computing Parallel Multipole Method br Architectures. In VLSI and Parallel Computation pages - .
30 Representing Time in Multimedia-Systems - Wahl, Rothermel (1993)(Correct)
As multimedia systems deal with a variety of temporally interrelated media items, synchronization
is an important issue in those systems. One part of synchronization is the representation of
temporal ... / examined in the context of parallel computing. Several temporal models br presented ahead of time. In parallel computing data are processed as soon
30 Connection Analysis: A Practical Interprocedural Heap Analysis for C - Ghiya, Hendren (1995)(Correct)
This paper presents a practical heap analysis technique, connection analysis, that
can be used to disambiguate heap accesses in C programs. The technique is designed
for analyzing programs that alloca... / by Industry Canada Alex Parallel Computers Digital Equipment Canada br Languages and Compilers for Parallel Computing no. in Lec. Notes in
29 The Bird-Meertens Formalism as a Parallel Model - Skillicorn (1993)(Correct)
The expense of developing and maintaining software is the major obstacle to the routine use of parallel computation. Architecture independent programming offers a way of avoiding the problem, but the ... / obstacle to the routine use of parallel computation. Architecture br requirements for a model of parallel computation that will permit it are
29 The Prospero Resource Manager: A Scalable Framework for Processor.. - Neuman, Rao (1994)(Correct)
Existing techniques for allocating processors in parallel and distributed systems are not suitable for use in
large distributed systems. In such systems, dedicated multiprocessors should exist as an i... / by the desire to support parallel computing across organizations in a br provide environments for parallel computing on a network of
29 Approximating Total Flow Time on Parallel Machines - Leonardi, Raz (1997)(Correct)
We consider the problem of optimizing the total flow time of a stream of jobs that are released over time in a multiprocessor setting. This problem is NP -hard even when we allow preemption, and have ... / In areas like networks and parallel computing guaranteeing high
28 Balancing Domain Decomposition for Mixed Finite Elements - Cowsar(Correct)
The rate of convergence of the Balancing Domain Decomposition
method applied to the mixed finite element discretization of second order elliptic
equations is analyzed. The Balancing Domain Decomposi... / Center for Research on Parallel Computation Rice University P.O. br Domain Decomposition Parallel Computing Second Order Elliptic
28 Dynamic Coscheduling on Workstation Clusters - Patrick Sobalvarro (1998)(Correct)
Coscheduling has been shown to be a critical factor in achieving efficient
parallel execution in timeshared environments [11, 18, 4]. However, the most
common approach, gang scheduling, has limitation... / management efficient parallel computing with demand-paged virtual
28 Fast Interrupt Priority Management in Operating System Kernels - Stodolsky (1993)(Correct)
In this paper we describe a new, low-overhead technique for manipulating processor interrupt state in an operating
system kernel. Both uniprocessor and multiprocessor operating systems protect against... / under the title Research on Parallel Computing ARPA Order No.
28 A More Efficient RMI for Java - Nester, Philippsen, Haumacher (1999)(Correct)
In current Java implementations, Remote Method Invocation (RMI) is too slow, especially for high performance computing. RMI is designed for wide-area and high-latency networks, it is based on a slow o... / frequently demand a parallel computing infrastructure. Although br Tichy. ParaStation Efficient parallel computing by clustering workstations
27 BSPlib - The BSP Programming Library - Hill, McColl, Stefanescu, Goudreau.. (1997)(Correct)
This memory area is regarded as unregistered. 6. While registration is designed for "full duplex" communication, a process can do half duplex communication by, appropriately, registering an area of si... / would be superseded by parallel computing. This has not yet happened br computing power. For parallel computing to become the normal form of
27 A High-Performance, Portable Implementation of the MPI Message.. - Gropp (1996)(Correct)
MPI (Message Passing Interface) is a specification for a standard library for message
passing that was defined by the MPI Forum, a broadly based group of parallel computer
vendors, library writers, an... / a broadly based group of parallel computer vendors library writers br imparts lessons about parallel computing the specification being
27 The Nexus Task-parallel Runtime System - Foster, Kesselman, Tuecke (1994)(Correct)
A runtime system provides a parallel language compiler with an interface to the low-level facilities required to support interaction between concurrently executing program components. Nexus is a porta... / used to implement Nexus on parallel computers show how it is used in br the compiler's view of a parallel computer how computational
27 BSPlib: The BSP Programming Library - Hill, McColl, Stefanescu, Goudreau.. (1998)(Correct)
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full definition of BSPlib in C, motivates t... / including massively parallel computers with distributed memory br would be superseded by parallel computing. This has not yet happened
27 Solving Alignment using Elementary Linear Algebra - Bau, Kodukula, Kotlyar, Pingali.. (1994)(Correct)
Data and computation alignment is an important part of
compiling sequential programs to architectures with non-uniform memory
access times. In this paper, we show that elementary matrix methods
can ... / Languages and Compilers for Parallel Computing. Sixth International br Languages and Compilers for Parallel Computing. Fourth International
26 Functional Skeletons for Parallel Coordination - Darlington, Guo, To, Yang (1995)(Correct)
In this paper we propose a methodology for structured parallel programming using
functional skeletons to compose and co-ordinate concurrent activities themselves defined
in a standard imperative langu... / Words Programming Language Parallel Computing Skeleton Coordination br language Linda abstracts MIMD parallel computation as an asynchronously
26 Provably Efficient Scheduling for Languages with Fine-Grained.. - Blelloch, Gibbons, Matias (1995)(Correct)
this paper has been extended
to generate the pdf-schedule for such languages by using a
2-3 tree data structure that maintains the ready set in the
appropriate priority order [BGMN97]. unknown [Hag91]... / International Workshop on Parallel Computing and VLSI pages - br Vector Models for Data-Parallel Computing. The MIT Press Cambridge
26 A Parallel Genetic Algorithm for the Set Partitioning Problem - Levine (1994)(Correct)
This paper describes a parallel genetic algorithm developed for the solution of the
set partitioning problem---a difficult combinatorial optimization problem used by many airlines
as a mathematical ... / Up To Nodes Of An Ibm Sp Parallel Computer. We Found That Performance br combinatorial optimization parallel computing airline crew scheduling
25 Polaris: The Next Generation in Parallelizing Compilers - Blume, Eigenmann, Faigin, Grout.. (1994)(Correct)
It is the goal of the Polaris project to develop a new parallelizing compiler that will overcome limitations of current compilers. While current parallelizing compilers may succeed on small kernels, t... / toward the goal of making parallel computing a practical technology. br important instruments of a parallel computing environment. We have come a
25 Construction of Optimal Multicast Trees Based on the Parameterized.. - Park (1996)(Correct)
Many tree-based multicast algorithms have been proposed to provide an efficient
software implementation on parallel platforms without hardware multicast support.
These algorithms are either architectu... / Tree Message Passing Parallel Computers Parameterized br ported to any message-based parallel computing platforms regardless their
25 Efficient Address Generation for Block-Cyclic Distributions - Kennedy (1995)(Correct)
Data-parallel languages, such as High Performance Fortran, are designed to make programming of
distributed-memory machines easier, and resulting programs more portable and efficient. Advanced
features... / Center for Research on Parallel Computation Rice University P.O. br Center for Research on Parallel Computation Department of Computer
25 Coherent Network Interfaces for Fine-Grain Communication - Mukherjee, Falsafi, al. (1996)(Correct)
Historically, processor accesses to memory-mapped device
registers have been marked uncachable to insure their visibility to
the device. The ubiquity of snooping cache coherence, however,
makes it pos... / as required by demanding parallel computing applications. This includes br Delivering Seamless Parallel Computing. In Proceedings of EURO-PAR
25 Ninf: A Network based Information Library for Global World-Wide.. - Sato (1997)(Correct)
Ninf is an ongoing global network-wide computing infrastructure
project which allows users to access computational resources including hardware,
software and scientific data distributed across a wid... / high performance in network parallel computing but also to provide high
25 Thread Migration and its Applications in Distributed Shared Memory.. - Itzkovitz, Schuster, Shalev (1997)(Correct)
In this paper we describe the way thread migration can be carried in distributed shared memory (dsm) systems. We discuss the advantages of multi-threading in dsm systems and the importance of preempte... / point of view non-scalable parallel computing on smp machines with br shared memory and scalable parallel computing on metacomputing
24 The Tiger Shark File System - Haskin, Schmuck (1996)(Correct)
Tiger Shark is a parallel file system for IBM's AIX operating system. It is designed to support interactive multimedia, particularly large-scale systems such as interactive television (ITV). Tiger Sha... / of both multimedia and parallel computing. Tiger Shark Overview br support general purpose parallel computing several extensions to
24 Interprocedural Array Region Analyses - Eatrice Creusillet (1995)(Correct)
Many program optimizations require exact knowledge of the
sets of array elements that are referenced in or that flow between statements
or procedures. Some examples are array privatization, generati... / Workshop on Compilers for Parallel Computers pages - June
24 PUMMA: Parallel Universal Matrix Multiplication Algorithms on.. - Choi, Dongarra, Walker (1993)(Correct)
0-5, NASA Ames Research Center, Moffet Field, CA
94035
134. William C. Skamarock, 3973 Escuela Court, Boulder, CO 80301
135. Richard Smith, Los Alamos National Laboratory, Group T-3, Mail Stop B2316, ... / Center for Research on Parallel Computation Rice University br Captain Edward A. Carmona Parallel Computing Research Group U.S. Air
23 A Proposal For A User-Level, Message Passing Interface In A.. - Dongarra, Hempel, al. (1993)(Correct)
This paper describes Message Passing Interface 1 (MPI1), a proposed library interface
standard for supporting point-to-point message passing. The intended standard will
be provided with Fortran 77 and... / by the Center for Research on Parallel Computing. Prepared by the Oak br the Center for Research on Parallel Computing for sponsoring this
23 Scalable Parallel Computing: A Grand Unified Theory and its Practical .. - McColl(Correct)
this paper we
describe the BSP model and discuss some of the developments in architecture, algorithms
and programming languages which are currently being pursued as part of this new, unified
approach ... / Scalable Parallel Computing A Grand Unified Theory and br of general purpose parallel computing systems. In this paper we
23 The Remote Computation System - Arbenz, Gander, Oettli (1996)(Correct)
Today many high performance computers are reachable over some network. However,
the access and use of these computers is often complicated. This prevents many users
to work on such machines. The goal ... / for extensive training in parallel computing and allowing them to use br software for sequential or parallel computers. Therefore it is assumed
23 On the Power of Bio-Computers - Rooss, Wagner (1995)(Correct)
In [Adl94] Adleman used biological manipulations with DNA strings to solve some instances of the Directed Hamiltonian Path Problem. Lipton [Lip94] showed how to extend this idea to solve any NP proble... / new theoretical approach to parallel computing by manipulating large sets
23 A Cutting Plane Method from Analytic Centers for Stochastic.. - Bahn, Merle, Goffin, Vial (1994)(Correct)
The stochastic linear programming problem with recourse has a dual block angular structure.
It can thus be handled by Benders decomposition or by Kelley's method of cutting
planes; equivalently the du... / with a potential for parallel computing see Loute and Vial br They are also amenable to parallel computation Another
23 Cost-Effective Parallel Computing - Wood, Hill (1995)(Correct)
Many academic papers imply that parallel computing is only worthwhile when applications achieve nearly linear speedup (i.e., execute nearly p times faster on p processors). This note shows that parall... / Cost-Effective Parallel Computing y David A. Wood and br academic papers imply that parallel computing is only worthwhile when
23 Software Synthesis for DSP Using Ptolemy - Pino, Ha, Lee, Buck (1993)(Correct)
Ptolemy is an environment for simulation, prototyping,
and software synthesis for heterogeneous systems. It
uses modern object-oriented software technology (in
C++) to model each subsystem in a natura... / and software design parallel computing and generation of
23 Work-Preserving Emulations of Fixed-Connection Networks - Koch, Leighton, Maggs, Rao.. (1989)(Correct)
In this paper, we study the problem of emulating TG steps of an NG -node guest network, G, on an NH -node host network, H. We call an emulation work-preserving if the time required by the host, TH , i... / at the heart of efficient parallel computing. Indeed one of the central br problems in efficient parallel computing is the task of mapping a
23 Transparent Fault-Tolerance In Parallel Orca Programs - Kaashoek, Michiels, Bal, Tanenbaum (1992)(Correct)
With the advent of large-scale parallel computing systems, making parallel programs fault-tolerant becomes an important problem, because the probability of a failure increases with the number of proce... / the advent of large-scale parallel computing systems making parallel br is intended for long running parallel computation. In their method the
22 Simulating Computer Architectures - Muller (1993)(Correct)
ion and COncurrency) allows the designer to answer so called "what-if" questions, for example: "What if the width of the bus is doubled?" As the name explains, ART-DACO models are constructed around a... / Eindhoven ACE Amsterdam and Parallel computing BV thank you all. Some br y One of the ways to build parallel computers is to use a distributed
22 HFS: A Performance-Oriented Flexible File System Based on.. - Krieger (1996)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on
servers, to redistribute to lists, or to use any component of this work in other works, requires prior
specific permission and... / data replication parallel computing parallel file system This br performance I O for massively parallel computers Problems and prospects.
22 Virtual Reality and Parallel Systems Performance Analysis - Reed (1995)(Correct)
Recording and analyzing the dynamics of application program, system software, and hardware interactions are the keys to understanding and tuning the performance of massively parallel systems. Because ... / Illinois Keywords parallel computing performance analysis br Introduction As massively parallel computer systems replace traditional
22 Portable Run-Time Support for Dynamic Object-Oriented Parallel.. - Grimshaw, Weissman, Strayer (1993)(Correct)
The object-oriented paradigm is a powerful tool for managing software complexity. A key
question when the paradigm is applied to parallel computing is whether the associated
overhead is so large as to... / the paradigm is applied to parallel computing is whether the associated br objectives that motivate parallel computing. We show that
22 Block-Cyclic Dense Linear Algebra - Lichtenstein, Johnsson (1993)(Correct)
Block--cyclic order elimination algorithms for LU and QR factorization and solve
routines are described for distributed memory architectures with processing nodes
configured as two--dimensional arrays... / Revised August Parallel Computing Research Group Center for br of arbitrary shape on a Data Parallel Computer. Parallel Computing
22 Multiprocessors Should Support Simple Memory Consistency Models - Hill (1998)(Correct)
Many future computers will be shared-memory multiprocessors.
These hardware systems must define for software the allowable
behavior of memory. A reasonable model is sequential consistency
(SC), which ... / Keywords multiprocessors parallel computing shared memory memory br Mark D. Hill. Cost-Effective Parallel Computing. IEEE Computer
21 Performance of the NAS Parallel Benchmarks on PVM Based Networks - White (1995)(Correct)
The NAS parallel benchmarks are a set of applications that embody the key
characteristics of typical processing in computational aerodynamics. Five of these,
the kernel benchmarks, have been implement... / tools. This mode of parallel computing is currently at a stage br analysis of highly parallel computers. While the NPB suite is
21 Effective Automatic Parallelization with Polaris - Blume, Eigenmann, Faigin, Grout.. (1995)(Correct)
The Polaris project has delivered a new parallelizing compiler that overcomes severe limitations of current compilers. While available parallelizing compilers may succeed on small kernels, they ofte... / toward the goal of making parallel computing a practical technology. br closer to the goal of making parallel computing available to the broad user
21 VAMPIR: Visualization and Analysis of MPI Resources - Nagel, Arnold, Weber, al. (1996)(Correct)
Performance analysis most often is based on the detailed knowledge of program behavior. One option to get this information is tracing. Based on the research tool PARvis, the visualization environment ... / Introduction On massively parallel computer systems performance br analysis tools available for parallel computers Paragraph Int or
20 The Privatizing DOALL Test: A Run-Time Technique for DOALL Loop.. - Rauchwerger, Padua (1994)(Correct)
Current parallelizing compilers cannot extract a significant fraction of the available parallelism
in a loop if it has a complex and/or statically insufficiently defined access pattern. This
is an imp... / to realize the potential of parallel computing. The reason that run-time br from the beginning of parallel computing. During the s
20 Fine-grain Scheduling under Resource Constraints - Paul Feautrier (1994)(Correct)
Many present-day microprocessors have fine grain parallelism, be it in the
form of a pipeline, of multiple functional units, or replicated processors. The
efficient use of such architectures depends o... / on Language and Compiler for Parallel Computers ADDRESS Cornell br the processors in a massively parallel computers. The schedule must be
20 Models of Parallel Computation: A Survey and Synthesis - Maggs, Matheson, Tarjan (1995)(Correct)
In the realm of sequential computing the random access machine has successufully provided an underlying model of computation that promoted consistency and coordination among algorithm developers, comp... / Models of Parallel Computation A Survey and Synthesis br experts. In the realm of parallel computing however there has been no
20 Collective Loop Fusion for Array Contraction - Gao, Olsen, Sarkary, Thekkath (1992)(Correct)
In this paper we propose a method for applying the loop fusion and array contraction
optimizations across a collection of loop nests. Loop fusion and array contraction are
techniques that can reduce ... / Languages and Compilers for Parallel Computing Irvine CA August . br Languages and Compilers for Parallel Computing August . To appear in
20 Java for Parallel Computing and as a General Language for Scientific.. - Fox (1997)(Correct)
We discuss the role of Java and Web technologies for general simulation. We classify the
classes of concurrency typical in problems and analyze separately the role of Java in user
interfaces, coarse g... / Java for Parallel Computing and as a General Language br Overview of Web and Parallel Computing Software Issues We can
19 Commutativity Analysis: A New Analysis Framework for Parallelizing.. - Rinard, Diniz (1996)(Correct)
This paper presents a new analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutativity analysis views ... / of developing software for parallel computing environments. Existing br role in other areas of parallel computing. Explicitly parallel
19 HeNCE: A Heterogeneous Network Computing Environment - Beguelin, Dongarra, Geist, Manchek.. (1993)(Correct)
Network computing seeks to utilize the aggregate resources of many networked computers to solve a
single problem. In so doing it is often possible to obtain supercomputer performance from an inexpensi... / heterogeneous machines parallel computing programming environments br debugging and analyzing the parallel computation. HeNCE provides
19 Game Tree Search on a Massively Parallel System - Feldmann, Mysliwietz, Monien (1993)(Correct)
During the World Computer Chess Championships in Madrid, November 1992, our distributed
chess program ZUGZWANG ran on a 1024 processor machine and finished second place without
having lost a game. Thi... / The Paderborn Center for Parallel Computing PC provided us with br tree searching algorithm. Parallel Computing pages - .
19 Parallel Programming Systems For Workstation Clusters - Douglas, MATTSON, SCHULTZ (1993)(Correct)
In this paper, we describe experiments comparing the communication times for a number of different network programming environments on isolated 2 and 4 node workstation networks. In addition to simp... / benchmarks. Key words. Parallel computing Communication C-Linda br reasons for considering parallel computing in the first place. Past
19 LSBATCH: A Distributed Load Sharing Batch System - Wang (1993)(Correct)
Batch processing, a primary mode of computing in mainframes and supercomputers, is
becoming important for networked systems as the computing environments become more
and more distributed. In this pape... / computer systems parallel computing heterogeneous computer br defeats the purpose of parallel computing. Worse yet such compute
19 FORK - A High-Level Language for PRAMs - Hagerup, Schmitt, Seidl (1994)(Correct)
We present a new programming language designed to allow the convenient expression of
algorithms for a parallel random access machine (PRAM). The language attempts to satisfy
two potentially conflictin... / of the most popular models of parallel computation and the number of br design. In the wider area of parallel computing in general much effort has
19 Parallelizing Applications into Silicon - Babb, Rinard, Moritz, Lee, Frank.. (1999)(Correct)
The next decade of computing will be dominated by embedded
systems, information appliances and application-specific
computers. In order to build these systems, designers will
need high-level compilati... / of known techniques from parallel computing and parallelizing br techniques from parallel computing and parallelizing compilers.
19 PUMA: An Operating System for Massively Parallel Systems - Wheat, al. (1994)(Correct)
This paper presents an overview of PUMA, (Performanceoriented,
User-managed Messaging Architecture), a
message passing kernel. Message passing in PUMA is
based on portals---an opening in the address s... / a joint project between the Parallel Computing Sciences Department at br high-performance massively-parallel computing. In January of the
19 Fast Folding and Comparison of RNA Secondary Structures (The Vienna.. - Hofacker, Fontana, Stadler.. (1994)(Correct)
Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures ... / of modified algorithms on parallel computers with distributed memory. br an Intel Hypercube shows that parallel computing becomes gradually more and
19 Data Flow Equations for Explicitly Parallel Programs - Grunwald, Srinivasan (1993)(Correct)
We have extended the standard monotone dataflow system for the reaching definitions problem
to accommodate explicitly parallel programs; this information is used in many standard
optimization problems... / FORTRAN as specified by the Parallel Computing Forum which is the br Cliffs NJ . Parallel Computing Forum. PCF Parallel FORTRAN
18 Restructuring Fortran Programs for Cedar - Eigenmann, Hoeflinger, Jaxon, Li.. (1993)(Correct)
This paper reports on the status of the Fortran translator for the
Cedar computer at the end of March, 1991. A brief description of
the Cedar Fortran language is followed by a discussion of the fortra... / techniques for vector and parallel computers since the late s when br Fortran developed by the Parallel Computing Forum including parallel
18 Quantifying the Multi-Level Nature of Tiling Interactions - Nicholas Mitchell (1997)(Correct)
Optimizations, including tiling, often target a single level
of memory or parallelism, such as cache. These optimizations usually
operate on a level-by-level basis, guided by a cost function paramet... / In Int. Conf. on Parallel Computing . . C. Ancourt and br to Program Optimization for Parallel Computers chapter . McGraw Hill
18 Parallel Algorithms for Hierarchical Clustering - Olson (1993)(Correct)
Hierarchical clustering is a common method used to determine clusters of
similar data points in multi-dimensional spaces. O(n
2
) algorithms, where n is
the number of points to cluster, have long be... / how it may be applied to the parallel computation of minimum spanning br section I will discuss the parallel computers that I describe algorithms
18 Overview of VPE: A Visual Environment for Message-Passing - Newton (1995)(Correct)
VPE is a fully integrated visual heterogeneous parallel
programming environment with a message-passing
orientation. It is intended to provide a simple human
interface to the process of creating messag... / Introduction Many existing parallel computing languages and environments br and Tutorial for Networked Parallel Computing MIT Press Cambridge MA
18 A Practical Approach to Dynamic Load Balancing - Jerrell Watts (1996)(Correct)
This paper presents a cohesive, practical load balancing framework that improves upon existing
strategies. These techniques are portable to a broad range of prevalent architectures,
including massivel... / diffusion massively parallel computing irregular problems br probabilities Parallel Computing vol. pp. -
18 Scheduling And Code Generation For Parallel Architectures - Yang (1993)(Correct)
OF THE DISSERTATION
Scheduling and Code Generation for Parallel
Architectures
by Tao Yang, Ph.D.
Dissertation Director: Professor Apostolos Gerasoulis
Automatic partitioning, scheduling and code gener... / for introducing me to parallel computing and for always being there br acyclic task graph to model parallel computation. We do not address the
18 Evaluation of Mechanisms for Fine-Grained Parallel Programs in the.. - Ellen Spertus (1993)(Correct)
This paper uses an abstract machine approach to
compare the mechanisms of two parallel machines: the
J-Machine and the CM-5. High-level parallel programs
are translated by a single optimizing compiler... / At the current state of parallel computing a completely satisfactory br aspects that are unique to parallel computing. Section examines the
18 Formal Memetic Algorithms - Radcliffe, Surry (1994)(Correct)
A formal, representation-independent form of a memetic algorithm---a genetic algorithm
incorporating local search---is introduced. Ageneralisedform of N-point crossover is defined together
with repr... / Edinburgh Parallel Computing Centre King's Buildings br International Conference on Parallel Computing and Transputer
18 Bayanihan: Building and Studying Web-Based Volunteer Computing.. - Sarmenta (1999)(Correct)
Project Bayanihan is developing the idea of volunteer computing , which seeks to enable people to form very large parallel computing networks very quickly by using ubiquitous and easy-to-use technolog... / people to form very large parallel computing networks very quickly by br to separate blocks of parallel computation such that one block is