2010 IEEE Second International Conference on Cloud Computing Technology and Science最新文献

筛选
英文 中文
BetterLife 2.0: Large-Scale Social Intelligence Reasoning on Cloud 美好生活2.0:云上大规模社会智能推理
Dexter H. Hu, Yinfeng Wang, Cho-Li Wang
{"title":"BetterLife 2.0: Large-Scale Social Intelligence Reasoning on Cloud","authors":"Dexter H. Hu, Yinfeng Wang, Cho-Li Wang","doi":"10.1109/CloudCom.2010.108","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.108","url":null,"abstract":"This paper presents the design of the Better Life 2.0 framework, which facilitates implementation of large-scale social intelligence application in cloud environment. We argued that more and more mobile social applications in pervasive computing need to be implemented this way, with a lot of user generated activities in social networking websites. We adopted the Case-based Reasoning technique to provide logical reasoning and outlined design considerations when porting a typical CBR framework jCOLIBRI2 to cloud, using Hadoop's various services (HDFS, HBase). These services allow efficient case base management (e.g. case insertion) and distribution of computational intensive jobs to speed up reasoning process more than 5 times. With the scalability merit of MapReduce, we can improve recommendation service with social network analysis that needs to handle millions of users' social activities.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121046028","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}
引用次数: 9
Bag-of-Tasks Scheduling under Budget Constraints 预算约束下的任务袋调度
Ana Oprescu, T. Kielmann
{"title":"Bag-of-Tasks Scheduling under Budget Constraints","authors":"Ana Oprescu, T. Kielmann","doi":"10.1109/CloudCom.2010.32","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.32","url":null,"abstract":"Commercial cloud offerings, such as Amazon’s EC2, let users allocate compute resources on demand, charging based on reserved time intervals. While this gives great¿exibility to elastic applications, users lack guidance for choosing between multiple offerings, in order to complete their computations within given budget constraints. In this work, we present BaTS, our budget-constrained scheduler. BaTS can schedule large bags of tasks onto multiple clouds with different CPU performance and cost, minimizing completion time while respecting an upper bound for the budget to be spent. BaTS requires no a-priori information about task completion times, and learns to estimate them at runtime. We evaluate BaTS by emulating different cloud environments on the DAS-3 multi-cluster system. Our results show that BaTS is able to schedule within a user-definedbudget (if such a schedule is possible at all.) At the expense of extra compute time, significant cost savings can be achieved when comparing to a cost-oblivious round-robin scheduler.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129312920","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}
引用次数: 156
Data Replication and Power Consumption in Data Grids 数据网格中的数据复制和功耗
Susan V. Vrbsky, Ming Lei, Karl Smith, Jeff Byrd
{"title":"Data Replication and Power Consumption in Data Grids","authors":"Susan V. Vrbsky, Ming Lei, Karl Smith, Jeff Byrd","doi":"10.1109/CloudCom.2010.35","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.35","url":null,"abstract":"While data grids can provide the ability to solve large-scale applications which require the processing of large amounts of data, they have been recognized as extremely energy inefficient. Computing elements can be located far away from the data storage elements. A common solution to improve availability and file access time in such environments is to replicate the data, resulting in the creation of copies of data files at many different sites. The energy efficiency of the data centers storing this data is one of the biggest issues in data intensive computing. Since power is needed to transmit, store and cool the data, we propose to minimize the amount of data transmitted and stored by utilizing smart replication strategies that are data aware. In this paper we present a new data replication approach, called the sliding window replica strategy (SWIN), that is not only data aware, but is also energy efficient. We measure the performance of SWIN and existing replica strategies on our Sage green cluster to study the power consumption of the strategies. Results from this study have implications beyond our cluster to the management of data in clouds.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340965","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}
引用次数: 39
Power of Clouds in Your Pocket: An Efficient Approach for Cloud Mobile Hybrid Application Development 口袋中的云的力量:云移动混合应用程序开发的有效方法
Ashwin Manjunatha, Ajith Ranabahu, A. Sheth, K. Thirunarayan
{"title":"Power of Clouds in Your Pocket: An Efficient Approach for Cloud Mobile Hybrid Application Development","authors":"Ashwin Manjunatha, Ajith Ranabahu, A. Sheth, K. Thirunarayan","doi":"10.1109/CloudCom.2010.78","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.78","url":null,"abstract":"The advancements in computing have resulted in a boom of cheap, ubiquitous, connected mobile devices as well as seemingly unlimited, utility style, pay as you go computing resources, commonly referred to as Cloud computing. However, taking full advantage of this mobile and cloud computing landscape, especially for the data intensive domains has been hampered by the many heterogeneities that exist in the mobile space as well as the Cloud space. Our research focuses on exploiting the capabilities of the mobile and cloud landscape by defining a new class of applications called cloud mobile hybrid (CMH) applications and a Domain Specific Language (DSL) based methodology to develop these applications. We define Cloud-mobile hybrid as a collective application that has a Cloud based back-end and a mobile device front-end. Using a single DSL script, our toolkit is capable of generating a variety of CMH applications. These applications are composed of multiple combinations of native Cloud and mobile applications. Our approach not only reduces the learning curve but also shields developers from the complexities of the target platforms. We provide a detailed description of our language and present the results obtained using our prototype generator implementation. We also present a list of extensions that will enhance the various aspects of this platform.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116752587","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}
引用次数: 57
Scheduling Hadoop Jobs to Meet Deadlines 调度Hadoop作业以满足最后期限
Kamal Kc, Kemafor Anyanwu
{"title":"Scheduling Hadoop Jobs to Meet Deadlines","authors":"Kamal Kc, Kemafor Anyanwu","doi":"10.1109/CloudCom.2010.97","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.97","url":null,"abstract":"User constraints such as deadlines are important requirements that are not considered by existing cloud-based data processing environments such as Hadoop. In the current implementation, jobs are scheduled in FIFO order by default with options for other priority based schedulers. In this paper, we extend real time cluster scheduling approach to account for the two-phase computation style of MapReduce. We develop criteria for scheduling jobs based on user specified deadline constraints and discuss our implementation and preliminary evaluation of a Deadline Constraint Scheduler for Hadoop which ensures that only jobs whose deadlines can be met are scheduled for execution.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114787111","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}
引用次数: 273
A Hybrid and Secure Mechanism to Execute Parameter Survey Applications on Local and Public Cloud Resources 在本地和公共云资源上执行参数调查应用的混合安全机制
Hao Sun, K. Aida
{"title":"A Hybrid and Secure Mechanism to Execute Parameter Survey Applications on Local and Public Cloud Resources","authors":"Hao Sun, K. Aida","doi":"10.1109/CloudCom.2010.61","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.61","url":null,"abstract":"A parameter survey application (PSA) is a typical application running on high-performance computing (HPC) systems. A PSA consists of a lot of independent tasks with different input parameters that are executed in parallel on different CPU cores. Infrastructure-as-a-Service Cloud (IaaS Cloud) is expected to be used as an HPC infrastructure to run PSAs, and some reports have discussed hybrid execution mechanisms to utilize both local resources and IaaS Clouds. However, users still have security problems in running applications with confidential data on an IaaS Cloud. We propose a hybrid and secure execution mechanism to run PSAs utilizing both local computing resources with a batch scheduler and an IaaS Cloud. The proposed mechanism utilizes both local resources and IaaS Clouds to meet the deadline of user applications. We conducted experiments running a natural language processing application, which uses machine learning to detect abusive language on Internet bulletin board systems. The experimental results showed that the proposed mechanism effectively allocated resources and met the deadlines of the user application.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114660300","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}
引用次数: 8
Modeling the Runtime Integrity of Cloud Servers: A Scoped Invariant Perspective 云服务器的运行时完整性建模:一个范围不变的透视图
Jinpeng Wei, C. Pu, Carlos V. Rozas, Anand Rajan, Feng Zhu
{"title":"Modeling the Runtime Integrity of Cloud Servers: A Scoped Invariant Perspective","authors":"Jinpeng Wei, C. Pu, Carlos V. Rozas, Anand Rajan, Feng Zhu","doi":"10.1109/CloudCom.2010.29","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.29","url":null,"abstract":"One of the underpinnings of Cloud Computing security is the runtime integrity of individual Cloud servers. Due to the on-going discovery of runtime software vulnerabilities like buffer overflows, it is critical to be able to gauge the integrity of a Cloud server as it operates. In this paper, we propose scoped invariants as a primitive for analyzing the software system for its integrity properties. We report our experience with the modeling and detection of scoped invariants. The Xen Virtual Machine Manager is used for a case study. Our research detects a set of essential scoped invariants that are critical to the runtime integrity of Xen. One such property, that the addressable memory limit of a guest OS must not include Xen’s code and data, is indispensable for Xen’s guest isolation mechanism. The violation of this property demonstrates that the attacker only needs to modify a single byte in the Global Descriptor Table to achieve his goal.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127238375","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}
引用次数: 16
LEMO-MR: Low Overhead and Elastic MapReduce Implementation Optimized for Memory and CPU-Intensive Applications LEMO-MR:低开销和弹性MapReduce实现,针对内存和cpu密集型应用进行了优化
Zacharia Fadika, M. Govindaraju
{"title":"LEMO-MR: Low Overhead and Elastic MapReduce Implementation Optimized for Memory and CPU-Intensive Applications","authors":"Zacharia Fadika, M. Govindaraju","doi":"10.1109/CloudCom.2010.45","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.45","url":null,"abstract":"Since its inception, MapReduce has frequently been associated with Hadoop and large-scale datasets. Its deployment at Amazon in the cloud, and its applications at Yahoo! and Face book for large-scale distributed document indexing and database building, among other tasks, have thrust MapReduce to the forefront of the data processing application domain. The applicability of the paradigm however extends far beyond its use with data intensive applications and disk based systems, and can also be brought to bear in processing small but CPU intensive distributed applications. In this work, we focus both on the performance of processing large-scale hierarchical data in distributed scientific applications, as well as the processing of smaller but demanding input sizes primarily used in diskless, and memory resident I/O systems. In this paper, we present LEMO-MR (Low overhead, Elastic, configurable for in-Memory applications, and on-Demand fault tolerance), an optimized implementation of MapReduce, for both on-disk and in-memory applications, describe its architecture and identify not only the necessary components of this model, but also trade offs and factors to be considered. We show the efficacy of our implementation in terms of potential speedup that can be achieved for representative data sets used by cloud applications. Finally, we quantify the performance gains exhibited by our MapReduce implementation over Apache Hadoop in a compute intensive environment.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127192965","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}
引用次数: 42
Achieving High Throughput by Transparent Network Interface Virtualization on Multi-core Systems 通过透明网络接口虚拟化实现多核系统的高吞吐量
Huiyong Zhang, Yuebin Bai, Zhi Li, Niandong Du, Wentao Yang
{"title":"Achieving High Throughput by Transparent Network Interface Virtualization on Multi-core Systems","authors":"Huiyong Zhang, Yuebin Bai, Zhi Li, Niandong Du, Wentao Yang","doi":"10.1109/CloudCom.2010.62","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.62","url":null,"abstract":"Though with the rapid development, there remains a challenge on achieving high performance of I/O virtualization. The Para virtualized I/O driver domain model, used in Xen, provides several advantages including fault isolation, live migration, and hardware independence. However, the high CPU overhead of driver domain leads to low throughput for high bandwidth links. Direct I/O can achieve high performance but at the cost of removing the benefits of the driver domain model. This paper presents software techniques and optimizations to achieve high throughput network I/Ovirtualization by driver domain virtualization model on multicore systems. In our experiments on multi-core system with a quad-port 1GbE NIC, we observe the overall throughput of multiple guest VMs can only be 2.2Gb/s, while the link bandwidth is 4Gb/s in total. The low performance results from the disability of driver domain to concurrently serve multiple guest VMs running bandwidth-intensive applications. Consequently, two approaches are proposed. First, a multi task let net back is implemented to serve multiple net fronts on currently. Second, we implement a new event channel dispatch mechanism to balance event associated with networkI/O over VCPUs of driver domain. To reduce the CPU overhead of the driver domain model, we also propose two optimizations: lower down event frequency in netback and implement LRO in net front. By applying all the above techniques, our experiments show that the overall throughput can be improved from the original 2.2Gb/s to 3.7Gb/s and the multi-core CPU resources can be utilized efficiently. We believe that the approaches of our study can be valuable for high throughput I/O virtualization in the coming multi-core era.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127306404","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}
引用次数: 3
VDBench: A Benchmarking Toolkit for Thin-Client Based Virtual Desktop Environments VDBench:一个基于瘦客户机的虚拟桌面环境的基准测试工具包
Alex Berryman, P. Calyam, Matthew Honigford, A. Lai
{"title":"VDBench: A Benchmarking Toolkit for Thin-Client Based Virtual Desktop Environments","authors":"Alex Berryman, P. Calyam, Matthew Honigford, A. Lai","doi":"10.1109/CloudCom.2010.106","DOIUrl":"https://doi.org/10.1109/CloudCom.2010.106","url":null,"abstract":"The recent advances in thin client devices and the push to transition users' desktop delivery to cloud environments will eventually transform how desktop computers are used today. The ability to measure and adapt the performance of virtual desktop environments is a major challenge for ''virtual desktop cloud'' service providers. In this paper, we present the ''VD Bench'' toolkit that uses a novel methodology and related metrics to benchmark thin-client based virtual desktop environments in terms of scalability and reliability. We also describe how we used a VD Bench instance to benchmark the performance of: (a) popular user applications (Spreadsheet Calculator, Internet Browser, Media Player, Interactive Visualization), (b) TCP/UDP based thin client protocols (RDP, RGS, PCoIP), and (c) remote user experience (interactive response times, perceived video quality), under a variety of system load and network health conditions. Our results can help service providers to mitigate over-provisioning in sizing virtual desktop resources, and guesswork in thin client protocol configurations, and thus obtain significant cost savings while simultaneously fostering satisfied customers.","PeriodicalId":130987,"journal":{"name":"2010 IEEE Second International Conference on Cloud Computing Technology and Science","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123212978","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}
引用次数: 54
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信