2011 40th International Conference on Parallel Processing Workshops最新文献

筛选
英文 中文
iMace: Protecting Females from Sexual and Violent Offenders in a Community via Smartphones iMace:通过智能手机保护女性免受社区性暴力犯罪者的侵害
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.57
Jou-Chih Chang, Pi-Shih Wang, K. Fan, Shih-Rong Yang, D. Su, M. Lin, Min-Te Sun, Y. Tseng
{"title":"iMace: Protecting Females from Sexual and Violent Offenders in a Community via Smartphones","authors":"Jou-Chih Chang, Pi-Shih Wang, K. Fan, Shih-Rong Yang, D. Su, M. Lin, Min-Te Sun, Y. Tseng","doi":"10.1109/ICPPW.2011.57","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.57","url":null,"abstract":"Personal safety in a community is an important issue. In particular, females and children are more vulnerable to violent and/or sexual attacks. In this project, we utilize smart phones and wireless networking techniques to provide a rescue-seeking mechanism for people under attack. When a user encounters an assault, by simply shaking the smart phone, iMace will not only produce high-pitch alarms to fend off the attacker but also quickly notify friends and law enforcement the location and even the snapshot of the attack. Such a fast response to attacks can eventually lead to a safer and better community.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131132622","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}
引用次数: 11
Secure Connectivity for Intra-cloud and Inter-cloud Communication 云内和云间通信的安全连接
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.54
Shiping Chen, S. Nepal, R. Liu
{"title":"Secure Connectivity for Intra-cloud and Inter-cloud Communication","authors":"Shiping Chen, S. Nepal, R. Liu","doi":"10.1109/ICPPW.2011.54","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.54","url":null,"abstract":"The cloud has become an attractive platform for enterprises to deploy and execute their business services for B2B collaborations. Naturally, some of the confidential B2B collaborations require secure tunnels to secure the messaging between the services that are deployed within the same cloud or different clouds. This article examines this issue by reviewing existing network security technologies and presenting an electronic contract based solution that provides a secure Connectivity as a Service (CaaS) for intra-cloud and inter-cloud communications with little or no configuration effort.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"355 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132691908","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}
引用次数: 20
An Efficient I/O Aggregator Assignment Scheme for Collective I/O Considering Processor Affinity 一种考虑处理器亲和性的I/O聚合器分配方案
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.23
Kwangho Cha, S. Maeng
{"title":"An Efficient I/O Aggregator Assignment Scheme for Collective I/O Considering Processor Affinity","authors":"Kwangho Cha, S. Maeng","doi":"10.1109/ICPPW.2011.23","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.23","url":null,"abstract":"As the number of processes in parallel applications increases, the importance of parallel I/O is also emphasized. Collective I/O is the specialized parallel I/O which provides the function of single-file-based parallel I/O. Collective I/O in popular message-passing interface (MPI) libraries follows a two-phase I/O scheme, in which the particular processes, namely I/O aggregators, perform important roles by engaging communications and I/O operations. Although there have been many previous works to improve the performance of collective I/O, it is hard to find a study about an I/O aggregator assignment considering multi-core architecture. Nowadays, many HPC systems use the multi-core system as a computational node. Therefore, it is important to understand the characteristics of multi-core architecture, such as processor affinity, in order to increase the performance of parallel applications. In this paper, we discovered that the communication costs in collective I/O were different according to the placement of I/O aggregators, where the computational nodes consisted of multi-core system and each node had multiple I/O aggregators. We also proposed a modified collective I/O scheme, in order to reduce the communication costs of collective I/O, by proper placement of I/O aggregators. The performance of our proposed scheme was examined on a Linux cluster system and the result demonstrated performance improvements in the range of 7.08% to 90.46% for read operations and 20.67% to 90.18% for write operations.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123247739","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}
引用次数: 7
Critical-Path-Guided Interactive Parallelisation 关键路径引导的交互式并行化
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.26
Jonathan Chee Heng Mak, A. Mycroft
{"title":"Critical-Path-Guided Interactive Parallelisation","authors":"Jonathan Chee Heng Mak, A. Mycroft","doi":"10.1109/ICPPW.2011.26","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.26","url":null,"abstract":"With the prevalence of multi-core processors, it is essential that legacy programs are parallelised effectively and efficiently. However, compilers have not been able to automatically extract sufficient parallelism in general programs. One of the major reasons, we argue, is that algorithms are often implemented sequentially in a way that unintentionally precludes efficient parallelisation. As manual parallelisation is usually tedious and error-prone, we propose a profiling-based interactive approach to program parallelisation, by presenting a tool-chain with two main components: Embla 2, a dependence-profiler that estimates the amount of task-level parallelism in programs, and Woolifier, a source-to-source transformer that uses Embla 2's output to parallelise programs using Wool, a Cilk-like API, to express parallelism. Based on profiled dependences, our tool-chain (i) performs an automatic best-effort parallelisation and (ii) presents remaining critical paths in a concise graphical form to the programmer, who can then quickly locate and refactor parallelism bottlenecks. Using case studies from the SPEC CPU 2000 benchmarks, we demonstrate how this tool-chain enables us to efficiently parallelise legacy sequential programs, achieving significant speed-ups on commodity multi-core processors.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129967040","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}
引用次数: 2
Accelerating the Near Non-bonded Force Computation in Desmond with Graphic Processing Units 图形处理单元加速Desmond中近非粘结力的计算
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-01 DOI: 10.1109/ICPPW.2011.14
Hualiang Deng, Xin Li, X. Liu, G. Wang
{"title":"Accelerating the Near Non-bonded Force Computation in Desmond with Graphic Processing Units","authors":"Hualiang Deng, Xin Li, X. Liu, G. Wang","doi":"10.1109/ICPPW.2011.14","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.14","url":null,"abstract":"Desmond is a high-performance program for molecular dynamics simulations (MDS). It provides an unprecedented combination of parallel scalability, simulation speed, and scientific accuracy. However, it still has much improvement space based on the fact that the computation of near non-bonded force (NNF) consumes most of the simulation time. NNF computation is the bottleneck of Desmond. In this paper, we address this problem with graphics processing units (GPU). To the authors' knowledge, this is the first try of accelerating Desmond with GPU. We propose two task decomposition approaches on different levels to accelerate the NNF computation on GPU, one pair-based and another more efficient particle-based. We employ several techniques to optimize the GPU NNF algorithm. Among these techniques, NNF updating conflicts reduction improves the performance best. Combining all the approaches and techniques, we obtain a final speedup of more than 10 on NNF computation and more than 3 on the whole Desmond.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114631783","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
A Secure File Allocation Algorithm for Heterogeneous Distributed Systems 异构分布式系统的安全文件分配算法
2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-01 DOI: 10.1109/ICPPW.2011.40
Yun Tian, Jiong Xie, Shu Yin, Ji Zhang, X. Qin, Mohammed I. Alghamdi, Meikang Qiu, Yiming Yang
{"title":"A Secure File Allocation Algorithm for Heterogeneous Distributed Systems","authors":"Yun Tian, Jiong Xie, Shu Yin, Ji Zhang, X. Qin, Mohammed I. Alghamdi, Meikang Qiu, Yiming Yang","doi":"10.1109/ICPPW.2011.40","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.40","url":null,"abstract":"In this study we develop a secure allocating processing(SAP) algorithm for the S-FAS scheme [13] to improve the security level and consider its performance using the heterogeneous feature of a large distributed system. The SAP allocation algorithm considers load balancing, delayed effects caused by the workload variance of many consecutive requests, and the heterogeneous feature of the storage nodes in the system. We develop a prototype using the multi-threading technique for the S-FAS scheme with the SAP algorithm to guide the file allocation. We did some experiments and the results show that the proposed solution can not only improve the security level, but also improve the throughput of the distributed storage system with heterogeneous vulnerabilities by using the multi-thread technique.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132825000","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
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学术官方微信