{"title":"vfcBOX: multi-user consistent file sharing","authors":"Jean-Pierre Ramos, L. Veiga, P. Ferreira","doi":"10.1145/2089002.2089007","DOIUrl":"https://doi.org/10.1145/2089002.2089007","url":null,"abstract":"The emerging of cloud file sharing systems has been motivated by real user needs for data sharing. There are many solutions providing such sharing support all having the common goal of being widely scalable while providing users with consistent shared data. However, offering consistent data is at odds with scalability as it requires many messages and available network bandwith for file transfer.\u0000 Network bandwidth can be minimized using several techniques such as compression, deduplication[10], delta encoding[9], etc. However, these approaches do not take into account that not all files must be fully consistent at all times for all users.\u0000 In this paper we further increase the scalability of a cloud file sharing system, called vfcBOX, by taking into account the notion of users interest. This means that vfcBOX considers users' consistency needs regarding shared files, to avoid sending useless (or unnecessary) data through the network. As a matter of fact, some files do not need to be constantly propagated to all users, because some of them do not require such immediacy given the particular semantics of the shared data.\u0000 vfcBOX uses not only deduplication techniques to minimize network usage but also a consistency model that takes into account the users' interests. The result is a scalable and efficient cloud file sharing system that fulfills users needs regarding data sharing.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117085292","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}
{"title":"Understanding scheduling implications for scientific applications in clouds","authors":"Giacomo V. Mc Evoy, B. Schulze","doi":"10.1145/2089002.2089005","DOIUrl":"https://doi.org/10.1145/2089002.2089005","url":null,"abstract":"This paper explores some of the effects that the paradigm of Cloud Computing has on schedulers when executing scientific applications. We present premises regarding to provisioning and architectural aspects of a Cloud infrastructure, that are not present in other environments, and which implications they may have on scheduling decisions in presence of relevant policies like improving performance. We also argue that using virtualization as a mechanism for workload consolidation in a multi-core environment has important performance consequences for e-science. We propose and test a preliminary workload classification, based on usage modes, that may improve early scheduling decisions as we research towards automatic deployment of scientific applications.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124531872","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}
Daniel Guimaraes do Lago, E. Madeira, L. Bittencourt
{"title":"Power-aware virtual machine scheduling on clouds using active cooling control and DVFS","authors":"Daniel Guimaraes do Lago, E. Madeira, L. Bittencourt","doi":"10.1145/2089002.2089004","DOIUrl":"https://doi.org/10.1145/2089002.2089004","url":null,"abstract":"This paper presents a virtual machine scheduling algorithm for Cloud Computing based on Green Computing concepts. The goal of this algorithm is the minimization of energy consumption in task executions in a cloud computing environment. This algorithm uses some features like shutdown of underutilized hosts, migration of loads of hosts that are operating below a certain threshold, and DVFS. It also applies the concept of active cooling control in order to minimize power consumption. The choice of which host will receive load is based on the concept of higher energy efficiency from the hosts, which is given by the ratio of MIPS by the energy consumed of each host. Results from simulation of this algorithm confronted with other surveyed algorithms have shown that it can improve the power consumption in clouds composed of heterogeneous datacenters while being equivalent to the best algorithms in homogeneous datacenters.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124201168","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}
{"title":"A hybrid fault tolerance scheme for EasyGrid MPI applications","authors":"J. A. D. Silva, Vinod E. F. Rebello","doi":"10.1145/2089002.2089006","DOIUrl":"https://doi.org/10.1145/2089002.2089006","url":null,"abstract":"Writing applications capable of executing efficiently in distributed systems is extremely difficult and tedious for inexperienced users. The resources may be heterogeneous, non-dedicated, and offered without any performance or availability guarantees. Systems capable of adapting the execution of an application to these characteristics are essential. The EasyGrid Application Management System (AMS) transforms cluster-based MPI applications into autonomic ones capable executing robustly and efficiently in distributed environments. This work describes a strategy to endow these autonomic MPI applications with the property of self-healing and thus be capable of withstanding multiple simultaneous crash faults of processes and/or processors. The extremely low intrusion cost of the proposed hybrid solution might now facilitate acceptance of fault tolerance techniques in large scale high performance applications.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129156506","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}
{"title":"A scheduling model for workflows on grids and clouds","authors":"H. Kloh, B. Schulze, A. Mury, R. Pinto","doi":"10.1145/1890799.1890802","DOIUrl":"https://doi.org/10.1145/1890799.1890802","url":null,"abstract":"This paper presents a set of comparisons of the performance of a bi-criteria scheduling algorithm for Workflows with Quality of Service (QoS) support. This work serves as basis to implement a bi-criteria hybrid scheduling algorithm for workflows with QoS support, aiming to optimize the criteria chosen by the users and based on the priority ordering and relaxation specified by them. Analyzing the comparisons and obtained results, indicates a performance improvement when adopting the model proposed in this paper.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128408486","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}
{"title":"CRM-OO-VM: a checkpointing-enabled Java VM for efficient and reliable e-science applications in grids","authors":"Tiago Garrochinho, L. Veiga","doi":"10.1145/1890799.1890800","DOIUrl":"https://doi.org/10.1145/1890799.1890800","url":null,"abstract":"Object-oriented programming languages are in current days, the dominant paradigm of application development (mostly Java and .NET languages). Recently, increasingly more Java applications have long (or very long) execution times and manipulate large amounts of data/information, gaining relevance in fields related with e-Science (with Grid and Cloud computing). Significant examples include chemistry, computational biology and bio-informatics, with many available Java-based APIs (e.g., Neobio).\u0000 Often, when the execution of one of those applications is terminated abruptly due to a failure (regardless of it being caused by hardware of software fault, lack of available resources,...), all of its work already carried out is simply lost and, when the application is later re-executed, it has to restart its work from scratch, wasting resources and time, and being prone to another failure, to delay its completion with no deadline guarantees.\u0000 A possible solution to solve these problems, is through mechanisms of checkpoint and migration. This makes applications more robust and flexible by being able to move to other nodes, without intervention from the programmer. This article provides a solution to Java applications with long execution times, by incorporating such mechanisms in a Java VM (JikesRVM).","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114638406","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}
BuddhikaDe Alwis, Supun Malinga, P. Kathiravelu, Denis Weerasiri, S. Perera, V. Nanayakkara
{"title":"Mooshabaya: mashup generator for XBaya","authors":"BuddhikaDe Alwis, Supun Malinga, P. Kathiravelu, Denis Weerasiri, S. Perera, V. Nanayakkara","doi":"10.1145/1890799.1890807","DOIUrl":"https://doi.org/10.1145/1890799.1890807","url":null,"abstract":"Visual composition of workflows enables end user to visually depict the workflow as a graph of activities in a process. Tools that support visual composition translate those visual models to traditional workflow languages such as BPEL and execute them thus freeing the end user of the need of knowing workflow languages. Mashups on the other hand, provide a lightweight mechanism for ordinary user centric service composition and creation, hence considered to have an active role in the web 2.0 paradigm. In this paper, we extend a visual workflow composition tool to support mashups, thus providing a comprehensive tooling platform for mashup development backed up by workflow style modeling capabilities, while expanding the reach of the workflow domain into web 2.0 resources with the potential of the mashups. Furthermore, our work opens up a new possibility of converging the mashup domain and workflow domain, thus capturing beneficial aspects from each domain.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125962852","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}
D. Oliveira, F. Porto, G. Giraldi, B. Schulze, R. Pinto
{"title":"Optimizing the pre-processing of scientific visualization techniques using QEF","authors":"D. Oliveira, F. Porto, G. Giraldi, B. Schulze, R. Pinto","doi":"10.1145/1890799.1890805","DOIUrl":"https://doi.org/10.1145/1890799.1890805","url":null,"abstract":"Scientific Visualization is a computer-based field concerned with techniques that allow scientists to create graphical representations from datasets generated by computational simulations or acquisition instruments. To address the computational cost of visualization tasks, specially for large datasets, researchers have explored grid environments as a platform for their parallel evaluation. It is however not trivial to adapt each different visualization technique to run in grid environments. A desirable alternative would separate the specificities of data and process distribution in grids from visualization computation logic. In this work we claim that the QEF (query evaluation framework) leverages scientific visualization computation with the above mentioned characteristics. Visualization computation techniques are modeled as operators in an algebra and integrated with a set of control operators that manage data distribution leading to a parallel QEP (query execution plan). We show the benefits of parallelization for two of those techniques: particle tracing and volume rendering. For these techniques, our experiments demonstrate many positive aspects of the solution presented, as well as opportunities for future work.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123869580","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}
Kailash Kotwani, J. Myers, Bill Baker, J. Mohr, G. Daues, T. Darnell, Y. D. Cai, M. Gower, S. Desai, B. Armstrong, T. McLaren, D. Petravick, Ankit Chandra, J. Plutchak
{"title":"The dark energy survey data management system as a data intensive science gateway","authors":"Kailash Kotwani, J. Myers, Bill Baker, J. Mohr, G. Daues, T. Darnell, Y. D. Cai, M. Gower, S. Desai, B. Armstrong, T. McLaren, D. Petravick, Ankit Chandra, J. Plutchak","doi":"10.1145/1890799.1890808","DOIUrl":"https://doi.org/10.1145/1890799.1890808","url":null,"abstract":"The Dark Energy Survey (DES) collaboration is a multi-national science effort to understand cosmic acceleration and the nature of 'dark energy' responsible for this phenomenon. Dark Energy Survey Data Management (DESDM) system is a new observational astronomy processing pipeline and data management system that will be used to: process raw images obtained from a survey with the new DES field camera (DECam) covering 5000 sq degree of southern sky; archive intermediate and final co-added images; extract catalogs of celestial objects from every image and deliver data products to the astronomy community through portals and services. DESDM has been designed as a data intensive Science Gateway coupling use of shared computational resources (e.g. Teragrid) with project-owned databases and file systems for storage distributed across three continents. DESDM system over the next six years time will perform over 10 million CPU-hours (SUs) of image processing and serve over 4 Petabytes of images and 14 billion cataloged objects to the international DES collaboration. When delivered for operations in 2011, it will be one of, if not the, most scalable and powerful systems for processing telescope images, creating co-added deep images, and generating detailed star and galaxy catalogs in existence. The project's software components consist of a processing framework, an ensemble of astronomy codes, an integrated archive, a data-access framework and a portal infrastructure. This paper provides an overview of the DESDM scope and highlights, the architectural features developed and planned to be able to support Gateway-style management peta-scale intensive continuous processing and on-demand user queries for analysis.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125070259","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}
{"title":"Multi-domain grid/cloud computing through a hierarchical component-based middleware","authors":"E. Mathias, F. Baude","doi":"10.1145/1890799.1890801","DOIUrl":"https://doi.org/10.1145/1890799.1890801","url":null,"abstract":"Current solutions for hybrid Grid/Cloud computing have been developed to hide from heterogeneity, dynamism and distributed nature of resources. These solutions are however insufficient to support distributed applications with non trivial communication patterns among processes, or that are structured so as to reflect the organization of resources they are deployed onto. In this paper, we present a generic, adaptable and extensible component-based middleware that seamlessly enables a transition of non-trivial applications from traditional Grids to hybrid Grid-Cloud platforms. This middleware goes beyond the resolution of well known technical challenges for multi-domain computing, as it offers mechanisms to exploit the hierarchical, heterogeneous and dynamic nature of platforms. We validate its capabilities and versatility through two use cases: an Internet-wide federation of Distributed Service Buses and a runtime supporting domain-decomposition HPC in heterogeneous computing environments using MPI-like programming. Performance results show the efficiency and usefulness of our middleware, and so contribute to promote research efforts geared towards flexible, on-demand IT solutions.","PeriodicalId":313448,"journal":{"name":"Middleware for Grid Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120887043","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}