Stability and Distributed Scheduling Algorithms
IEEE Transactions on Software Engineering
Using stochastic learning automata for job scheduling in distributed processing systems
Journal of Parallel and Distributed Computing
Characterizations of parallelism in applications and their use in scheduling
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
IEEE Transactions on Software Engineering
Robust partitioning policies of multiprocessor systems
Performance Evaluation - Special issue: performance modeling of parallel processing systems
Simulation study of multiple intelligent vehicle control using stochastic learning automata
Transactions of the Society for Computer Simulation International - Special issue: simulation methodology in transportation systems
Graph Partitioning Using Learning Automata
IEEE Transactions on Computers
Hi-index | 0.00 |
Given a typical parallel system and a collection of applications that are to execute on the system, a common problem is determining an effective allocation of processors among the applications. In this paper a learning approach is applied to processor allocation. The approach is to use a stochastic learning automaton (SLA) as a decision tool. An SLA uses values of the current state description, makes an allocation decision, evaluates its decision at some later time, modifies its decision making process, and tries to find the best allocation strategy by learning from its previous mistakes. The method is applied to the problem of allocating processors to parallel applications in a distributed system such as a cluster of workstations, and is validated through simulation. The result of this study show that a learning approach that utilizes a stochastic learning automaton is effective at making processor allocation decisions in a parallel system.