scholarly journals Research on Task Scheduling Strategy based on the Trustworthiness of MapReduce

2021 ◽  
Author(s):  
QIN Jun ◽  
SONG Yanyan ◽  
ZONG Ping
Keyword(s):  
Task Scheduling ◽  
Programming Model ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Rapid Development ◽  
Computing Technology ◽  
Scheduling Strategy ◽  
Task Scheduling Algorithm ◽  
Good Environment ◽  
Massive Data Processing

With the rapid development and popularization of information technology, cloud computing technology provides a good environment for solving massive data processing. Hadoop is an open-source implementation of MapReduce and has the ability to process large amounts of data. Aiming at the shortcomings of the fault-tolerant technology in the MapReduce programming model, this paper proposes a reliability task scheduling strategy that introduces a failure recovery mechanism, evaluates the trustworthiness of resource nodes in the cloud environment, establishes a trustworthiness model, and avoids task allocation to low reliability node, causing the task to be re-executed, wasting time and resources. Finally, the simulation platform CloudSim verifies the validity and stability of the task scheduling algorithm and scheduling model proposed in this paper.

scholarly journals Study of Task Scheduling Strategy based on Trustworthiness

2021 ◽  
Vol 12 (05) ◽  
pp. 01-09
Author(s):  
Jun QIN ◽  
Yanyan SONG ◽  
Ping ZONG
Keyword(s):  
Task Scheduling ◽  
Programming Model ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Massive Data ◽  
Scheduling Strategy ◽  
Computing Model ◽  
Scheduling Model ◽  
Task Scheduling Algorithm ◽  
The Stability

MapReduce is a distributed computing model for cloud computing to process massive data. It simplifies the writing of distributed parallel programs. For the fault-tolerant technology in the MapReduce programming model, tasks may be allocated to nodes with low reliability. It causes the task to be reexecuted, wasting time and resources. This paper proposes a reliability task scheduling strategy with a failure recovery mechanism, evaluates the trustworthiness of resource nodes in the cloud environment and builds a trustworthiness model. By using the simulation platform CloudSim, the stability of the task scheduling algorithm and scheduling model are verified in this paper.

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 Edge computing task scheduling strategy based on load balancing

2020 ◽  
Vol 309 ◽  
pp. 03025
Author(s):  
Lintan Sun ◽  
Zigan Li ◽  
Jingxian Lv ◽  
Chenfei Wang ◽  
Yajuan Wang ◽  
...  
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Rapid Development ◽  
Mobile Terminal ◽  
Heavy Load ◽  
Dynamic Selection ◽  
Scheduling Strategy ◽  
Light Load ◽  
Task Scheduling Algorithm

With the rapid development and wide application of the Internet of Everything, in order to cope with the increasing amount of data and computational scale of mobile terminal processing, and the imbalance of existing scheduling algorithms and low resource utilization, this paper proposes a task scheduling algorithm based on business priority. The algorithm firstly divides the service according to the priority of the service. Secondly, the standard deviation of the computing task group is used to determine the proportion of long and short services, and the dynamic selection model is established. Finally, according to the idea of secondary allocation, the task of heavy load is assigned to the scheduling strategy of light load resources to execute, and the service redistribution model is established. The simulation results show that compared with the typical algorithm, the proposed algorithm achieves the result of comprehensive consideration of Makespan and load balancing to improve system efficiency.

A Novel Performance Enhancing Task Scheduling Algorithm for Cloud-Based E-Health Environment

2019 ◽  
Vol 10 (2) ◽  
pp. 102-117 ◽  
Author(s):  
Vijayakumar Pandi ◽  
Pandiaraja Perumal ◽  
Balamurugan Balusamy ◽  
Marimuthu Karuppiah
Keyword(s):  
Task Scheduling ◽  
Performance Optimization ◽  
Scheduling Algorithm ◽  
Rapid Development ◽  
Computation Time ◽  
Cloud Services ◽  
Network Bandwidth ◽  
Task Scheduling Algorithm ◽  
Efficient Resource ◽  
The Cost

The fast-growing internet services have led to the rapid development of storing, retrieving and processing health-related documents from a public cloud. In such a scenario, the performance of cloud services offered is not guaranteed, since it depends on efficient resource scheduling, network bandwidth, etc. The trade-off which lies between the cost and the QoS is that the cost should be variably low on achieving high QoS. This can be done by performance optimization. In order to optimize the performance, a novel task scheduling algorithm is proposed in this article. The main advantage of this proposed scheduling algorithm is to improve the QoS parameters which comprises of metrics such as response time, computation time, availability and cost. The proposed work is simulated in Aneka and shows better performance compared to existing paradigms.

A Novel Performance Enhancing Task Scheduling Algorithm for Cloud-Based E-Health Environment

2021 ◽  
pp. 567-582
Author(s):  
Vijayakumar Pandi ◽  
Pandiaraja Perumal ◽  
Balamurugan Balusamy ◽  
Marimuthu Karuppiah
Keyword(s):  
Task Scheduling ◽  
Performance Optimization ◽  
Scheduling Algorithm ◽  
Rapid Development ◽  
Computation Time ◽  
Cloud Services ◽  
Task Scheduling Algorithm ◽  
Efficient Resource ◽  
Health Related ◽  
The Cost

The fast-growing internet services have led to the rapid development of storing, retrieving and processing health-related documents from a public cloud. In such a scenario, the performance of cloud services offered is not guaranteed, since it depends on efficient resource scheduling, network bandwidth, etc. The trade-off which lies between the cost and the QoS is that the cost should be variably low on achieving high QoS. This can be done by performance optimization. In order to optimize the performance, a novel task scheduling algorithm is proposed in this article. The main advantage of this proposed scheduling algorithm is to improve the QoS parameters which comprises of metrics such as response time, computation time, availability and cost. The proposed work is simulated in Aneka and shows better performance compared to existing paradigms.

Sign in / Sign up

Export Citation Format

Share Document