E. Vairavanathan, S. Al-Kiswany, L. Costa, Zhao Zhang, D. Katz, M. Wilde, M. Ripeanu
{"title":"A Workflow-Aware Storage System: An Opportunity Study","authors":"E. Vairavanathan, S. Al-Kiswany, L. Costa, Zhao Zhang, D. Katz, M. Wilde, M. Ripeanu","doi":"10.1109/CCGrid.2012.109","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.109","url":null,"abstract":"This paper evaluates the potential gains a workflow-aware storage system can bring. Two observations make us believe such storage system is crucial to efficiently support workflow-based applications: First, workflows generate irregular and application-dependent data access patterns. These patterns render existing storage systems unable to harness all optimization opportunities as this often requires conflicting optimization options or even conflicting design decision at the level of the storage system. Second, when scheduling, workflow runtime engines make suboptimal decisions as they lack detailed data location information. This paper discusses the feasibility, and evaluates the potential performance benefits brought by, building a workflow-aware storage system that supports per-file access optimizations and exposes data location. To this end, this paper presents approaches to determine the application-specific data access patterns, and evaluates experimentally the performance gains of a workflow-aware storage approach. Our evaluation using synthetic benchmarks shows that a workflow-aware storage system can bring significant performance gains: up to 7× performance gain compared to the distributed storage system - MosaStore and up to 16× compared to a central, well provisioned, NFS server.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126435246","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":"Automatic Adaptive Page-Size Control for Remote Memory Paging","authors":"H. Midorikawa, Joe Uchiyama","doi":"10.1109/CCGrid.2012.125","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.125","url":null,"abstract":"An automatic adaptive page size control methodology is proposed for remote memory paging. It estimates a working data set and changes page size dynamically and adaptively to each processing part of an application during it is running. It is highly effective to prevent memory server thrashing when the size of local memory is limited.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125461032","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":"Optimal Reconfiguration of the Cloud Network for Maximum Energy Savings","authors":"B. Kantarci, H. Mouftah","doi":"10.1109/CCGrid.2012.47","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.47","url":null,"abstract":"With the advent of cloud computing, storage and computing functions are migrating to remote resources such as virtual servers and storage systems which are mostly hosted in the data centers. This migration can ensure significant energy savings as utilization of local resources contribute to 40% of the Greenhouse Gas emissions of the Information and Communication Technologies (ICTs). On the other hand, provisioning of the cloud services needs to be handled carefully since energy consumption of the transport network, as well as the energy consumed by the data centers, is expected to increase. We revisit our previously proposed Mixed Integer Linear Programming (MILP) models that are used to reconfigure the cloud network design with look-ahead demand profile. Due to long runtimes of the MILP models in large-scale scenarios, in this paper, we propose two heuristics to reconfigure the cloud network for provisioning the cloud and Internet computing demands. The first heuristic aims to minimize the propagation delay while the second one targets minimizing the power consumption of the data centers and the transport network. We verify the heuristics through simulations where MILP models are used as the benchmarks. Numerical results show that power minimized provisioning can guarantee significant energy savings in the cloud network with less resource consumption. We also present the energy versus delay trade-off and point out possible solutions.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"1987 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130711278","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}
Wenfeng Li, Junrong Bao, Xiuwen Fu, G. Fortino, Stefano Galzarano
{"title":"Human Postures Recognition Based on D-S Evidence Theory and Multi-sensor Data Fusion","authors":"Wenfeng Li, Junrong Bao, Xiuwen Fu, G. Fortino, Stefano Galzarano","doi":"10.1109/CCGrid.2012.144","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.144","url":null,"abstract":"Body Sensor Networks (BSNs) are conveying notable attention due to their capabilities in supporting humans in their daily life. In particular, real-time and noninvasive monitoring of assisted livings is having great potential in many application domains, such as health care, sport/fitness, e-entertainment, social interaction and e-factory. And the basic as well as crucial feature characterizing such systems is the ability of detecting human actions and behaviors. In this paper, a novel approach for human posture recognition is proposed. Our BSN system relies on an information fusion method based on the D-S Evidence Theory, which is applied on the accelerometer data coming from multiple wearable sensors. Experimental results demonstrate that the developed prototype system is able to achieve a recognition accuracy between 98.5% and 100% for basic postures (standing, sitting, lying, squatting).","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131159964","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":"VM Economics for Java Cloud Computing: An Adaptive and Resource-Aware Java Runtime with Quality-of-Execution","authors":"José Simão, L. Veiga","doi":"10.1109/CCGrid.2012.121","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.121","url":null,"abstract":"Resource management in Cloud Computing has been dominated by system-level virtual machines to enable the management of resources using a coarse grained approach, largely in a manner independent from the applications running on these infrastructures. However, in such environments, although different types of applications can be running, the resources are delivered equally to each one, missing the opportunity to manage the available resources in a more efficient and application driven way. So, as more applications target managed runtimes, high level virtualization is a relevant abstraction layer that has not been properly explored to enhance resource usage, control, and effectiveness. We propose a VM economics model to manage cloud infrastructures, governed by a quality-of-execution (QoE) metric and implemented by an extended virtual machine. The Adaptive and Resource-Aware Java Virtual Machine (ARA-JVM) is a cluster-enabled virtual execution environment with the ability to monitor base mechanisms (e.g. thread cheduling, garbage collection, memory or network consumptions) to assess application's performance and reconfigure these mechanisms in runtime according to previously defined resource allocation policies. Reconfiguration is driven by incremental gains in quality-of-execution (QoE), used by the VM economics model to balance relative resource savings and perceived performance degradation. Our work in progress, aims to allow cloud providers to exchange resource slices among virtual machines, continually addressing where those resources are required, while being able to determine where the reduction will be more economically effective, i.e., will contribute in lesser extent to performance degradation.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134642756","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":"Cellular STEM: Promoting Interest in Science, Technology, Engineering, and Math Education Using Cellular Messaging, Cloud Computing, and Web-Based Social Networks","authors":"Brandon C. Judd, C. Graves","doi":"10.1109/CCGrid.2012.111","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.111","url":null,"abstract":"Cellular STEM (Science, Technology, Engineering, and Mathematics) is a system conceived to interface computational/ visualization engines to SMS/MMS messaging for the purpose of enhancing STEM Education. The system allows users to send processing request to a computational/visualization engine (e.g. MATLAB, Octave) via SMS or MMS and receive the processed data back via SMS or MMS. The development of the Cellular STEM system using a social networking site managed better versus using a dedicated email account, primarily due to the versatile API of the social networking site as well as it alleviating the burden of message parsing. Additionally, SMS/MMS-based social networking sites have the potential to ultimately draw the attention of younger people toward STEM learning because of familiarity with the social networking site. Overall, the social networking site based-system was far more robust in terms of security, speed, development, and SMS/MMS message parsing. Furthermore Cellular STEM users can easily tailor the computational/visualization engine toolbox for specific courses or demonstrations. Based on the increase in cloud computing in education and in society in general, Cellular STEM has potential to be a major part of STEM education, and may warrant enterprise-level implementations customized on a per-institution basis.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122031880","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}
Shaun Murphy, Scott Gallant, C. Gaughan, Manny Diego
{"title":"U.S. Army Modeling and Simulation Executable Architecture Deployment Cloud Virtualization Strategy","authors":"Shaun Murphy, Scott Gallant, C. Gaughan, Manny Diego","doi":"10.1109/CCGrid.2012.89","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.89","url":null,"abstract":"Our research has included leveraging Virtualization Technologies to provide integration, configuration and execution relief of Modeling & Simulation (M&S) event planning, instantiation and analysis. We have achieved this through a single service that is used to deploy and execute stand-alone applications as well as separate, but cooperative, applications on a dynamic virtual machine-based cloud. This use of virtualization technology shows significant cost savings in reducing the human effort for integration, test and execution by providing a powerful virtual machine environment that combines new and existing applications and their configurations. Our effort eliminates the time needed to manually configure and execute these applications on physical hardware once they are captured in the system.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128181269","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":"Task Scheduling Algorithm for Multicore Processor System for Minimizing Recovery Time in Case of Single Node Fault","authors":"Shohei Gotoda, Minoru Ito, N. Shibata","doi":"10.1109/CCGrid.2012.23","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.23","url":null,"abstract":"In this paper, we propose a task scheduling algorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processor. Many of the recently developed processors have multiple cores on a single die, so that one failure of a computing node results in failure of many processors. In the case of a failure of a multicore processor, all tasks which have been executed on the failed multicore processor have to be recovered at once. The proposed algorithm is based on an existing check pointing technique, and we assume that the state is saved when nodes send results to the next node. If a series of computations that depends on former results is executed on a single die, we need to execute all parts of the series of computations again in the case of failure of the processor. The proposed scheduling algorithm tries not to concentrate tasks to processors on a die. We designed our algorithm as a parallel algorithm that achieves O(n) speedup where n is the number of processors. We evaluated our method using simulations and experiments with four PCs. We compared our method with existing scheduling method, and in the simulation, the execution time including recovery time in the case of a node failure is reduced by up to 50% while the overhead in the case of no failure was a few percent in typical scenarios.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127134914","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":"Investigation of Data Locality in MapReduce","authors":"Zhenhua Guo, G. Fox, Mo Zhou","doi":"10.1109/CCGrid.2012.42","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.42","url":null,"abstract":"Traditional HPC architectures separate compute nodes and storage nodes, which are interconnected with high speed links to satisfy data access requirements in multi-user environments. However, the capacity of those high speed links is still much less than the aggregate bandwidth of all compute nodes. In Data Parallel Systems such as GFS/MapReduce, clusters are built with commodity hardware and each node takes the roles of both computation and storage, which makes it possible to bring compute to data. Data locality is a significant advantage of data parallel systems over traditional HPC systems. Good data locality reduces cross-switch network traffic - one of the bottlenecks in data-intensive computing. In this paper, we investigate data locality in depth. Firstly, we build a mathematical model of scheduling in MapReduce and theoretically analyze the impact on data locality of configuration factors, such as the numbers of nodes and tasks. Secondly, we find the default Hadoop scheduling is non-optimal and propose an algorithm that schedules multiple tasks simultaneously rather than one by one to give optimal data locality. Thirdly, we run extensive experiments to quantify performance improvement of our proposed algorithms, measure how different factors impact data locality, and investigate how data locality influences job execution time in both single-cluster and cross-cluster environments.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132490370","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}
Byunggu Yu, A. Cuzzocrea, D. Jeong, Sergey Maydebura
{"title":"On Managing Very Large Sensor-Network Data Using Bigtable","authors":"Byunggu Yu, A. Cuzzocrea, D. Jeong, Sergey Maydebura","doi":"10.1109/CCGrid.2012.150","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.150","url":null,"abstract":"Recent advances and innovations in smart sensor technologies, energy storage, data communications, and distributed computing paradigms are enabling technological breakthroughs in very large sensor networks. There is an emerging surge of next-generation sensor-rich computers in consumer mobile devices as well as tailor-made field platforms wirelessly connected to the Internet. Billions of such sensor computers are posing both challenges and opportunities in relation to scalable and reliable management of the peta- and exa-scale time series being generated over time. This paper presents a Cloud-computing approach to this issue based on the two well-known data storage and processing paradigms: Bigtable and MapReduce.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132844458","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}