A Policy Language for Distributed Resource Management

分布式资源管理的策略语言

• 批准号: 9972232
• 负责人: Marvin Solomon
• 金额: $ 14.95万
• 依托单位: University of Wisconsin-Madison
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1999
• 资助国家: 美国
• 起止时间: 1999-08-01 至 2002-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9972232&HistoricalAwards=false
• 关键词: Policy; Language; Distributed; Resource; Management

Marvin H. SolomonCCR-9972232The internet presents the potential for efficient and equitable allocation of distributed computing resources, such as high-speed computers and databases, to those best able to use them productively. Realization of this potential requires a rotation for describing producers and consumers of resources and a mechanism for allocating them subject to bilateral constraints: Consumers of resources may specify acceptability criteria for resources, and purveyors of resources may impose restrictions on consumers. The Classified Advertisement language provides a precise and powerful notation for defining these constraints and the Matchmaking algorithm provides a mechanism for enforcing them. This research improves the efficiency of Matchmaking by discovering and exploiting homogeneous properties of sets of Classified Advertisements. It also extends the Matchmaking paradigm to "co-matching" to support situations in which a successful allocation required assembling a complete and consistent set of resources, each of which may impose restrictions on others in the set. Thee enhancements are motivated by practical problems arising in the context of the Condor distributed resource management system, which is widely used by computational scientists to harness the power of idle workstations. The results of this research will be tested by applying it directly to improve the Condor service.

Marvin H.SolomonCCR-9972232Internet为高效、公平地将分布式计算资源(如高速计算机和数据库)分配给那些能够最有效地使用它们的人提供了潜力。要实现这一潜力，需要轮流描述资源的生产者和消费者，并建立一种受双边限制分配资源的机制：资源消费者可以规定资源的可接受性标准，资源提供者可以对消费者施加限制。分类广告语言为定义这些约束提供了精确而强大的符号，而匹配算法提供了强制执行这些约束的机制。该研究通过发现和利用分类广告集合的同质属性来提高匹配的效率。它还将配对范例扩展到“共同匹配”，以支持这样的情况，即成功的分配需要汇集一套完整和一致的资源，每一种资源都可能对该集合中的其他资源施加限制。这些改进的动机是在秃鹰分布式资源管理系统的背景下出现的实际问题，计算科学家广泛使用该系统来利用空闲工作站的能力。这项研究的结果将通过直接应用于改进秃鹰服务来检验。