File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TNET.2017.2781200
- Scopus: eid_2-s2.0-85040545489
- WOS: WOS:000425324000032
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Scheduling Frameworks for Cloud Container Services
Title | Scheduling Frameworks for Cloud Container Services |
---|---|
Authors | |
Keywords | Approximation algorithms Cloud computing Compact exponential optimization Scheduling |
Issue Date | 2018 |
Publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=90 |
Citation | IEEE/ACM Transactions on Networking, 2018, v. 26 n. 1, p. 436-450 How to Cite? |
Abstract | Compared with traditional virtual machines, cloud containers are more flexible and lightweight, emerging as the new norm of cloud resource provisioning. We exploit this new algorithm design space, and propose scheduling frameworks for cloud container services. Our offline and online schedulers permit partial execution, and allow a job to specify its job deadline, desired cloud containers, and inter-container dependence relations. We leverage the following classic and new techniques in our scheduling algorithm design. First, we apply the compact-exponential technique to express and handle nonconventional scheduling constraints. Second, we adopt the primal-dual framework that determines the primal solution based on its dual constraints in both the offline and online algorithms. The offline scheduling algorithm includes a new separation oracle to separate violated dual constraints, and works in concert with the randomized rounding technique to provide a near-optimal solution. The online scheduling algorithm leverages the online primal-dual framework with a learning-based scheme for obtaining dual solutions. Both theoretical analysis and trace-driven simulations validate that our scheduling frameworks are computationally efficient and achieve close-to-optimal aggregate job valuation. |
Persistent Identifier | http://hdl.handle.net/10722/259906 |
ISSN | 2023 Impact Factor: 3.0 2023 SCImago Journal Rankings: 2.034 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, R | - |
dc.contributor.author | Li, Z | - |
dc.contributor.author | Wu, C | - |
dc.date.accessioned | 2018-09-03T04:16:16Z | - |
dc.date.available | 2018-09-03T04:16:16Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | IEEE/ACM Transactions on Networking, 2018, v. 26 n. 1, p. 436-450 | - |
dc.identifier.issn | 1063-6692 | - |
dc.identifier.uri | http://hdl.handle.net/10722/259906 | - |
dc.description.abstract | Compared with traditional virtual machines, cloud containers are more flexible and lightweight, emerging as the new norm of cloud resource provisioning. We exploit this new algorithm design space, and propose scheduling frameworks for cloud container services. Our offline and online schedulers permit partial execution, and allow a job to specify its job deadline, desired cloud containers, and inter-container dependence relations. We leverage the following classic and new techniques in our scheduling algorithm design. First, we apply the compact-exponential technique to express and handle nonconventional scheduling constraints. Second, we adopt the primal-dual framework that determines the primal solution based on its dual constraints in both the offline and online algorithms. The offline scheduling algorithm includes a new separation oracle to separate violated dual constraints, and works in concert with the randomized rounding technique to provide a near-optimal solution. The online scheduling algorithm leverages the online primal-dual framework with a learning-based scheme for obtaining dual solutions. Both theoretical analysis and trace-driven simulations validate that our scheduling frameworks are computationally efficient and achieve close-to-optimal aggregate job valuation. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=90 | - |
dc.relation.ispartof | IEEE/ACM Transactions on Networking | - |
dc.rights | IEEE/ACM Transactions on Networking. Copyright © Institute of Electrical and Electronics Engineers. | - |
dc.subject | Approximation algorithms | - |
dc.subject | Cloud computing | - |
dc.subject | Compact exponential optimization | - |
dc.subject | Scheduling | - |
dc.title | Scheduling Frameworks for Cloud Container Services | - |
dc.type | Article | - |
dc.identifier.email | Wu, C: cwu@cs.hku.hk | - |
dc.identifier.authority | Wu, C=rp01397 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/TNET.2017.2781200 | - |
dc.identifier.scopus | eid_2-s2.0-85040545489 | - |
dc.identifier.hkuros | 288748 | - |
dc.identifier.volume | 26 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 436 | - |
dc.identifier.epage | 450 | - |
dc.identifier.isi | WOS:000425324000032 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1063-6692 | - |