2009 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第8页

Automatic Evaluation of the Computation Structure of Parallel Applications 并行应用计算结构的自动评估

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.52

Juan Gonzalez, Judit Giménez, Jesús Labarta

引用次数: 13

ICOMC: Invocation Complexity Of Multi-Language Clients for Classified Web Services and its Impact on Large Scale SOA Applications 分类Web服务的多语言客户端调用复杂性及其对大规模SOA应用的影响

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.74

Xiaoyi Lu, Yongqiang Zou, F. Xiong, Jian Lin, L. Zha

{"title":"ICOMC: Invocation Complexity Of Multi-Language Clients for Classified Web Services and its Impact on Large Scale SOA Applications","authors":"Xiaoyi Lu, Yongqiang Zou, F. Xiong, Jian Lin, L. Zha","doi":"10.1109/PDCAT.2009.74","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.74","url":null,"abstract":"Theoretically, multi-language clients invocating web services is no longer a problem due to XML-based interface descriptions by WSDL, but the reality is not so good. Some implementation level difficulties still exist when invoking web services from clients in different programming languages. These difficulties are caused by involving complex data structures in the service interface, carrying additional information such as WS-security headers in the SOAP messages, missing language features such as Reflection in C/C++ and so on, which make large scale multi-language SOA application development a time-consuming and buggy work. This paper proposes a new complexity ICOMC, short for Invocation Complexity Of Multi-language Clients, to quantify these difficulties, introduces implementation cost and runtime performance metrics for ICOMC, and indentifies three factors dominating the ICOMC: service interface, message context, and language feature. Consequently, the problem is formulated as finding out the correlation of the three factors to ICOMC. To simplify the problem, web services are classified into four categories: SISM, SICM, CISM and CICM according to service interface complexity and message context complexity. Furthermore, micro-benchmark experiments are done in C/C++/Java for all four categories. This paper also takes the GOS System Software of the China National Grid as a real large scale application to implement its C/C++ client APIs and compare them with the original Java APIs. Evaluations based on micro-benchmarks and real application show the correlations between the factors and ICOMC. Our results benefit web service interface designing, appropriate language adoption, and implementation cost / runtime performance estimation.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"72 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":"130291702","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

Parallelized Critical Path Search in Electrical Circuit Designs 电路设计中的并行关键路径搜索

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.83

Pascal Bolzhauser, Anthony Sulistio, Gerhard Angst, C. Reich

引用次数: 0

Theoretical and Empirical Analysis of a GPU Based Parallel Bayesian Optimization Algorithm 基于GPU的并行贝叶斯优化算法的理论与实证分析

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.32

Asim Munawar, M. Wahib, M. Munetomo, K. Akama

引用次数: 18

CheCUDA: A Checkpoint/Restart Tool for CUDA Applications CheCUDA: CUDA应用程序的检查点/重启工具

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.78

H. Takizawa, Katsuto Sato, K. Komatsu, Hiroaki Kobayashi

{"title":"CheCUDA: A Checkpoint/Restart Tool for CUDA Applications","authors":"H. Takizawa, Katsuto Sato, K. Komatsu, Hiroaki Kobayashi","doi":"10.1109/PDCAT.2009.78","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.78","url":null,"abstract":"In this paper, a tool named CheCUDA is designed to checkpoint CUDA applications that use GPUs as accelerators. As existing checkpoint/restart implementations do not support checkpointing the GPU status, CheCUDA hooks a part of basic CUDA driver API calls in order to record the status changes on the main memory. At checkpointing, CheCUDA stores the status changes in a file after copying all necessary data in the video memory to the main memory and then disabling the CUDA runtime. At restarting, CheCUDA reads the file, re-initializes the CUDA runtime, and recovers the resources on GPUs so as to restart from the stored status. This paper demonstrates that a prototype implementation of CheCUDA can correctly checkpoint and restart a CUDA application written with basic APIs. This also indicates that CheCUDA can migrate a process from one PC to another even if the process uses a GPU. Accordingly, CheCUDA is useful not only to enhance the dependability of CUDA applications but also to enable dynamic task scheduling of CUDA applications required especially on heterogeneous GPU cluster systems. This paper also shows the timing overhead for checkpointing.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"429 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":"116541984","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}

引用次数: 87

Consistent Fixed Points and Negative Gain 一致的定点和负增益

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.85

H. B. Acharya, E. Elmallah, M. Gouda

引用次数: 0

The Design and Evaluation of a Distributed Reliable File System 分布式可靠文件系统的设计与评价

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-11-05 DOI: 10.1109/PDCAT.2009.37

D. Peric, T. Bocek, F. Hecht, D. Hausheer, B. Stiller

{"title":"The Design and Evaluation of a Distributed Reliable File System","authors":"D. Peric, T. Bocek, F. Hecht, D. Hausheer, B. Stiller","doi":"10.1109/PDCAT.2009.37","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.37","url":null,"abstract":"Peer-to-peer (P2P) systems are, in contrast to clientserver (C/S) systems, fault-tolerant, robust, and scalable. While C/S distributed file systems, such as NFS (Network File System) or SMB (Server Message Block), do not scale with respect to the number of clients and exhibit a single point of failure, P2P file systems have the potential to cope with an increasing number of participants. Thus, this paper presents DRFS (Distributed Reliable File System), a P2P file system for cooperative environments. DRFS uses random, content-independent identifiers for data storage, while maintaining high performance and low overhead with many concurrent reads and writes. A dynamic replication mechanism ensures data availability, even under high churn. The application scenario considers an office environment, where DRFS is installed on employees’ machines, who store and request files. DRFS has been implemented using the Filesystem in Userspace (FUSE) interface, in order to provide users with transparent read and write operations. Experiments show the benefits of such a peer-to-peer architecture, when a small number of peers reads or writes in parallel: DRFS performs better than NFS, as soon as 6 peers read or write in parallel a 32 MB file. For unpopular files, it is also more reliable than IgorFS.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129843820","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

Analytical Study of Adversarial Strategies in Cluster-based Overlays 基于聚类叠加的对抗策略分析研究

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-08-04 DOI: 10.1109/PDCAT.2009.62

E. Anceaume, F. Brasileiro, R. Ludinard, B. Sericola, F. Tronel

引用次数: 8