The Grid 2: Blueprint for a New Computing Infrastructure

Edge computing: A survey

As computing infrastructure expands, resource management in a large, heterogeneous, and distributed environment becomes a challenging task. In a cloud environment, with uncertainty and dispersion of resources, one encounters problems of allocation of resources, which is caused by things such as heterogeneity, dynamism, and failures. Unfortunately, existing resource management techniques, frameworks, and mechanisms are insufficient to handle these environments, applications, and resource behaviors. To provide efficient performance of workloads and applications, the aforementioned characteristics should be addressed effectively. This research depicts a broad methodical literature analysis of autonomic resource management in the area of the cloud in general and QoS (Quality of Service)-aware autonomic resource management specifically. The current status of autonomic resource management in cloud computing is distributed into various categories. Methodical analysis of autonomic resource management in cloud computing and its techniques are described as developed by various industry and academic groups. Further, taxonomy of autonomic resource management in the cloud has been presented. This research work will help researchers find the important characteristics of autonomic resource management and will also help to select the most suitable technique for autonomic resource management in a specific application along with significant future research directions.

QoS-Aware Autonomic Resource Management in Cloud Computing: A Systematic Review

Self-adaptive systems tend to be reactive and myopic, adapting in response to changes without anticipating what the subsequent adaptation needs will be. Adapting reactively can result in inefficiencies due to the system performing a suboptimal sequence of adaptations. Furthermore, when adaptations have latency, and take some time to produce their effect, they have to be started with sufficient lead time so that they complete by the time their effect is needed. Proactive latency-aware adaptation addresses these issues by making adaptation decisions with a look-ahead horizon and taking adaptation latency into account. In this paper we present an approach for proactive latency-aware adaptation under uncertainty that uses probabilistic model checking for adaptation decisions. The key idea is to use a formal model of the adaptive system in which the adaptation decision is left underspecified through nondeterminism, and have the model checker resolve the nondeterministic choices so that the accumulated utility over the horizon is maximized. The adaptation decision is optimal over the horizon, and takes into account the inherent uncertainty of the environment predictions needed for looking ahead. Our results show that the decision based on a look-ahead horizon, and the factoring of both tactic latency and environment uncertainty, considerably improve the effectiveness of adaptation decisions.

/pdf/proactive-self-adaptation-under-uncertainty-a-probabilistic-4jbhs9camj.pdf

Proactive self-adaptation under uncertainty: a probabilistic model checking approach

Seamless application execution in mobile cloud computing

Proactive elasticity and energy awareness in data stream processing

This paper addresses the problem of designing scaling strategies for elastic data stream processing. Elasticity allows applications to rapidly change their configuration on-the-fly (e.g., the amount of used resources) in response to dynamic workload fluctuations. In this work we face this problem by adopting the Model Predictive Control technique, a control-theoretic method aimed at finding the optimal application configuration along a limited prediction horizon in the future by solving an online optimization problem. Our control strategies are designed to address latency constraints, using Queueing Theory models, and energy consumption by changing the number of used cores and the CPU frequency through the Dynamic Voltage and Frequency Scaling (DVFS) support available in the modern multicore CPUs. The proactive capabilities, in addition to the latency- and energy-awareness, represent the novel features of our approach. To validate our methodology, we develop a thorough set of experiments on a high-frequency trading application. The results demonstrate the high-degree of flexibility and configurability of our approach, and show the effectiveness of our elastic scaling strategies compared with existing state-of-the-art techniques used in similar scenarios.

/pdf/keep-calm-and-react-with-foresight-strategies-for-low-37wkj7yg0z.pdf

Keep calm and react with foresight: strategies for low-latency and energy-efficient elastic data stream processing

One of the most promising trends for next generation networks is to consider an integrated approach to the communication infrastructure and the processing layer. In particular, the introduction of broadband and reliable wireless networks allows the interaction of a huge number of devices all creating a single network. On the other hand, the grid paradigm is considered as one of the most promising approach for pervasive and dynamic applications. Aim of this paper is to present a novel integrated approach between grid paradigm and wireless networks by highlighting the main advantages of their cooperation. In particular, it will be shown here how a wireless heterogeneous network can be exploited for implementing a pervasive and dynamic grid (mobile grid) and, on the other hand, a mobile grid allows the optimization of the communication infrastructure. The integrated approach can be an effective method for solving applications, such as emergency management, where a huge amount of data derived from a wireless infrastructure needs to be processed efficiently and adaptively, and the traffic flow in the wide area wireless networks needs to be coordinated and optimized. Copyright © 2008 John Wiley & Sons, Ltd.

http://pages.di.unipi.it/mencagli/publications/wmc2008.pdf

Next generation grids and wireless communication networks: towards a novel integrated approach

The topic of Data Stream Processing is a recent and highly active research area dealing with the in-memory, tuple-by-tuple analysis of streaming data. Continuous queries typically consume huge volumes of data received at a great velocity. Solutions that persistently store all the input tuples and then perform off-line computation are impractical. Rather, queries must be executed continuously as data cross the streams. The goal of this paper is to present parallel patterns for window-based stateful operators, which are the most representative class of stateful data stream operators. Parallel patterns are presented "a la" Algorithmic Skeleton, by explaining the rationale of each pattern, the preconditions to safely apply it, and the outcome in terms of throughput, latency and memory consumption. The patterns have been implemented in the $$\mathtt {FastFlow}$$FastFlow framework targeting off-the-shelf multicores. To the best of our knowledge this is the first time that a similar effort to merge the Data Stream Processing domain and the field of Structured Parallelism has been made.

Parallel Patterns for Window-Based Stateful Operators on Data Streams: An Algorithmic Skeleton Approach

High-volume data streams are straining the limits of stream processing frameworks which need advanced parallel processing capabilities to withstand the actual incoming bandwidth. Parallel processing must be synergically integrated with elastic features in order dynamically scale the amount of utilized resources by accomplishing the Quality of Service goals in a cost-effective manner. This paper proposes a control-theoretic strategy to drive the elastic behavior of latency-sensitive streaming operators in distributed environments. The strategy takes scaling decisions in advance by relying on a predictive model-based approach. Our ideas have been experimentally evaluated on a cluster using a real-world streaming application fed by synthetic and real datasets. The results show that our approach takes the strictly necessary reconfigurations while providing reduced resource consumption. Furthermore, it allows the operator to meet desired average latency requirements with a significant reduction in the experienced latency jitter.

Gabriele Mencagli

Papers

Proactive elasticity and energy awareness in data stream processing

Keep calm and react with foresight: strategies for low-latency and energy-efficient elastic data stream processing

Next generation grids and wireless communication networks: towards a novel integrated approach

Parallel Patterns for Window-Based Stateful Operators on Data Streams: An Algorithmic Skeleton Approach

Elastic Scaling for Distributed Latency-Sensitive Data Stream Operators