Optimal online buffer scheduling for block devices
Optimal online buffer scheduling for block devices
复制标题
块设备的最佳在线缓冲区调度
DOI:
10.1145/2213977.2214031
复制
发表时间:
2012
期刊:
影响因子:
--
通讯作者:
Adamaszek A
中科院分区:
文献类型:
--
作者:
Adamaszek A
We introduce a buffer scheduling problem for block operation devices in an online setting. We consider a stream of items of different types to be processed by a block device. The block device can process all items of the same type in a single step. To improve the performance of the system a buffer of sizekis used to store items in order to reduce the number of operations required. Whenever the buffer becomes full a buffer scheduling strategy has to select one type and then a block operation on all elements with this type that are currently in the buffer is performed. The goal is to design a scheduling strategy that minimizes the number of block operations required. In this paper we consider the online version of this problem, where the buffer scheduling strategy must make decisions without knowing the future items that appear in the input stream. Our main result is the design of an O(log log k)-competitive online randomized buffer scheduling strategy. The bound is asymptotically tight. As a byproduct of our LP-based techniques, we obtain a randomized offline algorithm that approximates the optimal number of block operations to within a constant factor.
DOI:
10.1016/j.jda.2008.08.002
发表时间:
2010
期刊:
J. Discrete Algorithms
影响因子:
--
作者:
R. Khandekar;Vinayaka Pandit
通讯作者:
Vinayaka Pandit
DOI:
10.1145/1993636.1993717
发表时间:
2011
期刊:
--
影响因子:
--
作者:
Adamaszek A
通讯作者:
Adamaszek A
DOI:
10.1137/1.9781611973105.70
发表时间:
2012
期刊:
J. Discrete Algorithms
影响因子:
--
作者:
Noa Avigdor;Y. Rabani
通讯作者:
Y. Rabani