Return
A framework for reinforcement-based scheduling in parallel processor systems
DOI:10.1109/71.674317.png)
Abstract
En 中文
Task scheduling is important for the proper functioning of parallel processor systems. The static scheduling of tasks onto networks of parallel processors is well-defined and documented in the literature. However, in many practical situations a priori information about the tasks that need to be scheduled is not available. In such situations, tasks usually arrive dynamically and the scheduling should be performed on-line or on the fly. In this paper, we present a framework based on stochastic reinforcement learning, which is usually used to solve optimization problems in a simple and efficient way. The use of reinforcement learning reduces the dynamic scheduling problem to that of learning a stochastic approximation of an unknown average error surface. The main advantage of the proposed approach is that no prior information is required about the parallel processor system under consideration. The learning system develops an association between the best action (schedule) and the current state of the environment (parallel system). The performance of reinforcement learning is demonstrated by solving several dynamic scheduling problems. The conditions under which reinforcement teaming can used to efficiently solve the dynamic scheduling problem are highlighted.
Keywords:
neural networks
parallel processing
randomization
reinforcement learning
scheduling
task allocation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
Cited Papers
A Role for Transcription Factor GTF2IRD2 in Executive Function in Williams-Beuren Syndrome
PLoS ONE
IF0
Investigation of the optical properties of the Cr doped CuxO thin film deposited by thermionic vacuum arc plasma
Optik
IF0

