20 research outputs found
Predicting large scale fine grain energy consumption
Today a large volume of energy-related data have been continuously collected. Extracting actionable knowledge from such data is a multi-step process that opens up a variety of interesting and novel research issues across two domains: energy and computer science. The computer science aim is to provide energy scientists with cutting-edge and scalable engines to effectively support them in their daily research activities. This paper presents SPEC, a scalable and distributed predictor of fine grain energy consumption in buildings. SPEC exploits a data stream methodology analysis over a sliding time window to train a prediction model tailored to each building. The building model is then exploited to predict the upcoming energy consumption at a time instant in the near future. SPEC currently integrates the artificial neural networks technique and the random forest regression algorithm. The SPEC methodology exploits the computational advantages of distributed computing frameworks as the current implementation runs on Spark. As a case study, real data of thermal energy consumption collected in a major city have been exploited to preliminarily assess the SPEC accuracy. The initial results are promising and represent a first step towards predicting fine grain energy consumption over a sliding time window
A Bag-of-Tasks Scheduler Tolerant to Temporal Failures in Clouds
Cloud platforms have emerged as a prominent environment to execute high
performance computing (HPC) applications providing on-demand resources as well
as scalability. They usually offer different classes of Virtual Machines (VMs)
which ensure different guarantees in terms of availability and volatility,
provisioning the same resource through multiple pricing models. For instance,
in Amazon EC2 cloud, the user pays per hour for on-demand VMs while spot VMs
are unused instances available for lower price. Despite the monetary
advantages, a spot VM can be terminated, stopped, or hibernated by EC2 at any
moment.
Using both hibernation-prone spot VMs (for cost sake) and on-demand VMs, we
propose in this paper a static scheduling for HPC applications which are
composed by independent tasks (bag-of-task) with deadline constraints. However,
if a spot VM hibernates and it does not resume within a time which guarantees
the application's deadline, a temporal failure takes place. Our scheduling,
thus, aims at minimizing monetary costs of bag-of-tasks applications in EC2
cloud, respecting its deadline and avoiding temporal failures. To this end, our
algorithm statically creates two scheduling maps: (i) the first one contains,
for each task, its starting time and on which VM (i.e., an available spot or
on-demand VM with the current lowest price) the task should execute; (ii) the
second one contains, for each task allocated on a VM spot in the first map, its
starting time and on which on-demand VM it should be executed to meet the
application deadline in order to avoid temporal failures. The latter will be
used whenever the hibernation period of a spot VM exceeds a time limit.
Performance results from simulation with task execution traces, configuration
of Amazon EC2 VM classes, and VMs market history confirms the effectiveness of
our scheduling and that it tolerates temporal failures
Fuzzy Hybrid Approach for Ranking and Selecting Services in Cloud-based Marketplaces
Background and Objective: The popularity cloud computing has led to the proliferation of services that are commoditized and traded
on cloud e-marketplaces. Besides, userâs cloud service requirements-QoS preferences and aspiration are often shrouded in vagueness
and subjectivity. Therefore, cloud service selection can be overwhelming and lead to service choice overload. Existing cloud service
selection approaches rarely provide mechanisms to elicit both the QoS preferences and aspirations, but rather considers either of them.
This study aimed to design fuzzy-based model for service selection in e-market places that articulates both QoS preferences and
aspirations. Materials and Methods: This model comprised a fuzzy Analytic Hierarchy Process (AHP) method for deriving relative priority
weights of QoS attributes, a fuzzy decision-making method for obtaining userâs QoS aspiration values and a fuzzy multi-objective
optimization module for evaluating the services with respect to user requirements. A simulated experiment was conduct using publicly
QoS dataset and ranking accuracy produced by the proposed approach compared to existing methods was measured using Normalize
Discounted Cumulative Gain (NCDG) metric. Results: The descriptive and inferential analyses of the ranking results from both versions
of the proposed approach produce better accuracy results based on the NCDG metric and were in all cases closer to the benchmark metric
than the other two existing methods used in this simulation. Conclusion: Results from current simulation experiment showed that the
ranking accuracy of this model is not compromised by subjective QoS information from users and this approach is applicable use the
subjective QoS requirements of userâs in ranking services in the cloud e-marketplaces
Prediction, Recommendation and Group Analytics Models in the domain of Mashup Services and Cyber-Argumentation Platform
Mashup application development is becoming a widespread software development practice due to its appeal for a shorter application development period. Application developers usually use web APIs from different sources to create a new streamlined service and provide various features to end-users. This kind of practice saves time, ensures reliability, accuracy, and security in the developed applications. Mashup application developers integrate these available APIs into their applications. Still, they have to go through thousands of available web APIs and chose only a few appropriate ones for their application. Recommending relevant web APIs might help application developers in this situation. However, very low API invocation from mashup applications creates a sparse mashup-web API dataset for the recommendation models to learn about the mashups and their web API invocation pattern. One research aims to analyze these mashup-specific critical issues, look for supplemental information in the mashup domain, and develop web API recommendation models for mashup applications. The developed recommendation model generates useful and accurate web APIs to reduce the impact of low API invocations in mashup application development.
Cyber-Argumentation platform also faces a similarly challenging issue. In large-scale cyber argumentation platforms, participants express their opinions, engage with one another, and respond to feedback and criticism from others in discussing important issues online. Argumentation analysis tools capture the collective intelligence of the participants and reveal hidden insights from the underlying discussions. However, such analysis requires that the issues have been thoroughly discussed and participantâs opinions are clearly expressed and understood. Participants typically focus only on a few ideas and leave others unacknowledged and underdiscussed. This generates a limited dataset to work with, resulting in an incomplete analysis of issues in the discussion. One solution to this problem would be to develop an opinion prediction model for cyber-argumentation. This model would predict participantâs opinions on different ideas that they have not explicitly engaged.
In cyber-argumentation, individuals interact with each other without any group coordination. However, the implicit group interaction can impact the participating user\u27s opinion, attitude, and discussion outcome. One of the objectives of this research work is to analyze different group analytics in the cyber-argumentation environment. The objective is to design an experiment to inspect whether the critical concepts of the Social Identity Model of Deindividuation Effects (SIDE) are valid in our argumentation platform. This experiment can help us understand whether anonymity and group sense impact user\u27s behavior in our platform. Another section is about developing group interaction models to help us understand different aspects of group interactions in the cyber-argumentation platform.
These research works can help develop web API recommendation models tailored for mashup-specific domains and opinion prediction models for the cyber-argumentation specific area. Primarily these models utilize domain-specific knowledge and integrate them with traditional prediction and recommendation approaches. Our work on group analytic can be seen as the initial steps to understand these group interactions
Feature-Model-Guided Online Learning for Self-Adaptive Systems
A self-adaptive system can modify its own structure and behavior at runtime
based on its perception of the environment, of itself and of its requirements.
To develop a self-adaptive system, software developers codify knowledge about
the system and its environment, as well as how adaptation actions impact on the
system. However, the codified knowledge may be insufficient due to design time
uncertainty, and thus a self-adaptive system may execute adaptation actions
that do not have the desired effect. Online learning is an emerging approach to
address design time uncertainty by employing machine learning at runtime.
Online learning accumulates knowledge at runtime by, for instance, exploring
not-yet executed adaptation actions. We address two specific problems with
respect to online learning for self-adaptive systems. First, the number of
possible adaptation actions can be very large. Existing online learning
techniques randomly explore the possible adaptation actions, but this can lead
to slow convergence of the learning process. Second, the possible adaptation
actions can change as a result of system evolution. Existing online learning
techniques are unaware of these changes and thus do not explore new adaptation
actions, but explore adaptation actions that are no longer valid. We propose
using feature models to give structure to the set of adaptation actions and
thereby guide the exploration process during online learning. Experimental
results involving four real-world systems suggest that considering the
hierarchical structure of feature models may speed up convergence by 7.2% on
average. Considering the differences between feature models before and after an
evolution step may speed up convergence by 64.6% on average. [...
Quality-of-Service-Aware Service Selection in Mobile Environments
The last decade is characterized by the rise of mobile technologies (UMTS, LTE, WLAN, Bluetooth, SMS, etc.) and devices (notebooks, tablets, mobile phones, smart watches, etc.). In this rise, mobiles phones have played a crucial role because they paved the way for mobile pervasion among the public. In addition, this development has also led to a rapid growth of the mobile service/application market (Statista 2017b). As a consequence, users of mobile devices nowadays find themselves in a mobile environment, with (almost) unlimited access to information and services from anywhere through the Internet, and can connect to other people at any time (cf. Deng et al. 2016; Newman 2015). Additionally, modern mobile devices offer the opportunity to select the services or information that best fit to a userâs current context.
In this regard, mobile information services support users in retrieving context and non-context information, such as about the current traffic situation, public transport options, and flight connections, as well as about real-world entities, such as sights, museums, and restaurants (cf. Deng et al. 2016; Heinrich and Lewerenz 2015; Ventola 2014). An example of the application of mobile information services is several users planning a joint city day trip. Here, the users could utilize information retrieved about real-world entities for their planning. Such a trip constitutes a process with multiple participating users and may encompass actions such as visiting a museum and having lunch. For each action, mobile information services (e.g., Yelp, TripAdvisor, Google Places) can help locate available alternatives that differ only in attributes such as price, average length of stay (i.e., duration), or recommendations published by previous visitors. In addition, context information (e.g., business hours, distance) can be used to more effectively support the users in their decisions. Moreover, because multiple users are participating in the same trip, some users want to or must conduct certain actions together.
However, decision-makers (e.g., mobile users) attempting to determine the optimal solution for such processes â meaning the best alternative for each action and each participating user â are confronted with several challenges, as shown by means of the city trip example: First, each user most likely has his or her own preferences and requirements regarding attributes such as price and duration, which all must be considered. Furthermore, for each action of the day trip, a huge number of alternatives probably exist. Thus, users might face difficulties selecting the optimal alternatives because of an information overload problem (Zhang et al. 2009). Second, taking multiple users into account may require the coordination of their actions because of potential dependencies among different usersâ tours, which, for example, is the case when users prefer to conduct certain actions together. This turns the almost sophisticated decision problem at hand into a problem of high complexity. The problem complexity is increased further when considering context information, because this causes dependencies among different actions of a user that must be taken into account. For instance, the distance to cover by a user to reach a certain restaurant depends on the location of the previously visited museum. In conclusion, it might be impossible for a user to determine an optimal city trip tour for all users, making decision support by an information system necessary. Because the available alternatives for each action of the process can be denoted as (information) service objects (cf. Dannewitz et al. 2008; Heinrich and Lewerenz 2015; Hinkelmann et al. 2013), the decision problem at hand is a Quality-of-Service (QoS)-aware service selection problem.
This thesis proposes novel concepts and optimization approaches for QoS-aware service selection regarding processes with multiple users and context information, focusing on scenarios in mobile environments. In this respect, the developed multi user context-aware service selection approaches are able to deal with dependencies among different usersâ service compositions, which result from the consideration of multiple users, as well as dependencies within a userâs service composition, which result from the consideration of context information. Consequently, these approaches provide suitable support for decision-makers, such as mobile users
A Hibernation Aware Dynamic Scheduler for Cloud Environments
International audienceNowadays, cloud platforms usually offer several types of Virtual Machines (VMs) which have different guarantees in terms of availability and volatility, provisioning the same resource through multiple pricing models. For instance, in the Amazon EC2 cloud, the user pays per hour for on-demand VMs while spot VMs are unused instances available for a lower price. Despite the monetary advantages, a spot VM can be terminated or hibernated by EC2 at any moment. In this work, we propose the Hibernation-Aware Dynamic Scheduler (HADS), to schedule applications composed of independent tasks (bag-of-tasks) with deadline constraints in both hibernation-prone spot VMs (for cost sake) and on-demand VMs. We also consider the problem of temporal failures, that occurs when a spot VM hibernates, and does not resume within a time that guarantees the application's deadline. Our dynamic scheduling approach aims at minimizing the monetary costs of bag-of-tasks applications execution, respecting its deadline even in the presence of hibernation. It is also able to avoid temporal failures, by using task migration and work-stealing techniques. Experimental results with real executions using Amazon EC2 VMs confirm the effectiveness of our scheduling when compared with on-demand VM only based approaches, in terms of monetary costs and execution times. It is also shown that our strategy can tolerate temporal failures