Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing

2-5 Aug. 1994

Filter Results

Displaying Results 1 - 25 of 38
  • Overview of RWC massively parallel computer project

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (25 KB)

    Summary form only given, as follows. The author introduces the massively parallel computer research and development of the Japanese Real World Computing Project (RWC). RWC is a ten-year project whose budget is expected to be 600 million to 700 million dollars (US). We plan to develop an original 16 K PE stand-alone computer with a parallel C++ language, a more abstract object-oriented language, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing numerical software libraries for HPCC environments

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (32 KB)

    Summary form only given, as follows. Numerical software libraries have long been used in engineering and scientific computations on workstations and mainframes, but are just now becoming widely available on HPCC platforms. We describe recent developments in the SCALAPACK numerical linear algebra library, which have recently become available for currently existing massively parallel machines and ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multimedia supercomputing: the use of supercomputers to drive high-performance multimedia systems and virtual environments

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB)

    Summary form only given, as follows. The author describes a project underway at Argonne National Laboratory (ANL) to merge multimedia capability with large-scale parallel supercomputing. He describes the IBM SP parallel system currently installed at ANL and the project to extend its capability with ATM networks and video processor hardware/software, in order to provide scientific computing users w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Performance analysis of a new implementation efficient capacity allocation protocol for multimedia traffic in ATM networks

    Publication Year: 1994, Page(s):51 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    A. Burrell et al. (1993; 1994) described an implementation efficient capacity allocation protocol for multimedia traffic (voice, video, high and low speed data). The protocol determines the capacity allocation of each traffic dynamically, and induces moving boundaries within prespecified and fixed channel frames. The channel frames are selected to satisfy the jittering constraints of all the traff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting inter task dependencies for dynamic load balancing

    Publication Year: 1994, Page(s):157 - 165
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The major goal of dynamic load balancing is not primarily to equalize the load on the nodes of a parallel computing system, but to optimize the average response time of single requests or the throughput of all applications in the system. Therefore it is often necessary not only to keep all processors busy and all processor ready queue lengths within the same range, but to avoid delays and ineffici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WAVE processing of networks and distributed simulation

    Publication Year: 1994, Page(s):61 - 69
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    The objective of the paper is the description of the implementation of the WAVE model and language for highly parallel processing in open computer networks as well as an application of the distributed WAVE interpreter for modelling complex systems within an object-oriented philosophy. WAVE represents a new distributed programming paradigm enabling the dynamic creation and processing of arbitrary n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The virtual computing environment

    Publication Year: 1994, Page(s):7 - 14
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    A network of supercomputers and high-performance workstations appears to be the only reasonable way to provide adequate computing resources for the Grand Challenge problems of the next century. Such a collection of computers and supporting software environments is called a virtual computing environment (VCE). The paper describes the motivation and goals of the VCE project, followed by a descriptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling large-scale parallel computations on networks of workstations

    Publication Year: 1994, Page(s):96 - 105
    Cited by:  Papers (15)  |  Patents (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    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 parallel computations on workstation networks. By “idle-initiated”, we mean that idle computers actively search out work to do rather than wait for work to be assigned. The idl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic generation of parallel programs with dynamic load balancing

    Publication Year: 1994, Page(s):166 - 175
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    Existing parallelizing compilers are targeted towards parallel architectures where all processors are dedicated to a single application. However a new type of parallel system has become available in the form of high performance workstations connected by high speed networks. Such systems pose new problems for compilers because the available processing power on each workstation may change with time ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experimental active-memory-based network element

    Publication Year: 1994, Page(s):139 - 148
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    We describe a network element based on an active memory named SWIM (Structured Wafer-based Intelligent Memory), designed for efficient storage and manipulation of data structures. The key architectural idea in SWIM is to put some processing logic inside each memory chip that allows it to perform data manipulation operations locally and to interact with a disk or a communication line through a back... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of a partial dynamic declustering disk array system

    Publication Year: 1994, Page(s):244 - 252
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    With a view to improving the performance and the fault tolerance of mass storage units, this paper concentrates on the architectural issues of parallelizing I/O access and a disk array system by means of definition of a new, particularly flexible architecture, called Partial Dynamic Declustering, which is fault-tolerant and offers higher levels of performance and reliability than the solutions nor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction for different consistency schemes in distributed shared memory systems

    Publication Year: 1994, Page(s):295 - 302
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    A model for predicting relative performance in distributed shared memory systems is presented. The model is intended for use with systems that feature adaptive consistency schemes. Based on estimated read/write access patterns, the model determines the average steady-state communication costs in the system, which serve as a performance indicator. The model is applied to data items which may be eit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing high performance distributed computing through scalable computation servers

    Publication Year: 1994, Page(s):70 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Distributed applications spanning multiple nodes should he capable of providing fast response. Computation servers equipped with powerful processors and large memories can improve performance by better utilising system resources such as offloading overloaded nodes. A computation service may comprise all the nodes of the system (in case all are equipped with the required resources) or a small subse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of frameworks for scientific computation in a parallel distributed environment

    Publication Year: 1994, Page(s):15 - 25
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    The purpose of the paper is to introduce a frame-based approach to scientific computing on distributed computing platforms. The objective of the effort is to introduce well-defined mappings between the representations of physical phenomena as mathematical structures and the computational algorithms for modeling that phenomena on high-performance parallel computing platforms. Using this approach, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling a metacomputer by an implicit voting system

    Publication Year: 1994, Page(s):106 - 113
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    We address the problem of scheduling hardware requests to a metacomputer environment. The environment may consist of a heterogeneous set of computing resources. A high level abstraction of the metacomputer is assumed to take care of the heterogeneity. The scheduling problem is considered in two parts. Some requests are extracted from the waiting room at first and scheduled afterwards by using bin ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deciding boundedness for systems of two communicating finite state machines

    Publication Year: 1994, Page(s):262 - 269
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Consider a system of two communicating finite state machines that exchange messages over two unbounded, one-directional, FIFO channels. In our main result, we show that the boundedness problem is decidable for the class of such systems, where the two CFSMs are identical and constituted of only initial elementary circuits, and where the two CFSMs are linear. To analyse such systems, we introduce a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed solutions to the delay fault test quality evaluation problem

    Publication Year: 1994, Page(s):177 - 185
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Delay testing continues to gain importance as manufacturers try to meet stricter requirements for higher performance and higher density integrated circuits. The methodology to obtain a set of high quality gate delay fault detecting tests is unfortunately computationally intensive enough to be intractable for reasonably large VLSI circuits; parallelization of these computations is thus an attractiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of global reduction operations across ATM networks

    Publication Year: 1994, Page(s):43 - 50
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    The paper presents the results of an investigation into the efficient implementation of reduction operations for cluster-based parallel computing across asynchronous transfer mode (ATM) local area networks. The study combines graph theoretical analysis with experimentation on an ATM network. Different reduction algorithms are analyzed in terms of the amount of message traffic produced and the numb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network partitioning of data parallel computations

    Publication Year: 1994, Page(s):149 - 156
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Partitioning data parallel computations across a network of heterogeneous workstations is a difficult problem for the user. We have developed a runtime partitioning method for choosing the number and type of processors to apply to a data parallel computation, and a decomposition of the data domain in order to achieve reduced completion time. The partitioning method utilizes information about the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed computation of electromagnetic scattering problems using finite-difference time-domain decompositions

    Publication Year: 1994, Page(s):85 - 93
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Finite-Difference Time-Domain (FDTD) is an important numerical method for solving electromagnetic scattering problems. Solutions for these problems are computationally intensive, In addition, large problems require large amounts of memory, making distributed memory desirable. This paper describes distributed FDTD methods and their implementations on a distributed workstation network using PVM. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program analysis and transformations for fast data sharing

    Publication Year: 1994, Page(s):131 - 138
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Distributed Shared Memory (DSM) systems have been proposed to combine the programmability of traditional shared memory and the scalability of message-passing systems. Eager DSM systems can greatly reduce access latencies for remote data by keeping copies of shared values in local memory and updating them immediately whenever a shared datum changes. However, sharing all changes globally can limit t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process-replication technique for fault-tolerance and performance improvement in distributed computing systems

    Publication Year: 1994, Page(s):236 - 243
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The paper presents a process-replication protocol which aims at providing fault-tolerance as well as performance improvement to applications such as long-running and real-time tasks. Identical delivering order of messages are enforced on all replicas of a troupe using multicasts for inter- and intra-troupe communication. The detailed design of the protocol is given in the paper. The protocol is se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing variations in parallel efficiency for unstructured grid computations

    Publication Year: 1994, Page(s):287 - 294
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    We present the GRIDS programming system for parallel computations on unstructured grids. The need for adaptive parallelization is discussed. It takes into account the specific reasons for the degradation of parallel efficiency in parallel systems ranging from workstation clusters to parallel supercomputers. Implications are shown on the design of programming models for unified parallel and distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large-scale group communication protocol on high-speed channel

    Publication Year: 1994, Page(s):254 - 261
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    Group communication protocols discussed so far can be adopted for only a small group from the processing and communication overhead point of view. In this paper, we discuss how to provide a large-scale reliable group communication among several hundreds entities interconnected by a high-speed one-channel network. A group of entities is partitioned into disjoint subgroups named component clusters i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.