Name
Abstract | ||
|---|---|---|
The improvements in disk speeds have not kept up with improvements in processor and memory speeds. Many techniques have been proposed and utilized to maximize the bandwidths of storage devices. These techniques have proven useful for conventional data, but when applied to multimedia data, they tend to be insufficient or inefficient due to the diversified data types, bandwidth requirements, file sizes and structures of complex objects of multimedia data. In this paper, we discuss the design of an efficient multimedia object allocation strategy that strives to achieve the expected retrieval rates and I/O computational requirements of objects; and also effectively balances the loads on the storage devices. We define a multimedia object model, describe the multimedia object and storage device characteristics, the classification of the multimedia objects according to their I/O requirements, and the fragmentation strategies. We use a bipartite graph model for mapping of fragments to storage devices. A cost function based on a disk utilization per allocated space, the amount of free space, and the bandwidth of a storage device is used to determine the optimal allocation for an object's data. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF00962242 | J. Intell. Inf. Syst. |
Keywords | Field | DocType |
bipartite matching,efficient allocation,fragmentation,multimedia object modeling,storage allocation | Multimedia object,Computer science,Bipartite graph,Fragmentation (computing),Free space,Data type,Bandwidth (signal processing),Distributed computing | Journal |
Volume | Issue | Citations |
3 | 3-4 | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kingsley Nwosu | 1 | 42 | 7.72 |
| C. Y. Roger Chen | 2 | 0 | 0.34 |
| P. Bruce Berra | 3 | 323 | 196.93 |