Academic Journal
On the efficiency of several VM provisioning strategies for workflows with multi-threaded tasks on clouds.
| Τίτλος: | On the efficiency of several VM provisioning strategies for workflows with multi-threaded tasks on clouds. |
|---|---|
| Συγγραφείς: | Frincu, Marc1 frincu@usc.edu, Genaud, Stéphane1 genaud@unistra.fr, Gossa, Julien1 julien.gossa@unistra.fr |
| Πηγή: | Computing. Nov2014, Vol. 96 Issue 11, p1059-1086. 28p. |
| Θεματικοί όροι: | *Virtual machine systems, *Workflow management, *Heuristic programming, *Resource allocation, Threads (Computer programs), Cloud computing, Subscription Internet services |
| Περίληψη: | Cloud computing promises the delivery of on-demand pay-per-use access to unlimited resources. Using these resources requires more than a simple access to them as most clients have certain constraints in terms of cost and time that need to be fulfilled. Therefore certain scheduling heuristics have been devised to optimize the placement of client tasks on allocated virtual machines. The applications can be roughly divided in two categories: independent bag-of-tasks and workflows. In this paper we focus on the latter and investigate a less studied problem, i.e., the effect the virtual machine allocation policy has on the scheduling outcome. For this we look at how workflow structure, execution time, virtual machine instance type affect the efficiency of the provisioning method when cost and makespan are considered. To aid our study we devised a mathematical model for cost and makespan in case single or multiple instance types are used. While the model allows us to determine the boundaries for two of our extreme methods, the complexity of workflow applications calls for a more experimental approach to determine the general relation. For this purpose we considered synthetically generated workflows that cover a wide range of possible cases. Results have shown the need for probabilistic selection methods in case small and heterogeneous execution times are used, while for large homogeneous ones the best algorithm is clearly noticed. Several other conclusions regarding the efficiency of powerful instance types as compared to weaker ones, and of dynamic methods against static ones are also made. [ABSTRACT FROM AUTHOR] |
| Copyright of Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
| FullText | Links: – Type: other Text: Availability: 0 CustomLinks: – Url: https://dx.doi.org/doi:10.1007/s00607-014-0410-0 Name: EDS - Springer Nature Journals (s7799221) Category: fullText Text: View record at Springer |
|---|---|
| Header | DbId: bsx DbLabel: Business Source Index An: 99000397 RelevancyScore: 1174 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1173.50390625 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On the efficiency of several VM provisioning strategies for workflows with multi-threaded tasks on clouds. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Frincu%2C+Marc%22">Frincu, Marc</searchLink><relatesTo>1</relatesTo><i> frincu@usc.edu</i><br /><searchLink fieldCode="AR" term="%22Genaud%2C+Stéphane%22">Genaud, Stéphane</searchLink><relatesTo>1</relatesTo><i> genaud@unistra.fr</i><br /><searchLink fieldCode="AR" term="%22Gossa%2C+Julien%22">Gossa, Julien</searchLink><relatesTo>1</relatesTo><i> julien.gossa@unistra.fr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Computing%22">Computing</searchLink>. Nov2014, Vol. 96 Issue 11, p1059-1086. 28p. – Name: Subject Label: Subject Terms Group: Su Data: *<searchLink fieldCode="DE" term="%22Virtual+machine+systems%22">Virtual machine systems</searchLink><br />*<searchLink fieldCode="DE" term="%22Workflow+management%22">Workflow management</searchLink><br />*<searchLink fieldCode="DE" term="%22Heuristic+programming%22">Heuristic programming</searchLink><br />*<searchLink fieldCode="DE" term="%22Resource+allocation%22">Resource allocation</searchLink><br /><searchLink fieldCode="DE" term="%22Threads+%28Computer+programs%29%22">Threads (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Cloud+computing%22">Cloud computing</searchLink><br /><searchLink fieldCode="DE" term="%22Subscription+Internet+services%22">Subscription Internet services</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Cloud computing promises the delivery of on-demand pay-per-use access to unlimited resources. Using these resources requires more than a simple access to them as most clients have certain constraints in terms of cost and time that need to be fulfilled. Therefore certain scheduling heuristics have been devised to optimize the placement of client tasks on allocated virtual machines. The applications can be roughly divided in two categories: independent bag-of-tasks and workflows. In this paper we focus on the latter and investigate a less studied problem, i.e., the effect the virtual machine allocation policy has on the scheduling outcome. For this we look at how workflow structure, execution time, virtual machine instance type affect the efficiency of the provisioning method when cost and makespan are considered. To aid our study we devised a mathematical model for cost and makespan in case single or multiple instance types are used. While the model allows us to determine the boundaries for two of our extreme methods, the complexity of workflow applications calls for a more experimental approach to determine the general relation. For this purpose we considered synthetically generated workflows that cover a wide range of possible cases. Results have shown the need for probabilistic selection methods in case small and heterogeneous execution times are used, while for large homogeneous ones the best algorithm is clearly noticed. Several other conclusions regarding the efficiency of powerful instance types as compared to weaker ones, and of dynamic methods against static ones are also made. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=99000397 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s00607-014-0410-0 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 28 StartPage: 1059 Subjects: – SubjectFull: Virtual machine systems Type: general – SubjectFull: Workflow management Type: general – SubjectFull: Heuristic programming Type: general – SubjectFull: Resource allocation Type: general – SubjectFull: Threads (Computer programs) Type: general – SubjectFull: Cloud computing Type: general – SubjectFull: Subscription Internet services Type: general Titles: – TitleFull: On the efficiency of several VM provisioning strategies for workflows with multi-threaded tasks on clouds. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Frincu, Marc – PersonEntity: Name: NameFull: Genaud, Stéphane – PersonEntity: Name: NameFull: Gossa, Julien IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov2014 Type: published Y: 2014 Identifiers: – Type: issn-print Value: 0010485X Numbering: – Type: volume Value: 96 – Type: issue Value: 11 Titles: – TitleFull: Computing Type: main |
| ResultId | 1 |