Adaptive Job Routing and Scheduling (2004)
Shimon Whiteson and Peter Stone
Computer systems are rapidly becoming so complex that maintaining them with human support staffs will be prohibitively expensive and inefficient. In response, visionaries have begun proposing that computer systems be imbued with the ability to configure themselves, diagnose failures, and ultimately repair themselves in response to these failures. However, despite convincing arguments that such a shift would be desirable, as of yet there has been little concrete progress made towards this goal. We view these problems as fundamentally emphmachine learning challenges. Hence, this article presents a new network simulator designed to study the application of machine learning methods from a system-wide perspective. We also introduce learning-based methods for addressing the problems of job routing and CPU scheduling in the networks we simulate. Our experimental results verify that methods using machine learning outperform reasonable heuristic and hand-coded approaches on example networks designed to capture many of the complexities that exist in real systems.
View:
PDF, PS, HTML
Citation:
Engineering Applications of Artificial Intelligence, Vol. 17(7), 7 (2004), pp. 855-869. Corrected version.
Bibtex:

Peter Stone Faculty pstone [at] cs utexas edu