RRTS: A Task Scheduling Algorithm to Minimize Makespan in Grid Environment

被引:1
|
作者
Panda, Sanjaya Kumar [1 ]
Bhoi, Sourav Kumar [1 ]
Khilar, Pabitra Mohan [1 ]
机构
[1] Natl Inst Technol, Dept Comp Sci & Engn, Rourkela, India
来源
PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INTERNET COMPUTING AND INFORMATION COMMUNICATIONS (ICICIC GLOBAL 2012) | 2014年 / 216卷
关键词
Round robin task scheduling; Makespan; Grid computing; Task scheduling; Dynamic time slice;
D O I
10.1007/978-81-322-1299-7_27
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Task scheduling is one of the major issues of grid environment. This is an essential process in utilizing the resources efficiently by reducing the completion time. The performance of the grid can be enhanced by using efficient task scheduling algorithms. In this paper, we have proposed a new technique called Round Robin Task Scheduling (RRTS) for minimizing the Makespan by using concept of Round Robin. The idea of the approach is to execute the tasks by using Dynamic Time Slice (DTS). Our experimental analysis shows better results than other task scheduling algorithms (Minimum Execution Time (MET), Minimum Completion Time (MCT), Min-Max, and Max-Min) in terms of Makespan and Average Resource Utilization.
引用
收藏
页码:279 / 292
页数:14
相关论文
共 50 条
  • [11] Optimization of makespan and resource utilization in the fog computing environment through task scheduling algorithm
    Vijayalakshmi, R.
    Vasudevan, V.
    Kadry, Seifedine
    Kumar, R. Lakshmana
    INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING, 2020, 18 (01)
  • [12] Minimum Makespan Task Scheduling Algorithm in Cloud Computing
    Sasikaladevi, N.
    INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2016, 9 (11): : 61 - 70
  • [13] Task Scheduling in a Desktop Grid to Minimize the Server Load
    Mazalov, Vladimir V.
    Nikitina, Natalia N.
    Ivashko, Evgeny E.
    PARALLEL COMPUTING TECHNOLOGIES (PACT 2015), 2015, 9251 : 273 - 278
  • [14] Transgenic Genetic Algorithm to Minimize the Makespan in the Job Shop Scheduling Problem
    Viana, Monique Simplicio
    Morandin Junior, Orides
    Contreras, Rodrigo Colnago
    ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2020, : 463 - 474
  • [15] A hybrid genetic algorithm for job shop scheduling problem to minimize makespan
    Liu, Lin
    Xi, Yugeng
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3709 - +
  • [16] A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
    Tellache, Nour ElHouda
    Kerbache, Laoucine
    COMPUTERS & OPERATIONS RESEARCH, 2023, 156
  • [17] A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
    Wang, Cheng
    Song, Shiji
    Gupta, Jatinder N. D.
    Wu, Cheng
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2880 - 2887
  • [18] An effective genetic algorithm for flow shop scheduling problems to minimize makespan
    Robert, R. B. Jeen
    Rajkumar, R.
    MECHANIKA, 2017, 23 (04): : 594 - 603
  • [19] A new algorithm for online uniform-machine scheduling to minimize the makespan
    Cheng, T. C. E.
    Ng, C. T.
    Kotov, Vladimir
    INFORMATION PROCESSING LETTERS, 2006, 99 (03) : 102 - 105
  • [20] An Adaptive Differential Evolution Algorithm for Flow Shop Scheduling to minimize makespan
    Zhou, Yanping
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY II, PTS 1-4, 2013, 411-414 : 2089 - 2092