Newsletter Downloads
Analyzing stability in wide-area network performance
The Internet is a very large scale, complex, dynamical system that is hard to model and analyze. In this paper, we develop and analyze statistical models for the observed end-to-end network performance based on extensive packet-level traces (consisting ...
Performance issues of enterprise level web proxies
Enterprise level web proxies relay world-wide web traffic between private networks and the Internet. They improve security, save network bandwidth, and reduce network latency. While the performance of web proxies has been analyzed based on synthetic ...
A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet
Most of the studies of feedback-based flow and congestion control consider only persistent sources which always have data to send. However, with the rapid growth of Internet applications built on TCP/IP such as the World Wide Web and the standardization ...
Queue management for explicit rate based congestion control
Rate based congestion control has been considered desirable, both to deal with the high bandwidth-delay products of today's high speed networks, and to match the needs of emerging multimedia applications. Explicit rate control achieves low loss because ...
TCP over ATM: ABR or UBR?
This paper reports on a simulation study of the relative performances of the ATM ABR and UBR service categories in transporting TCP/IP flows through an ATM Network. The objective is two-fold: (i) to understand the interaction between the window - based ...
Scalable reliable multicast using multiple multicast groups
We examine an approach for providing reliable, scalable multicast communication, using multiple multicast groups for reducing receiver processing costs in a multicast session. In this approach a single multicast group is used for the original ...
Performance debugging shared memory parallel programs using run-time dependence analysis
We describe a new approach to performance debugging that focuses on automatically identifying computation transformations to reduce synchronization and communication. By grouping writes together into equivalence classes, we are able to tractably collect ...
Preprototyping SIMD coprocessors using virtual machine emulation and trace compilation
The use of massively parallel SIMD array architectures is proliferating in the area of domain specific coprocessors. Even so, they have undergone few systematic empirical studies. The underlying problems include the size of the architecture space, the ...
Informed multi-process prefetching and caching
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent study showed that, in the context of a single hinting application, ...
Adaptive page replacement based on memory reference behavior
As disk performance continues to lag behind that of memory systems and processors, virtual memory management becomes increasingly important for overall system performance. In this paper we study the page reference behavior of a collection of memory-...
Managing server load in global memory systems
New high-speed switched networks have reduced the latency of network page transfers significantly below that of local disk. This trend has led to the development of systems that use network-wide memory, or global memory, as a cache for virtual memory ...
Size-limited batch movement in product-form closed discrete-time queueing networks
Existing models for product-form closed discrete-time queueing networks with batch movement of customers implicitly assume that batch sizes are unrestricted. In many practical modelling situations however, it is necessary to impose restrictions on the ...
Bounding of performance measures for a threshold-based queueing system with hysteresis
In this paper, we consider a K-server threshold-based queueing system with hysteresis in which the number of servers, employed for servicing customers, is governed by a forward threshold vector F= (F1, F2, …, FK-1) (where F1 < F2 < … ...
Using real-time queueing theory to control lateness in real-time systems
This paper presents real-time queueing theory, a new theory which embeds the ability of real-time scheduling theory to determine whether task timing requirements are met into the context of queueing models. Specifically, this paper extends the analysis ...
Cache behavior of network protocols
In this paper we present a performance study of memory reference behavior in network protocol processing, using an Internet-based protocol stack implemented in the x-kernel running in user space on a MIPS R4400-based Silicon Graphics machine. We use the ...
Second moment resource allocation in multi-service networks
A crucial problem for the efficient design and management of integrated services networks is how to best allocate network resources for heterogeneous and bursty traffic streams in multiplexers that support prioritized service disciplines. In this paper, ...
On the characterization of VBR MPEG streams
We present a comprehensive model for variable-bit-rate MPEG video streams. This model captures the bit-rate variations at multiple time scales. Long-term variations are captured by incorporating scene changes, which are most noticeable in the ...
File system aging—increasing the relevance of file system benchmarks
Benchmarks are important because they provide a means for users and researchers to characterize how their workloads will perform on different systems and different system architectures. The field of file system design is no different from other areas of ...
Operating system benchmarking in the wake of lmbench: a case study of the performance of NetBSD on the Intel x86 architecture
The lmbench suite of operating system microbenchmarks provides a set of portable programs for use in cross-platform comparisons. We have augmented the lmbench suite to increase its flexibility and precision, and to improve its methodological and ...
The utility of exploiting idle workstations for parallel computation
In this paper, we examine the utility of exploiting idle workstations for parallel computation. We attempt to answer the following questions. First, given a workstation pool, for what fraction of time can we expect to find a cluster of k workstations ...
A performance evaluation of cluster architectures
This paper investigates the performance of shared-memory cluster-based architectures where each cluster is a shared-bus multiprocessor augmented with a protocol processor maintaining cache coherence across clusters. For a given number of processors, ...
Design and evaluation of a DRAM-based shared memory ATM switch
Beluga is a single-chip switch architecture specifically targeted at local area ATM networks, and it features three architectural innovations. First, an interconnection hierarchy composed of multiple switching fabrics is built into the chip to provide ...
Efficient retrieval of composite multimedia objects in the JINSIL distributed system
In a distributed environment, presentation of structured, composite multimedia information poses new challenges in dealing with variable bandwidth (BW) requirement and synchronization of media data objects. The detailed knowledge of BW requirement ...
File server scaling with network-attached secure disks
- Garth A. Gibson,
- David F. Nagle,
- Khalil Amiri,
- Fay W. Chang,
- Eugene M. Feinberg,
- Howard Gobioff,
- Chen Lee,
- Berend Ozceri,
- Erik Riedel,
- David Rochberg,
- Jim Zelenka
By providing direct data transfer between storage and client, network-attached storage devices have the potential to improve scalability for existing distributed file systems (by removing the server as a bottleneck) and bandwidth for new parallel and ...
Group-guaranteed channel capacity in multimedia storage servers
One of the open questions in the design of multimedia storage servers is in what order to serve incoming requests. Given the capability provided by the disk layout and scheduling algorithms to serve multiple streams simultaneously, improved request ...