2013 International Conference on Cloud and Service Computing最新文献

{"title":"Heterogeneous Network Analysis of Developer Contribution in Bug Repositories","authors":"Wen Zhang, Song-cheng Wang, Ye Yang, Qing Wang","doi":"10.1109/CSC.2013.23","DOIUrl":"https://doi.org/10.1109/CSC.2013.23","url":null,"abstract":"Using a bug repository, developers contribute to improve the quality of software incrementally by creating and updating bug reports. All the software artifacts in bug repositories are derived from developer contribution. Most prior studies on developer contribution in bug repositories bias on one particular form, e.g., commenting bug reports. However, in real practice of bug repositories, developers participate in and contribute to software projects via multiple ways, e.g., reporting new bugs, reopening incorrectly fixed bugs, commenting unfixed bug reports, and fixing unsolved bugs. In this paper, we exploit recent advances in analysis of heterogeneous network to avoid biased aspects in measuring developer contribution and explore multiple types of developer contribution in bug repositories. Further, we consider leveraging such multiple types of developer contribution to assist a typical prediction problem in bug repositories, i.e., bug triage. Empirical studies on bug repositories of Eclipse and Mozilla show that our approach can provide enriched knowledge of developer contribution to improve the resolution of bug triage. This study strongly suggests using the promising aspects of heterogeneous network can open many actionable insights in analyzing software repositories.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128794483","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 System-Oriented Approach to Full-Text Search on Encrypted Cloud Storage","authors":"Luigi Lo Iacono, Daniel Behnam Torkian","doi":"10.1109/CSC.2013.12","DOIUrl":"https://doi.org/10.1109/CSC.2013.12","url":null,"abstract":"Today's Cloud market offers a wide variety of online storage services which provide reliable and inexpensive storage accessible from almost every device at almost any location. Still, it proofs to be difficult to satisfy the user's confidence concerning the confidentiality and integrity of the own data in the Cloud. This is especially true since the user is forced to take a tradeoff between security and functionality. Storage services which allow the adoption of self-selected and self-controlled security mechanisms provide a high security level but miss on the other side a set of useful operations such as e.g. a full-text search or a synchronization across distinct devices. Such features require that the server-side is capable of accessing the data in unencrypted form for processing purposes. This paper presents an system-oriented approach to this issue by introducing an architecture that allows to integrate a full-text search operation with file-based Cloud storage services in the presence of user-selected and user-controlled security. Different instances of the presented architecture allow furthermore for a more fine-grained balance between the level of security and the provided functionality by the Cloud storage service.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128790760","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":"Real Time Cache Performance Analyzing for Multi-core Parallel Programs","authors":"Rui Wang, Yuan Gao, Guolu Zhang","doi":"10.1109/CSC.2013.11","DOIUrl":"https://doi.org/10.1109/CSC.2013.11","url":null,"abstract":"Modern processors mostly use cache to hide the memory access latency, so cache performance is very important to application program. A detailed cache performance analysis will provide programmers a clear view of their program behaviors, which can help them to identify the performance bottleneck and to optimize the source code. As the chip industry turn to integrate multiple cores into one chip, multi-core/many-core processor becomes the new approach to maintain the Moor's Law. Therefore, Parallel programs turn to be more important even in the personal computers. In parallel programs, the interaction between tasks is the source of bugs and errors and is hard to handling for most of programmers. The detailed cache behaviors will greatly helpful to the programmer to find the errors and optimize the programs. However, the existing cache performance analysis tools, due to the limitations of the hardware performance counters they depend on to get data, cannot get as much data as we expected. Those tools cannot reveal the program routines characteristics on shared cache and the source of cache misses with limited metrics on cache misses. In this paper, we propose a method to obtain and analysis real time cache performance with binary instrumentation and cache emulation. We instrument the parallel program while it is running, and get the trace data about memory access. Then we transport the trace data to an carefully configured cache emulation module to get the detailed cache behavior information. The emulation module can not only get more information than hardware performance counter but also can be configured to simulate different target hardware environment. Additionally, we use the performance data to form a group of cache performance metrics which can intuitively help programmers to optimize their codes. The accuracy of this method is demonstrated by comparing the summary result with the hardware performance counter. Finally, we design an cache performance analysis tool named CC-Analyzer for parallel programs. Comparing with the existing technologies, CC-Analyzer is able to analyze the cause of cache misses and gather much more performance statistics when the parallel program is running on different cache architectures.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124722342","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":"Lynn: A Multi-dimensional Dynamic Resource Management System for Distributed Applications in Clouds","authors":"Zhang Zhang, Jizhong Han, Bo Li, W. Zhou, Dan Meng","doi":"10.1109/CSC.2013.21","DOIUrl":"https://doi.org/10.1109/CSC.2013.21","url":null,"abstract":"We present Lynn, a multi-dimensional dynamic resource management system for distributed applications in clouds. Lynn is the first to uniformly manage full kinds of resources, including CPU, memory and particularly, the network I/O bandwidth resource as a whole to schedule tasks. This comprehensive policy allows for more fine-grained control over hardware resources, and thus more efficiency. To support today's sophisticated distributed applications in clouds and to ease the burden of software developers, Lynn defines the concept of virtual cluster in this case and provides a transparent and user-friendly interface of deploying the virtual cluster to run applications. Distributed Applications do not need to make any change to be adapted to Lynn for use. In addition, Lynn puts forward a mechanism that allows different kinds of virtualization techniques to coexist within one single machine, particularly the light-weighted visualization technology Linux container LXC and the famous full virtualization technology KVM. Lynn can handle the difference of the underlying virtualization technology and can manage their resources properly. Then, Lynn breaks the usual rule of static resource allocation of virtual machines. Creatively, Lynn takes careful account of the resources used by each virtual cluster and dynamically adapts their amounts of resources according to their respective workloads. Dynamic policy improves cluster resource utilizations and provides more room for new applications. Our results show that Lynn's multidimensional dynamic resource management policy is feasible and effective.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129737220","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":"PIOD: A Parallel I/O Dispatch Model Based on Lustre File System for Virtual Machine Storage","authors":"Zhou Lei, Zhebo Zhou, Bolin Hu, W. Shen, Luokai Hu","doi":"10.1109/CSC.2013.13","DOIUrl":"https://doi.org/10.1109/CSC.2013.13","url":null,"abstract":"Virtualization is a key technique for cloud computing. One challenge in it is providing a scalable, high performance and high cost effective data storage for virtual machines. In this paper, we propose a parallel I/O dispatch model called PIOD based on Lustre parallel file system to address this issue. PIOD adopts queue mechanism to coordinate data access requests from clients, avoiding random and concurrent storage access. Doing so contributes to avoid random disk seek overhead, which in turn improves I/O performance of data access. The simulation results show that PIOD is effective and can improve I/O throughput about 26.3% on average.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114525643","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":"Information Extraction for Computer Science Academic Rankings System","authors":"Chengkai Shi, J. Quan, Minglu Li","doi":"10.1109/CSC.2013.19","DOIUrl":"https://doi.org/10.1109/CSC.2013.19","url":null,"abstract":"Today the academic ranking for computer science is a hot and importmant problem. This paper introduces Computer Science Academic Rankings System (CSAR) which aims at academic information extracting, mining and ranking. In this paper we mainly present approaches for information extraction and normalization in CSAR. For semi-structured and unstructured web pages such as paper-view pages, we propose a method with natural language processing n-gram model and web grammar. We generate an optimal matching bipartite graph to extract authors and organizations information with maximum likelihood. CSAR also uses KM algorithm and Hungarian algorithm to find authors and emails correspondence. For information normalization, we introduce n-gram model, EM algorithm and trigram model with linear interpolation to construct part-of-speech tagger, with which to extract useful information from web source. Then TF-IDF model and string edit distance are applied to finish normalizing organization names. In experiment, our proposed approaches obtain high accuracy rate and great improvements of academic information extraction.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122312763","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":"Erlang as a Language for Cloud Computing and Its Integration with Many-core Coprocessor","authors":"Siyao Zheng, Xiang Long","doi":"10.1109/CSC.2013.9","DOIUrl":"https://doi.org/10.1109/CSC.2013.9","url":null,"abstract":"Erlang programming language is developed for programming concurrent, distributed and fault-tolerant systems. The native support for concurrency makes Erlang an efficient language for multi-core and even many-core programming. The support for large number of light-weight processes in distributed computing environment makes Erlang a good choice for cloud computing. Building more cores on a single chip is a trend in processor design. Intel Xeon Phi coprocessor , which is equipped with at least 60 cores, is the first commercial many-core product released by Intel. Xeon Phi coprocessor is encapsulated in a PCIe card and communicates with host operating system through a specialized interface library called SCIF. This paper introduces the architecture of Xeon Phi coprocessor and analyses the internals of SCIF programming interface first. Then this paper proposes a solution that integrates the computing power of multi-core host machine and Xeon Phi many-core coprocessor transparently. The solutions implements a high efficient SCIF-based Erlang distribution carrier as a plugin into Erlang virtual machine, and extends Erlang VM itself to support remote port access in order to support process location policy defined in this solution. In the end, this paper shows a practical use case of the proposed solution in cloud service environment: improve web server capacity without modifying user program. The performance evaluation shows that the capacity of a web server is improved at least 4 times.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124396331","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":"Interactive Recommendation of Composition Operators for Situational Data Integration","authors":"Guiling Wang, Jun Fang, Yanbo Han","doi":"10.1109/CSC.2013.26","DOIUrl":"https://doi.org/10.1109/CSC.2013.26","url":null,"abstract":"In the open and dynamic Internet computing environment, situational data integration applications appear to be trendy. The situational data integration requirements are often immediate and can't be totally defined in advance. Data service mashup is an effective approach to dealing with situational data integration problems to certain extent. It offers agility by providing the visual user interface to expose the data integration capabilities to enable non-professional users to solve transient data integration problems. In order to assist the non-professional users to select and link the composition operator, this paper aims to work toward an approach for interactive recommendation of the candidate composition operators. Based on the observation that many mashup patterns can be derived according to their functionalities, this paper proposes a composition operator recommendation algorithm combining the rule-based and statistics-based methods. We also experimentally demonstrated the accuracy of our approach.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124894449","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":"Ceaser: Exploring the Monitoring Rules in the Time Dimension","authors":"You Meng, Zhongzhi Luan, D. Qian","doi":"10.1109/CSC.2013.16","DOIUrl":"https://doi.org/10.1109/CSC.2013.16","url":null,"abstract":"In cloud environment, most failures would not strike at a sudden moment but evolve from a minor anomaly. During the evolving procedure, it may generate a series of events. But users can't specify exactly the event sequences of all the failures due the lack of time or knowledge. Automatically exploring the monitoring rules in time dimension can help users refine their rules and timely discover the failure. Based on these facts, we introduce our prototype: Ceaser. It analyzes the raw rules that user specified based on history event sequence, and try to refine them in the time dimension. Unlike pattern mining or event summarization, the rule refinement process is handled by a rule generator Ceaser-S and an extensible CEP engine Ceaser-E. The cooperation of these two can not only discover the event sequence pattern which one event happens after another, they can also explore the monitoring rules including the negative pattern or Kleeneclosure pattern and other user defined pattern.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115244191","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":"CUDA-Enabled Multiple Symbol Detection for PCM/FM Demodulation","authors":"Renliang Zhao, Haixin Zheng, Y. Liu, Liheng Jian, Xianglong Gu, Bingyin Han, Zhongya Wang","doi":"10.1109/CSC.2013.10","DOIUrl":"https://doi.org/10.1109/CSC.2013.10","url":null,"abstract":"PCM/FM has been widely used in telemetry system. Multiple Symbol Detection (MSD) based signal demodulation methods can achieve lower BER (Bit Error Rate) than other methods. Due to its high computational complexity, current MSD algorithms are implemented in specialized signal processing devices, such as FPGAs (Field Programmable Gate Arrays). As the rapid development of CUDA, GPU has successfully accelerated applications in a variety of domains. In this paper, we explore to utilize CUDA-enabled GPU to accelerate MSD-based signal demodulation method. The computation core of MSD, sliding correlation problem, is formulated and an efficient parallelization scheme is proposed. CU-MSD (CUDA-enabled MSD) algorithm is implemented by adapting CUDA-enabled sliding correlation. Various optimization techniques are used to achieve the maximum performance. We evaluate our implementation by using data sets from a real aerospace PCM/FM integrated baseband system. The experimental results demonstrate up to 52.8x speedup.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125897969","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}