Disk striping

Salem, Kenneth; García-Molina, Héctor

doi:10.1109/icde.1986.7266238

Cited by 189 publications

(64 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The disk striping is the common technique to derive high throughput, such as in many types of RAID systems [3,10]. In the ordinary disk striping technique, the number of disks for a striping group is fixed and the placement manner of the fragments is static in a storage system.…”

Section: Disk Stripingmentioning

confidence: 99%

“…To implement a high throughput storage system, striping technique using multiple disk drives are commonly used [3,9,10]. However, the number of disks for striping groups is fixed and the placement manner of fragments is static in the ordinary disk striping methods used for RAID 0, 3-5. Because it is difficult for them to provide different throughput for each objects and to reconfigure the cluster online, they have less flexibility and extensibility.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Evaluation of Placement and Access Asignment for Replicated Object Striping

Kataigi

Kobayashi

Yoshihara

et al. 2006

22nd International Conference on Data Engineering Workshops (ICDEW'06)

View full text Add to dashboard Cite

show abstract

Section: Disk Stripingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Evaluation of Placement and Access Asignment for Replicated Object Striping

Kataigi

Kobayashi

Yoshihara

et al. 2006

22nd International Conference on Data Engineering Workshops (ICDEW'06)

View full text Add to dashboard Cite

show abstract

“…For example, parallelism has been proposed for disk arrays [15], tape arrays [16], [17], and even network transmissions [18]. In particular, the use of parallel disk systems have been studied extensively in VoD systems literatures [11], [12], [13], [14].…”

Section: Related Workmentioning

confidence: 99%

Performance analysis of a pull-based parallel video server

Lee

Wong

2000

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

AbstractÐIn conventional video-on-demand systems, video data are stored in a video server for delivery to multiple receivers over a communications network. The video server's hardware limits the maximum storage capacity as well as the maximum number of video sessions that can concurrently be delivered. Clearly, these limits will eventually be exceeded by the growing need for better video quality and larger user population. This paper studies a parallel video server architecture that exploits server parallelism to achieve incremental scalability. First, unlike data partition and replication, the architecture employs data striping at the server level to achieve fine-grain load balancing across multiple servers. Second, a client-pull service model is employed to eliminate the need for interserver synchronization. Third, an admission-scheduling algorithm is proposed to further control the instantaneous load at each server so that linear scalability can be achieved. This paper analyzes the performance of the architecture by deriving bounds for server service delay, client buffer requirement, prefetch delay, and scheduling delay. These performance metrics and design tradeoffs are further evaluated using numerical examples. Our results show that the proposed parallel video server architecture can be linearly scaled up to more concurrent users simply by adding more servers and redistributing the video data among the servers.

show abstract

“…In this technique, data of a le are interleaved across numerous disks and accessed synchronously in parallel 15,7,13]. These schemes rely on a single controller to manage all of the disks.…”

Section: Introductionmentioning

confidence: 99%