TAILIEUCHUNG - Sort-Mid tasks scheduling algorithm in grid computing

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NPcomplete problem. 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. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan. | Journal of Advanced Research 2015 6 987-993 Cairo University Journal of Advanced Research ORIGINAL ARTICLE Sort-Mid tasks scheduling algorithm in grid computing CrossMark Naglaa M. Reda a A. Tawfik b Mohamed A. Marzok b Soheir M. Khamis a a Department of Mathematics Faculty of Science Ain Shams University Cairo Egypt b Egypt. Ctr. for Theo. Phys. Faculty of Engineering Modern University Cairo Egypt ARTICLE INFO ABSTRACT Article history Received 14 July 2014 Received in revised form 10 November 2014 Accepted 21 November 2014 Available online 26 November 2014 Keywords Grid computing Heuristic algorithm Scheduling Resource utilization Makespan Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. 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. However using of the full power of resources is still a challenge. In this paper a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then the maximum average is obtained. Finally the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan. 2014 Production and hosting by Elsevier . on behalf of Cairo University. Introduction Grid computing systems 1 2 are distributed systems enable large-scale resource sharing among millions of computer systems across a worldwide network such as the Internet. Grid resources are different from .

• Toán học
• Grid computing
• Heuristic algorithm
• Resource utilization
• Sort Mid tasks scheduling algorithm
• Grid computing
• Introduction to Grid Computing
• Grid Generations
• Types of Grid
• The Grid We are Building
• Grid Characteristics
• Grid applications
• Grid vs
• Cluster computing from application view
• Types of Grid applications
• Grid in the world
• Grid in Viet Nam
• Seminar Review
• Grid Computing Middleware
• Grid Resource Management
• Grid Computing Security
• Applications of SOA
• Grid Architecture
• Grid Layer Architecture
• Open Grid Service Architecture
• OGSA Capabilities
• Service centric View of the Grid
• Quản trị mạng
• Luận văn cử nhân tin học
• Công nghệ Grid Computing
• Ứng dụng công nghệ Grid Computing
• Lĩnh vực điện toán
• Khả năng lưu trữ
• Đại học Khoa học Tự nhiên TP
• HCM
• tài nguyên trên Grid
• tổ chức ảo
• quản lý toàn cục
• Data Management
• Based Scheduling
• Network Aware
• Data Transfers
• Grid Architectures
• Nền tảng Alchemi
• Ứng dụng Grid
• Toán ứng dụng
• Hiệu suất bài toán với Alchemi
• Công nghệ thông tin
• Market Oriented Grid
• Utility Computing
• Wiley Series on Parallel
• Distributed Computing
• market oriented
• Grid Software Process
• User Environments and Tools
• Grid Portal
• Framework for Loosely
• Coupled ApplicationsBuild Grid
• luận văn
• công nghệ Grid
• hệ thống Grid
• phần mềm Globus
• phương trình tuyến tính
• Grid Systems
• Monitoring and Program Analysis Activities with DeWiz
• Grid Service
• Cluster Technology
• Graphical Design
• Programming Tools
• Bài toán quản trị mạng
• Luận văn quản trị mạng
• Bộ Globus Toolkit
• Integrated Research
• scientific technological
• Peer to Peer technologies
• Programming Models
• System Architecture
• Resource Management
• Computational fluid dynamics
• Structured grid generation
• Unstructured grid generation
• Adaptive methods
• Computing techniques