Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183)

5-8 Aug. 1997

Filter Results

Displaying Results 1 - 25 of 39
  • Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183)

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (224 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s): 377
    Request permission for commercial reuse | PDF file iconPDF (66 KB)
    Freely Available from IEEE
  • Distributed service paradigm for remote video retrieval request

    Publication Year: 1997, Page(s):191 - 200
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    The per service cost have been serious impediment to wide spread usage of on-line digital continuous media service, especially in the entertainment arena. Although handling the continuous media may be achievable due to the technology advances in past few years, its competitiveness in the market with the existing service type such as video rental is still in question. In this paper, we propose a se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kaleido: an environment for composing networked multimedia applications

    Publication Year: 1997, Page(s):181 - 190
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    Kaleido is a system for flexible concurrent processing of multimedia flows where applications are decomposed into building blocks called “active buffers” whose computation and I/O requirements are characterized so as to allow reservation of CPU and bandwidth resources. The input and output ports of active buffers in a Kaleido application are connected by channels. The active buffers in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed polyphonic music synthesis

    Publication Year: 1997, Page(s):20 - 29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    Music synthesis often relies on very computationally intensive algorithms. Various strategies have been used to deal with the complexity, including using simpler, but more limited algorithms, using specialized hardware, and executing them in non-real-time for later playback. Although several implementations using parallel hardware have been done, very little has been done with distributed implemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cut-through delivery in Trapeze: An exercise in low-latency messaging

    Publication Year: 1997, Page(s):243 - 252
    Cited by:  Papers (6)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    New network technology continues to improve both the latency and bandwidth of communication in computer clusters. The fastest high-speed networks approach or exceed the I/O bus bandwidths of “gigabit-ready” hosts. These advances introduce new considerations for the design of network interfaces and messaging systems for low-latency communication. This paper investigates cut-through deli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel hierarchical global illumination

    Publication Year: 1997, Page(s):12 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    This paper presents an algorithm that solves the Rendering Equation to any desired accuracy, and can be run in parallel on distributed memory or shared memory computer systems with excellent scaling properties. It appears superior in both speed and physical correctness to recent published methods involving bidirectional ray tracing or hybrid treatments of diffuse and specular surfaces. Like &ldquo... View full abstract»

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

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

    In discussions of ASCI, the high-profile procurements of large computers frequently figure prominently. However, from the outset of the ASCI program, applications have been recognized as the driver. These applications feature complex, multi-physics simulations of natural phenomena that generate massive data sets as output. As we have moved from computing systems dominated by parallel vector proces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forecasting network performance to support dynamic scheduling using the network weather service

    Publication Year: 1997, Page(s):316 - 325
    Cited by:  Papers (54)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    The Network Weather Service is a generalizable and extensible facility designed to provide dynamic resource performance forecasts in metacomputing environments. In this paper, we outline its design and detail the predictive performance of the forecasts it generates. While the forecasting methods are general, we focus on their ability to predict the TCP/IP end-to-end throughput and latency that is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting parallel applications on clusters of workstations: The intelligent network interface approach

    Publication Year: 1997, Page(s):159 - 168
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by high speed network. This architecture permits: (1) the transfer of selected communication-related functionality the host machine to the network interface coprocessor and (2) the exposure of this functionality directly to applications... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel FFT on ATM-based networks of workstations

    Publication Year: 1997, Page(s):2 - 11
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    In this paper, we first evaluate the performance degradation caused by unequal bandwidths on the execution of conventional parallel algorithms such as the fast Fourier transform on an ATM-based Network of Workstations. We then present a strategy based on dynamic redistribution of data points to reduce the bottlenecks caused by unequal bandwidths. We also extend this strategy to deal with processor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing layered communication protocols

    Publication Year: 1997, Page(s):169 - 177
    Cited by:  Papers (2)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Layering of communication protocols offers many well-known advantages but typically leads to performance inefficiencies. We present a model for layering, and point out where the performance problems occur in stacks of layers using this model. We then investigate the common execution paths in these stacks and how to identify them. These paths are optimized using three techniques: optimizing the com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packing messages as a tool for boosting the performance of total ordering protocols

    Publication Year: 1997, Page(s):233 - 242
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a technique that buffers application messages for a short period of time before sending them, so more messages are packed together. The main conclusion of this comparison is that message packing influences the performance of tot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A directory service for configuring high-performance distributed computations

    Publication Year: 1997, Page(s):365 - 375
    Cited by:  Papers (100)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also of the protocols and algorithms used by applications. Selection and configuration in turn require access to accurate, up-to-date information on the structure and state of available resources. Unfortunately no standard mech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Run-time support for scheduling parallel applications in heterogeneous NOWs

    Publication Year: 1997, Page(s):347 - 355
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    This paper describes the current state of Prophet-a system that provides run-time scheduling support for parallel applications in heterogeneous workstation networks. Prior work on Prophet demonstrated that scheduling SPMD applications could be effectively automated with excellent performance. Enhancements have been made to Prophet to broaden its use to other application types including parallel pi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lilith: Scalable execution of user code for distributed computing

    Publication Year: 1997, Page(s):305 - 314
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Lilith is a general purpose tool to provide highly scalable, easy distribution of user code across a heterogeneous computing platform. Lilith's principal task is to span a heterogeneous tree of machines executing user-defined code in a scalable and secure fashion. Lilith will be used for controlling user processes as well as general system administrative tasks. Lilith is written in Java, taking ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collective buffering: Improving parallel I/O performance

    Publication Year: 1997, Page(s):148 - 157
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    “Parallel I/O” is the support of a single parallel application run on many nodes; application data is distributed among the nodes, and is read or written to a single logical file, itself spread across nodes and disks. Parallel I/O is a mapping problem from the data layout in node memory to the file layout on disks. Since the mapping can be quite complicated and involve significant data... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilizing heterogeneous networks in distributed parallel computing systems

    Publication Year: 1997, Page(s):336 - 345
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1172 KB)

    Heterogeneity is becoming quite common in distributed parallel computing systems, both in processor architectures and in communication networks. Different types of networks have different performance characteristics, while different types of messages may have different communication requirements. In this work, we analyze two techniques for exploiting these heterogeneous characteristics and require... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design patterns for parallel computing using a network of processors

    Publication Year: 1997, Page(s):293 - 304
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    High complexity of building parallel applications is often cited as one of the major impediments to the mainstream adoption of parallel computing. To deal with the complexity of software development, abstractions such as macros, functions, abstract data types, and objects are commonly employed by sequential as well as parallel programming models. This paper describes the concept of a design patter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A secure communications infrastructure for high-performance distributed computing

    Publication Year: 1997, Page(s):125 - 136
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    Applications that use high-speed networks to connect geographically distributed supercomputers, databases, and scientific instruments may operate over open networks and access valuable resources. Hence, they can require mechanisms for ensuring integrity and confidentiality of communications and for authenticating both users and resources. Security solutions developed for traditional client-server ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load-balanced routing for collaborative multimedia communication

    Publication Year: 1997, Page(s):81 - 90
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    An important class of multimedia applications involve real-time distributed collaboration or distributed control. This paper examines some of the issues in network support for this class of applications and presents Collaborative Load-Balanced Routing (CLBR), a new technique for routing and call establishment of distributed collaborative and control multimedia applications. CLBR substantially redu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible general purpose communication primitives for distributed systems

    Publication Year: 1997, Page(s):201 - 210
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    This paper presents the slotted-FIFO communication mode that supports communication primitives for the entire spectrum of reliability and ordering requirements of distributed applications: FIFO as well as non-FIFO, and reliable as well as unreliable communication. Hence, the slotted-FIFO communication mode is suitable for multimedia applications, as well as non real-time distributed applications. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PARDIS: A parallel approach to CORBA

    Publication Year: 1997, Page(s):31 - 39
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    This paper describes PARDIS, a system containing explicit support for interoperability of PARallel DIStributed applications. PARDIS is based on the Common Object Request Broker Architecture (CORBA). Like CORBA, it provides interoperability between heterogeneous components by specifying their interfaces in a meta-language, the CORBA IDL, which call be translated into the language of interacting com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed load balancing algorithm for the hot cell problem in cellular mobile networks

    Publication Year: 1997, Page(s):254 - 263
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    We propose a novel channel management algorithm, called distributed load balancing with selective borrowing (D-LBSB), for cellular mobile networks. As an underlying approach, we start with a fixed channel assignment scheme where each cell is initially allocated a set of local channels, each to be assigned on demand to a user in that cell. The novelty of our D-LBSB scheme lies in handling the hot c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed-thread scheduling methods for reducing page-thrashing

    Publication Year: 1997, Page(s):356 - 364
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    Although distributed threads on distributed shared memory (DSM) provide an easy programming model for distributed computer systems, it is not easy to build a high performance system with them, because a software DSM system is prone to page-thrashing. One way to reduce page-thrashing is to utilize thread migration, which leads to changes in page access patterns on DSM. In this paper, we propose thr... View full abstract»

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