Minimization of Job Waiting Time Variance on Identical Parallel Machines

Xu, Xiaoyun; Ye, Nong

doi:10.1109/tsmcc.2007.900657

Cited by 11 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[23]. Heuristic algorithms are proposed to solve a number of independent tasks on multiple number of identical parallel processors problem so as to minimize the waiting time variance [24].…”

Section: Review Of Literature and Motivationmentioning

confidence: 99%

“…Parallel processing is one of the arising concepts that used to schedule a batch of 'n' numbers of tasks to be processed by 'm' numbers of parallel processors [24]. This section presents a parallel scheduling algorithm as a solution to the problem Q m |prec|WTV with an effect of minimization of mean WVT.…”

Section: Parallel Processor Schedulingmentioning

confidence: 99%

“…Fifth, the optimal sequence for a WTV minimization problem is V shaped [10]. Sixth, P m k CTV problem is NP complete in the strong sense when 'm' is arbitrary [24]. Seventh, P m k CTV Problem is NP complete in the ordinary sense when 'm' is fixed [24].…”

Section: Problem Formulation For Task Scheduling Problemmentioning

confidence: 99%

See 2 more Smart Citations

Heuristics Techniques for Scheduling Problems with Reducing Waiting Time Variance

Mahapatra¹,

Dash²,

Pradhan³

2017

Heuristics and Hyper-Heuristics - Principles and Applications

View full text Add to dashboard Cite

In real computational world, scheduling is a decision making process. This is nothing but a systematic schedule through which a large numbers of tasks are assigned to the processors. Due to the resource limitation, creation of such schedule is a real challenge. This creates the interest of developing a qualitative scheduler for the processors. These processors are either single or parallel. One of the criteria for improving the efficiency of scheduler is waiting time variance (WTV). Minimizing the WTV of a task is a NP-hard problem. Achieving the quality of service (QoS) in a single or parallel processor by minimizing the WTV is a problem of task scheduling. To enhance the performance of a single or parallel processor, it is required to develop a stable and none overlap scheduler by minimizing WTV. An automated scheduler's performance is always measured by the attributes of QoS. One of the attributes of QoS is 'Timeliness'. First, this chapter presents the importance of heuristics with five heuristic-based solutions. Then applies these heuristics on 1kWTV minimization problem and three heuristics with a unique task distribution mechanism on Q m |prec|WTV minimization problem. The experimental result shows the performance of heuristic in the form of graph for consonant problems.

show abstract

Section: Review Of Literature and Motivationmentioning

confidence: 99%

Section: Parallel Processor Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Heuristics Techniques for Scheduling Problems with Reducing Waiting Time Variance

Mahapatra¹,

Dash²,

Pradhan³

2017

Heuristics and Hyper-Heuristics - Principles and Applications

View full text Add to dashboard Cite

show abstract

“…Generally used simple algorithm for job scheduling is first-come-first-serve (FCFS) [6] [10]. In FCFS algorithm the first job is selected from the job pool, and job allocates IMS Engineering College, Ghaziabad, India suitable resources.…”

Section: Introductionmentioning

confidence: 99%

“…For full utilization of cloud resources, an efficient algorithm called a backfill scheduling algorithm, on the basis of FCFS has been proposed [6].…”

Section: Introductionmentioning

confidence: 99%

A priority based job scheduling algorithm using IBA and EASY algorithm for cloud metaschedular

Dubey

Kumar

Chandra

2015

2015 International Conference on Advances in Computer Engineering and Applications

View full text Add to dashboard Cite

Job scheduling (JS) is one of the most important issues in a Cloud system. The objective of job schedulers in cloud computing is to meet users' requirements and optimize the utilization of cloud resources. To achieve better QoS with high resource utilization in a cloud environment, an improved backfill algorithm (IBA) using balanced spiral (BS) method can be used. Results show that IBA minimizes resource idleness up to a great extent. However, IBA does not provide support for handling job priority and QoS. We need an algorithm to maximize the resource utilization while considering priority.

show abstract

Job Scheduling Algorithm in Cloud Environment Considering the Priority and Cost of Job

Kumar

Dubey

Sharma

2017

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Minimization of Job Waiting Time Variance on Identical Parallel Machines

Cited by 11 publications

References 24 publications

Heuristics Techniques for Scheduling Problems with Reducing Waiting Time Variance

Heuristics Techniques for Scheduling Problems with Reducing Waiting Time Variance

A priority based job scheduling algorithm using IBA and EASY algorithm for cloud metaschedular

Job Scheduling Algorithm in Cloud Environment Considering the Priority and Cost of Job

Contact Info

Product

Resources

About