A subjective job scheduler based on a backpropagation neural networkReport as inadecuate

A subjective job scheduler based on a backpropagation neural network - Download this document for free, or read online. Document in PDF available to download.

Human-centric Computing and Information Sciences

, 3:17

First Online: 22 September 2013Received: 20 February 2012Accepted: 17 September 2013


This paper aims to present and discuss the concept of a subjective job scheduler based on a Backpropagation Neural Network BPNN and a greedy job alignment procedure. The subjective criteria of the scheduler depend on the solution plan for a given job scheduling problem. When the scheduler is provided with desired job selection criteria for the problem, it generates user satisfying solution from a set of valid jobs. The job validation procedure is based on the similarity measure of the jobs with the seen dataset of the scheduler. The seen dataset is based on the subjective criteria of the scheduler. The prioritized and valid jobs are allowed to execute concurrently on the given identical machines. The satisfying criterion of the scheduler indicates the user satisfaction of the scheduler and is based on three measures: convergence test of the BPNN, job validity test and cost evaluation. The simulations presented in this paper indicate that the proposed scheduler approach is one of the most effective strategies of structuring a subjective job scheduler.

KeywordsBackpropagation neural network Greedy task alignment procedure Seen data Unseen data Subjective criteria Satisfying criterion Convergence test Job validity test Cost evaluation Electronic supplementary materialThe online version of this article doi:10.1186-2192-1962-3-17 contains supplementary material, which is available to authorized users.

Download fulltext PDF

Author: Anilkumar Kothalil Gopalakrishnan

Source: https://link.springer.com/

Related documents