Placement of Records on a Secondary Storage Device to Minimize Access Time
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Resource Scheduling In A High-Performance Multimedia Server
IEEE Transactions on Knowledge and Data Engineering
Distributed System Resource Management Infrastructure for Information Quality Assurance
COMPSAC '00 24th International Computer Software and Applications Conference
A Data Placement Strategy on MZR for VOD Servers
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Flexible storage placement of digital video media
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
A Detailed Simulation Model of the HP 97560 Disk Drive
A Detailed Simulation Model of the HP 97560 Disk Drive
Track-Pairing: a Novel Data Layout for VOD Servers with Multi-Zone-Recording Disks
ICMCS '95 Proceedings of the International Conference on Multimedia Computing and Systems
Data Placement for Continuous Media in Multimedia DBMS
IW-MMDBMS '95 Proceedings of the International Workshop on Multi-Media Database Management Systems
IEEE Transactions on Consumer Electronics
An efficient storage server in near video-on-demand systems
IEEE Transactions on Consumer Electronics
IEEE Transactions on Consumer Electronics
Hi-index | 0.00 |
The storage management of an interactive multimedia information system (MMIS) is different from that of the conventional file system. In an MMIS, there could be relationships between the homepages stored on a disk. During browsing homepages, how to reduce the disk seek time and then to provide a fast browsing become a critic performance issue. In the paper, we propose two data placement algorithms for continuous and non-continuous spaces to place objects on a disk in order to reduce their access time. In the simulation, we conduct several experiments to validate the superiority of our algorithms over other algorithms. Besides we also show that the results derived by our algorithms are near optimal by comparing with the optimal solution.