Search

Cloud computing offers the flexibility to dynamically size the infrastructure in response to changes in workload demand. While both horizontal scaling and vertical scaling of infrastructure are supported by major cloud providers, these scaling options differ significantly in terms of their cost, provisioning time, and their impact on workload performance. Importantly, the efficacy of horizontal and vertical scaling critically depends on the workload characteristics, such as the workload’s parallelizability and its core scalability. In today’s cloud systems, the scaling decision is left to the users, requiring them to fully understand the trade-offs associated with the different scaling options. In this paper, we present our solution for optimizing the resource scaling of cloud deployments via implementation in OpenStack. The key component of our solution is the modeling engine that characterizes the workload and then quantitatively evaluates different scaling options for that workload. Our modeling engine leverages Amdahl’s Law to model service timescaling in scale-up environments and queueing-theoretic concepts to model performance scaling in scale-out environments. We further employ Kalman filtering to account for inaccuracies in the model-based methodology and to dynamically track changes in the workload and cloud environment. [ABSTRACT FROM AUTHOR]

Abstract: This paper is motivated by study of the economics of Quality of Service (QoS) of congestible services. We introduce a queueing game framework to study such problems. We consider multiple competing providers, each offering a queued service. Users are sensitive to both access price and expected delay, and pick providers with the smallest price plus delay cost. We study equilibrium of the pricing (Bertrand) game between the congestible network service providers. We establish the existence of a Nash equilibrium under some natural assumptions. We then consider a setting with multiple classes of differentiated service. Differentiated Services (DiffServ) technologies of the Internet that can provide QoS guarantees have failed to catch on, primarily due to economic impediments. Each provider is now modeled as operating a multi-class queue. We provide sufficient conditions for the existence of a Nash equilibrium in the Bertrand (pricing) game between the providers. We characterize the inefficiency (price of anarchy) due to strategic pricing to be 2/3. Surprisingly, the price of anarchy for the multi-class setting is the same as for the single-class setting. [Copyright &y& Elsevier]

Complex analytics queries often involve expensive operations that may require large computational runtimes leading to slow query responsiveness and hampering real-time performance. Moreover, running these expensive analytics queries inside traditional online transaction processing (OLTP) systems for real-time analytics can affect the performance of mission-critical OLTP queries. On the other hand, support for real-time analytics is considered vital for important business insights and improved market responsiveness. In this paper, we try to address the needs of real-time analytics by enabling hardware acceleration of complex database query operations such as predicate evaluation, sort and projection. While projection helps reduce the amount of data being processed by subsequent query operations, sort is central to most database queries, even those not involving an explicit sort operation. Our system involves FPGA-based composable accelerator for offloading the analytics queries from the host CPU running the OLTP workload. The FPGA-accelerated database system contains accelerator kernels for various database operations and automatic transformation of query operations into calls to these hardware kernels for seamless integration of the accelerator into the database system. Based on the query semantics, each accelerator kernel can be tailored by software to execute specific database operations and different kernels can be fused together to compose a query accelerator. Our query transformation algorithm creates a query-specific control block to customize the accelerator without requiring FPGA-reconfiguration. [ABSTRACT FROM AUTHOR]

Businesses are experiencing a growing need for performing real-time analytics on ever-increasing enterprise data. While providing useful business insights and improved market responsiveness, analytics also adds a computational burden on traditional online transaction processing (OLTP) systems and could adversely affect the performance of OLTP workloads. The authors present a highly pipelined, high-throughput query-processing engine on a field-programmable gate array (FPGA) to offload expensive queries for database analytics. The proposed solution provides a mechanism for a database management system (DBMS) to seamlessly harness the FPGA accelerator without requiring any changes in the application or the existing data layout. The authors' system, which uses an off-the-shelf server and a PCIe-attached FPGA card and is integrated into a commercial DBMS platform, achieves an order-of-magnitude speedup on various real-life queries. [ABSTRACT FROM PUBLISHER]