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

An XML Data Placement Strategy for Distributed XML Storage and Parallel Query 面向分布式XML存储和并行查询的XML数据放置策略

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.19

Jing Zhang, B. Lang, Yawei Duan

{"title":"An XML Data Placement Strategy for Distributed XML Storage and Parallel Query","authors":"Jing Zhang, B. Lang, Yawei Duan","doi":"10.1109/PDCAT.2011.19","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.19","url":null,"abstract":"Since there has been significant amount of XML documents generated in various application domains, efficient XML management has become an important problem. Distributed XML storage and parallel query based on Map Reduce can be an effective solution to this problem. As XML data placement strategy is a key factor of parallel system performance, in this paper we present an XML placement strategy, which is Query Workload Estimation based XML Placement strategy (QWEXP) for efficient distributed XML storage and parallel query. To achieve query workload balance, it partitions XML based on query workload estimation which is calculated by XML structure without knowing of user queries, considering that in common application scenarios user queries are unknown in advance. The partitioned XML segments are around an XML storage unit W0, to support scalability of parallel XML database. Finally segments are distributed to each processing node evenly to ensure workload balance on parallel query execution. Experimental results have shown that QWEXP promotes the speedup and scale up properties of parallel XML system greatly.","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":"128817899","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

An Application Level Approach for Proactive Process Migration in MPI Applications MPI应用程序中主动进程迁移的应用程序级方法

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.16

Iván Cores, Gabriel Rodríguez, P. González, María J. Martín

{"title":"An Application Level Approach for Proactive Process Migration in MPI Applications","authors":"Iván Cores, Gabriel Rodríguez, P. González, María J. Martín","doi":"10.1109/PDCAT.2011.16","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.16","url":null,"abstract":"The running times of large-scale computational science and engineering parallel applications are usually longer than the mean-time-between-failures (MTBF). Hardware failures must be tolerated by the parallel applications to ensure that not all computation done is lost on machine failures. Check pointing and rollback recovery is a very useful technique to implement fault-tolerant applications. However, when a failure occurs, most check pointing mechanisms require a complete restart of the parallel application from the last checkpoint. This affects the efficiency of the solution, leading to an unnecessary overhead that can be avoided through a single process migration in case of failure. Although research has been carried out in this field, the solutions proposed in the literature are commonly tied to specific implementations of the parallel communication APIs or to specific runtime environments. The approach presented in this work extends an application level check pointing framework to proactively migrate MPI processes from processors when impending failures are notified, without having to restart the entire application. The main features of the proposed solution are: transparency for the user, achieved through the use of a compiler tool and a runtime library, and portability since it is not locked into a particular MPI implementation.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"44 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":"126340438","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

Data Gathering for Periodic Sensor Applications 周期性传感器应用的数据采集

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.34

Khaled Almiani, M. Aalsalem, Rafeeq Al-Hashemi

引用次数: 4

Handover Delay in Mobile WiMAX: A Simulation Study 移动WiMAX中切换延迟的仿真研究

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.45

Bhaskar Ashoka, D. Eyers, Zhiyi Huang

引用次数: 16

Multi-relational Algorithm for Mining Association Rules in Large Databases 大型数据库中关联规则挖掘的多关系算法

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.56

C. R. Valêncio, Fernando Takeshi Oyama, Fernando Tochio Ichiba, Rogéria Cristiane Gratão de Souza

引用次数: 2

Adaptive Metadata Management and Flexible Consistency in a Distributed In-memory File-System 分布式内存文件系统中的自适应元数据管理和灵活一致性

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.14

Kim-Thomas Rehmann, S. Dere, M. Schöttner

引用次数: 0

Efficient Hierarchical Agglomerative Clustering Algorithms on GPU Using Data Partitioning 基于数据分区的GPU高效分层聚类算法

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.38

S. Shalom, M. Dash

引用次数: 6

Grid Based Analysis Toolkit for Partial Wave Analysis 基于网格的部分波分析工具包

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.43

Zhi Yang, Richard T. Jones, Changqing Yin

引用次数: 0

Dynamic Thread Partition Algorithm Based on Sharing Data on CMP 基于CMP数据共享的动态线程划分算法

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.36

Deng Zhou, Ye Tian, Hong Shen

{"title":"Dynamic Thread Partition Algorithm Based on Sharing Data on CMP","authors":"Deng Zhou, Ye Tian, Hong Shen","doi":"10.1109/PDCAT.2011.36","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.36","url":null,"abstract":"At the level of multi-core processors that share the same cache, data sharing among threads which belong to different cores may not enjoy the benifit of non-uniform cache access because it is difficult to determine which core should be set as the local position of data block while each cache block is setting as one of the core's local block. Studies have found that the cost of long latency access can be reduced by using a proper thread partition/allocation algorithm [5]. However, at present work, researchers pay little attention to thread partitioning algorithms which can reduce the cost of long latency access. In this paper, we present a dynamic thread partitioning algorithm according to data sharing among threads at the level of cache-shared-multicore processers. In our design, the algorithm makes the best effort to minimize shared block accessed by threads of different cores. Compared with the existing work, our new algorithm achieves a performance improvement. We perform experiments on 4 cores and more than 100 threads and the result show that our algorithm can reduce the interaction of threads belonging to different cores between 30% and 50% over the previously known solutions.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"12 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":"124895180","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

Comparative Study of Algorithms for Mining Association Rules: Traditional Approach versus Multi-relational Approach 关联规则挖掘算法的比较研究:传统方法与多关系方法

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.29

C. R. Valêncio, Fernando Takeshi Oyama, Paulo Scarpelini Neto, Rogéria Cristiane Gratão de Souza

引用次数: 4