Near-Optimal Scheduling based on Immune Algorithms in Distributed Environments

被引：2
作者：
Istin, Mihai [1 ]
Visan, Andreea [1 ]
Pop, Florin [1 ]
Dobre, Ciprian [1 ]
Cristea, Valentin [1 ]
机构：
[1] Univ Politehn Bucuresti, Fac Automat & Comp Sci, Bucharest, Romania
来源：
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS (CISIS 2010) | 2010年
关键词：
Scheduling; Distributed Systems; Immune Algorithms; Genetic Algorithms;
D O I：
10.1109/CISIS.2010.78
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
One of the most important management aspects in Grid systems is task scheduling. This component should try to achieve two main objectives: efficient use of available resources and high performance in solving tasks given by members of virtual organizations. The scheduling problem is one of the hardest problems and it is proved that it is an NP-Complete problem. In order to have good performances heuristic algorithms are required. This paper presents a near-optimal algorithm for dependent task scheduling in distributed systems. The algorithm is based on both genetic and immune algorithms. The genetic componment is used in order to evolve a population of chromosomes representing potential solutions. In order to increase the performances of the genetic algorithm in terms of convergence times, in the initialization stage it is used an immune algorithm that produces an initial population with a good average fitness.
引用
收藏
页码：439 / 444
页数：6
相关论文
共 6 条
[1]  
Dobre C., 2008, ISDCP, P131
[2]   Hierarchical scheduling and allocation of multirate systems on heterogeneous multiprocessors [J].
Li, YB ;
Wolf, W .
EUROPEAN DESIGN & TEST CONFERENCE - ED&TC 97, PROCEEDINGS, 1997, :134-139
[3]  
Pop F., 2008, THESIS
[4]   Toward a realistic task scheduling model [J].
Sinnen, O ;
Sousa, LA ;
Sandnes, FE .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (03) :263-275
[5]  
Von Zuben F. J, 2000, GECCO00 WORKSH P NEW
[6]  
Von Zuben F. J, 2003, SOFT COMPUTING JOURN, P125
1