排序方式: 共有3条查询结果,搜索用时 62 毫秒
1
1.
Kallahalla M. Uysal M. Swaminathan R. Lowell D.E. Wray M. Christian T. Edwards N. Dalton C.I. Gittler F. 《Computer》2004,37(11):38-46
Utility computing aims to aggregate server, network, and storage systems into a single, centrally managed pool of resources. SoftUDC, a virtual machine monitor, lets applications and administrative domains share physical resources while maintaining full functional isolation. 相似文献
2.
Buffer management for a D-disk parallel I/O system is considered in the context of randomized placement of data on the disks. A simple prefetching and caching algorithm PHASE-LRU using bounded lookahead is described and analyzed. It is shown that PHASE-LRU performs an expected number of I/Os that is within a factor Θ(logD/loglogD) of the number performed by an optimal off-line algorithm. In contrast, any deterministic buffer management algorithm with the same amount of lookahead must do at least times the number of I/Os of the optimal. 相似文献
3.
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references
is presented. The algorithm uses knowledge of the next $L$ references, $L$-block lookahead, to create a minimal-length I/O
schedule. For a system with $D$ disks and a buffer of capacity $m$ blocks, we show that the competitive ratio of
L-OPT is $\Theta(\sqrt{mD/L})$ when $L \geq m$, which matches the lower bound of any prefetching algorithm with $L$-block
lookahead. Tight bounds for the remaining ranges of lookahead are also presented. In addition we show that L-OPT is the optimal
offline algorithm: when the lookahead consists of the entire reference string, it performs the absolute minimum possible number
of I/Os. Finally, we show that L-OPT is comparable with the best online algorithm with the same amount of lookahead; the
ratio of the length of its schedule to the length of the optimal schedule is always within a constant factor. 相似文献
1