Extrapolation methods belong to the class of one-step methods for the solution of systems of ordinary differential equations (ODEs). In this paper, we present parallel implementation variants of extrapolation methods for large shared-memory computer systems which exploit pure data parallelism or mixed task and data parallelism and make use of different load balancing strategies and different loop structures. In addition to general implementation variants suitable for ODE systems with arbitrary access structure, we devise specialized implementation variants which exploit the specific access structure of a large class of ODE systems to reduce synchronization costs and to improve the locality of memory references. We analyze and compare the scalability and the locality behavior of the implementation variants on an SGI Altix 4700 using up to 500 threads.
{"title":"Mixed-Parallel Implementations of Extrapolation Methods with Reduced Synchronization Overhead for Large Shared-Memory Computers","authors":"Matthias Korch, T. Rauber, C. Scholtes","doi":"10.1109/ICPADS.2010.12","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.12","url":null,"abstract":"Extrapolation methods belong to the class of one-step methods for the solution of systems of ordinary differential equations (ODEs). In this paper, we present parallel implementation variants of extrapolation methods for large shared-memory computer systems which exploit pure data parallelism or mixed task and data parallelism and make use of different load balancing strategies and different loop structures. In addition to general implementation variants suitable for ODE systems with arbitrary access structure, we devise specialized implementation variants which exploit the specific access structure of a large class of ODE systems to reduce synchronization costs and to improve the locality of memory references. We analyze and compare the scalability and the locality behavior of the implementation variants on an SGI Altix 4700 using up to 500 threads.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114151745","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 present a new heuristic that generates broadcast schemes in arbitrary networks. The heuristic gives optimal broadcast time for ring, tree and grid if the originator is on the corner. Extensive simulations show that our new heuristic outperforms the best known broadcast algorithms for two different network models representing Internet and ATM networks. It also allows to generate broadcast time of networks of bigger size because its time complexity, O(|E|), is lower compared to the complexities of the other algorithms. The last advantage of the heuristic is that every node is informed via a shortest path from the originator.
{"title":"Broadcasting Algorithm Via Shortest Paths","authors":"Hovhannes A. Harutyunyan, Wei Wang","doi":"10.1109/ICPADS.2010.110","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.110","url":null,"abstract":"In this paper, we present a new heuristic that generates broadcast schemes in arbitrary networks. The heuristic gives optimal broadcast time for ring, tree and grid if the originator is on the corner. Extensive simulations show that our new heuristic outperforms the best known broadcast algorithms for two different network models representing Internet and ATM networks. It also allows to generate broadcast time of networks of bigger size because its time complexity, O(|E|), is lower compared to the complexities of the other algorithms. The last advantage of the heuristic is that every node is informed via a shortest path from the originator.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114756096","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}
Media streaming services have been much more popular nowadays, and these services consume lots of network bandwidth. Peer-to-Peer(P2P) technology has been employed in the streaming systems to save the server bandwidth consumption and enhance the system scalability. In a P2P streaming system, the quality of the data scheduling scheme will largely affect the server stress that being saved. In this paper, we present our optimal data scheduling scheme to achieve both server stress minimization and fairness among users when the playback continuities of the users are guaranteed. The data scheduling scheme we proposed is based on the maximum network flow problem, and it is proved to be polynomial. Simulations also show that the time consumption for the computation of the optimal scheduling is acceptable, and the result of the scheduling also achieves small node degree bound which makes it practical.
{"title":"Optimal Data Scheduling for P2P VoD Streaming Systems","authors":"Qifeng Yu, Daoxu Chen","doi":"10.1109/ICPADS.2010.55","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.55","url":null,"abstract":"Media streaming services have been much more popular nowadays, and these services consume lots of network bandwidth. Peer-to-Peer(P2P) technology has been employed in the streaming systems to save the server bandwidth consumption and enhance the system scalability. In a P2P streaming system, the quality of the data scheduling scheme will largely affect the server stress that being saved. In this paper, we present our optimal data scheduling scheme to achieve both server stress minimization and fairness among users when the playback continuities of the users are guaranteed. The data scheduling scheme we proposed is based on the maximum network flow problem, and it is proved to be polynomial. Simulations also show that the time consumption for the computation of the optimal scheduling is acceptable, and the result of the scheduling also achieves small node degree bound which makes it practical.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116084056","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}
Service Level Agreements (SLAs) play an important role in guaranteeing successful collaborations among autonomous entities in Internet-based Virtual Computing Environment (iVCE). However, traditional static and predefined SLAs are not suitable for the open and dynamic iVCE. This paper proposes a policy-based framework for supporting dynamic and automated SLA negotiations between autonomous entities in iVCE. Requirements or constraints on SLA attributes as well as negotiation strategies of negotiating parties are both specified in policy specifications using a simple but expressive policy language that extends the WS-Policy framework. According to these policies, a negotiation agent will be dynamically created for each negotiation party, which is responsible for SLA negotiations on behalf of its owner party. We have implemented a prototype of our framework and demonstrated our approach through a case study.
{"title":"A Policy-Based Framework for Automated SLA Negotiation for Internet-Based Virtual Computing Environment","authors":"Z. Xiao, Donggang Cao","doi":"10.1109/ICPADS.2010.104","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.104","url":null,"abstract":"Service Level Agreements (SLAs) play an important role in guaranteeing successful collaborations among autonomous entities in Internet-based Virtual Computing Environment (iVCE). However, traditional static and predefined SLAs are not suitable for the open and dynamic iVCE. This paper proposes a policy-based framework for supporting dynamic and automated SLA negotiations between autonomous entities in iVCE. Requirements or constraints on SLA attributes as well as negotiation strategies of negotiating parties are both specified in policy specifications using a simple but expressive policy language that extends the WS-Policy framework. According to these policies, a negotiation agent will be dynamically created for each negotiation party, which is responsible for SLA negotiations on behalf of its owner party. We have implemented a prototype of our framework and demonstrated our approach through a case study.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121407158","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}
Liang Zhong, Junbin Kang, Chunming Hu, Tianyu Wo, Haibing Zheng, B. Li
In recent years, the Software as a Service, largely enabled by the Internet, has become an innovative software delivery model. During the streaming execution of virtualization software, the execution will wait until the missing data was downloaded, which greatly influences the user experience. In this paper, we present a block-level prefetching framework for streaming delivery of software based on N-Gram prediction model and an incremental data mining algorithm. The prefetching framework uses the historical block access logs for data mining, then dynamically updates and polishes the prefetching rules. The experimental results show that this prefetching framework achieves a launch time reduced by 10% to 50%, as well as hit rate between 81% and 97%.
{"title":"A Prefetching Framework for the Streaming Loading of Virtual Software","authors":"Liang Zhong, Junbin Kang, Chunming Hu, Tianyu Wo, Haibing Zheng, B. Li","doi":"10.1109/ICPADS.2010.25","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.25","url":null,"abstract":"In recent years, the Software as a Service, largely enabled by the Internet, has become an innovative software delivery model. During the streaming execution of virtualization software, the execution will wait until the missing data was downloaded, which greatly influences the user experience. In this paper, we present a block-level prefetching framework for streaming delivery of software based on N-Gram prediction model and an incremental data mining algorithm. The prefetching framework uses the historical block access logs for data mining, then dynamically updates and polishes the prefetching rules. The experimental results show that this prefetching framework achieves a launch time reduced by 10% to 50%, as well as hit rate between 81% and 97%.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124772764","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}
Xiaoming Tang, Panlong Yang, Chang Tian, Laixian Peng, Yubo Yan
The main challenge in DTNs is how to deal with path uncertainty in achieving a reliable routing scheme. All Erasure coding based routing algorithms make the assumption that the underlying path probabilities are known previously and remain constant, which is unpractical. On the other hand, the overall behavior of path probability tends to be stable with the increasing number of paths, which can be used to increase the stability of Erasure coding based schemes. Bearing this in mind, we present Inter-Coding: Inter-Coding is designed to fully combine the reliability of erasure coding, and the stability of interleaving to cope with uncertainties. We evaluate our approach in terms of delivery ratio under different level of uncertainty as well as different interleaving policy, and validate that Inter-Coding offers reliable and stable performance even the path uncertainty and dynamic is high.
{"title":"Inter-Coding: An Interleaving and Erasure Coding Based Stable Routing Scheme in Multi-path DTN","authors":"Xiaoming Tang, Panlong Yang, Chang Tian, Laixian Peng, Yubo Yan","doi":"10.1109/ICPADS.2010.22","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.22","url":null,"abstract":"The main challenge in DTNs is how to deal with path uncertainty in achieving a reliable routing scheme. All Erasure coding based routing algorithms make the assumption that the underlying path probabilities are known previously and remain constant, which is unpractical. On the other hand, the overall behavior of path probability tends to be stable with the increasing number of paths, which can be used to increase the stability of Erasure coding based schemes. Bearing this in mind, we present Inter-Coding: Inter-Coding is designed to fully combine the reliability of erasure coding, and the stability of interleaving to cope with uncertainties. We evaluate our approach in terms of delivery ratio under different level of uncertainty as well as different interleaving policy, and validate that Inter-Coding offers reliable and stable performance even the path uncertainty and dynamic is high.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130356083","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 mechanical engineering and aerospace, gas turbine blades are taken as the crucial components, and need special treatment for protection and long-turn service. Therefore, ceramic Thermal Barrier Coating (TBC), acting as the insulation between gas and the alloying bodies of blades, is utilized to guarantee that the gas turbine blades are able to work in the high-temperature and high-stress environment. It is imperative to non-destructively evaluate TBC systems of blades, since the TBC with thin thickness or delimitation will lead to catastrophic accidents of gas turbines. In this paper, Tri-frequency Eddy Current inspection (TFEC) is proposed for quantitative evaluation of TBC systems, which involves assessment of: (1) TBC thickness to identify possible thinning, and (2) thickness and conductivity of bond coating to detect delimitation and degradation. The Levenberg-Marquardt Algorithm is adopted in the inversion for the parameters, which need to be quantified. In the inverse process, the closed-form expressions of the Jacobian Matrix, which is conventionally obtained by using interpolation functions, are derived based on an analytical modeling. The inversion method is verified by a hybrid numerical modeling, which indicates that the proposed TFEC for quantitative evaluation of TBC is valid and applicable.
{"title":"Quantitative Evaluation of TBC Systems of Gas Turbine Blades Using TFEC","authors":"Yong Li, Y. Mao, Zhenmao Chen","doi":"10.1109/ICPADS.2010.121","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.121","url":null,"abstract":"In mechanical engineering and aerospace, gas turbine blades are taken as the crucial components, and need special treatment for protection and long-turn service. Therefore, ceramic Thermal Barrier Coating (TBC), acting as the insulation between gas and the alloying bodies of blades, is utilized to guarantee that the gas turbine blades are able to work in the high-temperature and high-stress environment. It is imperative to non-destructively evaluate TBC systems of blades, since the TBC with thin thickness or delimitation will lead to catastrophic accidents of gas turbines. In this paper, Tri-frequency Eddy Current inspection (TFEC) is proposed for quantitative evaluation of TBC systems, which involves assessment of: (1) TBC thickness to identify possible thinning, and (2) thickness and conductivity of bond coating to detect delimitation and degradation. The Levenberg-Marquardt Algorithm is adopted in the inversion for the parameters, which need to be quantified. In the inverse process, the closed-form expressions of the Jacobian Matrix, which is conventionally obtained by using interpolation functions, are derived based on an analytical modeling. The inversion method is verified by a hybrid numerical modeling, which indicates that the proposed TFEC for quantitative evaluation of TBC is valid and applicable.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125284187","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}
Providing secure and efficient outsourced storage is a precursor to widespread cloud deployment and availability. For this purpose, existing designs mainly rely on block ciphers, although stream ciphers are more computationally-efficient than block ciphers. This paper presents a construction of secure storage, BLAST, enhanced with a stream cipher rather than a block cipher with a novel block accessible encryption mechanism based on streaming ciphers. In BLAST, a hierarchical tree generated in the form of an n-level quad tree is created for each user during the registration phase of the storage system. When a user wants to access the outsourced storage, the user can access their data after encrypting or decrypting it using a sequence of key stream frames derived from the hierarchical tree. The experimental results show that the proposed system achieves significant improved performance than normal streaming/block cipher-based secure storage system in terms of throughput and access latency.
{"title":"BLAST: Applying Streaming Ciphers Into Outsourced Cloud Storage","authors":"Ki-Woong Park, Chulmin Kim, K. Park","doi":"10.1109/ICPADS.2010.9","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.9","url":null,"abstract":"Providing secure and efficient outsourced storage is a precursor to widespread cloud deployment and availability. For this purpose, existing designs mainly rely on block ciphers, although stream ciphers are more computationally-efficient than block ciphers. This paper presents a construction of secure storage, BLAST, enhanced with a stream cipher rather than a block cipher with a novel block accessible encryption mechanism based on streaming ciphers. In BLAST, a hierarchical tree generated in the form of an n-level quad tree is created for each user during the registration phase of the storage system. When a user wants to access the outsourced storage, the user can access their data after encrypting or decrypting it using a sequence of key stream frames derived from the hierarchical tree. The experimental results show that the proposed system achieves significant improved performance than normal streaming/block cipher-based secure storage system in terms of throughput and access latency.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128322722","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}
there are many approaches proposed to provide anonymous peer-to-peer communications. Data sent via peer-to-peer communications is vulnerable to traffic analysis. Traffic analysis is the process of intercepting and analysing messages in order to compromise information from patterns in communications. An intruder can get information about the content of the data, the requester's and provider's identities. Anonymous approaches are designed with the following three goals: to protect the identity of provider, to protect the identity of requester and to protect the contents of transferred data between them. This article presents a new peer-to-peer approach to achieve anonymity between a requester and a provider in a hybrid peer-to-peer information-sharing environment with trusted servers called supper node so that the provider will not be able to identify the requester and no other peers can identify the two communicating parties with certainty. This article shows that the proposed approaches improved reliability and has more security. This approach, based on onion routing and randomization, protects transferring data against traffic analysis attack. The ultimate goal of this anonymous communications approach is to allow a requester to communicate with a provider in such a manner that nobody can determine the requester’s identity and the content of transferred data.
{"title":"Dual-Path Peer-to-Peer Anonymous Approach","authors":"Ehsan Saboori, M. Abbaspour","doi":"10.1109/ICPADS.2010.111","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.111","url":null,"abstract":"there are many approaches proposed to provide anonymous peer-to-peer communications. Data sent via peer-to-peer communications is vulnerable to traffic analysis. Traffic analysis is the process of intercepting and analysing messages in order to compromise information from patterns in communications. An intruder can get information about the content of the data, the requester's and provider's identities. Anonymous approaches are designed with the following three goals: to protect the identity of provider, to protect the identity of requester and to protect the contents of transferred data between them. This article presents a new peer-to-peer approach to achieve anonymity between a requester and a provider in a hybrid peer-to-peer information-sharing environment with trusted servers called supper node so that the provider will not be able to identify the requester and no other peers can identify the two communicating parties with certainty. This article shows that the proposed approaches improved reliability and has more security. This approach, based on onion routing and randomization, protects transferring data against traffic analysis attack. The ultimate goal of this anonymous communications approach is to allow a requester to communicate with a provider in such a manner that nobody can determine the requester’s identity and the content of transferred data.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128483958","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 peacekeeping, domestic or combat operations, unanticipated crowd confrontations can occur. As a highly dynamic social group, human crowd in confrontation is a fascinating phenomenon. This study proposes a novel method based on the concept of vector field to formulate the way in which external stimuli may affect the behaviors of individuals in a crowd. Our approach represents each individual as an autonomous agent whose actions are guided by the vector field model. Furthermore, the concept of information entropy has been adopted to describe the connection between individuals’ behaviors and the potential of disorder of the whole crowd. A quantitative analysis on intangible dynamics of a crowd in confrontation is then enabled, which is significant in designing crowd control tactics.
{"title":"Velocity Field Based Modelling and Simulation of Crowd in Confrontation Operations","authors":"Congcong Bian, Dan Chen, Shuaiting Wang","doi":"10.1109/ICPADS.2010.95","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.95","url":null,"abstract":"In peacekeeping, domestic or combat operations, unanticipated crowd confrontations can occur. As a highly dynamic social group, human crowd in confrontation is a fascinating phenomenon. This study proposes a novel method based on the concept of vector field to formulate the way in which external stimuli may affect the behaviors of individuals in a crowd. Our approach represents each individual as an autonomous agent whose actions are guided by the vector field model. Furthermore, the concept of information entropy has been adopted to describe the connection between individuals’ behaviors and the potential of disorder of the whole crowd. A quantitative analysis on intangible dynamics of a crowd in confrontation is then enabled, which is significant in designing crowd control tactics.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125669890","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
扫码关注我们
求助内容：
应助结果提醒方式：