ITR: Algorithms for Active Storage

ITR：主动存储算法

• 批准号: 0082986
• 负责人: Jeffrey Vitter
• 金额: $ 25.2万
• 依托单位: Duke University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2000
• 资助国家: 美国
• 起止时间: 2000-09-01 至 2003-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0082986&HistoricalAwards=false
• 关键词: ITR; Algorithms; Active; Storage

This project explores techniques for efficient computation on large, disk-based data sets. The research focuses on theoretical and practical aspects of ``active'' storage systems, in which each storage unit (a disk or group of disks) has some limited capability for local computation. A key goal of the project is to develop a theoretical model for active storage systems. The model is a basis for designing and evaluating algorithms for active storage systems, identifying useful computation kernels for active storage units, and deriving lower bounds for fundamental problems. The applied aspects of the project include design and implementation of a programming environment (PEARL) for active storage algorithms, and experimental evaluation of new algorithms for active storage. This project is a collaboration with a separately funded project team at Carleton University in Ottawa, Canada.

该项目探索对基于磁盘的大型数据集进行高效计算的技术。 该研究重点关注“主动”存储系统的理论和实践方面，其中每个存储单元（一个磁盘或一组磁盘）的本地计算能力有限。 该项目的一个关键目标是开发主动存储系统的理论模型。 该模型是设计和评估主动存储系统算法、识别主动存储单元有用的计算内核以及推导基本问题下界的基础。 该项目的应用方面包括主动存储算法编程环境（PEARL）的设计和实现，以及主动存储新算法的实验评估。 该项目是与加拿大渥太华卡尔顿大学的一个单独资助的项目团队合作的。