{"title":"Research on Services Selection Based on Credible Alliance in Web Services Combination","authors":"Chunhua Hu, Xiaohong Chen, Jianxun Liu, Jibo Liu","doi":"10.1109/ISPA.2009.63","DOIUrl":"https://doi.org/10.1109/ISPA.2009.63","url":null,"abstract":"In the Internet, there are a mass of malicious, fraudulent services in addition to the dynamics change and differences in service of quality. As a result, it is difficult for a client to fastly get high- quality services. In this paper, a service-composition framework based on the trust evolution and alliance has been proposed. It is different from traditional service workflow model. The trust relationship will be built after the trust evolution between services requester and provider. The trust services requester and provider are going to form an alliance through the relationship, so the malicious, fraudulent services will be excluded from the system and the service-composition will be carried out in a trust environment. On this basis, a strategy measuring the trust relationship among the services based on information entropy has been proposed, which can avoid the deficiencies of multi-dimensional trust indicators simply weighted in the previous studies. Theoretical analysis and experimental result show that the method proposed in this paper is more superior in credibility and security, comparing to the traditional services selection methods.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243653","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":"Luvalley-Lite: An Effort to Balance Re-use and Re-coding","authors":"Xiao-Jian Liu, Xiaodong Yi, Yi Ren","doi":"10.1109/ISPA.2009.31","DOIUrl":"https://doi.org/10.1109/ISPA.2009.31","url":null,"abstract":"When constructing a Virtual Machine Monitor(VMM), there are two different trends. The first one is trying to make the VMM be self-inclusive, while the second one is to make the VMM part of the host operating system. The former is prefered by independent virtualization provider(IVP) or BIOS manufacturer, and the later is advocated by OS vendors. In this article, after analyzing the implementation of three prevail VMMs, it is argued that: 1) unless the VMM is used as part of the BIOS, being self-inclusive is not a wise decision; 2) overly utilizing the existing functions that the underlying host operating system provides can not produce good solution to the problem of computer system virtualization. The design philosophy, architecture and implementation of Luvalley-lite is introduced to show our efforts to make a balance between reusing commodity OS functions and fitting the virtualization environment well. The approach of avoiding being restricted by the GPL license is also described. Due to the lack of publicly acknowledged performance benchmark, only preliminary experiments are conducted.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128974447","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":"Secure Logging for Auditable File System Using Separate Virtual Machines","authors":"Siqin Zhao, Kang Chen, Weimin Zheng","doi":"10.1109/ISPA.2009.32","DOIUrl":"https://doi.org/10.1109/ISPA.2009.32","url":null,"abstract":"Auditable file system is used to track the usage of the file system including the operations like read and write. Auditable file system keeps the trails of users’ action and the trails are kept faithfully for future auditing. However, as the logs are still kept within the same file system, it will be quite vulnerable to be exposed as malware penetrating the system. Even with the file system hiding the logs, the skillful attacker can still analyze the on-disk structure to get and modify the logs. Thus the logs should be kept separate from the working system. Virtual machines can provide such separation as virtual machines can hold the whole operating system while still keep the system apart from the metal hardware. We propose a method of secure logging for auditable file system using a logging virtual machine. The logs are kept in another virtual machine safely. Even the working virtual machine is broken; the logs are not exposed to the outside. By the isolation provided by virtual machines, the logs can be kept safe and valid. The high privileged user can not modify the logs contents, or forge the logs and data to keep consistency, or pretend to be another user for doing un-authorized actions. We have done several works as well as a prototype system to show the feasibility of such approach. Experiments show that the logging virtual machine will not bring too much overhead.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132863480","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":"Extended Combination Testing: Generates Array Test Suite","authors":"Xiaodong Xie, Yansheng Lu","doi":"10.1109/ISPA.2009.55","DOIUrl":"https://doi.org/10.1109/ISPA.2009.55","url":null,"abstract":"Traditional testing methods tend to generate test suite for programs of which parameters are basic data types, e.g. integer, real or Boolean. However, there are lots of programs with inputs of complex data types, e.g. array, point or structure, traditional testing methods can’t deal with them. This paper focuses on testing programs with array parameter that is widely used in programming. The difficulties to generate array test suite lie in two reasons. The first reason is that array is composed by several ordered, interactional elements. Thus, we cannot take the array as several independent, isolated elements when generating array test suite. The second one is that we should consider the implicative attributes of array effecting the generation of test suite, e.g. the size of array, or some special elements in array. This paper proposes a new testing method, Extended Combination Testing (ECT), to generate array test suite systemically. Through based on traditional combination testing, ECT extends its application scope form basic data test suite generation to array test suite generation. ECT proceeds in three steps: (1) yield values of other non-array parameters and spawn them to a proper combination; (2) identify the implicative attributes of array; (3) choose values for each array elements, and combine values of array elements with proper combination coverage into test suite. While in traditional combination test, only step (3) is included. The results of our experiment validate the effectiveness of ECT in generating array test suite.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125322440","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":"Characterizing Betweenness Centrality Algorithm on Multi-core Architectures","authors":"Dengbiao Tu, Guangming Tan","doi":"10.1109/ISPA.2009.18","DOIUrl":"https://doi.org/10.1109/ISPA.2009.18","url":null,"abstract":"This paper presents an in-depth analysis of characterization for an irregular application – computing betweenness centrality (BC) – on multi-core architectures. BC algorithm is widely used in large scale graph analysis applications, which play an increasingly important role in high performance computing community. Through a joint study of architecture and application, we find that dynamically non-contiguous memory access, unstructured parallelism and low arithmetic intensity in BC program pose an obstacle to an efficient execution on parallel architectures. The experimental results report a comparison between Intel Clovertown and Sun Niagara1 for running such irregular program. Finally, several implications on mulit-core architecture and programming are proposed.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126390961","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 Forwarding Migration Algorithm for Multipath Transmission","authors":"L. Han, Jinkuan Wang, Jianhua Tang, P. He","doi":"10.1109/ISPA.2009.58","DOIUrl":"https://doi.org/10.1109/ISPA.2009.58","url":null,"abstract":"According to the new features of traffic distribution, a novel forwarding migration algorithm (FMA) is proposed. Programmable routers (PR) are used in FMA. One PR sets FMA bit for unbalanced traffic. Another PR forwards related traffic to the FMA link rather than to wait for matching the longest address prefix. Theoretic analysis shows that FMA can reduce the forwarding burden of core router. Simulation proves that FMA obtains a lower transmission delay and packet loss rate.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115609579","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":"System Monitoring and Controlling Mechanism Based on Hypervisor","authors":"Q. Wu, C. Wang, Yusong Tan","doi":"10.1109/ISPA.2009.99","DOIUrl":"https://doi.org/10.1109/ISPA.2009.99","url":null,"abstract":"Current commodity operating systems allow a privileged user to run some programs in kernel mode by installing a kernel module or a device driver, but there isn’t an available method to verify the reliability of these programs. As a result, malware leverages this way to corrupt system services, defeat anti-malware and even get control of the whole system. It makes operating-system-based security tools undergo all kinds of hardships in face of various attacks. Virtualization technology brings a new chance to protect operating systems out-of-box in hypervisors. This article proposes a system monitoring and controlling framework, named as BMCS, which monitors low-level states and hardware accessing events of operating system in a hypervisor. BMCS abstracts low-level states and events and profiles OS-level semantics with the help of a hosted daemon. Moreover, it can control the execution of operating system software through the hypervisor. Our out-of box method can collect real run-time operating system profile and control the execution of the OS according some defined rules. As a result, it makes the operating system stronger. We implement BMCS based on KVM and experiment results prove that BMCS performs well.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563153","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":"I-Cache Tag Reduction for Low Power Chip Multiprocessor","authors":"Long Zheng, M. Dong, Song Guo, M. Guo, Li Li","doi":"10.1109/ISPA.2009.85","DOIUrl":"https://doi.org/10.1109/ISPA.2009.85","url":null,"abstract":"Energy consumption is a major consideration in microprocessor optimization. This paper presents a tag-reduction based approach for energy saving in L1 I-Cache (instruction cache) of Chip Multiprocessors (CMP). To our best knowledge, this is the first work that extends the tag reduction technique to the CMP. We formulate our approach to an equivalent problem which is to find an assignment of the whole instruction pages in the physical memory to a set of cores such that the tag-reduction conflicts for each core can be mostly avoided or reduced. We then propose three algorithms using different heuristics for this assignment problem. The experimental results show that our proposed algorithms can save the total power up to 45.33% in average compared to the one that the tag-reduction is not used. They outperform significantly the tag-reduction based algorithm on single-core processor as well.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131363649","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 Hardware-Software Cooperative Approach for the Exhaustive Verification of the Collatz Conjecture","authors":"Yasuaki Ito, K. Nakano","doi":"10.1109/ISPA.2009.35","DOIUrl":"https://doi.org/10.1109/ISPA.2009.35","url":null,"abstract":"Consider the following operation on an arbitrary positive number: if the number is even, divide it by two, and if the number is odd, triple it and add one. The Collatz conjecture assert that, starting from any positive number n, repeated iteration of the operations eventually produces the value 1. The main contribution of this paper is to present hardware-software cooperative approach to verify the Collatz conjecture. The key idea of our approach is to sieve numbers n that produces 1 using a circuit implemented on an FPGA. The numbers that fail to be verified by overflow are reported to the host PC. The host PC verifies those numbers using unlimited bits operations by software. We have implemented 24 coprocessors on the Vertex II family FPGA XC2V3000-4. The experimental results show that our hardware-software cooperative approach can verify 2.89x10^9 64-bit numbers per second.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131504041","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 Multiple QoS Constrained Scheduling Strategy of Multiple Workflows for Cloud Computing","authors":"Meng Xu, Li-zhen Cui, Haiyang Wang, Yanbing Bi","doi":"10.1109/ISPA.2009.95","DOIUrl":"https://doi.org/10.1109/ISPA.2009.95","url":null,"abstract":"Cloud computing has gained popularity in recent times. As a cloud must provide services to many users at the same time and different users have different QoS requirements, the scheduling strategy should be developed for multiple workflows with different QoS requirements. In this paper, we introduce a Multiple QoS Constrained Scheduling Strategy of Multi-Workflows (MQMW) to address this problem. The strategy can schedule multiple workflows which are started at any time and the QoS requirements are taken into account. Experimentation shows that our strategy is able to increase the scheduling success rate significantly.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"339 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132618502","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}