&lt;title&gt;Disk scheduling for displaying and recording video in nonlinear news editing systems&lt;/title&gt;

Aref, Walid G.; Kamel, Ibrahim; Niranjan, T.; Ghandeharizadeh, Shahram

doi:10.1117/12.264296

Cited by 6 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result. developers must tune current high performance multimedia applications for specific storage devices (Aref 1997). Without device-specific information applications may use excessive amount of memory due to overly aggressive prefetching.…”

Section: Motivationmentioning

confidence: 99%

Predictable File Access Latency for Multimedia

Revel

Cowan

McNamee

et al. 1997

Building QoS Into Distributed Systems

View full text Add to dashboard Cite

Multimedia applications are sensitive to 110 latency and jitter when accessing data in secondary storage. Transparent adaptive prefetching (TAP) uses software feedback to provide multimedia applications with file system quality of service (QoS) guarantees. We are investigating how QoS requirements can be communicated and how they can be met by adaptive resource management. A preliminary test of adaptive prefetching is presented.

show abstract

Section: Motivationmentioning

confidence: 99%

Predictable File Access Latency for Multimedia

Revel

Cowan

McNamee

et al. 1997

Building QoS Into Distributed Systems

View full text Add to dashboard Cite

show abstract

“…Section 6 shows this algorithm provides significant response time enhancements when compared with EVEN. 4 Given two disks, p r q and p X s with negative imbalance of -0.5 and -2.0, respectively, p X s has the minimum negative load imbalance.…”

Section: Even: Constrained By Bandwidthmentioning

confidence: 99%

“…Moreover, it might perform writes against £ ( in the background depending on the amount of free buffer space. Once the free space falls below a certain threshold, the system might perform writes as foreground tasks that compete with active user requests [4].…”

Section: Migratementioning

confidence: 99%

An On-Line Reorganization Framework for SAN File Systems

Ghandeharizadeh

Gao

Gahagan

et al. 2006

Advances in Databases and Information Systems

Self Cite

View full text Add to dashboard Cite

While the cost per megabyte of magnetic disk storage is economical, organizations are alarmed by the increasing cost of managing storage. Storage Area Network (SAN) architectures strive to minimize this cost by consolidating storage devices. A SAN is a special-purpose network that interconnects different data storage devices with servers. While there are many definitions for a SAN, there is a general consensus that it provides access at the granularity of a block and is typically used for database applications.In this study, we focus on SAN switches that include an embedded storage management software in support of virtualization. We describe an On-line Re-organization Environment, ORE, that controls the placement of data to improve the average response time of the system. ORE is designed for a heterogeneous collection of storage devices. Its key novel feature is its use of "time" to quantify the benefit and cost of a migration. It migrates a fragment only when its net benefit exceeds a pre-specified threshold. We describe a taxonomy of techniques for fragment migration and employ a trace driven simulation study to quantify their tradeoff. Our performance results demonstrate a significant improvement in response time (order of magnitude) for those algorithms that employ ORE's cost/benefit feature. Moreover, a technique that employs bandwidth of all devices intelligently is superior to one that simply migrates data to the fastest devices.

show abstract

“…Work has also been done to write continuous media data to a server [1]. This work is orthogonal to our approach since we also need a similar technique to write blocks during the redistribution.…”

Section: Related Workmentioning

confidence: 97%

SCADDAR: an efficient randomized technique to reorganize continuous media blocks

Goel

Shahabi

Shengyue

et al.

Proceedings 18th International Conference on Data Engineering

View full text Add to dashboard Cite

Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when either capacity needs to be conserved or old disk drives are retired. Assuming random placement of blocks on multiple nodes of a continuous media server, our optimization objective is to redistribute a minimum number of media blocks after disk scaling. This objective should be met under two restrictions. First, uniform distribution and hence a balanced load should be ensured after redistribution. Second, the redistributed blocks should be retrieved at the normal mode of operation in one disk access and through low complexity computation. We propose a technique that meets the objective, while we prove that it also satisfies both restrictions. The SCADDAR approach is based on using a series of REMAP functions which can derive the location of a new block using only its original location as a basis.

show abstract

<title>Disk scheduling for displaying and recording video in nonlinear news editing systems</title>

Cited by 6 publications

References 9 publications

Predictable File Access Latency for Multimedia

Predictable File Access Latency for Multimedia

An On-Line Reorganization Framework for SAN File Systems

SCADDAR: an efficient randomized technique to reorganize continuous media blocks

Contact Info

Product

Resources

About