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

2013 International Conference on Parallel and Distributed Systems最新文献

筛选
英文 中文
Multi-resource Aware Congestion Control in Data Centers 数据中心的多资源感知拥塞控制
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.119
Deke Guo, Q. Wu, Shanshan Li, Yusong Tan, Quanyuan Wu
{"title":"Multi-resource Aware Congestion Control in Data Centers","authors":"Deke Guo, Q. Wu, Shanshan Li, Yusong Tan, Quanyuan Wu","doi":"10.1109/ICPADS.2013.119","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.119","url":null,"abstract":"Network has been widely reported as a bottleneck of data center applications. However, current researches of congestion control are unaware of multiple resources consuming and decrease all flows when congestion, ignoring some involved flows may not be the faults. In this paper, we propose a novel multi-resources aware congestion control framework MRTCP to provide a fine-grain control on flows when congestions appear. MRTCP exploits a multi-tuple vector model to measure multi-resources provision and consumption, and develops a novel metric RB (Resource Balance) to denote the heterogeneous amounts of resources employed by each flow. It analyzes which resources are being the bottlenecks that lead to congestions, calculates the responsibility of each flow to this congestion, and then adjusts their sending rates respectively. Our experiment results demonstrate that MRTCP is able to optimize network multi-resources utilization and improve network throughput without adding obvious packets delays.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125075565","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
Real Asynchronous MPI Communication in Hybrid Codes through OpenMP Communication Tasks 通过OpenMP通信任务实现混合码中的真实异步MPI通信
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.39
D. Büttner, Jean-Thomas Acquaviva, J. Weidendorfer
{"title":"Real Asynchronous MPI Communication in Hybrid Codes through OpenMP Communication Tasks","authors":"D. Büttner, Jean-Thomas Acquaviva, J. Weidendorfer","doi":"10.1109/ICPADS.2013.39","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.39","url":null,"abstract":"With the number of cores growing faster than memory per node, hybrid programming models (mixing message passing with shared memory paradigms) become a requirement for efficient use of HPC systems. For this scenario, achieving efficient communication is challenging. This is true even when using asynchronous communication, as most MPI implementations can only advance communication inside library calls. In this paper we propose to move communication into a new type of OpenMP task, which gets scheduled as part of the regular OpenMP work-pool. We show for compute intensive iterative stencil algorithms, that this provides real asynchronous communication. Without complicating the programming interface, our results show an excellent performance independent of the communication to computation ratio.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123743390","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
SimNUMA: Simulating NUMA-Architecture Multiprocessor Systems Efficiently SimNUMA:高效模拟numa架构多处理器系统
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.55
Yi Liu, Yanchao Zhu, Xiang Li, Zehui Ni, Tao Liu, Yali Chen, Jin Wu
{"title":"SimNUMA: Simulating NUMA-Architecture Multiprocessor Systems Efficiently","authors":"Yi Liu, Yanchao Zhu, Xiang Li, Zehui Ni, Tao Liu, Yali Chen, Jin Wu","doi":"10.1109/ICPADS.2013.55","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.55","url":null,"abstract":"Non-uniform memory access (NUMA) architecture is widely used in high-end servers and computing systems due to its scalability. In recent years, the number of processor cores in NUMA systems increases rapidly with the development of multi-core processors. Along with the growing of system scales, simulation of NUMA systems becomes a challenge to traditional general-purpose simulators by reason of their low simulation performance. This paper presents SimNUMA, an execution-driven full-system simulator dedicated for NUMA systems. In the design of SimNUMA, to improve simulation performance significantly, the same type of processor with the target machine is used in the host system, and a new method to capture remote-memory accesses efficiently is proposed, in addition, parallel simulation is used to achieve scalability and improve performance. The modeling and simulation of interconnection networks are also supported. The simulator is tested in accuracy, scalability and performance, results show that the simulation slowdown is rather satisfying. Finally, the paper gives simulation experiments for different scales of target NUMA systems.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126280554","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
Detecting Correlation Violations and Data Races by Inferring Non-deterministic Reads 通过推断非确定性读取来检测相关违规和数据竞争
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.14
A. Jannesari, Nico Koprowski, Jochen Schimmel, F. Wolf, W. Tichy
{"title":"Detecting Correlation Violations and Data Races by Inferring Non-deterministic Reads","authors":"A. Jannesari, Nico Koprowski, Jochen Schimmel, F. Wolf, W. Tichy","doi":"10.1109/ICPADS.2013.14","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.14","url":null,"abstract":"With the introduction of multicore systems and parallel programs concurrency bugs have become more common. A notorious class of these bugs are data races that violate correlations between variables. This happens, for example, when the programmer does not update correlated variables atomically, which is needed to maintain their semantic relationship. The detection of such races is challenging because correlations among variables usually escape traditional race detectors which are oblivious of semantic relationships. In this paper, we present an effective method for dynamically identifying correlated variables together with a race detector based on the notion of non-deterministic reads that identifies malicious data races on correlated variables. In eight programs and 190 micro benchmarks, we found more than 100 races that were overlooked by other race detectors. Furthermore, we identified about 300 variable correlations which were violated by these races.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116454240","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
On the HDT with the Tree Representation for Large RDFs on GPU 基于GPU的大型rdf树表示HDT研究
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.116
Chidchanok Choksuchat, C. Phongpensri
{"title":"On the HDT with the Tree Representation for Large RDFs on GPU","authors":"Chidchanok Choksuchat, C. Phongpensri","doi":"10.1109/ICPADS.2013.116","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.116","url":null,"abstract":"Nowadays, semantic web technology depends on interexchange and integration of RDF data for various aspects of each social communication. The searching for possible answer to the related topics across the open data source obviously becomes a massive task. In this research, we study the RDF query with parallel processing on the GPU. In particular, in this paper, we consider the compact data representation for the RDFs which can enable importing more data to the GPUs memory to enable parallel search in the GPU. The key idea is the use of compressed data type such as HDT before going the search on GPUs. Loading the HDT file to the GPUs straightforwardly and perform searching may not be the good solutions. Thus, this work presents the tree representation from the HDT data which can com-pact the HDT triples, ease the GPU memory transfer, and enable the GPU parallel search. With the HDT representation, the size is reduced from the original RDF about 10%-30%. Together with the tree array representation, we can reduce the redundant terms from in HDT triples by 30%-50% for the test cases.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133001281","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
Linear Function Based Transformation Scheme for Preserving Database Privacy in Cloud Computing 基于线性函数的云计算数据库隐私保护转换方案
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.90
M. Yoon, Hyeong-Il Kim, Miyoung Jang, Jae-Woo Chang
{"title":"Linear Function Based Transformation Scheme for Preserving Database Privacy in Cloud Computing","authors":"M. Yoon, Hyeong-Il Kim, Miyoung Jang, Jae-Woo Chang","doi":"10.1109/ICPADS.2013.90","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.90","url":null,"abstract":"Because much interest in spatial database in cloud computing has been attracted, studies on preserving location data privacy in cloud computing have been actively done. However, since the existing spatial transformation schemes are weak to proximity attack, they cannot preserve the privacy of users who enjoy location-based services from the cloud computing. Therefore, a transformation scheme for providing a safe service to users is required. So, we, in this paper, propose a new transformation scheme based on a line symmetric transformation (LST). The proposed scheme performs both LST-based data distribution and error injection transformation for preventing proximity attack effectively. Finally, we show from our performance analysis that the proposed scheme greatly reduces the success rate of the proximity attack while performing the spatial transformation in an efficient way.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"115 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134582054","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
Reputation Measurement of Cloud Services Based on Unstable Feedback Ratings 基于不稳定反馈评级的云服务声誉度量
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1504/IJWGS.2015.072805
Shangguang Wang, Lei Sun, Qibo Sun, Jie Wei, Fangchun Yang
{"title":"Reputation Measurement of Cloud Services Based on Unstable Feedback Ratings","authors":"Shangguang Wang, Lei Sun, Qibo Sun, Jie Wei, Fangchun Yang","doi":"10.1504/IJWGS.2015.072805","DOIUrl":"https://doi.org/10.1504/IJWGS.2015.072805","url":null,"abstract":"With the rapid development of Cloud computing, more and more service providers could provide cloud services (applications) to users. Faced with mass Cloud services, trust and reputation mechanisms offer a promising way to solve the trust evaluation of Cloud services. Hence, trust and reputation play an important role in evaluating of Cloud services. In this paper, we propose a lightweight reputation measurement approach for Cloud services based on (user) feedback ratings. The proposed approach first adopts cloud model to obtain the trust vector of each cloud service by exploiting feedback ratings. The trust vector consists of Expected value, Entropy value and Hyper-Entropy value. Then we use fuzzy set theory to calculate the reputation scores of Cloud services. Simulation results show that the proposed approach is significantly effective for unstable feedback ratings.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"18 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132027066","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}
引用次数: 26
A Better Understanding of Event-Triggered Control from a CPS Perspective 从CPS的角度更好地理解事件触发控制
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.45
J. An, Jianguo Yao, Haihang Zhou, F. Hu
{"title":"A Better Understanding of Event-Triggered Control from a CPS Perspective","authors":"J. An, Jianguo Yao, Haihang Zhou, F. Hu","doi":"10.1109/ICPADS.2013.45","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.45","url":null,"abstract":"In cybernetics filed, the benefit of event-triggered control reaches a consensus, but in practice the event-triggered control is hampered by the lack of a system theory. This paper provides a Cyber-Physical System (CPS) viewpoint of the relation between the controller and the physical plant to explain the event detection logic of the event-triggered control. The relation between the controller and the physical plant is considered as communication, and based on this communication process the controller and the physical plant exchange the information entropy and thermodynamic entropy. The physical plant generates the thermodynamic entropy and the controller provides the negative thermodynamic entropy based on the predictability of the mathematical model for the physical plant, where there is an entropy balance process between the thermodynamic entropy and information entropy. The adjustment of the controller cycle period is the process to adjust the entropy balance process, which implies the event detection logic.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133035170","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
Spatial Data Mining in the Context of Big Data 大数据背景下的空间数据挖掘
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.88
Shuliang Wang, Hanning Yuan
{"title":"Spatial Data Mining in the Context of Big Data","authors":"Shuliang Wang, Hanning Yuan","doi":"10.1109/ICPADS.2013.88","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.88","url":null,"abstract":"In this paper, spatial data mining is presented in the context of big data. Spatial data plays a primary role in big data, attracting human interests. Spatial data mining confronts much difficulty when attracting the value hidden in spatial big data. The techniques to discover knowledge from spatial big data may help data to become intelligent.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130175906","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
ConsumSense: A Framework for Physical Consuming Behavior Prediction on Smartphones 消费感知:智能手机物理消费行为预测框架
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.36
Guanzhong Ding, C. King, Yi-Fan Chung
{"title":"ConsumSense: A Framework for Physical Consuming Behavior Prediction on Smartphones","authors":"Guanzhong Ding, C. King, Yi-Fan Chung","doi":"10.1109/ICPADS.2013.36","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.36","url":null,"abstract":"Automatic track and prediction of consumer behaviors involve huge commercial interests and have been studied extensively in the past. We have seen very successful application of such techniques on online consuming behaviors. However, it is still very challenging to predict consumer behaviors in physical stores, because many operations in the middle are not digitized. As smartphones are becoming indispensible in our daily life, we propose to build a framework, called ConsumSense, into the smartphones that observes in close-up the physical consuming behavior of the user and predicts his/her future purchases. Our framework addresses two difficult issues: (1) how to use the limited number of sensors on a smart phone to observe and predict the consuming behavior of its user? (2) how to verify and correlate the purchases? To demonstrate the feasibility of the proposed framework, we have developed the framework on Android and evaluated it by asking 14 participants to conduct a 3-week experiment by using Easy card during their daily life. The results show that time and location are the most important contexts for predicting consuming activities and our framework can achieve a 76% prediction accuracy.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114338514","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信