A Cloud Reservation System for Big Data Applications

• Published in: IEEE transactions on parallel and distributed systems Vol. 28; no. 3; pp. 606 - 618
• Main Authors: Marinescu, Dan C., Paya, Ashkan, Morrison, John P.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Associations; Big Data; Big data applications; Cloud computing; cloud resource management; coalition formation; Combinatorial analysis; combinatorial auctions; Computers; Data management; Dependence; Google; hierarchical organization; Organizations; Resource allocation; Resource management; Servers; Workflow
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2016.2594783

Emerging Big Data applications increasingly require resources beyond those available from a single server and may be expressed as a complex workflow of many components and dependency relationships-each component potentially requiring its own specific, and perhaps specialized, resources for its execution. Efficiently supporting this type of Big Data application is a challenging resource management problem for existing cloud environments. In response, we propose a two-stage protocol for solving this resource management problem. We exploit spatial locality in the first stage by dynamically forming rack-level coalitions of servers to execute a workflow component. These coalitions only exist for the duration of the execution of their assigned component and are subsequently disbanded, allowing their resources to take part in future coalitions. The second stage creates a package of these coalitions, designed to support all the components in the complete workflow. To minimize the communication and housekeeping overhead needed to form this package of coalitions, the technique of combinatorial auctions is adapted from market-based resource allocation. This technique has a considerably lower overhead for resource aggregation than the traditional hierarchically organized models. We analyze two strategies for coalition formation: the first, history-based uses information from past auctions to pre-form coalitions in anticipation of predicted demand; the second one is a just-in-time-that builds coalitions only when support for specific workflow components is requested.