Dynamic Resource Provisioning For An Interactive System
Download Dynamic Resource Provisioning For An Interactive System full books in PDF, epub, and Kindle. Read online free Dynamic Resource Provisioning For An Interactive System ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : Shao Wen Acer Lu |
| Publisher | : |
| Total Pages | : 57 |
| Release | : 2009 |
| Genre | : |
| ISBN | : |
In a data centre, server clusters are typically used to provide the required processing capacity to provide acceptable response time performance to interactive applications. The workload of each application may be time-varying. Static allocation to meet peak demand is not an efficient usage of resources. Dynamic resource allocation, on the other hand, can result in efficient resource utilization while meeting the performance goals of individual applications. In this thesis, we develop a new interactive system model where the number of logon users changes over time. Our objective is to obtain results that can be used to guide dynamic resource allocation decisions.
| Author | : Weijie Shi |
| Publisher | : |
| Total Pages | : |
| Release | : 2017-01-26 |
| Genre | : |
| ISBN | : 9781361034217 |
This dissertation, "Online Mechanisms for Dynamic Resource Provisioning in Cloud Computing" by Weijie, Shi, 施維捷, was obtained from The University of Hong Kong (Pokfulam, Hong Kong) and is being sold pursuant to Creative Commons: Attribution 3.0 Hong Kong License. The content of this dissertation has not been altered in any way. We have altered the formatting in order to facilitate the ease of printing and reading of the dissertation. All rights not granted by the above license are retained by the author. Abstract: Auction mechanisms, which have recently attracted substantial attention, are efficient approaches to resource allocation and pricing in cloud computing. In contrast to fixed price policy, auction mechanism can adapt to realtime demand/supply changes, achieving maximal market efficiency and provider revenue. Cloud users arrive in an online fashion, requiring the provider to provision resources on demand, which complicates the design of the mechanism compared with online mechanisms. Although some online mechanisms have been proposed in this field, existing solutions are still not completely satisfactory, especially for heterogeneous types of Virtual Machines (VM) and bandwidth resources. In this thesis, we propose efficient online mechanisms for computational and communication resources provisioning, using techniques of primal-dual optimization and auction theory. We first investigate the online auctions for heterogeneous types of VMs with and without user budget, respectively. For the model without user budget, we propose a truthful online mechanism that timely responds to incoming users' demands and makes dynamic allocation decisions, while guaranteeing system efficiency, using the pricing curve technique. For the model with user budget constraint, we use primal-dual technique to decompose the online combinatorial optimization into a series of independent single-user optimization problems, and solve the single-user problem with randomized auctions. In both solutions, our mechanisms provision different types of VMs dynamically, adjusting the number of instances of VMs to realtime user demand. Next, we turn to bandwidth resource allocation in cloud computing. We novelly exploit the Shapley value in the auction mechanism design, and present the first dynamic pricing mechanism for inter-datacenter on-demand bandwidth. Our auctions, including both online and online version, are expressive enough to accept bids as a at bandwidth rate plus a time duration, or a data volume with a transfer deadline, and achieve approximately efficiency in social welfare. Finally, we combine the computational resources with the communication resources under a unified framework, and propose the first online algorithm for dynamic Virtual Cluster (VC) provisioning and pricing, which optimally places VCs, routes inter-VM traffic and charges a market-driven price for each VC. We use the pricing-curve method to design a social welfare maximizing auction, and then convert it to a revenue maximizing online auction using randomized payment boosting technique. Through theoretical analysis and trace-driven simulations, we rigorously examine the efficiency of our mechanisms comparing with both the theoretical optima and existing solutions. Subjects: Resource allocation - Mathematical models Cloud computing
| Author | : Ching-Hsien Hsu |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 314 |
| Release | : 2010-07-30 |
| Genre | : Computers |
| ISBN | : 3642148212 |
This book constitutes the thoroughly refereed post-conference proceedings of the Second Russia-Taiwan Symposium on Methods and Tools of Parallel Programming, MTPP 2010, held in Vladivostok, Russia in May 2010. The 33 revised full papers were carefully selected from a large number of submissions and cover the many dimensions of methods and tools of parallel programming, algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental approaches as well as commercial components and systems.
| Author | : Samee U. Khan |
| Publisher | : Springer |
| Total Pages | : 1309 |
| Release | : 2015-03-16 |
| Genre | : Computers |
| ISBN | : 1493920928 |
This handbook offers a comprehensive review of the state-of-the-art research achievements in the field of data centers. Contributions from international, leading researchers and scholars offer topics in cloud computing, virtualization in data centers, energy efficient data centers, and next generation data center architecture. It also comprises current research trends in emerging areas, such as data security, data protection management, and network resource management in data centers. Specific attention is devoted to industry needs associated with the challenges faced by data centers, such as various power, cooling, floor space, and associated environmental health and safety issues, while still working to support growth without disrupting quality of service. The contributions cut across various IT data technology domains as a single source to discuss the interdependencies that need to be supported to enable a virtualized, next-generation, energy efficient, economical, and environmentally friendly data center. This book appeals to a broad spectrum of readers, including server, storage, networking, database, and applications analysts, administrators, and architects. It is intended for those seeking to gain a stronger grasp on data center networks: the fundamental protocol used by the applications and the network, the typical network technologies, and their design aspects. The Handbook of Data Centers is a leading reference on design and implementation for planning, implementing, and operating data center networks.
| Author | : Sarah Lynn Bird |
| Publisher | : |
| Total Pages | : 121 |
| Release | : 2014 |
| Genre | : |
| ISBN | : |
Modern computing systems are under intense pressure to provide guaranteed responsiveness to their workloads. Ideally, applications with strict performance requirements should be given just enough resources to meet these requirements consistently, without unnecessarily siphoning resources from other applications. However, executing multiple parallel, real-time applications while satisfying response time requirements is a complex optimization problem and traditionally operating systems have provided little support to provide QoS to applications. As a result, client, cloud, and embedded systems have all resorted to over-provisioning and isolating applications to guarantee responsiveness. Instead, we present PACORA, a resource allocation framework designed to provide responsiveness guarantees to a simultaneous mix of high-throughput parallel, interactive, and real-time applications in an efficient, scalable manner. By measuring application behavior directly and using convex optimization techniques, PACORA is able to understand the resource requirements of applications and perform near-optimal resource allocation--2% from the best allocation in 1.4ms while only requiring a few hundred bytes of storage per application.
| Author | : Management Association, Information Resources |
| Publisher | : IGI Global |
| Total Pages | : 2461 |
| Release | : 2015-11-09 |
| Genre | : Computers |
| ISBN | : 146669467X |
The recent explosion of digital media, online networking, and e-commerce has generated great new opportunities for those Internet-savvy individuals who see potential in new technologies and can turn those possibilities into reality. It is vital for such forward-thinking innovators to stay abreast of all the latest technologies. Web-Based Services: Concepts, Methodologies, Tools, and Applications provides readers with comprehensive coverage of some of the latest tools and technologies in the digital industry. The chapters in this multi-volume book describe a diverse range of applications and methodologies made possible in a world connected by the global network, providing researchers, computer scientists, web developers, and digital experts with the latest knowledge and developments in Internet technologies.
| Author | : Hangwei Qian |
| Publisher | : LAP Lambert Academic Publishing |
| Total Pages | : 132 |
| Release | : 2012 |
| Genre | : |
| ISBN | : 9783659223617 |
Internet is evolving toward service-oriented computing platforms (e.g., cloud computing platforms, such as Amazon EC2 and Microsoft Azure). In these platforms, service providers (owners of the platforms) offer resource pools by building multiple geo-distributed data centers; application providers (owners of the applications) outsource the hosting of their applications to these platforms, and pay by the amount of resources used as utility. These multi-tenant platforms need to dynamically allocate resources to applications so as to meet their demand variation. In this thesis, we address several issues of the dynamic resource management in these platforms. On the one hand, we consider the resource provisioning problems within data centers. In order to allocate resources to applications quickly, we propose deploying ghost virtual machines (VMs) which host spare application instances across the physical machines. When an application needs more instances, we can configure the request distributer to forward requests to ghost VMs, which takes only 5-7 seconds. Also, to deal with the scalability issues in mega data center (with hundreds of thousands of servers), we introduce hierarchical resource management scheme in which servers are divided into groups (pods), each with about 5k servers, and existing techniques are employed to manage resources in each pod efficiently. Meanwhile, multiple strategies are explored to balance the load among the pods. In addition, we also propose a new data center architecture in which we can apply DNS-based mechanism to balance the load among the access links which connect data center to Internet. On the other hand, we address the resource management problems among multiple data centers. We proposed a unified approach to decide in how many/which data centers each application should be deployed, and how client requests are forwarded to the geo-distributed service replicas. We make these decisions based on a min-cost network flow model, and apply a novel demand clustering technique to overcome the scalability issue when solving the min-cost problem. Furthermore, we also introduce a new client-side DNS architecture which brings local DNS server close to clients so that DNS-based server selection can precisely choose close service replicas for clients.
| Author | : Rahman Md. Mahfuzur |
| Publisher | : |
| Total Pages | : 0 |
| Release | : 2016 |
| Genre | : |
| ISBN | : |
To achieve "provisioning elasticity", the cloud needs to manage its available resources on demand. A-priori, static, VM provisioning introduces no runtime overhead but fails to handle unanticipated changes in resource demands. Dynamic provisioning addresses this problem but introduces runtime overhead. To avoid sub-optimal provisioning my PhD thesis adopts a hybrid approach that combines static and dynamic provisioning. The idea is to adapt an initial static placement of VMs in response to evolving load characteristics. My work is focused on broadening the applicability of clouds by looking at how the infrastructure can be more effectively used to support historically atypical applications (e.g. those that are interactive in nature with tighter QoS constraints). To accomplish this I have developed a family of related algorithms that collectively improve resource sharing on physical machines to permit load variation to be better addressed and to lessen the probability of VM interference due to resource contention. The family includes three core dynamic provisioning algorithms. The first algorithm provides for the short-term, controlled sharing of resources between co-hosted VMs, the second identifies pairs (and by extrapolation larger groups) of VMs that are predicted to be "compatible" in terms of the resources they need. This allows the cloud provider to do co-location to make the first algorithm more effective. The final, third, algorithm deals with under-utilized physical machines by re-packing the VMs on those machines while also considering their compatibility. This final algorithm both addresses the possibility of the second algorithm creating underutilized machines as a result of pairing and migration and also handles underutilization arising from "holes" left by the termination of short-duration VMs (another form of atypical VM application). I have also created a surprisingly simple static provisioning algorithm that considers compatibility to minimize VM interference that can be used before my dynamic algorithms. My evaluation is primarily simulation-based though I have also implemented the core algorithms on a small test-bed system to ensure correctness. The results obtained from my simulation experiments suggest that hybrid static and dynamic provisioning approaches are both feasible and should be effective supporting a broad range of applications in cloud environments.
| Author | : Samuel Kounev |
| Publisher | : Springer |
| Total Pages | : 720 |
| Release | : 2017-01-23 |
| Genre | : Computers |
| ISBN | : 331947474X |
This book provides formal and informal definitions and taxonomies for self-aware computing systems, and explains how self-aware computing relates to many existing subfields of computer science, especially software engineering. It describes architectures and algorithms for self-aware systems as well as the benefits and pitfalls of self-awareness, and reviews much of the latest relevant research across a wide array of disciplines, including open research challenges. The chapters of this book are organized into five parts: Introduction, System Architectures, Methods and Algorithms, Applications and Case Studies, and Outlook. Part I offers an introduction that defines self-aware computing systems from multiple perspectives, and establishes a formal definition, a taxonomy and a set of reference scenarios that help to unify the remaining chapters. Next, Part II explores architectures for self-aware computing systems, such as generic concepts and notations that allow a wide range of self-aware system architectures to be described and compared with both isolated and interacting systems. It also reviews the current state of reference architectures, architectural frameworks, and languages for self-aware systems. Part III focuses on methods and algorithms for self-aware computing systems by addressing issues pertaining to system design, like modeling, synthesis and verification. It also examines topics such as adaptation, benchmarks and metrics. Part IV then presents applications and case studies in various domains including cloud computing, data centers, cyber-physical systems, and the degree to which self-aware computing approaches have been adopted within those domains. Lastly, Part V surveys open challenges and future research directions for self-aware computing systems. It can be used as a handbook for professionals and researchers working in areas related to self-aware computing, and can also serve as an advanced textbook for lecturers and postgraduate students studying subjects like advanced software engineering, autonomic computing, self-adaptive systems, and data-center resource management. Each chapter is largely self-contained, and offers plenty of references for anyone wishing to pursue the topic more deeply.
| Author | : Armando Castañeda |
| Publisher | : Springer Nature |
| Total Pages | : 276 |
| Release | : |
| Genre | : |
| ISBN | : 3031673212 |
