Exploring Dynamic Task Loading in SGX-based Distributed Computing

Volunteer computing (VC) is a distributed computing paradigm, which provides unlimited computing resources in the form of donated idle resources for many large-scale scientific computing applications. Task scheduling is one of the most challenging problems in VC. Although, dynamic scheduling problem with deadline constraint has been extensively studied in prior studies in the heterogeneous system, such as cloud computing and clusters, these algorithms can’t be fully applied to VC. This is because volunteer nodes can get offline whenever they want without taking any responsibility, which is different from other distributed computing. For this situation, this paper proposes a dynamic task scheduling algorithm for heterogeneous VC with deadline constraint, called deadline preference dispatch scheduling (DPDS). The DPDS algorithm selects tasks with the nearest deadline each time and assigns them to volunteer nodes (VN), which solves the dynamic task scheduling problem with deadline constraint. To make full use of resources and maximize the number of completed tasks before the deadline constraint, on the basis of the DPDS algorithm, improved dispatch constraint scheduling (IDCS) is further proposed. To verify our algorithms, we conducted experiments, and the results show that the proposed algorithms can effectively solve the dynamic task assignment problem with deadline constraint in VC.

Download Full-text

A Hybrid Method to Shorten Congestion and Implement Data Guarantee in Cloud Computing

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.f1270.0886s219 ◽

2019 ◽

Vol 8 (6S2) ◽

pp. 739-741

Keyword(s):

Cloud Computing ◽

Distributed Computing ◽

Hybrid Method ◽

Data Security ◽

Security Level ◽

Present System ◽

Customer Needs ◽

Dynamic Task ◽

Full Control ◽

The Way

Distributed computing is used any place in light of the way that it gives on solicitation access of advantages and reduces cost, it offers dynamic task of benefits for guaranteed and trustworthy organizations. Customers store their data on a single virtual server, when customer needs to get to any data that data might be changed or balanced by unapproved people for malevolent reason since customer's don't have organize control of data So security is a noteworthy test for dispersed registering, to improve the immovable nature of organizations it is imperative to assemble the security level in the cloud where the customer should free from dependability, approval, rightness or protection. In this paper, I proposed another system for blockage control and data security in circulated figuring. Various makers have given their considerations on data security in cloud anyway no one gives the full control to the customer. This methodology control stop up by diminishing the proportion of data. In the present system cloud pro center uses weight strategy to diminish the degree of data after that scramble data that fabricates the proportion of ciphertext interestingly with compacted data. Another encryption framework is used to encode the pressed data that does not assemble the range of ciphertext. There are two rule ideal conditions of this methodology (I) it doesn't fabricate the range of ciphertext connection with existing strategy and (ii) reduce the blockage among server and customer by speedy transmission. In case we decline the range of data then data would be traded among customer and server in less proportion of time so for this circumstance this technique controls the blockage among customer and server.

Download Full-text