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
  • 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 (936 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.
  • Packing messages as a tool for boosting the performance of total ordering protocols

    Publication Year: 1997, Page(s):233 - 242
    Cited by:  Papers (14)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • A distributed load balancing algorithm for the hot cell problem in cellular mobile networks

    Publication Year: 1997, Page(s):254 - 263
    Cited by:  Papers (11)  |  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.
  • 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.
  • A parallel workload model and its implications for processor allocation

    Publication Year: 1997, Page(s):112 - 123
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 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.
  • Adaptive cache invalidation methods in mobile environments

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

    Caching of frequently accessed data items can reduce the bandwidth requirement in a mobile wireless computing environment. Periodically broadcast of invalidation reports is an efficient cache invalidation strategy. However, this strategy is severely affected by the disconnection and mobility of the clients. In this paper, we present two adaptive cache invalidation report methods, in which the serv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel allocation methods for data dissemination in mobile computing environments

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

    We discuss several channel allocation methods for data dissemination in mobile computing systems. We suggest that the broadcast and on-demand channels have different access performance under different system parameters and that a mobile cell should use a combination of both to obtain optimal access time for a given workload and system parameters. We study the data access efficiency of three channe... 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 (828 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.
  • 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.
  • Frame-based components for generalized particle methods

    Publication Year: 1997, Page(s):50 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 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.
  • 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.
  • 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.
  • 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.
  • Forecasting network performance to support dynamic scheduling using the network weather service

    Publication Year: 1997, Page(s):316 - 325
    Cited by:  Papers (51)  |  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.
  • 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.
  • 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.
  • 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 (804 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.
  • PARDIS: A parallel approach to CORBA

    Publication Year: 1997, Page(s):31 - 39
    Cited by:  Papers (13)
    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 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.