The growth of server consolidation is due to virtualization technology that enables multiple servers to run on a single platform. However, virtualization may bring the overheads in performance. The prediction of virtualization performance is of especially important. The contribution of our paper is two-fold. First, we propose a general model to predict the performance of consolidation. Second, we study a load balancing problem that arises in server consolidation, where is to assign a number of workloads to a small number of high-performance target servers such that the workloads in each target servers are balancing. We first model the load balancing problem as an integer linear programming. Then, an fully polynomial time approximate scheme (FPTAS) is provided to get the near optimal solution. That is to say, for any given $varepsilon ≫ 0$, our algorithm achieves ($1+varepsilon$)-approximation, and its running time is polynomial of both the number of source servers and $1/varepsilon$ when the number of target servers and the dimensions are constants.
{"title":"Load Balancing in Server Consolidation","authors":"Deshi Ye, Hua Chen, Qinming He","doi":"10.1109/ISPA.2009.56","DOIUrl":"https://doi.org/10.1109/ISPA.2009.56","url":null,"abstract":"The growth of server consolidation is due to virtualization technology that enables multiple servers to run on a single platform. However, virtualization may bring the overheads in performance. The prediction of virtualization performance is of especially important. The contribution of our paper is two-fold. First, we propose a general model to predict the performance of consolidation. Second, we study a load balancing problem that arises in server consolidation, where is to assign a number of workloads to a small number of high-performance target servers such that the workloads in each target servers are balancing. We first model the load balancing problem as an integer linear programming. Then, an fully polynomial time approximate scheme (FPTAS) is provided to get the near optimal solution. That is to say, for any given $varepsilon ≫ 0$, our algorithm achieves ($1+varepsilon$)-approximation, and its running time is polynomial of both the number of source servers and $1/varepsilon$ when the number of target servers and the dimensions are constants.","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":"132687672","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}
J. Watt, R. Sinnott, Jipu Jiang, T. Doherty, C. Higgins, Michael Koutroumpas
Collaboration is at the heart of e-Science and e-Research more generally. Successful collaborations must address both the needs of the end user researchers and the providers that make resources available. Usability and security are two fundamental requirements that are demanded by many collaborations and both concerns must be considered from both the researcher and resource provider perspective. In this paper we outline tools and methods developed at the National e-Science Centre (NeSC) that provide users with seamless, secure access to distributed resources through security-oriented research environments, whilst also allowing resource providers to define and enforce their own local access and usage policies through intuitive user interfaces. We describe these tools and illustrate their application in the ESRC-funded Data Management through e-Social Science (DAMES) and the JISC-funded SeeGEO projects
{"title":"Tool Support for Security-Oriented Virtual Research Collaborations","authors":"J. Watt, R. Sinnott, Jipu Jiang, T. Doherty, C. Higgins, Michael Koutroumpas","doi":"10.1109/ISPA.2009.49","DOIUrl":"https://doi.org/10.1109/ISPA.2009.49","url":null,"abstract":"Collaboration is at the heart of e-Science and e-Research more generally. Successful collaborations must address both the needs of the end user researchers and the providers that make resources available. Usability and security are two fundamental requirements that are demanded by many collaborations and both concerns must be considered from both the researcher and resource provider perspective. In this paper we outline tools and methods developed at the National e-Science Centre (NeSC) that provide users with seamless, secure access to distributed resources through security-oriented research environments, whilst also allowing resource providers to define and enforce their own local access and usage policies through intuitive user interfaces. We describe these tools and illustrate their application in the ESRC-funded Data Management through e-Social Science (DAMES) and the JISC-funded SeeGEO projects","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"39 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":"132703819","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}
The Master/worker pattern is widely used to construct the cross-domain, large scale computing infrastructure. The applications supported by this kind of infrastructure usually features long-running, speculative execution etc. Fault recovery mechanism is significant to them especially in the wide area network environment, which consists of error prone components. Inter-node cooperation is urgent to make the recovery process more efficient. The traditional log-based rollback recovery mechanism which features independent recovery cannot fulfill the global cooperation requirement due to the waste of bandwidth and slow application data transfer which is caused by the exchange of a large amount of logs. In this paper, we propose a two-phase log-based recovery mechanism which is of merits such as space saving and global optimization and can be used as a complement of the current log-based rollback recovery approach in some specific situations. We have demonstrated the use of this mechanism in the Drug Discovery Grid environment, which is supported by China National Grid. Experiment results have proved efficiency of this mechanism.
{"title":"A Two-Phase Log-Based Fault Recovery Mechanism in Master/Worker Based Computing Environment","authors":"Ting Chen, Yongjian Wang, Yuanqiang Huang, Cheng Luo, D. Qian, Zhongzhi Luan","doi":"10.1109/ISPA.2009.53","DOIUrl":"https://doi.org/10.1109/ISPA.2009.53","url":null,"abstract":"The Master/worker pattern is widely used to construct the cross-domain, large scale computing infrastructure. The applications supported by this kind of infrastructure usually features long-running, speculative execution etc. Fault recovery mechanism is significant to them especially in the wide area network environment, which consists of error prone components. Inter-node cooperation is urgent to make the recovery process more efficient. The traditional log-based rollback recovery mechanism which features independent recovery cannot fulfill the global cooperation requirement due to the waste of bandwidth and slow application data transfer which is caused by the exchange of a large amount of logs. In this paper, we propose a two-phase log-based recovery mechanism which is of merits such as space saving and global optimization and can be used as a complement of the current log-based rollback recovery approach in some specific situations. We have demonstrated the use of this mechanism in the Drug Discovery Grid environment, which is supported by China National Grid. Experiment results have proved efficiency of this mechanism.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"258 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":"133995232","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}
Zuoxian Nie, Xin-hua Jiang, Jian-cheng Liu, Hai-yan Yang
Completion time estimation for workflow instances is an important basis for real time workflow management and scheduling. Current researches on this topic omitted the fact that: instances of workflow that contains OR-SPLIT are certain to bypass some activities, thus at a particular time point, estimation of completion time for workflow instances should be based merely on activities that were already visited by it and are possible to be visited by it in the future. Firstly, rules were proposed to build reachable subnets for workflow instances. Subsequently, the complex problem of completion time estimation for generalized well-formed reachable subnet was decomposed to simpler ones for potential instance subgraphs, which were computed based on active transition performance equivalent model. Lastly, an example was given to demonstrate the process of completion time estimation for generalized well-formed workflow instances.
{"title":"Completion Time Estimation for Instances of Generalized Well-Formed Workflow","authors":"Zuoxian Nie, Xin-hua Jiang, Jian-cheng Liu, Hai-yan Yang","doi":"10.1109/ISPA.2009.43","DOIUrl":"https://doi.org/10.1109/ISPA.2009.43","url":null,"abstract":"Completion time estimation for workflow instances is an important basis for real time workflow management and scheduling. Current researches on this topic omitted the fact that: instances of workflow that contains OR-SPLIT are certain to bypass some activities, thus at a particular time point, estimation of completion time for workflow instances should be based merely on activities that were already visited by it and are possible to be visited by it in the future. Firstly, rules were proposed to build reachable subnets for workflow instances. Subsequently, the complex problem of completion time estimation for generalized well-formed reachable subnet was decomposed to simpler ones for potential instance subgraphs, which were computed based on active transition performance equivalent model. Lastly, an example was given to demonstrate the process of completion time estimation for generalized well-formed workflow instances.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"246 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":"113998639","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}
In this paper, we discuss the procedures how to make Viterbi decoder faster. The implementation in Intel CPU with SSE4 parallel processing instruction sets and some other methods achieves the decoding speed 47.05 Mbps (0.64 Mbps originally). The DVB-T mode used in Taiwan needs 13.27 Mbps to achieve real-time reception, so our implementation of software Viterbi decoder takes only 28% CPU loading.
{"title":"Software Viterbi Decoder with SSE4 Parallel Processing Instructions for Software DVB-T Receiver","authors":"S. Tseng, Yu-Chin Kuo, Yen-Chih Ku, Yueh-Teng Hsu","doi":"10.1109/ISPA.2009.100","DOIUrl":"https://doi.org/10.1109/ISPA.2009.100","url":null,"abstract":"In this paper, we discuss the procedures how to make Viterbi decoder faster. The implementation in Intel CPU with SSE4 parallel processing instruction sets and some other methods achieves the decoding speed 47.05 Mbps (0.64 Mbps originally). The DVB-T mode used in Taiwan needs 13.27 Mbps to achieve real-time reception, so our implementation of software Viterbi decoder takes only 28% CPU loading.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"102 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":"115610787","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}
In order to solve the problem that there exists unbalanced detection performance on different types of attacks in current large-scale network intrusion detection algorithms, Distributed Transfer Network Learning algorithm is proposed in this paper. The algorithm introduces transfer learning into Distributed Network Boosting algorithm for instructing the attacks learning with poor performance, in which the instances transfer learning is adopted for different domain adaptation. The experimental results on the Kdd Cup’99 Data Set show that the proposed algorithm has higher efficacy and better performance. Further, the detection accuracy of R2L attacks has been improved greatly while maintaining higher detection accuracy of other attack types.
为了解决目前大规模网络入侵检测算法对不同类型攻击检测性能不均衡的问题，本文提出了分布式传输网络学习算法。该算法将迁移学习引入到分布式网络增强算法中，指导性能较差的攻击学习，并采用实例迁移学习进行不同领域的自适应。在Kdd Cup ' 99数据集上的实验结果表明，该算法具有较高的效率和较好的性能。此外，在对其他攻击类型保持较高检测精度的同时，R2L攻击的检测精度得到了很大的提高。
{"title":"Distributed Transfer Network Learning Based Intrusion Detection","authors":"S. Gou, Yuqin Wang, L. Jiao, Jing Feng, Yao Yao","doi":"10.1109/ISPA.2009.92","DOIUrl":"https://doi.org/10.1109/ISPA.2009.92","url":null,"abstract":"In order to solve the problem that there exists unbalanced detection performance on different types of attacks in current large-scale network intrusion detection algorithms, Distributed Transfer Network Learning algorithm is proposed in this paper. The algorithm introduces transfer learning into Distributed Network Boosting algorithm for instructing the attacks learning with poor performance, in which the instances transfer learning is adopted for different domain adaptation. The experimental results on the Kdd Cup’99 Data Set show that the proposed algorithm has higher efficacy and better performance. Further, the detection accuracy of R2L attacks has been improved greatly while maintaining higher detection accuracy of other attack types.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"40 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":"114647785","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}
A novel and interesting application of RFID was a banknote attached a tag to determine the authenticity of money and to stop counterfeits. At Financial Cryptography 2003, Juels and Pappu firstly proposed a practical RFID banknote protection scheme (RBPS) by using the optical and the electrical (RFID) contacts. RFID-enabled notes can be tracked by the legal law agency and verified by the merchant. However, some effective attacks on the Juels-Pappu RBPS were subsequently proposed. In this paper, we enhance the Juels-Pappu RBPS to conquer such attacks.
{"title":"Enhancing Privacy and Security in RFID-Enabled Banknotes","authors":"Ching-Nung Yang, Jie-Ru Chen, Chih-Yang Chiu, Gen-Chin Wu, Chih-Cheng Wu","doi":"10.1109/ISPA.2009.77","DOIUrl":"https://doi.org/10.1109/ISPA.2009.77","url":null,"abstract":"A novel and interesting application of RFID was a banknote attached a tag to determine the authenticity of money and to stop counterfeits. At Financial Cryptography 2003, Juels and Pappu firstly proposed a practical RFID banknote protection scheme (RBPS) by using the optical and the electrical (RFID) contacts. RFID-enabled notes can be tracked by the legal law agency and verified by the merchant. However, some effective attacks on the Juels-Pappu RBPS were subsequently proposed. In this paper, we enhance the Juels-Pappu RBPS to conquer such attacks.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"449 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":"122963870","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}
Zhiheng Zhou, Xiangxue Li, D. Zheng, Kefei Chen, Jianhua Li
Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.
{"title":"Extended PEG Algorithm for High Rate LDPC Codes","authors":"Zhiheng Zhou, Xiangxue Li, D. Zheng, Kefei Chen, Jianhua Li","doi":"10.1109/ISPA.2009.80","DOIUrl":"https://doi.org/10.1109/ISPA.2009.80","url":null,"abstract":"Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"146 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":"123262125","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}
With the popularity of Web services, a set of Web services with similar functions but different qualities can be found. Since services are often be composed through a service process model, the way to compose them affects the whole quality of the process model itself. In this paper, a quality optimization method for the service process model is proposed, which takes the structure of service process into account. Based on the proposed quality model, a genetic algorithm is proposed to optimize the service process model.
{"title":"A Quality Optimization Method for Service Process Model","authors":"Haiyan Zhao, Jian Cao, Xiaohan Sun","doi":"10.1109/ISPA.2009.39","DOIUrl":"https://doi.org/10.1109/ISPA.2009.39","url":null,"abstract":"With the popularity of Web services, a set of Web services with similar functions but different qualities can be found. Since services are often be composed through a service process model, the way to compose them affects the whole quality of the process model itself. In this paper, a quality optimization method for the service process model is proposed, which takes the structure of service process into account. Based on the proposed quality model, a genetic algorithm is proposed to optimize the service process model.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"16 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":"122822860","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}
Resource performance monitoring is among the most active research topics in distributed computing. In this paper, we propose an adaptive resource monitoring method for applications in heterogeneous computing environment. According to the operating environment of distributed heterogeneous system and the changes of system resource workload, the method combines periodic pull mode with event-driven push mode to adaptively publish and retrieve system resource information. Preliminary experiments reveal that, by using our adaptive monitoring method, the efficiency of system monitoring is improved over that accrued by using regular monitoring approaches.
{"title":"An Adaptive Resource Monitoring Method for Distributed Heterogeneous Computing Environment","authors":"Gang Yang, Kaibo Wang, Xingshe Zhou","doi":"10.1109/ISPA.2009.13","DOIUrl":"https://doi.org/10.1109/ISPA.2009.13","url":null,"abstract":"Resource performance monitoring is among the most active research topics in distributed computing. In this paper, we propose an adaptive resource monitoring method for applications in heterogeneous computing environment. According to the operating environment of distributed heterogeneous system and the changes of system resource workload, the method combines periodic pull mode with event-driven push mode to adaptively publish and retrieve system resource information. Preliminary experiments reveal that, by using our adaptive monitoring method, the efficiency of system monitoring is improved over that accrued by using regular monitoring approaches.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"23 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":"125513415","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：