Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling

被引：11

作者：

Andreica, Mugurel Ionut ^{[1
]}

Tapus, Nicolae ^{[1
]}

机构：

[1] Univ Politehn Bucuresti, Dept Comp Sci, Bucharest, Romania

来源：

PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING | 2008年

关键词：

data transfer scheduling; block partitioning; segment tree; multidimensional data structures; algorithmic framework; range query; range update;

D O I：

10.1109/ISPDC.2008.36

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Distributed applications and services requiring the transfer of large amounts (if data have been developed and deployed till around the world. The best effort behavior of the Internet cannot offer to these applications the necessary Quality of Service (QoS) guarantees, making the development of data transfer scheduling techniques a necessity. In this paper we propose novel methods of efficiently using some wellknown data structures (e.g. the segment tree and the block partition), which can be implemented in a resource manager (e.g. Grid job scheduler, bandwidth broker) in order to serve quickly large numbers of advance resource reservation and allocation requests.

引用

页码：285 / 292

页数：8