Provisioning of a shared server with guarantees is an important scheduling task that has led to significant work in a number of areas including link scheduling. Fair Queuing algorithms provide a method for proportionally sharing a single server among competing flows, however, they do not address the problem of sharing multiple servers. Multiserver systems arise in a number of applications including link aggregation, multiprocessors and multi-path storage I/O. In this paper we introduce a new service discipline for multi-server systems that provides guarantees for competing flows. We prove that this new service discipline is a close approximation of the idealized Generalized Processor Sharing (GPS) discipline. We calculate its maximum packet delay and service discrepancy with respect to GPS. We also discuss its relevance to several applications, in particular, Ethernet link aggregation.
No abstract
A growing number of aipplications need access to video data stored in digital form on secondary storage devices (e.g., vide-on-demand, multimedia messaging). As a result, Mdeo S C N C~O that are respo'nsible for the storage and retrieval, a t fixed rates, of hundreds of videos from disks are becoming increasingly important. Since video data tends t o be voluminous, several disks are usually used in order to store the videos. A challenge is to devise schemes for the storage and retrieval of videos that distribute the workload evenly across disks, reduce the cast of the server and at the same time, provide good response times to client reguests for video data.In this paper, we present schemes that are based on striping videos ($ne-grained as well .as coarse-grahd) across disks in order to effectively utilize disk bandwidth. For the schemes, we show how an optimd-cost server architecture UUI be determined if data for a certain prespecifted number of videos is t o be concurrently retrieved. T h e schemes provide good response times in environments in which the number of concurrent client requests is not much larger than the number of videos that can be concurrently retrieved by the server.
Recent advances in storage technology, coupled with the dramatic increase in the bandwidth of networks, now make it possible to provide "video-on-demand" service to viewers. A video-on-demand server is a computer system that stores videos in compressed digital form and provides support for various portions of compressed video data to be accessed and transmitted concurrently. We present a lowcost storage architecture for a video-on-demand server that relies principally on disks. The high bandwidths of disks in conjunction with a clever strategy for striping videos on them enables simultaneous access and transmission of portions of a video, separated by fixed time intervals. We also present schemes for implementing VCR-like functions including fast forward, rewind, and pause, and extend our schemes to the case in which videos have different rate requirements.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.