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

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

筛选
英文 中文
Node-to-Set Disjoint-path Routing in Metacube 元数据中节点到集合的不相交路径路由
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.63
A. Bossard, K. Kaneko, S. Peng
{"title":"Node-to-Set Disjoint-path Routing in Metacube","authors":"A. Bossard, K. Kaneko, S. Peng","doi":"10.1109/PDCAT.2009.63","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.63","url":null,"abstract":"The metacube interconnection network introduced a few years ago has some very interesting properties: it has a short diameter similar to the hypercube, and its degree is much lower than that of a hypercube of the same size. In this paper, we describe an efficient algorithm for finding disjoint paths between one source node and at most m+k target nodes in a metacube MC(k, m) excluding MC(*,1), MC(2,2), MC(3,2) and MC(3,3). We show that we can find m+k disjoint paths between the source node and the m+k targets of length at most metacube diameter plus (k+4) with time complexity of order of metacube degree times its diameter.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116881557","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}
引用次数: 10
An Efficient Parallel Sorting Compatible with the Standard qsort 与标准qsort兼容的高效并行排序
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1142/S0129054111008568
Duhu Man, Yasuaki Ito, K. Nakano
{"title":"An Efficient Parallel Sorting Compatible with the Standard qsort","authors":"Duhu Man, Yasuaki Ito, K. Nakano","doi":"10.1142/S0129054111008568","DOIUrl":"https://doi.org/10.1142/S0129054111008568","url":null,"abstract":"The main contribution of this paper is to present an efficient parallel sorting \"psort\" compatible with the standard qsort. Our parallel sorting \"psort\" is implemented such that its interface is compatible with \"qsort\" in C Standard Library. Therefore, any application program that uses standard \"qsort\" can be accelerated by simply replacing \"qsort\" call by our \"psort\" . Also, \"psort\" uses standard \"qsort\" as a subroutine for local sequential sorting. So, if the performance of \"qsort\" is improved by anyone in the community, then that of our \"psort\" is also automatically improved. To evaluate the performance of our \"psort\", we have implemented our parallel sorting in a Linux server with two Intel quad-core processors (i. e. eight processor cores). The experimental results show that our \"psort\" is approximately 6 times faster than standard \"qsort\" using 8 processors. Since the speed up factor cannot be more than 8 if we use 8 cores, our algorithm is close to optimal. Also, as far as we know, no previously published parallel implementations achieve a speed up factor less than 4 using 8 cores.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126643026","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}
引用次数: 10
Balanced Dense Polynomial Multiplication on Multi-Cores 多核平衡密集多项式乘法
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1145/1823931.1823942
M. M. Maza, Yuzhen Xie
{"title":"Balanced Dense Polynomial Multiplication on Multi-Cores","authors":"M. M. Maza, Yuzhen Xie","doi":"10.1145/1823931.1823942","DOIUrl":"https://doi.org/10.1145/1823931.1823942","url":null,"abstract":"In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementation strategies for FFT-based dense polynomial multiplication targeting multi-cores. We show that {it balanced input data} can maximize parallel speedup and minimize cache complexity for bivariate multiplication. However, unbalanced input data, which are common in symbolic computation, are challenging. We provide efficient techniques, what we call {it contraction} and {it extension}, to reduce multivariate (and univariate) multiplication to {it balanced bivariate multiplication}. Our implementation in {tt Cilk++} demonstrates good speed upon multi-cores.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116127484","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}
引用次数: 29
Power Consumption of Hardware Cryptography Platform for Wireless Sensor 无线传感器硬件加密平台功耗研究
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.39
Peter Pecho, J. Nagy, P. Hanáček
{"title":"Power Consumption of Hardware Cryptography Platform for Wireless Sensor","authors":"Peter Pecho, J. Nagy, P. Hanáček","doi":"10.1109/PDCAT.2009.39","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.39","url":null,"abstract":"Wireless sensor networks usually require certain level of security, however there is lack of sensor nodes with cryptographic hardware build-in. We proved realization of cryptographic platform based on smart card--sensor node connection. Time complexity and power consumption of the platform was measured and compared to conventional software implementation. Our results showed low power demand and high efficiency of public key cryptography running on the platform.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116843187","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
Greedy Convex Embeddings for Ad-Hoc Networks Ad-Hoc网络的贪婪凸嵌入
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.68
Y. Berchenko, M. Teicher
{"title":"Greedy Convex Embeddings for Ad-Hoc Networks","authors":"Y. Berchenko, M. Teicher","doi":"10.1109/PDCAT.2009.68","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.68","url":null,"abstract":"Recent advances in networked systems and wireless communications have set the stage for applications with wide-ranging benefits. Perhaps the most natural problem in such systems is the ” efficient” propagation of locally stored data. In order to address this problem, the notion of greedy embedding was defined by Papadimitriou and Ratajczak, where the authors conjectured that every 3-connected planar graph has a greedy embedding (possibly planar and convex) in the Euclidean plane. Recently, the greedy embedding conjecture was proved by Leighton and Moitra. However, their algorithm does not result in a drawing that is planar and convex in the Euclidean plane for all 3-connected planar graphs. Here we consider the planar convex greedy embedding conjecture and give a probabilistic proof for the existence of such embeddings. In addition, we discuss a second proof which is almost immediate in the case of an embedding into the 3-dimensional sphere.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"60 23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116206429","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
Performance Optimization under Small Files Intensive Workloads in BWFS BWFS小文件密集型工作负载下的性能优化
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.60
Zhenhan Liu, Xiaoxuan Meng, Lu Xu
{"title":"Performance Optimization under Small Files Intensive Workloads in BWFS","authors":"Zhenhan Liu, Xiaoxuan Meng, Lu Xu","doi":"10.1109/PDCAT.2009.60","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.60","url":null,"abstract":"We have designed and implemented the Blue Whale File System (BWFS), a scalable distributed file system for large distributed data-intensive applications. With many of the features as previous distributed file systems, BWFS has successfully met our storage needs and is widely deployed within many fields. Although excellent for high-bandwidth access to large files, BWFS's out-of-band data transfer mode provides low efficiency under small files intensive workloads. In order to improve the overall performance of the file system, we propose a novel data transfer scheme. In such novel scheme, BWFS transfers data with the hybrid data transfer policy that small files are transferred with in-band mode while large files are transferred with out-of-band mode. The prototype design and implementation is described and the various experiments are presented to demonstrate that the significant performance benefits of our prototype implementation under the small files intensive workloads. For small files intensive applications, BWFS can achieve significantly higher throughput which increases by 60%.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124513780","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
Clustered Software Queue for Efficient Pipelined Multithreading 高效流水线多线程的集群软件队列
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.24
Yuanming Zhang, K. Ootsu, T. Yokota, T. Baba
{"title":"Clustered Software Queue for Efficient Pipelined Multithreading","authors":"Yuanming Zhang, K. Ootsu, T. Yokota, T. Baba","doi":"10.1109/PDCAT.2009.24","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.24","url":null,"abstract":"Multi-core processors have emerged as predominant architecture. Parallelizing applications into multithreaded ones executing on multiple cores is the key to achieving performance improvements. Recently proposed pipelined multithreading (PMT) techniques have shown great promise to parallelizing general applications. However, significant inter-core communication overheads limit the potential performance and hinder the wide commercial use. While dedicated inter-core communication mechanism has been proposed, it demands chip redesign effort, costs so much and needs extensions to ISA. Software queues avoid these problems. In this paper, we propose a clustered software queue technique, which applies a new clustered communication mechanism, to minimize the communication overheads from the average standpoint. Our research shows that very low average communication overheads (ACOs) can be achieved by sacrificing a certain amount of parallelisms. The principle of clustered communication mechanism and how to reduce the ACOs with it are presented in detail. A concurrent lock-free clustered software queue algorithm is given and then evaluated on commodity multi-core processors. Experimental results show that the communication performance of clustered software queue is over 10x faster than that of conventional software queue, and much higher PMT performances of real applications are achieved.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124347712","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
A Classification-Based Approach to Fault-Tolerance Support in Parallel Programs 并行程序中基于分类的容错支持方法
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.47
Gopinatha Jakadeesan, D. Goswami
{"title":"A Classification-Based Approach to Fault-Tolerance Support in Parallel Programs","authors":"Gopinatha Jakadeesan, D. Goswami","doi":"10.1109/PDCAT.2009.47","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.47","url":null,"abstract":"Fault tolerance is an important requirement for long-running parallel programs. This paper presents a different approach to fault-tolerance support in message-passing parallel programs based on their structural and behavioral characteristics, commonly known as patterns. A classification of these patterns and their applicable fault-tolerance strategies is aimed to facilitate an application developer to incorporate appropriate fault-tolerance strategies to an application. Fault-tolerance strategies for two of the patterns are discussed, and one specific strategy is elaborated and analyzed. The presented strategies have been incorporated into a fault-tolerance support framework called FT-PAS. One objective of the framework is to separate the fault tolerance related details from an application developer’s main objectives (separation-of-concerns). The paper presents the additional key features of the framework, and concludes with a discussion on current and future research directions.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114898287","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
Bifrost : A Novel Anonymous Communication System with DHT Bifrost:一种基于DHT的新型匿名通信系统
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.35
Masaki Kondo, S. Saito, Kiyohisa Ishiguro, Hiroyuki Tanaka, H. Matsuo
{"title":"Bifrost : A Novel Anonymous Communication System with DHT","authors":"Masaki Kondo, S. Saito, Kiyohisa Ishiguro, Hiroyuki Tanaka, H. Matsuo","doi":"10.1109/PDCAT.2009.35","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.35","url":null,"abstract":"An immense amount of information is processed on the Internet due to its spread, increasing the severity of such problems as the disclosure of personal information; privacy protection is required. Research to protect anonymity has become crucial. Anonymous communication systems must consider a sudden breakaway of nodes. However existing systems isn't considering this enough. This paper proposes separating a node management layer from an anonymous communication layer. A novel anonymous communication system is realized by a node management layer that uses Chord, which is a distributed hash table, and the anonymous communication layer uses multiplex encryptions.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"22 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123702035","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}
引用次数: 14
A Biased k-Random Walk to Find Useful Files in Unstructured Peer-to-Peer Networks 在非结构化点对点网络中寻找有用文件的有偏k随机漫步
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.49
Hiroo Kitamura, S. Fujita
{"title":"A Biased k-Random Walk to Find Useful Files in Unstructured Peer-to-Peer Networks","authors":"Hiroo Kitamura, S. Fujita","doi":"10.1109/PDCAT.2009.49","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.49","url":null,"abstract":"In this paper, we consider a problem of finding \"useful\" files matching a given query in unstructured P2Ps. The proposed scheme is a variant of k-random walk, which combines a synchronization mechanism proposed by Lv et al. with a mechanism to evaluate the usefulness of discovered files. In addition, we apply a variant of popularity-biased k-random walk to accelerate the file search in normal k-random walk under uniform distribution. The goodness of the scheme is evaluated by simulation. The result of simulations indicates that the proposed biased k-random walk scheme certainly finds useful files in short time, without significantly increasing the number of message transmissions.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124130065","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
下一页 尾页
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学术官方微信