Randomized algorithms for scheduling VMs in the cloud
We consider the problem of scheduling VMs (Virtual Machines) in a multi-server system motivated by cloud computing applications. VMs arrive dynamically over time and require various amounts of resources (e.g., CPU, Memory, Storage, etc.) for the duration of their service. When a VM arrives, it is qu...
Uloženo v:
| Vydáno v: | IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications s. 1 - 9 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.04.2016
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We consider the problem of scheduling VMs (Virtual Machines) in a multi-server system motivated by cloud computing applications. VMs arrive dynamically over time and require various amounts of resources (e.g., CPU, Memory, Storage, etc.) for the duration of their service. When a VM arrives, it is queued and later served by one of the servers that has sufficient remaining capacity to serve it. The scheduling of VMs is subject to: (i) packing constraints, i.e., multiple VMs can be be served simultaneously by a single server if their cumulative resource requirement does not violate the capacity of the server, and (ii) non-preemption, i.e., once a VM is scheduled in a server, it cannot be interrupted or migrated to another server. To achieve maximum throughput, prior results hinge on solving a hard combinatorial problem (Knapsack) at the instances that all the servers become empty (the so-called global refresh times which require synchronization among the servers). The main contribution of this paper is that it resolves these issues. Specifically, we present a class of randomized algorithms for placing VMs in the servers that can achieve maximum throughput without preemptions. The algorithms are naturally distributed, have low complexity, and each queue needs to perform limited operations. Further, our algorithms display good delay performance in simulations, comparable to delay of heuristics that may not be throughput-optimal, and much better than the delay of the prior known throughput-optimal algorithms. |
|---|---|
| AbstractList | We consider the problem of scheduling VMs (Virtual Machines) in a multi-server system motivated by cloud computing applications. VMs arrive dynamically over time and require various amounts of resources (e.g., CPU, Memory, Storage, etc.) for the duration of their service. When a VM arrives, it is queued and later served by one of the servers that has sufficient remaining capacity to serve it. The scheduling of VMs is subject to: (i) packing constraints, i.e., multiple VMs can be be served simultaneously by a single server if their cumulative resource requirement does not violate the capacity of the server, and (ii) non-preemption, i.e., once a VM is scheduled in a server, it cannot be interrupted or migrated to another server. To achieve maximum throughput, prior results hinge on solving a hard combinatorial problem (Knapsack) at the instances that all the servers become empty (the so-called global refresh times which require synchronization among the servers). The main contribution of this paper is that it resolves these issues. Specifically, we present a class of randomized algorithms for placing VMs in the servers that can achieve maximum throughput without preemptions. The algorithms are naturally distributed, have low complexity, and each queue needs to perform limited operations. Further, our algorithms display good delay performance in simulations, comparable to delay of heuristics that may not be throughput-optimal, and much better than the delay of the prior known throughput-optimal algorithms. |
| Author | Ghaderi, Javad |
| Author_xml | – sequence: 1 givenname: Javad surname: Ghaderi fullname: Ghaderi, Javad |
| BookMark | eNotj0tOwzAUAI1EF1B6Alj4AgnPduzYSxRRqNQSCVG2lT_PjaV8UJIu4PRUalezGY009-S2H3ok5IlBzhiY583Huq7qXc6BqbyUvJBC3ZCVKTUrVCmMkYLdEflp-zB06Q8Dte1xGNPcdBONw0gn32A4tak_0u_dRFNP5wapb4dTeCCLaNsJV1cuyX79-lW9Z9v6bVO9bLPEQc-Z5UJEh0z7wKEAo52JUoFzWoUYbDScgyyYPTugldcIxhnPUbmzqMGIJXm8dBMiHn7G1Nnx93CdEf9cg0Pl |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/INFOCOM.2016.7524536 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9781467399531 1467399531 |
| EndPage | 9 |
| ExternalDocumentID | 7524536 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH CBEJK RIE RIO |
| ID | FETCH-LOGICAL-i208t-a233fbe18cd204098b9f560bb86dfdaf9220541afbe086c8e09b9c2e6bb9f8093 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000390154400207&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Thu Jun 29 18:37:35 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i208t-a233fbe18cd204098b9f560bb86dfdaf9220541afbe086c8e09b9c2e6bb9f8093 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_7524536 |
| PublicationCentury | 2000 |
| PublicationDate | 20160401 |
| PublicationDateYYYYMMDD | 2016-04-01 |
| PublicationDate_xml | – month: 04 year: 2016 text: 20160401 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications |
| PublicationTitleAbbrev | INFOCOM |
| PublicationYear | 2016 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 2.1428564 |
| Snippet | We consider the problem of scheduling VMs (Virtual Machines) in a multi-server system motivated by cloud computing applications. VMs arrive dynamically over... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Cloud computing Complexity theory Delays Heuristic algorithms Knapsack Problem Markov Chains Resource Allocation Servers Stability Throughput Virtual machining |
| Title | Randomized algorithms for scheduling VMs in the cloud |
| URI | https://ieeexplore.ieee.org/document/7524536 |
| WOSCitedRecordID | wos000390154400207&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5t8eBJpRXf5ODRbXezjyTnYtFDH4hKbyWbmdWFdlf68OCvd7K7VAQv3kIYCDNJmPkm82UYuw2NoK1W4CUKJQGUGD2DwnogjLZCgtRWVc0m5GSi5nM9a7G7PRcGEaviM-y7YfWWD6XduVTZQMYiisOkzdpSypqr1bDhAl8PHiej6XA6duVaSb8R_dUzpXIZo6P_LXbMej_cOz7be5UT1sKiy-InAvzlKv9C4Gb5VhKif19tOAWcnNApeQtHKuev4w3PC04hHbfLcgc99jK6fx4-eE3DAy8Xvtp6RoRhlmKgLAi6XFqlOqOIJE1VAhmYTDtWbBQYkiEkYhX6OiWLYpKSoPJ1eMo6RVngGeOxoCMiEoi0y_JEylgZSgvaSh8gE3DOuk7lxUf9p8Wi0fbi7-lLduisWlesXLHOdr3Da3ZgP7f5Zn1TbcQ31xOMQA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFfSk0opvc_DotrvZR5JzsbTYbotU6a1kk6wutLvShwd_vZPtUhG8eAthIMwkYeabzJcBuPclxa3m2om4YQhQQuNIQ5WjqRSKMs2E4mWzCRbHfDoV4xo87Lgwxpiy-My07LB8y9eF2thUWZuFNAj9aA_2wyCg3patVfHhPFe0-3F31BkNbcFW1KqEf3VNKZ1G9_h_y51A84d9R8Y7v3IKNZM3IHxGyF8ssi-jiZy_FYjp3xcrgiEnQXyK_sLSysnrcEWynGBQR9S82OgmvHQfJ52eU7U8cDLq8rUjqe-nifG40hSvl-CJSDEmSRIe6VTLVFhebOBJlEEsorhxRYI2NVGCgtwV_hnU8yI350BCioeERjoQNs8TcKmYz5QWirlap1RfQMOqPPvY_moxq7S9_Hv6Dg57k-FgNujHT1dwZC28rV-5hvp6uTE3cKA-19lqeVtuyjdTjo-H |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE+INFOCOM+2016+-+The+35th+Annual+IEEE+International+Conference+on+Computer+Communications&rft.atitle=Randomized+algorithms+for+scheduling+VMs+in+the+cloud&rft.au=Ghaderi%2C+Javad&rft.date=2016-04-01&rft.pub=IEEE&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1109%2FINFOCOM.2016.7524536&rft.externalDocID=7524536 |