ITR/SY: Algorithms for Data Storage and Movement

ITR/SY：数据存储和移动算法

• 批准号: 0113192
• 负责人: Samir Khuller
• 金额: $ 36万
• 依托单位: University of Maryland, College Park
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2001
• 资助国家: 美国
• 起止时间: 2001-08-01 至 2005-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0113192&HistoricalAwards=false
• 关键词: ITR; SY; Algorithms; Data; Storage

The central focus of this proposal is the development of efficient algorithms for the storage and movement of data. Specifically, we are interested in algorithms that impact the performance of large multimedia data storage systems. In algorithmic terms, some of the principal challenges that arise in the context of multimedia data storage are: (a) deciding how many copies of each data item need to be stored, (b) determining the exact layout of data on a set of servers, (c) dealing with changing workloads and dynamic data access patterns. These related challenges require the development of efficient algorithms for optimizing data layout to maximize client satisfaction, monitoring the performance of data storage systems and scheduling the movement of large amounts of data.Futhermore, what makes the issues that we consider even more significant is the fact that data storage and movement issues also arise within publicly share networks such as the Internet where the bandwidth can be dynamic and highly variable, and can result in a poor choice of paths chosen to transfer data in the network. One way to address this issue is to route data through specific holding points. By doing this we are able to increase throughput and decrease completion times by an order of magnitude to transfer data from several sources to a single destination. Algorithms related to this problem have been developed by us and are being tested with the Bistro framework, which is a framework for providing a data upload service such as one required by IRS for tax submission purposes. Our data movement algorithms are being used to schedule the transfer of data from many different locations to a final destination server.While some specific instances of the individual problems have been considered earlier, there is no work dealing comprehensively with the range of issues that we focus on.

该提案的中心重点是开发用于数据存储和移动的有效算法。 具体来说，我们感兴趣的算法，影响大型多媒体数据存储系统的性能。 在算法方面，在多媒体数据存储的背景下出现的一些主要挑战是：（a）决定每个数据项需要存储多少个副本，（B）确定一组服务器上的数据的确切布局，（c）处理不断变化的工作负载和动态数据访问模式。 这些相关的挑战需要开发有效的算法来优化数据布局以最大限度地提高客户满意度，监控数据存储系统的性能并调度大量数据的移动。使我们认为更重要的问题是，数据存储和移动问题也出现在公共共享网络（如Internet）中，其中带宽可以是动态的，高度可变，并且可能导致在网络中选择用于传输数据的路径的选择不佳。 解决这个问题的一种方法是通过特定的等待点发送数据。 通过这样做，我们能够增加吞吐量并将完成时间减少一个数量级，将数据从多个源传输到单个目的地。 我们已经开发了与此问题相关的算法，并正在使用Bistro框架进行测试，Bistro框架是一个用于提供数据上传服务的框架，例如IRS为税务提交目的而要求的数据上传服务。 我们的数据移动算法被用来调度数据从许多不同的位置传输到一个最终的目的地server.While个别问题的一些特定的情况下已经考虑了较早，有没有工作全面处理的问题，我们专注于范围。