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

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

筛选
英文 中文
MapReduce Implementation of Prestack Kirchhoff Time Migration (PKTM) on Seismic Data 地震数据叠前Kirchhoff时间偏移(PKTM)的MapReduce实现
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.50
N. B. Rizvandi, A. Boloori, N. Kamyabpour, Albert Y. Zomaya
{"title":"MapReduce Implementation of Prestack Kirchhoff Time Migration (PKTM) on Seismic Data","authors":"N. B. Rizvandi, A. Boloori, N. Kamyabpour, Albert Y. Zomaya","doi":"10.1109/PDCAT.2011.50","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.50","url":null,"abstract":"The oil and gas industries have been great consumers of parallel and distributed computing systems, by frequently running technical applications with intensive processing of terabytes of data. By the emergence of cloud computing which gives the opportunity to hire high-throughput computing resources with lower operational costs, such industries have started to adopt their technical applications to be executed on such high-performance commodity systems. In this paper, we first give an overview of forward/inverse Prestack Kirchhoff Time Migration (PKTM) algorithm, as one of the well-known seismic imaging algorithms. Then we will explain our proposed approach to fit this algorithm for running on Google's MapReduce framework. Toward the end, we will analyse the relation between MapReduce-based PKTM completion time and the number of mappers/reducers on pseudo-distributed MapReduce mode.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129239495","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}
引用次数: 24
Optimizing MPI Alltoall Communication of Large Messages in Multicore Clusters 多核集群中大消息的MPI全通信优化
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.60
Qiang Li, Zhigang Huo, Ninghui Sun
{"title":"Optimizing MPI Alltoall Communication of Large Messages in Multicore Clusters","authors":"Qiang Li, Zhigang Huo, Ninghui Sun","doi":"10.1109/PDCAT.2011.60","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.60","url":null,"abstract":"MPI All to all communication is widely used in many high performance computing (HPC) applications. In All to all communication, each process sends a distinct message to all other participating processes. In multicore clusters, processes within a node simultaneously contend for the same network resource of the node in All to all communication. However, many small synchronization messages are required in All to all communication of large messages. With the contention, their latency is orders of magnitude larger than that without contention. As a result, the synchronization overhead is significantly increased and accounts for a large proportion to the whole latency of All to all communication. In this paper, we analyse the considerable overhead of synchronization messages. Base on the analysis, an optimization is presented to reduce the number of synchronization messages from 3N to 2¡ÌN. Evaluations on a 240-core cluster show that the performance is improved by almost constant ratio, which is mainly determined by message size and independent of system scale. The performance of All to all communication is improved by 25% for 32K and 64K bytes messages. For FFT application, performance is improved by 20%.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123354839","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
A Runtime Fault Detection Method for HPC Cluster 一种高性能计算集群运行时故障检测方法
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.9
Wu Linping, Luo Hongbing, Z. Jianfeng, Meng Dan
{"title":"A Runtime Fault Detection Method for HPC Cluster","authors":"Wu Linping, Luo Hongbing, Z. Jianfeng, Meng Dan","doi":"10.1109/PDCAT.2011.9","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.9","url":null,"abstract":"As the number of nodes keeps increasing, faults have become commonplace for HPC cluster. For fast recovery from faults, the fault detection method is necessary. Based on the usage patterns of HPC cluster, a automatic runtime fault detection mechanism is proposed in this paper: First, the normal activities for nodes in HPC cluster are modeled using runtime state by clustering analysis, Second, the fault detection process is implemented by comparing the current runtime state of nodes with normal activity models. A fault alarm is made immediately when the current runtime state deviates from the normal activity models. In the experiments, the faults are simulated by fault injection methods and the experimental results show that the runtime fault detection method in this paper can detect faults with high accuracy.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121152011","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
A Social Network-Based Information Dissemination Scheme 基于社会网络的信息传播方案
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.11
Xinfeng Ye, Yanfeng Li
{"title":"A Social Network-Based Information Dissemination Scheme","authors":"Xinfeng Ye, Yanfeng Li","doi":"10.1109/PDCAT.2011.11","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.11","url":null,"abstract":"Handheld devices can use the Bluetooth technology to exchange information with other. This feature allows that handheld devices to be utilized in disseminating information. A scheme for disseminating information using the handheld devices is proposed. The scheme uses both social network analysis and user activity analysis to deliver information to people who might be interested in the information. To encourage people to participate in disseminating information, the scheme uses an incentive mechanism and the integer programming technique to maximize the benefit that people can gain by passing other people's information. Some experiments were carried out to compare the effectiveness of the proposed scheme with other schemes.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114534479","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
A Distributed Task Migration Scheme for Mesh-Based Chip-Multiprocessors 基于网格的多处理器分布式任务迁移方案
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.2
H. Yaghoubi, M. Modarressi, H. Sarbazi-Azad
{"title":"A Distributed Task Migration Scheme for Mesh-Based Chip-Multiprocessors","authors":"H. Yaghoubi, M. Modarressi, H. Sarbazi-Azad","doi":"10.1109/PDCAT.2011.2","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.2","url":null,"abstract":"A task migration scheme for homogeneous chip multiprocessors (CMP) is presented in this paper. The proposed migration mechanism focuses on the communication sub-system and aims to reduce the total power consumption and latency of the network-on-chip (NoC). In this work, starting from an initial mapping, the tasks migrate to new cores in such a way that the distance between the end-point nodes of high-volume communication flows is reduced. Finding the new place for a task is done in a distributed manner by applying an iterative local search that relies on the local information of each task about its communication demand. The task migration procedure also includes a pre-migration step that aims to produce a high quality (i.e. closer to the optimum point) starting point for the main distributed algorithm. The experimental results under some synthetic and realistic CMP workloads show that this method can effectively adapt the mapping of the tasks to the on-chip communication pattern and improve the power consumption and performance of the on-chip networks.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"213 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114007669","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
Hash Based Byzantine Fault Tolerant Agreement with Enhanced View Consistency 基于哈希的拜占庭容错协议，增强了视图一致性
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1504/IJCNDS.2014.059435
P. Saini, Awadhesh Kumar Singh
{"title":"Hash Based Byzantine Fault Tolerant Agreement with Enhanced View Consistency","authors":"P. Saini, Awadhesh Kumar Singh","doi":"10.1504/IJCNDS.2014.059435","DOIUrl":"https://doi.org/10.1504/IJCNDS.2014.059435","url":null,"abstract":"The paper presents an authentication based Byzantine fault tolerant agreement protocol that is capable of detecting the tentative failures in transaction processing systems. The protocol employs a cryptographic hash function to detect crash as well as few more types of commonly faced arbitrary behaviors manifested by the participating server replicas in the system. We show that use of hash functions can successfully handle various types of (arbitrary) faults. In addition, it suggests a preemptive mechanism to proactively detect the malicious replicas. The protocol avoids frequent view changes that contributes to the liveness of the system and ensures continuity in transaction processing.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124343976","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
Reference metadata extraction from scientific papers 从科学论文中提取参考元数据
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.72
Zhixin Guo, Hai Jin
{"title":"Reference metadata extraction from scientific papers","authors":"Zhixin Guo, Hai Jin","doi":"10.1109/PDCAT.2011.72","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.72","url":null,"abstract":"Bibliographical information of scientific papers is of great value since the Science Citation Index is introduced to measure research impact. Most scientific documents available on the web are unstructured or semi-structured, and the automatic reference metadata extraction process becomes an important task. This paper describes a framework for automatic reference metadata extraction from scientific papers. Our system can extract title, author, journal, volume, year, and page from scientific papers in PDF. We utilize a document metadata knowledge base to guide the reference metadata extraction process. The experiment results show that our system achieves a high accuracy.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132038462","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 Framework for Scheduling Virtual Machines to Support Real-Time Services for U-Life Care 支持U-Life护理实时服务的虚拟机调度框架
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.5
N. Hieu, Jin Wang, Sungyoung Lee, Young-Koo Lee
{"title":"A Framework for Scheduling Virtual Machines to Support Real-Time Services for U-Life Care","authors":"N. Hieu, Jin Wang, Sungyoung Lee, Young-Koo Lee","doi":"10.1109/PDCAT.2011.5","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.5","url":null,"abstract":"This paper presents an approach for scheduling U-Life care applications in the cloud computing environment based on virtual resources to support real-time services and to improve user Quality of Service (QoS) requirements. We design and develop an architecture called ULC3 (Ubiquitous Life Care Cloud Computing) that uses virtual resources provided by cloud computing to schedule U-Life care applications. The ULC3 is based on the concepts of cloud computing and wireless sensor networks. The architecture is very important and necessary to support create virtual clusters dynamically, deploys the required number of virtual machines (VMs) in potential computing resources to meet the application requirements, and to configure with the required software execution environment. Thus, the system can improve computation time, guarantee the QoS, and support real-time services. Finally, the results from the execute applications are provided to the end-users as a service.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333138","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
Resistence against Malicious Collectives in BubbleTrust 对BubbleTrust中恶意集体的抵抗
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.73
M. Novotný, F. Zavoral
{"title":"Resistence against Malicious Collectives in BubbleTrust","authors":"M. Novotný, F. Zavoral","doi":"10.1109/PDCAT.2011.73","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.73","url":null,"abstract":"Malicious collectives represent one of the biggest threats for secured P2P applications. In our previous work, we proposed a trust management system called Bubble Trust targeting this problem. In this paper, we investigate the most common malicious strategies as well as the resistance the Bubble Trust uses against them. We created the simulation framework suitable for testing other TMSs in the same scenarios. Our analysis shows that the success of malicious peers in the Bubble Trust depends mainly on the amount of benefit provided to the network and that the analyzed malicious strategies cannot menace the contribution provided by the P2P network.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130901438","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
Performance Evaluation of Quality of VoIP in WiMAX and UMTS 基于WiMAX和UMTS的VoIP质量性能评价
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.67
Sheetal Jadhav, Haibo Zhang, Zhiyi Huang
{"title":"Performance Evaluation of Quality of VoIP in WiMAX and UMTS","authors":"Sheetal Jadhav, Haibo Zhang, Zhiyi Huang","doi":"10.1109/PDCAT.2011.67","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.67","url":null,"abstract":"Next Generation Wireless Networks (NGWNs) focus on convergence of different Radio Access Technologies (RATs) providing good Quality of Service (QoS) for applications such as Voice over IP traffic (VoIP) and video streaming. The voice applications over IP networks are growing rapidly due to their increasing popularity and cost. To meet the demand of providing high-quality of VoIP at anytime and from anywhere, it is imperative to design suitable QoS model. In this paper we conduct simulation study to evaluate the QoS performance of WiMAX and UMTS for supporting VoIP. We designed simulation modules in OPNET for WiMAX and UMTS, and carried out extensive simulations to evaluate and analyze several important performance metrics such as Mean Opinion Score (MOS), end-to-end delay, jitter and packet delay variation. Simulation results show that WiMAX outscores the UMTS with a sufficient margin, and is the better technology to support VoIP applications compared with UMTS.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127940828","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}
引用次数: 80
下一页 尾页
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学术官方微信