Dynamic Scheduling and Resource Management in Computer Systems

计算机系统中的动态调度和资源管理

• 批准号: 9705392
• 负责人: David Yao
• 金额: $ 18万
• 依托单位: Columbia University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1997
• 资助国家: 美国
• 起止时间: 1997-10-01 至 2001-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9705392&HistoricalAwards=false
• 关键词: Dynamic; Scheduling; Resource; Management; Computer

ECS-9705392 Yao This project is motivated by two recent developments at the IBM T.J. Watson Research Center concerning the scheduling and resource management in computer operating systems: (1) implementation of the so-called "time-function scheduling" in both OS/400 (the operating system for IBM's AS/400 product line) and AIX (the UNLX-based operating system for IBM's RS/6000 product line); and (2) a prototype scheduler for distributed-memory, multiprocessor environments (e.g., IBM's SP2 and clusters of workstations), which integrates several scheduling paradigms such as gang scheduling and load-sharing scheduling. In both cases, through extensive theoretical studies, in addition to empirical studies, it has been found that the schedulers provide effective and flexible control of resources that achieves a diverse set of scheduling objectives and improves the performance of a variety of applications in large and complex scientific and engineering applications. What we propose here is to explore and establish the control-theoretic foundation of these schedulers, and in return further enhance the dynamic scheduling and resource management protocols in high-performance operating systems. Specifically, we propose to study the mathematical structure of the schedulers in the context of discrete-event systems. Some of the PI's recent works in this area have established the connection between the optimality of simple control rules of a wide class of discrete-event systems and discrete mathematical structures such as matroid and antimatroid. Here, we want to explore related structures such as polymatroid and extended polymatroid, which are associated with conservation laws and generalized conservation laws of many stochastic systems, so as to bring out the effectiveness, or in some cases, optimality, of the schedulers. We also propose to implement the theoretical results for empirical studies, by way of adding new features to the prototype testbeds at Watson.

ECS-9705392姚 这个项目的动机是IBM T. J.沃森研究中心最近在计算机操作系统中的调度和资源管理方面的两个发展：（1）在OS/400和OS/400中实现了所谓的“时间函数调度”。（IBM AS/400产品线的操作系统）和AIX（用于IBM的RS/6000产品线的基于UNLX的操作系统）;以及（2）用于分布式存储器、多处理器环境的原型调度器（例如，IBM的SP2和工作站集群），它集成了几个调度范例，如组调度和负载共享调度。 在这两种情况下，通过广泛的理论研究，除了实证研究，已经发现，调度器提供了有效和灵活的资源控制，实现了一组不同的调度目标，并提高了性能的各种应用在大型和复杂的科学和工程应用。 我们的目标是探索和建立这些调度器的控制理论基础，并进一步增强高性能操作系统中的动态调度和资源管理协议。 具体来说，我们建议在离散事件系统的背景下研究调度器的数学结构。 PI最近在这一领域的一些工作已经建立了广泛的一类离散事件系统和离散数学结构，如拟阵和反拟阵的简单控制规则的最优性之间的联系。 在这里，我们想探讨相关的结构，如多拟阵和扩展多拟阵，这是与许多随机系统的守恒律和广义守恒律，以便带出的有效性，或在某些情况下，最优性，的的排序。 我们还建议通过在沃森的原型测试平台上添加新功能来实现实证研究的理论结果。