By Topic

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
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Distributed-thread scheduling methods for reducing page-thrashing

    Publication Year: 1997, Page(s):356 - 364
    Cited by:  Papers (4)  |  Patents (5)
    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.
  • 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 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.
  • 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.
  • 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.
  • 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.
  • 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 (764 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.
  • 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.
  • 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 (872 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.
  • 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.
  • 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.
  • Parallel programming in multi-paradigm clusters

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

    An important development in cluster computing is the availability of multiprocessor workstations. These are able to provide additional computational power to the cluster without increasing network overhead and allow multiparadigm parallelism, which we define to be the simultaneous application of both distributed and shared memory parallel processing techniques to a single problem. In this paper we... 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 (94)  |  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.
  • 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 (1008 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.
  • Utilizing heterogeneous networks in distributed parallel computing systems

    Publication Year: 1997, Page(s):336 - 345
    Cited by:  Papers (5)
    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.
  • 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.
  • 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.
  • 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.