摘要:
In a system (100), such as a video-on-demand-server, a reader (180) reads data from a storage medium (110) and stores the read data in buffers (125). The data is supplied from the buffers (125) to users (130) for consumption in the form of a plurality of data streams. The data streams may be fixed rate or variable rate with an identical maximum consumption rate of Rmax data elements per second. The reader (180) is controlled by a scheduler (170). The scheduler (170) divides a predetermined period of tcycle seconds, wherein for each active data stream at least Rmax*tcycle data elements can be read from the storage medium, into n successive time intervals, each of t¿interval? seconds. For each data stream a corresponding buffer (125) is reserved for storing at least Rmax*(n+1)*t¿interval? data elements. The data is read from the storage medium (110) by repeatedly sweeping the storage medium (110) for a group of data streams. Immediately before causing the reader (180) to perform a next sweep, the scheduler (170) determines the composition of the next group of data streams to be supplied with data. At least data streams whose corresponding buffer (125) comprise less than Rmax*2*t¿interval? data elements are assigned to this group.
摘要:
In a video server hard disk storage unit, video layout ensures average case bandwidth and case seek time during bounded-time information transfers, to maximize access of users S. The storage unit includes D hard disks whose platters are divided into Z zones. Each movie is divided into i blocks and is striped across all D disks such that movie block i is stored on disk (i mod D). In one embodiment, movie block i is placed in zone (i/D) mod Z of disk (i mod D). User streams are organized into slots containing N=S/D streams and the number of streams in each slot accessing a zone is ≤ (N/Z). Seeking is to the nearest end of a set of accesses, where total seek time for a set of N accesses is ≤ N*seek (1.5/N). Preferably two storage buffers/stream are used. Admission policy permits stream assignment to any slot, but streams do not transfer until the needed data block is on the disk needed by the other streams in the slot, and until the block is in the proper disk zone. A second embodiment optimizes disk seeks by placing movie block i in zone (((i/D) + (i mod D)) mod Z) of disk (i mod D) to reduce buffer unit requirements. The S streams progress in order 0 to S-1 through disks 0 to D-1, all streams accessing each disk from the same zone before moving through the disk in another zone.
摘要:
A stream scheduling system capable of lowering a probability for a response time of a real time stream server to exceed a specified time limit. A reference for transfer timing (reference time-slot) which can guarantee a continuity of a stream for the requested real time stream data is determined, and a transfer timing is determined in a prescribed relation to the reference time-slot while a reading timing is set movably within a prescribed tolerable range defined with respect to the reference time-slot. When a request for a transfer of a new real time stream data is received, a time-slot for a reading of another real time stream data is re-allocated within a prescribed tolerable range defined with respect to the reference time-slot for that another real time stream data so as to create a vacant time-slot, and a reading of that new real time stream data is allocated to the vacant time-slot created by re-allocation.