Filters








23,215 Hits in 4.5 sec

A comparative analysis of disk scheduling policies

Toby J. Teorey, Tad B. Pinkerton
1971 Proceedings of the third symposium on Operating systems principles - SOSP '71  
Five well-known scheduling policies for movable head disks are compared using the performance criteria of expected seek time (system oriented) and expected waiting time (individual I/O request oriented  ...  Such a function allows one to differentiate among the scheduling policies over a wide range of input loading conditions.  ...  Five well-known scheduling policies for movable head disks are compared using the performance criteria of expected seek time (system oriented) and expected waiting time (individual I/O request oriented  ... 
doi:10.1145/800212.806509 dblp:conf/sosp/TeoreyP71 fatcat:62lg56yalbf3zdjs4ozjgh3h5i

Design and implementation of the parallel multimedia file system based on message distribution

Seung-Ho Park, Si-Yong Park, Gwang Moon Kim, Ki Dong Chung
2000 Proceedings of the eighth ACM international conference on Multimedia - MULTIMEDIA '00  
In addition, the file system must support the effective data placement and disk scheduling policies and should be designed to sustain portability and flexibility in any hardware or software environment  ...  With this kind of the server architecture, it is easy to sustain disk load balancing and scalable disk bandwidth.  ...  [Figure 2 ][Figure 3 ] 23 Structure of pmfs_read()An IOD consists of a Request reader, a Job scheduler and a Transmission scheduler.  ... 
doi:10.1145/354384.376325 fatcat:giadgvuzozcalbe4d5jdf44ori

Disk scheduling policies with lookahead

Alexander Thomasian, Chang Liu
2002 Performance Evaluation Review  
A variation to SATF considers the sum of service times of several successive requests in scheduling the next request, so that the arm is moved to a (temporal) neighborhood with many requests.  ...  For example the access time to random disk blocks has decreased by a mere factor of two, while disk capacities have increased by several orders of magnitude.  ...  Teunis Ott at the CS Dept. of NJIT.  ... 
doi:10.1145/588160.588165 fatcat:lfyiyctyorhk3gecjidofccozi

Storage system support for continuous-media applications. 1. Requirements and single-disk issues

P. Halvorsen, C. Griwodz, V. Goebel, K. Lund, T. Plagemann, J. Walpole
2004 IEEE Distributed Systems Online  
A multimedia storage system plays a vital role for the performance and scalability of multimedia servers.  ...  Internet use and the amount of data that users download and stream from Internet servers are rapidly increasing.  ...  We now address these developments in some key areas of multimedia storage system research. DISK SCHEDULING A disk is an exclusive, nonpreemptable device: it serves one request at a time.  ... 
doi:10.1109/mdso.2004.1270711 fatcat:44xjlhb5ofahpfseb3hxoxctqe

Page 154 of Journal of Research and Practice in Information Technology Vol. 14, Issue 4 [page]

1982 Journal of Research and Practice in Information Technology  
TEORY, T.J. and PINKERTON, T.B. (1972): A Comparative Analysis of Disk Scheduling Policies, Commun. ACM, 15, No. 3, pp. 177-184.  ...  Disk Scheduling Policies In any event, regardless of the potential utility of the more complex service policies, the possibility of improving disk layout should be considered.  ... 

Self-Learning Disk Scheduling

Yu Zhang, B. Bhargava
2009 IEEE Transactions on Knowledge and Data Engineering  
Experiments with real-world and synthetic workloads show that self-learning disk scheduling can adapt to a wide variety of workloads, file systems, disk systems, and user preferences.  ...  The performance of disk I/O schedulers is affected by many factors such as workloads, file systems, and disk systems.  ...  One may overlook changes of workloads, fail to start a new comparative analysis of all disk schedulers, and end up with a suboptimal choice. Algorithm pseudocode and complexity.  ... 
doi:10.1109/tkde.2008.116 fatcat:kvii5e7atndlbfy2rowm63xhce

Competitive prefetching for concurrent sequential I/O

Chuanpeng Li, Kai Shen, Athanasios E. Papathanasiou
2007 Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 - EuroSys '07  
We have implemented the proposed competitive prefetching policy in Linux 2.6.10 and evaluated its performance on both standalone disks and a disk array using a variety of workloads (including two common  ...  The proposed strategy does not require a-priori information on the data access pattern, and achieves at least half the performance (in terms of I/O throughput) of the optimal offline policy.  ...  Acknowledgments This work benefited from discussions with our colleagues at the University of Rochester (particularly Chen Ding, Michael Huang, and Michael L. Scott).  ... 
doi:10.1145/1272996.1273017 dblp:conf/eurosys/LiSP07 fatcat:r5w3wxu24nbazhat4zrvikravy

Competitive prefetching for concurrent sequential I/O

Chuanpeng Li, Kai Shen, Athanasios E. Papathanasiou
2007 ACM SIGOPS Operating Systems Review  
We have implemented the proposed competitive prefetching policy in Linux 2.6.10 and evaluated its performance on both standalone disks and a disk array using a variety of workloads (including two common  ...  The proposed strategy does not require a-priori information on the data access pattern, and achieves at least half the performance (in terms of I/O throughput) of the optimal offline policy.  ...  Acknowledgments This work benefited from discussions with our colleagues at the University of Rochester (particularly Chen Ding, Michael Huang, and Michael L. Scott).  ... 
doi:10.1145/1272998.1273017 fatcat:uwqfpv3qhncermhyr7lxmc33wq

Quantifying the Brown Side of Priority Schedulers

Derya Çavdar, Andrea Rosà, Lydia Y. Chen, Walter Binder, Fatih Alagöz
2014 Performance Evaluation Review  
Taking an opposite perspective from most of the related work, this paper reveals the "brown" side of scheduling, i.e., wasted core seconds (so called brown resources), using field analysis and trace-driven  ...  simulation of a Google cluster trace.  ...  CONCLUSION In this paper, we provide a quantitative analysis of the resource waste due to the scheduling policy, in particular the priority scheduling.  ... 
doi:10.1145/2695533.2695560 fatcat:qjp5b2anibgznctwx5tmvep4sy

Efficient memory management in video on demand servers

A. Garcı́a-Martı́nez, J. Fernández-Conde, Á. Viña
2000 Computer Communications  
MRPSD allows large memory savings compared to traditional memory management techniques, based on the allocation of a certain amount of memory per client served, without a significant performance penalty  ...  Our proposal, Memory Reservation Per Storage Device (MRPSD), relies on the allocation of a fixed, small number of memory buffers per storage device.  ...  Acknowledgements This research was supported in part by the National R&D Program of Spain, Project Number TIC97-0438.  ... 
doi:10.1016/s0140-3664(99)00179-6 fatcat:rsinqgt2irgtvlzef4fwej274u

Min-max exclusive virtual machine placement in cloud computing for scientific data environment

Moon-Hyun Kim, Jun-Yeong Lee, Syed Asif Raza Shah, Tae-Hyung Kim, Seo-Young Noh
2021 Journal of Cloud Computing: Advances, Systems and Applications  
In this experiment, a lightweight version of the CloudSim simulator was developed and the results were compared to the other methods of different policies.  ...  Here, most of the jobs are data-intensive and a large amount of disk operations is required.  ...  Acknowledgements The authors would like to extend our sincere thanks to Global Science experimental Data hub Center at Korea Institute of Science Technology Information for their supporting our research  ... 
doi:10.1186/s13677-020-00221-7 fatcat:mcthqkwbkbc2lkala3fxq7eria

Storage Management in Virtualized Cloud Environment

Sankaran Sivathanu, Ling Liu, Mei Yiduo, Xing Pu
2010 2010 IEEE 3rd International Conference on Cloud Computing  
In this paper we present the measurement results of detailed experiments conducted on a virtualized setup focusing on the storage I/O performance.  ...  Therefore, identifying the performance bottlenecks in a virtualized setup and understanding the implications of workload combinations and resource configurations on the overall I/O performance helps both  ...  ACKNOWLEDGEMENTS We acknowledge the partial support by grants from NSF CISE NetSE program, NSF CISE CyberTrust program, IBM faculty award, IBM SUR grant, and a grant from Intel Research Council.  ... 
doi:10.1109/cloud.2010.27 dblp:conf/IEEEcloud/SivathanuLYP10 fatcat:bqlqymc65bdhxnrfko7rtg65a4

EERAID

Dong Li, Jun Wang
2004 Proceedings of the 11th workshop on ACM SIGOPS European workshop: beyond the PC - EW11  
To give a proof-of-concept solution, we develop new energy-efficient, redundancyaware I/O scheduling and controller-level cache management schemes for EERAID 1 and EERAID 5 respectively.  ...  Recent studies show that disk-based storage subsystems account for a non-trivial portion of energy consumption in both low-end and high-end servers.  ...  A new redundancy-aware I/O read scheduling policy needs to be developed. One of the typical disk accesses in RAID 5 is a write update.  ... 
doi:10.1145/1133572.1133577 dblp:conf/sigopsE/LiW04 fatcat:lubqdqipxrg3nldla7hqyigr3a

Enhancing data availability in disk drives through background activities

Ningfang Mi, Alma Riska, Evgenia Smirni, Erik Riedel
2008 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)  
By scheduling concurrently both scrubbing and intra-disk parity updates during idle times in disk drives, MTTDL improves by as much as 8 orders of magnitude.  ...  Latent sector errors in disk drives affect only a few data sectors. They occur silently and are detected only when the affected area is accessed again.  ...  Although the tail-based policies utilize only few long intervals, the total amount of background work scheduled during those long intervals is yet more when compared to the background work scheduled under  ... 
doi:10.1109/dsn.2008.4630120 dblp:conf/dsn/MiRSR08 fatcat:6zutgjb6vvbqbdqpoyi7rn4nua

BubbleUp

Edward Chang, Hector Garcia-Molina
1997 Proceedings of the fifth ACM international conference on Multimedia - MULTIMEDIA '97  
The throughput of the scheme is comparable to that of traditional schemes, and it may even provide better throughput than mechanisms based on elevator disk scheduling.  ...  BubbleUp incurs a slight disk storage overhead, but we argue that through effective allocation, this cost can be minimized.  ...  We also compare it with a representative disk scheduling policy, Sweep, which minimizes disk seek overhead.  ... 
doi:10.1145/266180.266339 dblp:conf/mm/ChangG97 fatcat:luyjoxp645hmbmrn5cfldodck4
« Previous Showing results 1 — 15 out of 23,215 results