Mary K. Vernon

Learn More
Recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request yet achieve considerable client stream sharing (i.e., server and network bandwidth savings). This paper considers (1) the maximum savings in the required server (disk I/O and network) bandwidth that any such technique can provide,(More)
This paper presents an extensive analysis of the client workloads for educational media servers at two major U.S. universities. The goals of the analysis include providing data for generating synthetic workloads, gaining insight into the design of streaming content distribution networks, and quantifying how much server bandwidth can be saved in(More)
The simplest video-on-demand (VOD) delivery policy is to allocate a new media delivery stream to each client request when it arrives. This policy has the desirable properties of “immediate service” (there is minimal latency between the client request and the start of playback, assuming that sufficient server bandwidth is available to start the new stream),(More)
Scheduling policies for general purpose multiprogrammed multiprocessors are not well understood. This paper examines various policies to determine which properties of a scheduling policy are the most significant determinants of performance. We compare a more comprehensive set of policies than previous work, including one important scheduling policy that has(More)
Video-on-demand applications must consider the bandwidth limitations at the server, within the network, and at the client. Recent multicast delivery techniques have addressed the server and network bandwidth bottlenecks. These techniques, however, neglect consideration of client network access bandwidth limitations. Client bandwidth is often insufficient to(More)
Internet sensor networks, including honeypots and log analysis centers such as the SANS Internet Storm Center, are used as a tool to detect malicious Internet traffic. For maximum effectiveness, such networks publish public reports without disclosing sensor locations, so that the Internet community can take steps to counteract the malicious traffic.(More)
The POEMS project is creating an environment for endto-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runtime and operating system software, and hardware architecture. To enable end-to-end modeling of large-scale applications and systems, the POEMS framework is designed to compose models(More)
The performance potential of run-to-completion (RTC) parallel processor scheduling policies is investigated by examining whether (1) application execution rate characteristics such as <italic>average parallelism (avg)</italic> and <italic>processor working set (PWS)</italic> and/or (2) limited preemption can be used to improve the performance of these(More)
This p a p e r develops detailed analytical per formance models fo r k-ary n-cube networks with single-flit o r infinite buffers, wormhole routing, a n d the nonadapt ive deadlock-free routing scheme proposed by Dally a n d Seitz. I n contrast to previous per formance studies of such networks, t he system is modeled as a closed queueing ne twork tha t 1)(More)
The primitives make use of synchronization bits (syncbits) to provide a simple mechanism for mutual exclusion. The proposed implementation of the primitives includes efEcient (Le. kxal) busy-waiting for syncbit& In addition, a hardware-supported mechanism for maintaining a first-come ih-st-serve queue of requests for a syncbit is proposed. This queueing(More)