![]() Based on a comprehensive understanding of the challenges and the state of the art of current research, some general issues worthy of further exploration are proposed. dynamic policies, objective functions, applications models, adaptation, QoS constraints, strategies dealing with dynamic behavior of resources, and so on. Then various Grid scheduling algorithms are discussed from different points of view, such as static vs. First, the architecture of components involved in scheduling is briefly introduced to provide an intuitive image of the Grid scheduling process. In this review, the challenges for Grid scheduling are identified. Rather than covering the whole Grid scheduling area, this survey provides a review of the subject mainly from the perspective of scheduling algorithms. To achieve this goal, an efficient Grid scheduling system is an essential part of the Grid. ![]() One motivation of Grid computing is to aggregate the power of widely distributed resources, and provide non-trivial services to users. Yogendra Sharma (graduated on currently working as a post-doc at NCKU, Taiwan) Measuring and Modeling Crustal Deformation along the Himalayan Arc. Thanks to advances in wide-area network technologies and the low cost of computing resources, Grid computing came into being and is currently an active research area. ยช 2014 Production and hosting by Elsevier B.V. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The base step is to get the average value via sorting list of completion time of each task. The new strategy of Sort-Mid algorithm is to find appropriate resources. It aims to maximizing the utilization and minimizing the makespan. In this paper, a new heuristic algorithm called Sort-Mid is proposed. However, using of the full power of resources is still a challenge. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. A B S T R A C T Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |