scholarly journals A Hybrid Genetic Scheduling Algorithm to Heterogeneous Distributed System

2012 ◽  
Vol 03 (07) ◽  
pp. 750-754 ◽  
Author(s):  
Yan Kang ◽  
Defu Zhang
Keyword(s):  
Distributed System ◽  
Scheduling Algorithm

Design and Construction of Distributed JavaScript Parsing System

2014 ◽  
Vol 6 (4) ◽  
pp. 1-14
Author(s):  
Bo Shen ◽  
Wei Huang ◽  
Xiaodi Li
Keyword(s):  
Search Engine ◽  
Distributed System ◽  
Task Scheduling ◽  
Information Acquisition ◽  
Scheduling Algorithm ◽  
Rapid Development ◽  
Internet Technology ◽  
The Internet ◽  
Computing Technology ◽  
Task Scheduling Algorithm

With the rapid development of the Internet technology, JS (short for JavaScript), as one of the representative of script languages, which is very powerful, is becoming more and more popular to the developers and users. But JS programming is more complex than usual static technology. In the field of search engine and information acquisition, it's very difficult to get the information hidden in script code. In this paper, the authors design a distributed system for parsing the JS code embedded in HTML file and retrieving the underling information. the authors describe how to extract JS codes from HTML file and parse them. Also, they introduce a task scheduling algorithm for the JS parsing system by employing Hadoop distributed computing technology. The experimental results indicate that the proposed algorithm and system can achieve a reasonable task scheduling efficiency and parse JS codes rapidly.

scholarly journals Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Rashmi Sharma ◽  
Nitin
Keyword(s):  
Real Time ◽  
Distributed System ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Time System ◽  
Real Time System ◽  
Main Target ◽  
Migration Mechanism ◽  
Simulation Results ◽  
Earliest Deadline

In Real Time System, the achievement of deadline is the main target of every scheduling algorithm. Earliest Deadline First (EDF), Rate Monotonic (RM), and least Laxity First are some renowned algorithms that work well in their own context. As we know, there is a very common problem Domino's effect in EDF that is generated due to overloading condition (EDF is not working well in overloading situation). Similarly, performance of RM is degraded in underloading condition. We can say that both algorithms are complements of each other. Deadline missing in both events happens because of their utilization bounding strategy. Therefore, in this paper we are proposing a new scheduling algorithm that carries through the drawback of both existing algorithms. Joint EDF-RM scheduling algorithm is implemented in global scheduler that permits task migration mechanism in between processors in the system. In order to check the improved behavior of proposed algorithm we perform simulation. Results are achieved and evaluated in terms of Success Ratio (SR), Average CPU Utilization (ECU), Failure Ratio (FR), and Maximum Tardiness parameters. In the end, the results are compared with the existing (EDF, RM, and D_R_EDF) algorithms. It has been shown that the proposed algorithm performs better during overloading condition as well in underloading condition.

scholarly journals Unavailable Time Aware Scheduling of Hybrid Task on Heterogeneous Distributed System

2018 ◽  
Author(s):  
Hejun Xuan ◽  
Shiwei Wei ◽  
Yanling Li ◽  
Ran Li ◽  
Wuning Tong
Keyword(s):  
Resource Allocation ◽  
Distributed System ◽  
Optimization Model ◽  
Scheduling Algorithm ◽  
Search Space ◽  
Generic Algorithm ◽  
Proposed Model ◽  
Heterogeneous Distributed Systems ◽  
Np Hard Problem ◽  
The Mathematical Model

The resource allocation for tasks in heterogeneous distributed system is a well known NP-hard problem. For the sake of making the makespan is minimized, it is hard to distribute the tasks to proper processors. The problem is even more complex and challenging when the processors have unavailable time and the tasks type are various. This paper investigates a resource allocation problem for hybrid tasks comprising both divisible and bag-of-tasks(BoT) in heterogeneous distributed system when the processors has unavailable time. First, the mathematical model, which minimizes the makespan of the hybrid tasks when the processors have unavailable time, is established. Second, we propose a scheduling algorithm referred to as bag-of-tasks allocate-pull and divisible task allocation (BoTAPDTA) algorithm for handling hybrid tasks on heterogeneous distributed systems. In addition, to solving the optimization model efficiently, a generic algorithm(GA) is proposed. For the sake of reducing the search space and solving the optimization model effectively, a two step scheduling algorithm(TSGA), which first allocate bag-of-tasks(BoT) using generic algorithm and then assign divisible task to processors like BoTAPDTA, is designed. Finally, numerical simulation experiments are conducted, and experimental results indicate the effectiveness of the proposed model and algorithm.

scholarly journals Effective Load Balance Scheduling Schemes for Heterogeneous Distributed System

2017 ◽  
Vol 7 (5) ◽  
pp. 2757 ◽  
Author(s):  
Zeba Khan ◽  
Mahfooz Alam ◽  
Raza Abbas Haidri
Keyword(s):  
Distributed Systems ◽  
Load Balancing ◽  
Distributed System ◽  
Load Balance ◽  
Scheduling Algorithm ◽  
Optimization Techniques ◽  
Load Imbalance ◽  
Test Conditions ◽  
Load Balancing Algorithm ◽  
Crossed Cube

Importance of distributed systems for distributing the workload on the processors is globally accepted. It is an agreed fact that divides and conquers is the effective strategy for load balancing problems. In today’s time, load balancing is the major issue for scheduling algorithm such as in Parallel and Distributed Systems including Grid and Cloud Computing and many more. Load Balancing is the phenomena of spreading or distributing the workload among the processors so that all processors keep busy for all the time, in order to prevent ideal time of processors. In this work, presents a load balancing algorithm for heterogeneous distributed system (HeDS) with aim of minimizing the load imbalance factor (LIF). The proposed algorithm is using optimization techniques such as Max-Max and Min-Max strategy and applied on Folded Crossed Cube (FCC) network. Makespan, speedup and average resource utilization are also evaluated for performance matrices. The experimental results of the proposed algorithms have showed better in comparison to with previous work under various test conditions.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document