By Topic

High Performance Distributed Computing, 1994., Proceedings of the Third IEEE International Symposium on

Date 2-5 Aug. 1994

Filter Results

Displaying Results 1 - 25 of 38
  • 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
  • Investigating weak memories using Maya

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

    Maya is a platform for investigating the impact of different memory coherence protocols on parallel architectures. We present the implementations of several weak memory protocols, together with some new primitives dedicated to weak memories using Maya. The results of some user applications are summarized and the impact of weak memories on the efficiency of these parallel programs is discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of parallel algorithms for gene-finding

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

    Finding genes unequivocally in DNA sequences is one of the key goals of the Human Genome project. The human genome is a 3 billion character long DNA sequence and is estimated to contain about 100000 genes. It has been shown by several biologists that genes in a DNA sequence satisfy certain special properties. We use a combination of these properties to design a serial algorithm for gene-finding. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving partial differential equations on a network of workstations

    Publication Year: 1994, Page(s):194 - 201
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The use of a network of workstations as a single unit for speeding up computationally intensive applications is becoming a cost-effective alternative to traditional parallel computers. We present the implementation of an application-driven parallel platform for solving partial differential equations (PDEs) on this computing environment. The platform provides a general and efficient parallel soluti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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 (16 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.
  • 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 (36 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.
  • A decomposition advisory system for heterogeneous data-parallel processing

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

    Networked computing has become a popular method for using parallelism to solve a variety of computationally intense problems. However, high communication costs and processor heterogeneity may limit performance unless the problem space is carefully partitioned. We propose a decomposition advisory system that is designed to help choose the best data partitioning strategy. The goal of this research i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A task graph centroid

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

    When one is concerned with maximizing overall program throughput, task mapping in a heterogeneous computing environment presents the problem of which computing unit(s) is best suited to perform each task. This paper explores the concept that finding a “better” starting point for the static mapping process will provide a better opportunity for success. A starting point based on a comput... 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.
  • 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.
  • An experimental active-memory-based network element

    Publication Year: 1994, Page(s):139 - 148
    Cited by:  Papers (1)
    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.
  • 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.
  • 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.
  • Running a climate model in a heterogeneous, distributed computer environment

    Publication Year: 1994, Page(s):79 - 84
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    A methodology for distribution of a global climate model among computers connected by a wide area network is presented. The application consists of a model of the global atmosphere coupled to a model of the world ocean. It is demonstrated that a `metacomputer' consisting of a CRAY Y-MP at the Jet Propulsion Laboratory and an Intel Delta at the California Institute of Technology connected by a high... 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.
  • 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.
  • Parallel computations on the CHARM heterogeneous workstation cluster

    Publication Year: 1994, Page(s):203 - 210
    Cited by:  Papers (3)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    In recent years parallel computing on a fast network of high performance and low cost workstations has become a viable and an economic option, compared to that on an expensive high performance parallel supercomputer for solving large Grand Challenge scientific problems. This paper focuses on how to efficiently exploit the computing resources of a set of heterogeneous Unix workstations. We have fur... 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.
  • Falcon-toward interactive parallel programs: the on-line steering of a molecular dynamics application

    Publication Year: 1994, Page(s):26 - 33
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The paper focuses on the opportunities and costs of online steering as applied to a substantial parallel application. We demonstrate potential performance improvements through the use of the Falcon system, an experimental system for the online monitoring and steering of parallel programs. The visual presentation of program output along with animated displays of program performance information via ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data reshuffling in support of fast I/O for distributed-memory machines

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

    Achieving high-speed network I/O on distributed memory systems is a hard problem because their architectures are, in general, ill-suited for communication with the external world One of the problems is that messages are distributed over the private memories of the distributed memory system. This can result in poor performance since communication includes a complex scatter/gather operation. This pa... 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.
  • Automatic generation of parallel programs with dynamic load balancing

    Publication Year: 1994, Page(s):166 - 175
    Cited by:  Papers (10)
    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.
  • 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.
  • 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.
  • 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.