Real Time Job Scheduling in Distributed System Using Artificial Intelligence Technique (original) (raw)
Related papers
A Survey for Task Scheduling in Real Time Distributed System
2016
In this review paper we are going to introduce the scheduling in the Distributed real-time system. Real-time system is a sort of plan in which we need to perform the task in certain timeframe with a precise result. Whereas in the general system there is no specified deadline. Actually Scheduling means execution of the task according to their properties and scheduling is performed on different processors, one is Uniprocessor and other is Multiprocessor and it can also be performed on the Distributed system. To schedule real-time task in distributed and multiprocessor system consists of two sub problems: Task allocation to processor and scheduling task on single processors. Task assignment can either be static or dynamic. We will discuss different task allocation algorithm for successful execution of the task.
Comparative analysis of Job Scheduling algorithms :A Review
International Journal of Engineering Development and Research, 2017
________________________________________________________________________________________________________ 1. INTRODUCTION Scheduling may be defined as a technique that is used to allocate the specific work to the specific resource. The specific task or work can be expressed as virtual calculating elements like threads or data flows and these works are allocated to the hardware equipments like processors or expansion cards in order to complete the task. Usually the main focus of job scheduling technique is to trade off between different processors; on the other hand reduction of total processing time is also the field to be concerned. [1].In grid type scheduling two things need to be considered and that are job scheduling and resource scheduling. Firstly in job scheduling it is required to determine the suitable resource that can be allocated to the specific job [2]. Therefore the optimum processor needed to be determined so that the specific job can be allocated to it. In grid type scheduling two types of schedulers are required: local and grid. Firstly consider the local schedulers, these are the type of schedulers that perform in local region therefore they are highly efficient, quicker, and operates in identical environment and that's why completely take over the identical processors [3]. Grid type Schedulers are also referred as Meta type schedulers [4]. Further the scheduling technique can also be divided into two types: first is static scheduling and second is dynamic scheduling. In static type of scheduling, firstly the processes are allocated to appropriate processor and this particular processor will start execution of processes without any pause. In dynamic type of scheduling, the rescheduling of processes is permitted. It is possible to change the process execution on the basis of dynamic data gathered related to workload on processing units [5]. In the grid, various processing units are present to execute the process. Major objective is that it is required to identify the suitable processor to execute the particular job. Various techniques that can be used for job scheduling: Centralized scheduling: The type of scheduler used here is centralized scheduler. When all the processor is busy then it makes the performance of system efficient. Hierarchical scheduling: it also contains central type of scheduler and it will direct the process to the global type of scheduler. Decentralized scheduling: It does not contain any central type scheduler. It consists of distributed type of schedulers that cooperates each other in order to schedule the process [6]. 2. EXISTING JOB SCHEDULING ALGORITHM In recent years, there are number of job scheduling algorithms are existed which has been used by several researchers in their work. Some of the algorithms have mentioned below. 2.1 First Come First Serve Scheduling Algorithm(FCFS) This algorithm works as first in first out order where in the waiting queue number of jobs is available and FCFS executes the job which arrives at first in the queue. This algorithm provides several merits such as simple and easy executing whereas there is no requirement of any priority to the job [7]. On the flip side it has several demerits as it is non-preemptive, increases waiting and turnaround time and time consuming. The diagrammatically representation of FCFS algorithm has explained below where there are two queues such as ready and waiting. The tasks which are in waiting queue are waiting for their processing. The process which comes first will be processed first or wait until its turn.
A Review on Various Scheduling Algorithms
This research paper describes about scheduling, scheduler, classification of scheduling, main purpose of scheduling and various scheduling algorithms such as first come first serve scheduling algorithm, shortest-job-first scheduling algorithm, priority scheduling algorithm, round robin scheduling algorithm, multilevel-queue scheduling algorithm, multilevel feedback queue scheduling algorithms. This research paper describes how these algorithms are implemented, with the parameters such as average waiting time and average turnaround time, Gantt chart and how average waiting time and average turnaround time are calculated, merits and demerits of the scheduling algorithms.
Comparative Study of Scheduling Algorithms for Real Time Environment
Scheduling is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but also on the time at which results are produced. Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in a real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters. Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done. The various issues have been presented on which there is still a need to work.
RSS Algorithm for Job Scheduling in Single Machine, A Novel Approach
2014
The elemental desire of this paper is to provide Quality of Services (QoS) by minimizing the variance of waiting time named as Waiting Time Variance (WTV) of the job scheduling mechanisms of data transmission in the information system. The basic intention is to reduce the avoidable idle time of a job in a computer network system due to the unavailability of accurate path in real time. Minimization of WTV is a problem of NP-Hard class. Heuristic mechanisms are one type of practice to work out such type of problems for providing a optimize solution with minimum computational time. By incorporating certain proven properties of optimum job scheduling sequence a new heuristic method named as RSS is developed. The proposed RSS method is demonstrated with the help of given small size samples are selected from the literature and randomly generated small size examples by using of Uniform distribution. The simulated outcomes are compared with two existing job scheduling heuristic methods name...
AN ANALYSIS OF SCHEDULING STRATEGIES BASED ON CRITICALITY OF JOBS
In this paper we will analyze the performance of job scheduler based on many parameters considering the criticality of job. Many job scheduling algorithms have been devised which affect the performance of the system in their own way. Improvement in job scheduling strategies will play a pivotal role in increasing the overall performance of the system. In this work we discuss some basic job scheduling strategies and also propose a new scheduling strategy which is based on the criticality i.e. how much important the job is for the user and priority of jobs with an effort towards improving the response time of the jobs. The idea is to motivate the users to submit more jobs and to minimize the chances of the users leaving the session. Interactive jobs usually require much less resources and are much more critical to the users than the batch jobs that execute over nights and weekends. The jobs are executed by first applying criticality to round robin scheduling and then applying priority to round robin scheduling. These scheduling strategies are then compared and their performance is evaluated on the basis of the three parameters viz. average waiting time, average turnaround time, and average response time. It is found that by applying criticality and priority on round robin scheduling there is significant improvement in the values of the three parameters especially the response time.
Comparative Study of Parallel Scheduling Algorithm for Parallel Job
International Journal of Computer Applications, 2016
Job scheduling is a technique which is applied on parallel computing systems, whose main focus is to measure the parameters of a system. For job scheduling menu algorithms are used in technical line such as priority based FCFS reservation, backfilling, improved round robin scheduling all are used to measure the parameters of a parallel computing. Since they all have some limitations and advantages to use all processors equally .This paper describes the various job scheduling algorithm such as priority based FCFS, PFCFS1, PFCFS2, PFCFS3 of static job scheduling algorithm.
Job shop scheduling in real-time cases
International Journal of Advanced Manufacturing Technology, 2005
A real-time scheduling algorithm is proposed, that is, to first make a fuzzy classification for the operations of jobs in real-time and then, according to their fuzzy sort, to schedule them with the heuristic. The heuristic is obtained by training a neural network offline with the genetic algorithm. Based on these ideas a real-time scheduler is built with neuro-fuzzy network (NFN). Finally the simulation for the real-time scheduling and the rescheduling are made. The results show that the real-time scheduling algorithm is effective and highly efficient compared to the first in and first out (FIFO) and the Lagrangian relaxation (LR) method.
2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009
The problem of real time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithm. This paper proposes a new novel scheduling algorithm to scheduler periodic task for soft real time systems .This is a planning based scheduler where tasks are scheduled on the basis of its instantaneous utilization .Here after every quantum of execution, instantaneous utilization of each task is calculated. task which is having highest instantaneous utilization is scheduled to the processor. Since Instantaneous Utilization Factor (IUF) is temporarily variant factor, the priority of each task will vary continuously. Experimentally IUF based scheduling shows better performance result like missing of deadline, predictability, schedulability and sustainability as compared to scheduling algorithm such as EDF, RM, LLF.
Algorithm fuzzy scheduling for realtime jobs on multiprocessor systems
Indonesian Journal of Electrical Engineering and Computer Science, 2022
The computing in real-time is rapidly focusing much developments in technologies so that the real-time jobs are to be scheduled and executed on computing systems in particular time frame. The scheduling and load balancing techniques in distributed systems face numerous challenges because of lack of centralized strategy to dispatch the jobs in multiprocessors systems. In this work, we propose an algorithm fuzzy scheduling (AFS) for real-time jobs that includes of arrival time, deadline and computation time as the scheduling parameters of input. The approach AFS is analyzed and compared with existing fuzzy algorithm (EFA) model for evaluation of performances from the outcome of the simulation. The jobs are scheduled on multiprocessor at higher system load by making use of fuzzy mechanisms in the algorithms. The experimental results prove that the proposed AFS achieves a better performance comparatively to EFA at various system load factors with respect to mean turnaroundtime, mean response time and count of missed deadlines. This is the initial phase of the algorithm, that will be enhanced to consider a greater number of parameters to be associated with jobs for better decision making and to investigate the scope for algorithm level parallelism.