← Back to Patent Explorer
US5721950A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for scheduling I/O transactions for video data storage unit to maintain continuity of number of video streams which is limited by number of I/O transactions

Assignee: Starlight Networks Inc
•
Filing: 1996-09-10
•
Granted: 1998-02-24
•
Expires: 2016-09-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for operating a disk storage system, comprising a disk and forming part of a communications network, simultaneously maintains the continuity of a plurality of data streams. Typically, each stream transfers video data to or from the disk storage system. Illustratively, each of the data streams is produced in the network at a rate of W base bits/sec and consumed by the disk storage system or produced by said disk storage system and consumed in the network at a rate of W base bits/sec. One I/O transaction is performed for each stream in each of a plurality of I/O cycles of duration S/W base , wherein in each I/O transaction a segment of S bits is retrieved from or stored in the disk. The number of streams whose continuity can be maintained in this manner is limited by the number of I/O's which can be performed in a cycle of duration S/W base . More generally, when a stream has a bit rate (A/B)W base bits/sec where A and B are integers chosen independently for each stream, then for this stream A I/O transactions are performed in B cycles of duration S/W base . If the number of disks is N d ,N d ≧1, then the I/O cycles have a duration N d S/W base and then A I/O transactions are performed in each disk for each stream in B I/O cycles.

Inventors

  • 👤 Fouad A. Tobagi
  • 👤 Joseph M. Gang, Jr.
  • 👤 Randall B. Baird
  • 👤 Joseph W. M. Pang
  • 👤 Martin J. McFadden

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 19:38
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/20; H04N21/21; G; G06; G06F; G06F16/00; G06F16/10; G06F3/00; G06F3/06; G06F3/0601; G06F3/0602; G06F3/061; G06F3/0628; G06F3/0655; G06F3/0659; G06F3/0668; G06F3/067; G11; G11B; G11B27/00; G11B27/10; G11B27/102; G11B27/105; H04N21/23; H04N7/00; H04N7/16; H04N7/173; H04N7/17309; H04N7/17336; H04N7/24; G11B2220/00; G11B2220/20

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 225 words
A method for scheduling I/O transactions for a data storage unit which stores data for a plurality of full motion video streams, comprising the steps of: maintaining simultaneously the continuity of all of said full motion video streams by performing one I/O transaction in said storage unit for each stream in each of a plurality of successive I/O cycles of a predetermined duration T play , wherein the number of streams whose continuity can be simultaneously maintained is limited by the number of I/O transactions which can be performed in said storage system in the period of duration T play , in each of said I/O transactions a segment of S bits is retrieved from said storage unit or written into said storage unit, each of said streams having a bit rate of W base bits/sec, said duration of each I/O cycle being T play =S/W base , the duration of each I/O transaction being shorter than T play , each of said segments retrieved from said storage unit in an I/O transaction being consumed in a consumption cycle of a stream of duration S/W base which begins after the I/O transaction, each of said segments written into said storage unit in an I/O transaction being produced in a production cycle of a stream of duration S/W base which ends prior to the I/O transaction.
Claim 2
Independent Claim 225 words
A method for scheduling I/O transactions for a data storage unit which stores data for a plurality of full motion video streams, comprising the steps of: maintaining simultaneously the continuity of all of said full motion video streams by performing one I/O transaction in said storage unit for each stream in each of a plurality of successive I/O cycles of a predetermined duration T play , wherein the number of streams whose continuity can be simultaneously maintained is limited by the number of I/O transactions which can be performed in said storage system in the period of duration T play , in each of said I/O transactions a segment of S bits is retrieved from said storage unit or written into said storage unit, each of said streams having a bit rate of W base bits/sec, said duration of each I/O cycle being T play =S/W base , the duration of each I/O transaction being shorter than T play , each of said segments retrieved from said storage unit in an I/O transaction being consumed in a consumption cycle of a stream of duration S/W base which begins after the I/O transaction, each of said segments written into said storage unit in an I/O transaction being produced in a production cycle of a stream of duration S/W base which ends prior to the I/O transaction.
Claim 3
Dependent Claim 27 words
The method of claim 1 wherein said storage system is located in a network and each of said streams is either produced or consumed in said network.
Claim 4
Dependent Claim 22 words
The method of claim 1 wherein said I/O transactions for each stream are performed in a predetermined order in each I/O cycle.
Claim 5
Dependent Claim 33 words
The method of claim 1 wherein the order in which said I/O transactions are performed for each of said streams in each of said I/O cycles is determined individually for each I/O cycle.
Claim 6
Dependent Claim 82 words
The method of claim 4 wherein production and consumption cycles of said streams are aligned with said I/O cycles and further comprising the steps of: during the i th cycle of duration T play , storing in said storage system segments of S bits belonging to particular streams and produced by said network in the (i-1) th cycle and retrieving from said storage system segments of S bits belonging to particular streams and consumed by said network in the (i+1) th cycle.
Claim 7
Dependent Claim 29 words
The method of claim 1 wherein said storage system comprises a disk, said disk is organized into bins of size S bits and segments are allocated to bins randomly.
Claim 8
Dependent Claim 41 words
The method of claim 1 wherein said storage system comprises a disk and wherein segments belonging to often-accessed files are located in outer zones in said disk and segments belonging to rarely-accessed files are located in inner zones of said disk.
Claim 9
Dependent Claim 30 words
The method of claim 1 wherein said storage system comprises a disk and wherein segments are stored in the outer zones of said disk when said disk is not full.
Claim 10
Dependent Claim 25 words
The method of claim 1 wherein said storage system comprise a disk and wherein segments belonging to particular files are stored contiguously on said disk.
Claim 11
Dependent Claim 13 words
The method of claim 2 wherein said network is a local area network.
Claim 12
Dependent Claim 11 words
The method of claim 1 wherein said streams contain video data.
Claim 13
Dependent Claim 11 words
The method of claim 1 wherein said streams include audio data.
Claim 14
Dependent Claim 68 words
The method of claim 1 wherein said streams have a bit rate of (A/B) W base bits/see, where A and B are integers chosen separately for each stream, wherein said storage system comprises N d ,N d ≧1, storage units, each I/O cycle has a duration of N d T play and for each stream, A I/O transactions take place for each storage unit in B I/O cycles.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-02-23 2001-08-25 2002-02-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-02-23 2005-08-25 2006-02-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-02-23 2009-08-25 2010-02-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag