2009 International Conference on Parallel Processing 2009
DOI: 10.1109/icpp.2009.34
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Branch and Bound Algorithm for Workflow QoS Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 6 publications
0
12
0
Order By: Relevance
“…In such situation, cloud service composition allows organizing various software applications and virtualized resources (eg, storage, platforms, and mashup applications) into a set of interacting services to construct cloud services that meet specific quality criteria. Considered as a complex and NP‐hard problem, cloud service composition is an optimization problem introduced for the first time in Zeng et al and Kofler et al…”
Section: Background On Cloud Service Compositionmentioning
confidence: 99%
See 1 more Smart Citation
“…In such situation, cloud service composition allows organizing various software applications and virtualized resources (eg, storage, platforms, and mashup applications) into a set of interacting services to construct cloud services that meet specific quality criteria. Considered as a complex and NP‐hard problem, cloud service composition is an optimization problem introduced for the first time in Zeng et al and Kofler et al…”
Section: Background On Cloud Service Compositionmentioning
confidence: 99%
“…Several approaches have been proposed to solve the cloud service composition problem. These approaches are classified by Jula et al into 5 categories: the first one includes classic algorithms and graph‐based algorithms . The second one contains combinatorial algorithms .…”
Section: Background On Cloud Service Compositionmentioning
confidence: 99%
“…The outlined formal model is based on the system ontology presented in Section 3 and follows the approach developed in [7].…”
Section: Formal Representation Of the Tag Components And Attributesmentioning
confidence: 99%
“…In the process of service selection, the reputation transfer helps to select the least violation-prone services, taking into account proactive measures to avoid SLA violations. Out of all the available services, the client (which is also a service in this case) first filters the best services complying its "happiness criteria" [10]. Then the client compares the credentials from reputation objects of the services.…”
Section: Proposed Model Via Use Case Scenariomentioning
confidence: 99%