Ascendable Computing with Storage Resources

1495 words (6 pages) Essay

7th Aug 2017 Computer Science Reference this

Disclaimer: This work has been submitted by a university student. This is not an example of the work produced by our Essay Writing Service. You can view samples of our professional work here.

Any opinions, findings, conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of UKEssays.com.

INTRODUCTION

Ascendable computing with storage resources through the Internet have been preferred by a cloud computing. It also assists users for accessing services with no regard where the services are presented and the way they offered same to water, gas, electricity, and telephony utilities [1]. With the adaptable and clear components in the resource assignment and also service delivering, a lot of data-intensive applications are improved in the environment of cloud computing. The data rigorous applications dedicate many of their implementation time in disk I/O for exercising a huge amount of data, e.g. commercial transactions data mining, satellite data processing, web search engine, etc.An evolving dedicated cloud computing platform for the  data-intensive application is Apache Hadoop [2][3]

Get Help With Your Essay

If you need assistance with writing your essay, our professional essay writing service is here to help!

Find out more

Data is allocated over the cloud. This has to be made possible to the applications that want to utilize it. There should not be any degradation of performance. The data accessing speed must be augmented, maintaining the load balanced in the system [4]. Possibility and Scalability are the two significant components to enhance the cloud performance. Generating replication is one of the vital strategies to attain the above. This replication also minimizes access latency plus bandwidth consumption. Then the data is saved at several places. The entreated data is derived from the closest source from which the appeal created. It results in increasing the performance of the system. The replication’s advantages do not occur without the overheads of generating, sustaining and also updating the replicas. Here, Replication can hugely enhance the performance [5]. The cloud computing applications’ performance of gaming, voice, storage, video conferencing, online office, social networking, and backup relies hugely on the possibility and effectiveness of great-performance communicating resources. For better reliability and high performance low latency service provisioning, Data resources may be drawn nearer (replicated)  to the place  known as physical infrastructure where the cloud applications are functioning.

One of the most broadly learned spectacle in the allocated environment is Replication. Data replication algorithms are classified into two categories: static replication [6] [7] plus dynamic replication algorithms [8] [9] [10]., The replication policy is reestablished and very well defined in the static replication model. Moreover, dynamic replication generates automatically and removes replicas based on the modifying access patterns. And, static plus dynamic replication algorithms are further categorized into two groups, they are distributed and centralized algorithms [11] [12] Two kinds of replication techniques are Active and passive Replication. In active replication the whole replicas derive and execute the similar series of client appeals. In Passive replication the clients dispatch their appeals to a primary, implementing the appeals and dispatches updated messages to the backups. The replication’s target is to reduce the data access for the user accesses and also improving the job implementation performance. Replication proffers both enhanced performance and dependability for mobile computers through generating several replicas of significant data. For enhancing the data access’ performance in conventional wired/wireless networks, Data replication has been broadly used [13]. With the data replication, the users can utilize the data with no assistance of network infrastructure, and also can minimize the traffic load [14].

Scheduling is one of the significant tasks executed to fasten most profit for boosting the effectiveness of the cloud computing work load [15]. In cloud environment, the vital aim of the scheduling algorithms is, creating the utilization of the resources orderly. In cloud computing the different job scheduling [16] techniques are Cloud Service, User Level, Static and Dynamic [17], Heuristic, Workflow [18] and also Real Time scheduling. A few of the scheduling algorithms in cloud whether otherwise task or job or else workflow [19] or resources are Compromised-Time-Cost, Particle Swarm Optimization related Heuristic [20], enhanced cost based for tasks, RASA workflow, plus  new transaction intensive cost constraint, SHEFT workflow, Multiple QoS Constrained for Multi- Workflows.  Demonstrated workflow scheduling algorithms [kianpisheh2016] are available. Some of them are ant colony, market oriented hierarchical, deadline constrained, etc.

Related Work

Mazhar Ali et.al [21] suggested Division plus Replication of Data in the Cloud for Optimal Performance and Security (DROPS) which approaches the safety and performance problems collectively. In the DROPS methodology, A file was separated into fragments, and then replicate the fragmented data through the cloud nodes. All nodes saved only one fragment of a specified data file that assures that even in a victorious attack, meaningful information was not exposed to the attacker. They presented that the possibility for generating and compromising every node saving the fragments single file’s fragments is utterly low. They also matched the DROPS methodology’s performance with ten other plans. The greater level of safety with little performance overhead was noticed.

Find out how UKEssays.com can help you!

Our academic experts are ready and waiting to assist with any writing project you may have. From simple essay plans, through to full dissertations, you can guarantee we have a service perfectly matched to your needs.

View our services

For minimizing the consumption of Cloud storage while confronting the data dependability requirement, Wenhao Li, Yun Yang et.al [22] proposed a cost-efficient data dependability management mechanism called PRCR regarding a common data dependability technique. By utilizing proactive replica examining method, when the running overhead for PRCR can be negligible, PRCR assures dependability of the great Cloud data with the minimized replication, that can also function as a cost efficiency yardstick for replication related methods.

Javid Taheri et.al [23] suggested an innovative optimization algorithm based on Bee Colony, called Job Data Scheduling using Bee Colony (JDS-BC). JDS-BC comprised two integrating mechanisms to schedule jobs effectively onto computational nodes and then replicate data files on the storage nodes in a system hence the two independent, and in several cases conflicting, objectives (i.e., makespan plus whole datafile transfer time) of these heterogeneous systems were minimized concurrently. Three benchmarks – differentiating from small- to huge-sized instances – were utilized to evaluate the of JDS-BC’s performance. For presenting JDS-BC’s superiority under variant operating situations, Results were matched opposite to other algorithms.

Menglan Hu et.al [24] suggested a sequence of innovative algorithms for solving the joint issue of resource provisioning and caching (i.e., replica placement) for cloud-based CDNs with an emphasis on handling the dynamic demand patterns. Firstly, they propose a provisioning and caching algorithm framework called Differential Provisioning and Caching (DPC) algorithm, that focuses to rent cloud resources for constructing  CDNs and whereby for caching  the concepts hence the complete rental cost can be reduced while every demands are served. DPC comprised 2 steps. Step 1 first augmented total demands assisted by available resources. Then, step 2 the whole rental cost for innovative resources for serving all remained demands. For every step we mapped both greedy plus iterative heuristics, each with variant benefits over the prevailing methods.

Yongqiang Gao et.al [25] presented a multi-objective ant colony system algorithm for the virtual machine placement issue. The aim was, deriving efficiently a sequence of non-dominated solutions (the Pareto set) that reduce the total resource wastage plus power consumption simultaneously. The suggested algorithm was examined with some examples from the literature. Its solution performance was matched to that of a prevailing multi-objective genetic algorithm plus two single-objective algorithms notable bin packing algorithm and a max-min ant system (MMAS) algorithm.

Zhenhua Wang et.al [26] presented workload balancing framework and resource management to Swift, a broadly utilized and conventional distributed storage system on cloud. In this framework, workload monitoring plus analysis algorithms were designed by them for inventing over and under loaded nodes in the cluster. For balancing the workload amidst those nodes, Split, Merge and also Pair Algorithms executed for regulating physical machines when Resource Reallocate Algorithm was mapped for regulating virtual machines on cloud. Additionally, by leveraging the experienced architecture of allocated storage systems, the framework resided in the hosts and operates through API interception.

Cite This Work

To export a reference to this article please select a referencing stye below:

Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.
Reference Copied to Clipboard.

Related Services

View all

DMCA / Removal Request

If you are the original writer of this essay and no longer wish to have your work published on the UKDiss.com website then please: