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
  • 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 (928 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.
  • Parallel hierarchical global illumination

    Publication Year: 1997, Page(s):12 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1241 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 "progr... 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 (1024 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.
  • PARDIS: A parallel approach to CORBA

    Publication Year: 1997, Page(s):31 - 39
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (913 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.
  • The software architecture of a virtual distributed computing environment

    Publication Year: 1997, Page(s):40 - 49
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB)

    The requirements of grand challenge problems and the deployment of gigabit networks makes the network computing framework an attractive and cost effective computing environment with which to interconnect geographically distributed processing and storage resources. Our project, Virtual Distributed Computing Environment (VDCE), provides a problem-solving environment for high-performance distributed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frame-based components for generalized particle methods

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

    Algorithms for generalized particle methods are discussed in the context of high-performance parallel distributed computing. An object-oriented framework for such methods is presented along with the implementation of several very different scientific particle-based applications using the POET framework. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • InVerse: Designing an interactive universe architecture for scalability and extensibility

    Publication Year: 1997, Page(s):61 - 70
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (961 KB)

    Faster networks, faster processors, and standardized protocols have enabled the emergence of interactive applications running over commercial networks such as the Internet. In such applications, multiple users interact with one another by exchanging real-time information such as user position and orientation in a virtual world, live and recorded audio, video, and text. These applications include i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Argonne Voyager multimedia server

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

    With the growing presence of multimedia-enabled systems, we will see an integration of collaborative computing concepts into future scientific and technical workplaces. Desktop teleconferencing is common today, while more complex teleconferencing technology that relies on the availability of multipoint-enabled tools is starting to become available on PCs. A critical problem when using these collab... 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 (961 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.
  • Predicting slowdown for networked workstations

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

    Most applications share the resources of networked workstations with other applications. Since system load can vary dramatically, allocation strategies that assume that resources have a constant availability and/or capability are unlikely to promote performance-efficient allocations in practice. In order to best allocate application tasks to machines, it is critical to provide a realistic model of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speed up your database client with adaptable multithreaded prefetching

    Publication Year: 1997, Page(s):102 - 111
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (889 KB)

    In many client/server object database applications, performance is limited by the delay in transferring pages from the server to the client. We present a prefetching technique that can avoid this delay, especially where there are several database servers. Part of the novelty of this approach lies in the way that multithreading on the client workstation is exploited, in particular for activities su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel workload model and its implications for processor allocation

    Publication Year: 1997, Page(s):112 - 123
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1158 KB)

    We develop a workload model based on observations of parallel computers at the San Diego Supercomputer Center and the Cornell Theory Center. This model gives us insight into the performance of strategies for scheduling moldable jobs on space-sharing parallel computers. We find that Adaptive Static Partitioning (ASP), which has been reported to work well for other workloads, does not perform as wel... 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)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1150 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.
  • Replaying distributed programs without message logging

    Publication Year: 1997, Page(s):137 - 147
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1119 KB)

    Debugging long program runs can be difficult because of the delays required to repeatedly re-run the execution. Even a moderately long run of five minutes can incur aggravating delays. To address this problem, techniques exist that allow re-executing a distributed program from intermediate points by using combinations of checkpointing and message logging. In this paper we explore another idea: how... 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 (981 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 movement, o... 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 (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1071 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.
  • 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 (1326 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 an applicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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 (975 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.
  • 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 (812 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.
  • A bus-efficient low-latency network interface for the PDSS multicomputer

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

    The Packaging-Driven Scalable Systems multicomputer (PDSS) project uses several innovative interconnect and routing techniques to construct a low-latency, high-bandwidth (1.3 GB/s) multicomputer network. The PDSS network interface provides a low-latency interface between the network and the processing nodes that allows unprivileged code to initiate network operations while maintaining a high level... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance aspects of switched SCI systems

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

    The Scalable Coherent Interface (SCI) defines a high-speed interconnect that provides a coherent distributed shared memory system. With the use of switches separate rings can be connected to form large topology-independent configurations. It has been realized that congestion in SCI systems generates additional retry traffic which reduces the available communication bandwidth. This paper investigat... 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 (959 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.
  • Cut-through delivery in Trapeze: An exercise in low-latency messaging

    Publication Year: 1997, Page(s):243 - 252
    Cited by:  Papers (6)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (963 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 delivery, a tech... 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 (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 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.