Search
Now showing items 1-10 of 71
Efficient simulation of interconnection networks
(1993)
This thesis presents a modular, general-purpose interconnection network simulator called NETSIM developed as an extension to YACSIM, a C-language based process-oriented discrete event simulator. NETSIM is capable of simulating a wide range of switch architectures and network topologies. A NETSIM model can be simulated in a stand-alone mode with the ...
Subnet discovery in passive internally sensed network tomography
(2007)
Passive internally-sensed network tomography is the study of network characteristics and behavior based on observations of network traffic on a select subset of links inside the network. In this research, we identify the Subnet Discovery Problem as a key challenge in performing passive network tomography, and propose an alternating classification ...
Multi-class latency bounded Web services
(2000)
Two recent advances have resulted in significant improvements in web server quality-of-service. First, both centralized and distributed web servers can provide isolation among service classes by fairly distributing system resources. Second, session admission control can protect classes from performance degradation due to overload. The goal of this ...
The effect of contention on the scalability of page-based software shared memory systems
(1999)
We demonstrate the profound effects of contention on the performance of page-based software distributed shared memory systems, as such systems are scaled to a larger number of nodes.
Programs whose performance scales will experience only minor increases in memory latency, do not suffer from contention, and show a balanced communication load. In ...
Measurement-based admission control in integrated-services networks
(1998)
To satisfy the quality of service requirements of real-time multimedia applications, networks must employ resource reservation and admission control. In this paper, we describe a new Measurement-Based Admission Control (MBAC) algorithm that uses empirical traffic envelopes of the aggregate traffic flow to allocate network resources. Our framework of ...
Automatic data aggregation for software distributed shared memory systems
(1997)
Software Distributed Shared Memory (DSM) provides a shared-memory abstraction on distributed memory hardware, making a parallel programmer's task easier. Unfortunately, software DSM is less efficient than the direct use of the underlying message-passing hardware. The chief reason for this is that hand-coded and compiler-generated message-passing ...
Connexions: An architecture for Web-based educational materials
(2001)
This thesis describes Connexions, a powerful new architecture for managing web-based educational materials. Connexions, consisting of five components, enables course instructors to take advantage of the cross-linked nature of the Web and helps students visualize the relationships between concepts. The first component is a pool of interlinked content ...
OpenMP on networks of workstations
(2001)
The OpenMP Application Programming Interface (API) is an emerging standard for parallel programming on shared memory architectures. Networks of workstations (NOWs) are attractive parallel programming platforms because of their good price/performance ratio, as well as their flexibility and their potential to scale. This work is the first to extend the ...
Simulation of shared memory parallel systems
(1990)
This thesis describes a method to simulate parallel programs written for shared memory multiprocessors. We have extended execution-driven simulation to facilitate the simulation of shared memory. We have developed a shared memory profiler, which, at compile-time, inserts simulation support code into the assembly code of the program to be able to ...
The effects of cache coherence on the performance of parallel PDE algorithms in multiprocessor systems
(1988)
The advent of parallel processing systems has resulted in the potential for increased performance over traditional uniprocessor systems. However, while there has been significant advances in developing these systems, designing parallel algorithms to run on them has not kept up with the pace. Although parallel algorithms have been studied in the ...