 |
|
|
|
|
|
 Title: |
US5799174:
Staggered striping in multimedia information systems
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Muntz, Richard; Pacific Palisades, CA
Berson, Steven; Los Angeles, CA
Ghandeharizadeh, Shahram; Los Angeles, CA
|
| Assignee: |
The Regents of the University of California, Oakland, CA
other patents from UNIVERSITY OF CALIFORNIA, THE REGENTS OF (599425) (approx. 4,840)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
1998-08-25
/ 1994-12-08
|
| Application Number: |
US1994000351608
|
| IPC Code: |
Advanced:
H04N 5/00;
Core:
more...
IPC-7:
G06T 1/60;
|
| ECLA Code: |
H04N5/00N;
|
| U.S. Class: |
Current:
345/540;
345/501;
345/537;
348/E05.008;
Original:
395/508;
395/501;
|
| Field of Search: |
395/776,777,501,506,507,508,806,807
|
| Priority Number: |
| 1994-12-08 |
US1994000351608 |
|
| Abstract: |
A multimedia object is declustered across a multiple of disk drives to employ the aggregate bandwidth of the several disk drives so that continuous retrieval or display of the object is achieved. The clusters are logically defined across a plurality of disk drives instead of being physically defined so that two consecutive subobjects comprising the data object may be on the same disks. The subobjects are assigned to the disks so that the first fragment of one subobject is k disks apart from the drive that contains the first fragment of the preceding subobject, where k is a fixed stride.
|
| Attorney, Agent or Firm: |
Dawes, Daniel L. ;
|
| Primary / Asst. Examiners: |
Bayerl, Raymond J.; Nguyen, Cao H.
|
| Maintenance Status: |
CC Certificate of Correction issued
|
| INPADOC Legal Status: |
Show legal status actions
|
| Family: |
None
|
First Claim:
Show all 22 claims |
We claim:
1. A method for managing a plurality of objects of multimedia information, each having an original bandwidth which varies from object to object, comprising the steps of:
- providing a plurality of memories, having a total number of memories, D and a bandwidth m;
- for each object logically dividing said plurality of memories into a subplurality of clusters of said memories, with number of memories per cluster being defined by modulo bandwidth of the object divided by bandwidth m and with a degree of declustering, M, for the object being equal to the number of memories in each cluster;
- dividing each object into a plurality of subobjects and storing the subobjects, one subobject per cluster;
- dividing each subobject into a plurality of fragments, said fragments being stored in said memories, one fragment per each memory of the subobject's cluster with the fragments disposed so that a first fragment of a subobject is a number, k, of memories, defined as stride, apart from a memory in which a first fragment of the preceding subobject is stored, with stride for all objects being identical; and
- accessing all memories of one cluster concurrently to retreive the stored subobject, whereby objects of differing bandwidths can be efficiently mixed and continuous random retrieval of each object is realized at a bandwidth equal to the original bandwidth of that object to support display thereof.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 10 U.S. patent(s) that reference this one
|
