International Journal of Computer

Science and Engineering (IJCSE)

ISSN (P): 2278–9960; ISSN (E): 2278–9979
Vol. 8, Issue 6, Oct–Nov 2019; 29–36
© IASET

AN IMPROVED HEFT-T SCHEDULING ALGORITHM IN MOBILE CLOUD

ENVIRONMENTS FOR UNCONSTRAINED CASE

A Mamatha1 & T. Satyendra Kumar2

1
PG Scholar, Department of Computer Science and Engineering, SV Engineering College for Women, Tirupati,
Andhra Pradesh, India
2
Assistant Professor, Department of Computer Science and Engineering, SV Engineering College for Women, Tirupati,
Andhra Pradesh, India

ABSTRACT

By utilizing the innovation of the portable distributed computing, asset limit, and processing capacity of cell phones could
be broadened. Nonetheless, it is hard to timetable assignments put together by portable clients when the quantity of
errands and specialist organizations increments and to streamline different destinations while fulfilling clients'
prerequisites.n this paper, the task booking is exhibited as a multi-target headway issue, and we consider both
unconstrained and time cutoff time obliged cases. To address this issue, a heterogeneous most reliable consummation time
(HEFT) using framework for demand tendency by equivalence to an ideal plan system is proposed, which is named as
HEFT-T computation. For the unconstrained case, a three-compose method reliant on HEFT-T count is shown to pick the
perfect game plans by applying non-directed organizing approach. For the cutoff time constrained case, an adaptable
weight adjustment framework subject to HEFT-T is proposed to change weight a motivating force for time. Differentiated
and other of the bleeding edge estimations, our proposed count performs better in the worldview of both the improvement
for complete cost similarly as mean weight, and the cutoff time basic social event rate.

KEYWORDS: Mobile Cloud Computing, Task Scheduling, Deadline-Constrained, Multi-Objective Optimization

Article History
Received: 04 Oct 2019 | Revised: 18 Oct 2019 | Accepted: 24 Oct 2019

INTRODUCTION

Cloud computing has turned into an unavoidable innovation for giving computing, storage and programming
administrations on Internet. This is contemplated by the way that cloud frameworks can give almost any sort of
administration clients may request and soothe clients from building their very own physical foundations. It can likewise
offer administrations with pay-as-you-go charging model where clients pay as indicated by the measure of the
administrations they use, which makes it significantly more attractive. Due to expanding interest for cloud administrations,
improvement of asset utilization turns out to be much progressively basic to build execution, accessibility and reliability of
the cloud frameworks. Virtualization innovations have been demonstrated to be helpful to meet these necessities.
Virtualization empowers clients and applications to share physical cloud assets in a productive, viable and detached way.

www.iaset.us editor@iaset.us
30 A Mamatha & T. Satyendra Kumar

With server virtualization numerous virtual machines can keep running in a solitary physical machine in a
completely secluded way. Thusly cloud suppliers can serve progressively number of clients in an adaptable and effective
manner.Different virtual machines mentioned by clients may have distinctive preparing, memory, I/O and systems
administration prerequisites. Physical servers can likewise have various limits. This prompts an improvement issue which
is known as virtual machine position issue. An answer for this issue may expect to build use of physical machines to lessen
expenses and vitality utilization. Because of expanding client interest for distributed computing referenced before,
enhancement of asset utilization turns into an exceptionally fundamental issue to spare more vitality, diminish expenses
and meet client assistance level understandings (SLAs).

The virtual machine position issue is a multi-objective obliged NPhard issue. Hereditary calculation based
methodologies have been one of the most generally utilized strategies to take care of this kind of complex issues. A
hereditary calculation impersonates the characteristic choice procedure and along these lines attempts to locate a near ideal
answer for a given complex issue.

A hereditary calculation requires detail of the chromosome structure and we planned our chromosome structure as
a tree speaking to a datacenter organize topology. Leaves of the tree speaks to the physical machines and each leaf hub has
a pointer to a rundown of virtual machines. The wellness capacity of our hereditary calculation is likewise structured
remarkably with the point of lessening asset waste and system transfer speed utilization.

Also, we built up a use based virtual machine position calculation that utilizations Simulated Annealing
meta-heuristic methodology. We call this calculation as UBSA. We did this to see which meta-heuristic, hereditary
calculation or recreated tempering, would yield better outcomes. The outcomes show that despite the fact that they have
comparable presentation, UBGA performs somewhat superior to UBSA. Accordingly UBGA has been our decision for
contrasting and different methodologies from writing.

Related Work

In this part, we give brief data about hereditary calculations and cloud computing. At that point, we show past works
having both transformative and non - developmental methodologies in the field of virtual machine situation.

Genetic Algorithms

A Genetic Algorithm is a chase meta-heuristic that mimics trademark assurance methodology of the real world and is
normally used to find close to perfect responses for complex progression issues.

Genetic Algorithms were planned and made by John Holland and his understudies at University of Michigan in
1970s [35]. Their basic point was to ponder how adaption of typical assurance would work instead of making new counts
for explicit issues. Holland showed genetic counts as an "impression of natural advancement" in his book Adaptation in
Natural and Artificial Systems [18].

Genetic Algorithm are even significant for issues with colossal chase space and huge number of components. In a
chase space, a genetic computation will all in all quest for picked and better game plans rather than separating the whole
space. Because of progress feature, it has less probability to get close by most outrageous worth rather than worldwide
most prominent.

Impact Factor (JCC): 7.1226 NAS Rating: 3.17

An Improved HEFT-T Scheduling Algorithm in Mobile cloud Environments for Unconstrained Case 31

A standard Genetic calculation is characterized with:

• A Genetic portrayal of arrangements

• A wellness capacity to assess applicant arrangements

A Genetic portrayal is generally a variety of bits however can be any information structure contingent upon the on
the issue (e.g., a tree in this theory). Since any property of the chose hereditary portrayal structure is fixed (i.e., size of
exhibit, tallness and number of leaves of tree) for every person of the populace, they can be effectively changed, and this
prompts basic hybrid activities. The wellness capacity is a figure of legitimacy that shows how close an answer is to
wanted targets.

At the point when the genetic portrayal and wellness capacity are resolved, a hereditary calculation keeps on creating an
underlying populace (an irregular arrangement of arrangements) and after that attempt to improve it by tedious utilization
of choice, hybrid and change.

The introduction stage incorporates making of populace with a few hundreds or thousands of arbitrary
arrangements as indicated by the idea of the issue. These arrangements might be difficult to apply to the issue. Now and
again, arrangements might be coordinated to turn into an increasingly ideal one yet this is unwise since this statements
assortment among arrangement that may lead being stuck at the nearby most extreme.

Undertaking Scheduling Process

• Task Scheduling With Energy Consumption Optimization

• Task Scheduling With Cost Optimization

• Task Scheduling With Time Optimization

• Task Scheduling With Other Objectives

Figure 1: Task Scheduling Process in Mobile Computing Environment.

Proposed Algorithm

The designing of undertaking getting ready for the MCC condition is depicted as Fig. 1, which in a general sense contains
a compact stage (MP), task arranging center (TSC) and a cloud organize (CP). As ought to be self-evident, MP is made out
of PDAs; TSC is able to pick which provider would these arranged assignments execute; CP is to give various providers to
flexible customers to execute endeavors.

www.iaset.us editor@iaset.us
32 A Mamatha & T. Satyendra Kumar

Here is the movement of the task booking process under Mobile Cloud conditions. Immediately, all of the
endeavors are delivered by phones in MP. Those tasks are accumulated in the Task Sequence Set (TSS) and booked by
TSC. The most fitting providers of CP are conveyed to the arranged tasks as demonstrated by the requirements of compact
customers. In this paper, we generally center around the task booking figuring in the TSC.In this paper, task arranging is
characterized as a period constrained, multi-target improvement issue.

In this fragment, we will display a couple of models related with task arranging process, which joins task outline
model, correspondence model, execution model and undertaking booking model.

Task Graph Model

A portable application comprises of various errands which could be spoken to by a DAG. In this paper, we think about that
every one of the undertakings are executed on the cloud suppliers. An assignment chart is led by the DAG, G D (N; E),
where N is the arrangement of n undertakings, and E is the arrangement of edge(i; j). Each edge(i; j) 2 E speaks to the
correspondence time between task ni and nj, where undertakings is spoken to as ni, I D 1; 2;…..; n, and cloud suppliers are
spoken to as pj, j D 1; 2… ….;m.

Figure 2: A Sample of DAG.

Communication Model

The correspondence time is created when information move between various suppliers. The measure of information that
must be moved from task ni to task nk can be spoken to as Data = {dataik |i, k = 1, ·, n}, and the transmission rate can be
spoken to as R. On the off chance that the assignment ni and undertaking nk are executed on various suppliers, for instance,
task ni is booked on pn and task nk is planned on pm. At that point the correspondence time of edge(i, k) is determined as:

cik = dataik/R

On the off chance that the assignment ni and errand nk are executed on a similar supplier, the correspondence time
cik is set as 0.

Execution Model

In the execution model, we consider three execution measurements which are fruition time, cost and burden individually.
Fruition time is viewed as cutoff time requirements of portable clients; cost is the improvement target which intends to

Impact Factor (JCC): 7.1226 NAS Rating: 3.17

An Improved HEFT-T Scheduling Algorithm in Mobile cloud Environments for Unconstrained Case 33

fulfill clients' desires; and burden is the advancement target which cloud suppliers need to consider. By advancing these
goals simultaneously, we can satisfy the two clients and cloud suppliers desires however much as could reasonably be
expected.

Proposed HEFT-T Algorithm

There are mainly two phases included in this algorithm, which are task selection Phase and provider selection phase
respectively.

Selection Phase

Tasks are scheduled in terms of their priorities, and tasks are given priorities and sorted according to their upward rank
values. The upward rank value of a task ni in HEFT is computed as:

ranku(ni) = Ti + max ns∈succ(ni) (c¯ is + ranku(ns))

Provider Selection

In HEFT calculation, the goal is to limit the complete execution length for the assignment booking. Along these lines, the
addition based approach is proposed in supplier determination stage, which considers embeddings an assignment in a most
punctual inert vacancy between two previously booked errands on a processor. In any case, in this paper, the assignment
booking issue is displayed as a multi-target enhancement issue, and we need to mull over every one of the destinations.
TOPSIS is a multi-model basic leadership technique. It commits to locate an ideal arrangement which was nearest from the
perfect arrangement and longest from the negative arrangement at the same time. Along these lines, in the supplier choice
stage, we apply the TOPSIS strategy to choose the most appropriate supplier to advance both absolute expense and mean
burden.

Algorithm HEFT-T Algorithm

• Initialize Parameters

• Compute rankcu for all tasks by traversing the task graph upward

• Sort the tasks in a scheduling list by increasing order of rankcu values

• While there are unscheduled tasks in the list do

• Select the first task ni from the list of scheduling

• For each processor pk do

• Compute EFT(ni,pk) value

• Compute Costik value

• Compute Lik value

• End for

• Select the optimal provider pj by applying TOPSIS

• Assigning task ni to the processor pj

www.iaset.us editor@iaset.us
34 A Mamatha & T. Satyendra Kumar

• End while

• Return Total cost

Unconstrained Heft-t Algorithm

As portrayed in Section An in IV, it tends to be seen that distinctive weight estimations of targets can bring about different
arrangements in supplier determination. In view of the proposed HEFT-T calculation, so as to acquire the ideal
arrangement and the comparing ideal weight estimations of every goal, we will: (1) discover every one of the arrangements
when weight estimation of every target changes from 0 to 1; (2) select non-ruled arrangements from that got in (1) as per
the Fast Non-ruled Sorting approach [10]; (3) figure the perfect and negative-perfect arrangements and locate the ideal one
which is the nearest to the perfect arrangement.

RESULTS

In order to evaluate the performance of the proposed algorithm, in this section, we evaluate our proposed HEFT-T
algorithm with unconstrained and deadline-constrained cases for task scheduling in the MCC environment.

Figure 3: Final Results.

CONCLUSIONS

In this paper, a HEFT calculations is proposed for the cutoff time compelled undertaking planning in MCC conditions.
Most works center around single target advancement and didn't focus on the best way to feature the preparing of
requirements when the errand booking is demonstrated as a compelled streamlining issue. Hence, our proposed calculation
means to address these issues by acquiring the ideal arrangements through a three phase technique under unconstrained
issue and changing the weight esteems for time and different destinations adjust so as to fulfill the cutoff time under the
time compelled case.But as indicated by greater security shading code based confirmation plan is superior to anything pair
based verification plot. These plans are totally new to the client and the proposed confirmation method ought to be checked
by and large. This strategy can be utilized for outer validation to associate the application to a database or additionally it
very well may be utilized to give security to any windows application.

Impact Factor (JCC): 7.1226 NAS Rating: 3.17

An Improved HEFT-T Scheduling Algorithm in Mobile cloud Environments for Unconstrained Case 35

REFERENCES

1. A. U. R. Khan, M. Othman, S. A. Madani, and S. U. Khan, ‘‘A survey of mobile cloud computing application
models,’’ IEEE Commun. Surveys Tuts., vol. 16, no. 1, pp. 393–413, 1st Quart., 2013, doi:
10.1109/SURV.2013.062613.00160.

2. B. G. Chun and P. Maniatis, ‘‘Augmented smartphone applications through clone cloud execution,’’ in Proc.
Conf. HotOS, Monte Verità, CA, USA, 2009, pp. 1–8.

3. H. T. Dinh, C. Lee, D. Niyato, and P. Wang, ‘‘A survey of mobile cloud computing: Architecture, applications,
and approaches,’’ Wireless Commun. Mobile Comput., vol. 13, no. 18, pp. 1587–1611, Dec. 2013, doi:
10.1002/wcm.1203.

4. H. Topcuoglu, S. Hariri, and M.-Y. Wu, ‘‘Performance-effective and low-complexity task scheduling for
heterogeneous computing,’’ IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 3, pp. 260–274, Mar. 2002, doi:
10.1109/71.993206.

5. T. Wang, X. Wei, C. Tang, and J. Fan, ‘‘Efficient multi-tasks scheduling algorithm in mobile cloud computing
with time constraints,’’ Peer-to-Peer Netw. Appl., vol. 11, no. 4, pp. 793–807, 2018, doi: 10.1007/s12083–017-
0561–9.

6. L. Shakkeera and L. Tamilselvan, ‘‘QoS and load balancing aware task scheduling framework for mobile cloud
computing environment,’’ Int. J. Wireless Mobile Comput., vol. 10, no. 4, pp. 309–316 Jan. 2016, doi:
10.1504/IJWMC.2016.078201.

7. H. Liu et al., ‘‘A holistic optimization framework for mobile cloud task scheduling,’’ IEEE Trans. Sustain.
Comput., pp. 1–14, Oct. 2017.doi: 10.1109/TSUSC.2017.2765520.

8. C. L. Hwang and K. Yoon, Multiple Attribute Decision Making. Berlin, Germany: Springer, 1981.

9. K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, ‘‘A fast elitist nondominated sorting genetic algorithm for
multi-objective optimization: NSGA-II,’’ in Proc. Conf. PPSN VI, Paris, France, 2000, pp. 849–858.

www.iaset.us editor@iaset.us