• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
【24h】

Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines

机译：为具有优先级和截止日期的超额订阅网络中的数据请求调度启发式算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Providing up-to-date information to users is an important data management problem for a heterogeneous networking environment, where each data storage location and intermediate machine may have specific data available, storage limitations, and communication links available. Sites in the network request data items and each request has an associated deadline and priority. This work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. Three multiple-source shortest-path algorithm based heuristics for finding a near-optimal schedule of the communication steps for staging the data are presented. Each heuristic can be used with each of four cost criteria developed. Thus, twelve implementations are examined. The performance of the proposed heuristics are evaluated and compared by simulations. Many of the proposed heuristics perform very well with respect to a loose upper bound metric.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号