2017
DOI: 10.1002/cpe.4214
|View full text |Cite
|
Sign up to set email alerts
|

Balanced task allocation in the on‐demand computing‐based transaction processing system using social spider optimization

Abstract: Summary Balanced task allocation is one of the methods that can be used to maximize the performance and reliability in the on‐demand computing‐based transaction processing system. On‐demand computing is an increasingly popular enterprise model. It provides computing resources to the user as needed, which may be maintained within the user's enterprise, or made available by a service provider. The balanced task allocation in such environment is known to be an NP hard. The reliability is a measure of trustworthin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 47 publications
0
7
0
Order By: Relevance
“…The spider location or else position is indicated as x. The weight of spider z j is given in Equation (12).…”
Section: Sso Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The spider location or else position is indicated as x. The weight of spider z j is given in Equation (12).…”
Section: Sso Algorithmmentioning
confidence: 99%
“…11 The SSO procedure mainly depends on the socialarachnids characteristics. 12,13 There exist dual diverse creepy crawlies (search agents) namely: male as well as females. 14,15 This paper is outlined as, subdivision 2 represents the literature survey also subdivision 2.1 is the problem identification.…”
Section: Introductionmentioning
confidence: 99%
“…A unique swarm calculation, in particular, the SSO is displayed for realizing optimization assignments . The SSO procedure depends on the simulation of agreeable conduct of social‐arachnids …”
Section: Introductionmentioning
confidence: 99%
“…12 The SSO procedure depends on the simulation of agreeable conduct of social-arachnids. 13 In the introduced procedure, entities compete with a collection of insects that associate with one another dependent on the organic laws of the supportive colony. 14 The procedure thinks about dual various search agents (creepy crawlies): guys and females.…”
Section: Introductionmentioning
confidence: 99%
“…Scheduling in such distributed systems is not easy. In the literature, there are several scheduling techniques available,() which optimize one or more characteristic parameters such as makespan, turnaround time, reliability,() and availability. Scheduling in such environment is of two types: static scheduling and dynamic scheduling.…”
Section: Introductionmentioning
confidence: 99%