ORMaCloud '13Pub Date : 2013-06-17DOI: 10.1145/2465823.2465828
G. Anastasi, E. Carlini, Patrizio Dazzi
{"title":"Smart cloud federation simulations with CloudSim","authors":"G. Anastasi, E. Carlini, Patrizio Dazzi","doi":"10.1145/2465823.2465828","DOIUrl":"https://doi.org/10.1145/2465823.2465828","url":null,"abstract":"In the last few years the broad diffusion of Cloud Computing has encouraged the proliferation of cloud computing providers. However, providers often propose their services using proprietary management software, interfaces and virtualization technologies. This strongly hinders the applications interoperability and migration across providers boundaries. Organizing providers in federations seems promising for addressing such issues, but it introduces other challenges to be faced, often requiring innovative approaches. Unfortunately, the evaluation of new solutions in a repeatable manner and under several configurations is a hard task to achieve using real Clouds platforms. For these reasons we propose SmartFed, a simulator for cloud federations that is able to model the richness typical of an environment with multiple cloud providers. We show the capability of SmartFed by simulating a sample mapping process for assigning applications to providers.","PeriodicalId":125896,"journal":{"name":"ORMaCloud '13","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128154816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ORMaCloud '13Pub Date : 2013-06-17DOI: 10.1145/2465823.2465825
Djawida Dib, N. Parlavantzas, C. Morin
{"title":"Meryn: open, SLA-driven, cloud bursting PaaS","authors":"Djawida Dib, N. Parlavantzas, C. Morin","doi":"10.1145/2465823.2465825","DOIUrl":"https://doi.org/10.1145/2465823.2465825","url":null,"abstract":"PaaS (Platform as a service) systems are revolutionizing the way modern applications are developed and hosted. Current PaaS offerings provide limited support for managing SLAs (Service Level Agreements) that constrain application quality properties, such as response times. To overcome this limitation, PaaS systems should be capable of dynamically adjusting resource allocations to meet provider objectives. At the same time, PaaS systems should retain their extensibility to host diverse application types. In this paper we propose Meryn, an open, SLA-driven, PaaS system that aims at maximizing the provider profit and providing SLA guarantees to diverse application types. Meryn provides support for cloud bursting and applies a decentralized protocol for selecting resources to run applications. This protocol tries to minimize the cost of running applications without affecting their agreed quality properties. We implemented a prototype of the Meryn system and performed a preliminary evaluation. The results show that the effectiveness of Meryn in optimizing the provider profit is very promising.","PeriodicalId":125896,"journal":{"name":"ORMaCloud '13","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130492916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ORMaCloud '13Pub Date : 2013-06-17DOI: 10.1145/2465823.2465827
G. Mencagli, M. Vanneschi
{"title":"Analysis of control-theoretic predictive strategies for the adaptation of distributed parallel computations","authors":"G. Mencagli, M. Vanneschi","doi":"10.1145/2465823.2465827","DOIUrl":"https://doi.org/10.1145/2465823.2465827","url":null,"abstract":"In adaptive distributed parallel applications the adaptation process is based on the ability to change some characteristics of parallel components, such as the parallelism form and the parallelism degree, in response to unexpected execution conditions. Although existing research work has studied this problem, it is of increasing importance to investigate adaptation strategies able to reach important properties like the stability of control decisions, i.e. to guarantee that reconfigurations are effective and durable, and control optimality, expressed by means of cooperative and non-cooperative agreements between decisions of different controllers. These properties are crucial in distributed environments like Grids and Clouds, where reconfigurations imply a cost both in terms of a performance degradation as well as a monetary charge. In this paper we briefly introduce the basic ideas of our methodology and we introduce different adaptation strategies based on alternative formulations of the Model-based Predictive Control technique. First hints about the effectiveness of our approach are discussed through experiments developed in a simulation environment.","PeriodicalId":125896,"journal":{"name":"ORMaCloud '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130918489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ORMaCloud '13Pub Date : 2013-06-17DOI: 10.1145/2465823.2465824
T. Beach, O. Rana, N. J. Avis
{"title":"Integrating acceleration devices using CometCloud","authors":"T. Beach, O. Rana, N. J. Avis","doi":"10.1145/2465823.2465824","DOIUrl":"https://doi.org/10.1145/2465823.2465824","url":null,"abstract":"Application accelerators can include GPUs, cell processors, FPGAs and other custom application specific integrated circuit (ASICs) based devices. A number of challenges arise when these devices must be integrated as part of a single computing environment, relating to both the diversity of devices and the supported programming models. One key challenge we consider here is the selection of the most appropriate device for accelerating a particular application. Our approach makes use of a broker-based matchmaking system, which attempts to compare the capability of a device with one or more application kernels, utilising the CometCloud tuple space-based coordination mechanism to facilitate the matchmaking process. We describe the architecture of our system and how it utilises performance prediction to select devices for particular application kernels. We demonstrate that within a highly dynamic HPC system, our approach can increase the performance of applications by using code porting techniques to the most suitable device found, also; (a) allowing the dynamic addition of new devices to the system, and (b) allowing applications to fall back and utilise the best alternative device available if the preferred device cannot be found or is unavailable.","PeriodicalId":125896,"journal":{"name":"ORMaCloud '13","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123542780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ORMaCloud '13Pub Date : 2013-06-17DOI: 10.1145/2465823.2465826
Alexandra Vintila Filip, Ana Oprescu, T. Kielmann
{"title":"Fast (re-)configuration of mixed on-demand and spot instance pools for high-throughput computing","authors":"Alexandra Vintila Filip, Ana Oprescu, T. Kielmann","doi":"10.1145/2465823.2465826","DOIUrl":"https://doi.org/10.1145/2465823.2465826","url":null,"abstract":"Commercial cloud offerings let users allocate compute resources on demand, charging based on reserved time intervals. Users, however, lack guidance for assembling instance pools from different cloud instance types, in order to control completion time and monetary budget. BaTS, our budget-constrained scheduler uses tiny statistical samples of task executions in order to predict completion times (and associated costs) for given bags of tasks, allowing the user to favor either fast execution or low computation budget. BaTS' estimator, however, can not handle variably-priced spot instances appropriately.\u0000 In this work, we present a new prediction module for BaTS that quickly computes accurate approximations to the Pareto set of mixed on-demand and spot instance pools, based on a genetic algorithm (GA). This new approach allows BaTS to react to changing spot instance prices at runtime by re-configuring the instance pool according to the user's runtime and budget constraints. Simulator-based results show that the GA can approximate the Pareto sets for machine configurations in about 30 seconds time, without noticeable loss of quality, compared to an exact solution, computed offline within 40 to 60 minutes time.","PeriodicalId":125896,"journal":{"name":"ORMaCloud '13","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}