检索结果-内蒙古大学图书馆

2nd International Conference on Measurement, Information and Control (ICMIC)

作者： Mo, Juan Lu, Jun Wang, Nan Zhang, Zhuo Liu, Yu Heilongjiang Univ Coll Comp Sci & Technol Harbin Peoples R China KLDPC HLJU Heilongjiang Prov Coll CS HLJU Key Lab Database & Parallel Comp Harbin Peoples R China

ISBN: (纸本)9781479913909

Universal combinatorics coding is a new kind of coding method and whole ordinal plays an important role in universal combinatorics coding. Whole ordinal GPU parallel algorithm is proposed in this paper. Whole ordinal computing is implemented by combining the advantage of GPU in aspect of complicated and vast parallel computing with CPU technology, and employing CPU+GPU heterogeneous program development model. It makes whole ordinal parallel computing implement by calling kernel function of large number multiplication calculation in original serial program of computing whole ordinal. In the process of research, a series of GPU parallel problem are solved by optimizing program code many times. Experiments show that GPU parallel method improves the speed of calculating whole ordinal greatly, and then improves the computation efficiency of relevant experiments. Whole ordinal parallel implementation also has important meaning to estimating relevant experimental data and pushes the pace of universal combinatorics coding into practical at the same time.

关键词： universal combinatorics coding GPU parallel Whole ordinal

来源：评论

学校读者我要写书评

暂无评论

Research on Max Ordinal in Universal Combinatorics Coding Based on GPU parallel computing

Research on Max Ordinal in Universal Combinatorics Coding Ba...

引用

2nd International Conference on Measurement, Information and Control (ICMIC)

作者： Zhang, Zhuo Lu, Jun Gao, Ting Ting Mo, Juan Liu, Yu Heilongjiang Univ Coll Comp Sci & Technol Harbin Peoples R China Key Lab Database & Parallel Comp Harbin Heilongjiang Pr Peoples R China East Univ Heilongjiang Coll CS HLJU KLDPC HLJU HLJEU Harbin Peoples R China

ISBN: (纸本)9781479913909

The parallel computing method of max ordinal number in universal combinatorics coding based on GPU is advanced in this paper. The core of universal combinatorics coding computing is ordinal number computing while the calculation of ordinal number depends on the value of max ordinal number. The calculation of max ordinal number is divided into two parts, multiplication and division of large numbers. This paper focus on the GPU parallel computing of the multiplication in max ordinal number calculation, the calculation speed of the multiplication part is increased substantially, and thus improves the efficiency of max ordinal number calculation.

关键词： Data Coding Universal Combinatorics Coding Max ordinal number parallel computing

来源：评论

学校读者我要写书评

暂无评论

An Efficient Graph Isomorphism Algorithm Based on Canonical labeling and Its parallel Implementation on GPU

An Efficient Graph Isomorphism Algorithm Based on Canonical ...

引用

15th IEEE International Conference on High Performance computing and Communications (HPCC) /11th IEEE/IFIP International Conference on Embedded and Ubiquitous computing (EUC)

作者： Wang, Renda Guo, Longjiang Ai, Chunyu Li, Jinbao Ren, Meirui Li, Keqin Heilongjiang Univ Sch Comp Sci & Technol Harbin 150080 Heilongjiang Peoples R China Key Lab Database & Parallel Comp Harbin 150080 Heilongjiang Peoples R China Univ South Carolina Upstate Dept Comp Sci Spartanburg SC 29303 USA SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA

ISBN: (纸本)9780769550886

The Graph Isomorphism (GI) problem has been extensively studied due to its significant applications. The most effective class of GI algorithms, i.e., canonical labeling algorithms, are suitable for either graphs with high randomness or symmetry, or graphs for which both of them are not strongly held. Also, the core operations of canonical labeling algorithms, i.e., individuation-refinement (IR) and certificate comparison, usually occupy more than 70% of the total running time. How to weaken the limitations of structures and improve the efficiency of these operations are challenges. In this paper, we present an efficient GI algorithm called PEACE, which is particularly suitable for graphs with high randomness or symmetry. We present a parallel implementation of our algorithm on GPUs. We design some new techniques and also use some existing methods to speed up calculations under CUDA. More importantly, these techniques can be applied to all IR-based GI algorithms. We evaluate the proposed algorithm on various graphs to make comprehensive comparison with currently the most efficient canonical labeling algorithms on CPUs. Experimental results show that PEACE is superior to other algorithms on graphs with high symmetry or many automorphisms, and up to 50% performance increase can be achieved in the best case. We also apply our parallel techniques on these algorithms, and compare the performance on CPU and multiple GPU devices. The results show that the techniques make all algorithms gain 15 similar to 55 speedup.

关键词： Canonical labeling CUDA GPU Graph isomorphism

来源：评论

学校读者我要写书评

暂无评论

Data caching-based query processing in multi-sink wireless sensor networks

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2012年第2期11卷 109-125页

作者： Cai, Zhipeng Ji, Shouling Li, Jinbao Heilongjiang Univ Sch Comp Sci & Technol Key Lab Database & Parallel Comp Heilongjiang Pro Harbin 150080 Heilongjiang Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

In multi-sink Wireless Sensor Networks (WSNs), different sinks may issue same queries and therefore they can share some common query results. As a classical data-sharing method, data caching is employed widely in traditional databases and it can also bring benefits in WSNs thanks to the emergence of sensors with Flash Memory. Therefore, a query-processing method based on common subtree (CS) caching in multi-sink WSNs is proposed. We first construct CSs and then cache the results of processed queries at the roots of CSs. Subsequently, later common queries can obtain their expected results from the common roots. Furthermore, in order to achieve a higher degree of data sharing, we propose a loop-removing algorithm. Extensive simulations indicate that the proposed method can reduce the energy consumption and the query response time significantly for WSNs.

关键词： WSNs wireless sensor networks data management query processing data caching multi-sink data sharing Flash Memory

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithms for Approximate String Matching with k Mismatches on CUDA

Parallel Algorithms for Approximate String Matching with <i>...

引用

26th IEEE International parallel and Distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive computing

作者： Liu, Yu Guo, Longjiang Li, Jinbao Ren, Meirui Li, Keqin Heilongjiang Univ Sch Comp Sci & Technol Harbin 150080 Peoples R China Key Lab Database & Parallel Comp uting Harbin 150080 Heilongjiang Peoples R China SUNY Coll New Paltz Dept Comp Sci New Paltz NY 12561 USA

ISBN: (纸本)9780769546766

Approximate string matching using the.. mismatch technique has been widely applied to many fields such as virus detection and computational biology. The traditional parallel algorithms are all based on multiple processors, which have high costs of computing and communication. GPU has high parallel processing capability, low cost of computing, and less time of communication. To the best of our knowledge, there is no any parallel algorithm for approximate string matching with.. mismatches on GPU. With a new parallel programming model based on CUDA, we present three parallel algorithms and their implementations on GPU, namely, the thread parallel algorithm, the block-thread parallel algorithm, and the OPT-block-thread parallel algorithm. The OPT-block-thread parallel algorithm can take full advantage of the powerful parallel capability of GPU. Furthermore, it balances the load among the threads and optimizes the execution time with the memory model of GPU. Experimental results show that compared with the traditional sequential algorithm on CPU, our best parallel algorithm on GPU in this paper achieves speedup of 40-80.

关键词： Approximate string matching CUDA GPU Hamming distance parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cache Based Multi-join Query Method with Two-Phase Processing in MANET

A Cache Based Multi-join Query Method with Two-Phase Process...

引用

7th International Conference on Wireless Algorithms, Systems, and Applications (WASA)

作者： Guo, Yahong Li, Jinbao Guo, Longjiang Zhu, Jinghua Liu, Xu Heilongjiang Univ Sch Informat Sci & Technol Harbin 150080 Heilongjiang Peoples R China Heilongjiang Univ Sch Comp Sci & Technol Harbin 150080 Heilongjiang Peoples R China Key Lab Database & Parallel Comp Heilongjiang Pro Harbin 150080 Heilongjiang Peoples R China

ISBN: (纸本)9783642318696

In this paper, we study the problem of join query in MANET and propose a new type of join query called Single-join Query Based on Caching (SQBC). This problem is proved to be a NP-hard problem and we present two polynomial approximate greedy algorithms (SOCA and MOCA) to solve the single-join query and multi-join query respectively. Both of these algorithms can ensure the low energy consumption. Moreover, MOCA can reduce the response time of query processing and minimize the energy consumption by considering the overhead of join query. Theoretical analysis and experimental results show that the algorithms proposed in this paper can effectively reduce the energy consumption, prolong the survival period of the network and enhance query efficiency.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

RCO: A Multi-channel MAC Protocol with Random Cooperation for Sensor Networks

RCO: A Multi-channel MAC Protocol with Random Cooperation fo...

引用

7th International Conference on Autonomic and Trusted computing

作者： Li, Jinbao Zhang, Desheng Heilongjiang Univ Sch Comp Sci & Technol Harbin 150080 Heilongjiang Peoples R China Key Lab Database Parallel Comp Harbin PT-150080 Peoples R China

ISBN: (纸本)9783642163548

To handle triple hidden terminal problems, this paper proposes RCO, an asynchronous multi-channel MAC protocol with random cooperation for sensor networks. By adopting a probability-based random cooperation, RCO effectively alleviates, if not eliminates, triple hidden terminal problems. More importantly, RCO is fully distributed with no requirements of time synchronization or multi-radio. Therefore, it is very easy to implement RCO in resource-constrained wireless sensor nodes. The simulation and real testbed experimental results show that RCO achieves significant improvement in energy efficiency with increasing benefit when the number of channels and traffic loads increase, while maintaining higher throughput.

关键词： WSNs MAC protocols Multi-channel Random cooperation

来源：评论

学校读者我要写书评

暂无评论

ARM: an Asynchronous Receiver-initiated Multi-channel MAC Protocol with Duty Cycling for WSNs

ARM: an Asynchronous Receiver-initiated Multi-channel MAC Pr...

引用

IEEE 29th International Performance computing and Communications Conference

作者： Li, Jinbao Zhang, Desheng Guo, Longjiang Ji, Shouling Li, Yingshu Heilongjiang Univ Sch Comp Sci & Technol Harbin 150080 Heilongjiang Peoples R China Heilongjiang Univ Key Lab Database & Parallel Comp Harbin 150080 Heilongjiang Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9781424493289

This paper proposes ARM, an receiver-initiated MAC protocol with duty cycling to tackle control channel saturation, triple hidden terminal and low broadcast reliability problems in asynchronous multi-channel WSNs. By adopting a receiver-initiated transmission scheme and probability-based random channel selection, ARM effectively solves control channel saturation and triple hidden terminal problems. Further, ARM employs a receiver-adjusted broadcast scheme to guarantee broadcast reliability for broadcast-intensive applications. Via the theoretical analysis, two factors that assist ARM to handle these problems are derived. The simulation and real testbed experimental results show that via solving these three problems ARM achieves significant improvement in energy efficiency and throughput. Moreover, ARM exhibits a prominent ability to enhance its broadcast reliability.

关键词： ARM WSN access protocols asynchronous multichannel WSN asynchronous receiver-initiated multichannel MAC protocol control channel saturation duty cycling energy efficiency low broadcast reliability problems probability probability-based random channel sele

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：