发布求助
文献互助 智能选刊 最新文献

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications最新文献

筛选
英文 中文
Load Balancing in Server Consolidation 服务器整合中的负载均衡
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.56
Deshi Ye, Hua Chen, Qinming He
{"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}
引用次数: 3
Tool Support for Security-Oriented Virtual Research Collaborations 面向安全的虚拟研究合作的工具支持
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.49
J. Watt, R. Sinnott, Jipu Jiang, T. Doherty, C. Higgins, Michael Koutroumpas
{"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}
引用次数: 8
A Two-Phase Log-Based Fault Recovery Mechanism in Master/Worker Based Computing Environment 基于主工计算环境下基于日志的两阶段故障恢复机制
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.53
Ting Chen, Yongjian Wang, Yuanqiang Huang, Cheng Luo, D. Qian, Zhongzhi Luan
{"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}
引用次数: 0
Completion Time Estimation for Instances of Generalized Well-Formed Workflow 广义格式良好工作流实例的完成时间估计
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.43
Zuoxian Nie, Xin-hua Jiang, Jian-cheng Liu, Hai-yan Yang
{"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}
引用次数: 1
Software Viterbi Decoder with SSE4 Parallel Processing Instructions for Software DVB-T Receiver 软件Viterbi解码器与SSE4并行处理指令的软件DVB-T接收机
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.100
S. Tseng, Yu-Chin Kuo, Yen-Chih Ku, Yueh-Teng Hsu
{"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}
引用次数: 13
Distributed Transfer Network Learning Based Intrusion Detection 基于分布式迁移网络学习的入侵检测
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.92
S. Gou, Yuqin Wang, L. Jiao, Jing Feng, Yao Yao
{"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}
引用次数: 13
Enhancing Privacy and Security in RFID-Enabled Banknotes 加强rfid钞票的私隐及安全
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.77
Ching-Nung Yang, Jie-Ru Chen, Chih-Yang Chiu, Gen-Chin Wu, Chih-Cheng Wu
{"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}
引用次数: 9
Extended PEG Algorithm for High Rate LDPC Codes 高速率LDPC码的扩展PEG算法
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.80
Zhiheng Zhou, Xiangxue Li, D. Zheng, Kefei Chen, Jianhua Li
{"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}
引用次数: 5
A Quality Optimization Method for Service Process Model 服务过程模型的质量优化方法
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.39
Haiyan Zhao, Jian Cao, Xiaohan Sun
{"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}
引用次数: 0
An Adaptive Resource Monitoring Method for Distributed Heterogeneous Computing Environment 分布式异构计算环境下的自适应资源监控方法
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.13
Gang Yang, Kaibo Wang, Xingshe Zhou
{"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}
引用次数: 4
首页 上一页 下一页 尾页
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学术官方微信