QoS-oriented negotiation in disk subsystems

Quality of service (QoS) has emerged as a new term in relation to adding innovation criteria in large scale applications such as network based services, multimedia applications, storage services, etc. QoS has been proposed in storage management towards effective disk space utilization and request servicing. This paper presents a QoS based storage model for effective client negotiation in terms of performance, cost and reliability. Clients can create their own profile with respect to certain QoS attributes in order to specify their profile and requirements. A QoS negotiation model is proposed based on an available disk simulator which is experimented under artificial request workload towards proposing improved system's responsiveness, performance and functionality. Certain remarks and conclusions are raised with respect to meeting the clients's QoS requirements under the negotiated scheduling algorithms, the redundancy scheme and the capacity available to the client's environment according to the client's QoS requirements.

[1]  Toby J. Teorey,et al.  A comparative analysis of disk scheduling policies , 1972, CACM.

[2]  Yannis Manolopoulos,et al.  An Exact Analysis on Expected Seeks in Shadowed Disks , 1997, Inf. Process. Lett..

[3]  Ralf Steinmetz,et al.  Multimedia File Systems Survey: Approaches for Continuous Media Disk Scheduling , 1995, Comput. Commun..

[4]  Margo I. Seltzer,et al.  Disk Scheduling Revisited , 1990 .

[5]  Nicholas Carriero,et al.  Adaptive Parallelism and Piranha , 1995, Computer.

[6]  Elizabeth Shriver.  Performance modeling for realistic storage devices , 1997 .

[7]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[8]  Peter Hofmann,et al.  Quality of service (QoS) in distributed hypermedia-systems , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[9]  Robert Geist,et al.  A continuum of disk scheduling algorithms , 1987, TOCS.

[10]  Bruno Ciciani,et al.  Performance vs. cost of redundant arrays of inexpensive disks , 1999, Simul. Pract. Theory.

[11]  Fouad A. Tobagi,et al.  Streaming RAID: a disk array management system for video files , 1993, MULTIMEDIA '93.

[12]  Yale N. Patt,et al.  Scheduling algorithms for modern disk drives , 1994, SIGMETRICS 1994.

[13]  Yale N. Patt,et al.  Disk arrays: high-performance, high-reliability storage subsystems , 1994, Computer.

[14]  Gregor von Bochmann,et al.  Distributed Multimedia and QOS: A Survey , 1995, IEEE Multim..

[15]  Donald F. Towsley,et al.  A Performance Evaluation of RAID Architectures , 1996, IEEE Trans. Computers.

[16]  Jose Renato Santos,et al.  Performance analysis of the RIO multimedia storage system with heterogeneous disk configurations , 1998, MULTIMEDIA '98.

[17]  P. Venkat Rangan,et al.  Multimedia Storage Servers: A Tutorial , 1995, Computer.

[18]  Randy H. Katz,et al.  Performance consequences of parity placement in disk arrays , 1991, ASPLOS IV.

[19]  Spencer W. Ng,et al.  Advances in Disk Technology: Performance Issues , 1998, Computer.

[20]  Jan H. M. Korst.  Random duplicated assignment: an alternative to striping in video servers , 1997, MULTIMEDIA '97.

[21]  John Wilkes,et al.  Disk scheduling algorithms based on rotational position , 1991 .

[22]  Elizabeth Shriver,et al.  Attribute-managed storage , 1995 .

[23]  Arif Merchant,et al.  Using attribute-managed storage to achieve QoS , 1997 .

[24]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[25]  Eric J. Schwabe,et al.  Flexible usage of parity storage space in disk arrays , 1996, SPAA '96.

[26]  Toby J. Teorey,et al.  A comparative analysis of disk scheduling policies , 1972, CACM.

[27]  Garth A. Gibson,et al.  RAID: high-performance, reliable secondary storage , 1994, CSUR.

[28]  Gerhard Weikum,et al.  Disk scheduling for mixed-media workloads in a multimedia server , 1998, MULTIMEDIA '98.