Figure 2 - uploaded by Jan-Ming Ho
Content may be subject to copyright.
Source publication
Modern magnetic disks support advanced mechanisms, such as read-ahead and caching, to optimize disk access performance. However, most of the proposed disk models in the literature of multimedia storage systems are too simplified to include the advanced feature that result in inaccurate performance prediction. In this paper, we propose an accurate,...
Contexts in source publication
Context 1
... Figure 2, the structure of disk is depicted. In a disk, there are several platters that both sides can be used for data storage and each side has its own read/write head. ...
Context 2
... the maximum throughput of disk equals to the disk rotating speed times track size and adjustment. For a disk with NP data platters, due to the existence of track skews, there needs NP+1 revolution in order to read all the NP tracks in a cylinder that can be observed from Figure 2. In addition, cylinder skew, which is generally longer than track skew, needs to be discounted from the equation. ...
Similar publications
Obtaining timely and accurate information about the low-level characteristics of disk drives presents a problem for system design and implementation alike. This paper presents a collection of three disk microbenchmarks which combine to empirically extract a relevant subset of disk geometry and performance parameters in an efficient and accurate man...
This article presents a Differentiated Storage Services architecture for file and storage systems. By classifying data at the block-level, a filesystem can request that different classes of data (e.g., file, directory, executable, text) be handled with different policies (e.g., low-latency versus highbandwidth), and it is left to the storage system...
We present a design style and synthesis algorithm that encompasses both asynchronous and synchronous state machines. Our proposed design style not only supports generalized "burst-mode" multiple-input change asynchronous designs [21], but also allows the automatic synthesis of any synchronous Moore machine using only basic gates (and no state-holdi...
![Figure 2 Six-membered ring of [SiO 4 ]-tetrahedra in the unmodulated...](profile/Volker-Kahlenberg/publication/292344975/figure/fig3/AS:667720563576854@1536208396862/Six-membered-ring-of-SiO-4-tetrahedra-in-the-unmodulated-3d-average-structure-in-a_Q320.jpg)
![Figure 4 Interatomic distances within the [SiO 4 ]-tetrahedron (a) and...](profile/Volker-Kahlenberg/publication/292344975/figure/fig5/AS:667720563576856@1536208396924/nteratomic-distances-within-the-SiO-4-tetrahedron-a-and-ScO-6-octahedron-b-as-a_Q320.jpg)
Single-crystal X-ray diffraction of Cs
3
ScSi
6
O
15
shows the presence of main reflections and satellite reflections up to the fourth order along the
c*
direction. The (3+1)-dimensional incommensurately modulated structure was solved in superspace group X{\bar 3}m1(00\gamma)0s0 [
a
= 13.861 (1),
c
= 6.992 (1) Å,
V
= 1163.4 (2) Å
3
] with a modulat...
Citations
Disk-zoning technique has been widely adopted to increase disks capacities. As a result of disparity of capacities of inner and outer zones, the data transfer rates of the outer zones of a zoned-disk are higher than the inner zones that post a great challenge for zoned-disk based multimedia playback. In this paper, we study the data placement problem of VBR (variable bit rate) videos on zoned-disks. Our objective is to minimize video server buffer size and simultaneously to maximize disk utilization subject to the zone constraints of disk. We introduce the CRT (constant read time) method that allocates each user a constant time period in every service round to retrieve a variable-sized disk block. The CRT method can be formulated as constrained combinatorial problems that its optimum solution can be obtained by employing dynamic programming. Two heuristics are also explored to reduce time and space complexities. According to experiment results, the heuristic algorithms obtain near optimum solutions with shorter computation time.
The success of multimedia information systems to adequately meet the needs of accessing and presenting audio/video information from a large multimedia server depends heavily on the proper use of storage and retrieval algorithms suitable for this task. Multimedia Storage and Retrieval describes various algorithms from simple to sophisticated: from single user to multiple users, from constant-bit-rate to variable-bit-rate streams, and from single disk to multiple disks. This book emphasizes storage and retrieval of video data using magnetic disk systems and its elementary, mathematical approach concentrates on the fundamental algorithms. • Provides those new to the subject with the basic principles of the design and analysis of video-on-demand systems and guides the reader towards a thorough understanding of the field. • Comprehensively covers disk scheduling algorithms, including round robin, double and triple buffering, grouped sweeping, and dual sweep. • Extensively treats storage strategies, including contiguous and segmented storage, track pairing, striping, and random redundant storage. • Concludes with further optimizations in the area of video transmission, covering bit-rate smoothing and near video-on-demand strategies.
Performance modeling of magnetic disks allows the prediction of the disk service time which is useful for on-line decision
support for soft real-time applications. In this paper, we propose a new performance model of disk access time to estimate
the bounded disk service time. Our proposed model focuses on modeling the head positioning time to fully utilize the disk
I/O bandwidth by exploiting the geometric layout of the disk. The experimental results show that our proposed model can estimate
the disk service time with less than 10% error on average.
