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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

47 篇 会议
3 册 图书

馆藏范围

50 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

41 篇 工学
- 40 篇 计算机科学与技术...
- 36 篇 软件工程
- 2 篇 电气工程
- 2 篇 电子科学与技术（可...
- 2 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 生物工程
- 1 篇 安全科学与工程
6 篇 理学
- 3 篇 数学
- 1 篇 地球物理学
- 1 篇 生物学
- 1 篇 系统科学
2 篇 管理学
- 2 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
1 篇 法学
- 1 篇 社会学

主题

4 篇 parallel computi...
4 篇 gpus
3 篇 graphics process...
2 篇 combinatorial op...
2 篇 graphics process...
2 篇 parallel algorit...
1 篇 distributed opti...
1 篇 computational ma...
1 篇 parallel algorit...
1 篇 adaptive time st...
1 篇 data pipeline
1 篇 multi-objective ...
1 篇 parallel process...
1 篇 parallelization
1 篇 apache spark
1 篇 speculative mult...
1 篇 testing sequence...
1 篇 reusing warps
1 篇 rssi
1 篇 parallelism

机构

3 篇 chinese acad sci...
2 篇 saarland informa...
2 篇 the university o...
2 篇 central south un...
2 篇 univ chinese aca...
2 篇 natl univ def te...
2 篇 university of mu...
2 篇 university of ca...
2 篇 cracow universit...
2 篇 hunan university
1 篇 columbia univers...
1 篇 univ queensland ...
1 篇 univ mostaganem ...
1 篇 school of comput...
1 篇 beijing normal u...
1 篇 inner mongolia u...
1 篇 hangzhou dianzi ...
1 篇 natl comp networ...
1 篇 chongqing univ c...
1 篇 university of ca...

作者

2 篇 koester marcel
2 篇 rabbouch hana
2 篇 zhang lei
2 篇 xiao jian
2 篇 li kenli
2 篇 wang guojun
2 篇 yu ce
2 篇 perez gregorio m...
2 篇 wu guangjun
2 篇 joanna kołodziej
2 篇 zhang bo
2 篇 saadaoui foued
2 篇 wang hao
2 篇 sun tao
2 篇 bellatreche ladj...
2 篇 krueger antonio
2 篇 chen yifeng
2 篇 gross julian
2 篇 hou junteng
2 篇 ji yiming

语言

50 篇 英文

检索条件"任意字段=20th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2020"

共 50 条记录，以下是41-50 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Selective Velocity Distributed Indexing for Continuously Moving Objects Model 19th

Selective Velocity Distributed Indexing for Continuously Mov...

引用

19th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Bareche, Imene Xia, Ying Chongqing Univ Posts & Telecommun Sch Comp Sci & Technol Chongqing Peoples R China

ISBN: (纸本)9783030389611;9783030389604

the widespread of GPS embedded devices has lead to a ubiquitous location dependent services, based on the generated real-time location data. this introduced the notion of continuous querying, and with the aid of advanced indexing techniques several complex query types could be supported. However the efficient querying and manipulation of such highly dynamic data is not trivial, processing factors of crucial importance should be carefully thought out such as accuracy and scalability. In this study we focus on Continuous KNN (CKNN) queries processing, one of the most well-know spatio-temporal queries over large scale of continuously moving objects. In this paper we provide an overview of CKNN queries and related challenges, as well as an outline of proposed works in the literature and their limitations, before getting to our contribution proposal. We propose a novel indexing approach model for CKNN querying, namely VS-TIMO. the proposed structure is based on a selective velocity partitioning method, since we have different objects with varying speeds. Our structure base unit is a comprised of a non overlapping R-tree and a two dimensions grid. In order to enhance performances, we design a compact multi-layer index structure on a distributed setting, and propose a CKNN search algorithm for accurate results using a candidate cells identification process. We provide a comprehensive vision of our indexing model and the adopted querying technique.

关键词： Continuous KNN querying Moving objects indexing Distributed spatio-temporal indices Velocity partitioning based index parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Communication-Avoiding Algorithm for Molecular Dynamics Simulation 19th

A Communication-Avoiding Algorithm for Molecular Dynamics Si...

引用

19th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Wang, Bei Chen, Yifeng Hou, Chaofeng Peking Univ EECS Beijing 100871 Peoples R China Chinese Acad Sci Inst Proc Engn Beijing Peoples R China

ISBN: (纸本)9783030389918;9783030389901

Molecular dynamics and many similar time-dependent computing tasks are defined as simple state updates over multiple time steps. In recent years, modern supercomputing clusters have enjoyed fast-growing compute capability and moderate-growing memory bandwidth, but their improvement of network bandwidth/latency is limited. In this paper, we propose a new communication-avoiding algorithmic model based on asynchronous communications which, unlike BSP, records and handles multiple iterative states together. the basic idea is to let computation run in small regular time steps while communications over longer dynamic time steps. Computation keeps checking inaccuracies so that the intervals between communications are small in volatile scenarios but longer when dynamics is smooth. this helps reduce the number of data exchanges via network communication and hence improve the overall performance when communication is the bottleneck. We test MD simulation of condensed covalent materials on the Sunway TaihuLight. For best time-to-solution, the general-purpose supercomputer Sunway TaihuLight performs 11.8K steps/s for a system with 2.1 million silicon atoms and 5.1 K steps/s for 50.4 million silicon atoms. this time-to-solution performance is close to those of state-of-art hardware solution. A software solution using general-purpose supercomputers makes the technology more accessible to the general scientific users.

关键词： BSP parallel-in-time Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Rise the Momentum: A Method for Reducing the Training Error on Multiple GPUs 19th

Rise the Momentum: A Method for Reducing the Training Error ...

引用

19th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Tang, Yu Yin, Lujia Zhang, Zhaoning Li, Dongsheng Natl Univ Def Technol Sci & Technol Parallel & Distributed Lab Changsha Peoples R China

ISBN: (纸本)9783030389611;9783030389604

Deep neural network training is a common issue that is receiving increasing attention in recent years and basically performed on Stochastic Gradient Descent or its variants. Distributed training increases training speed significantly but causes precision loss at the mean time. Increasing batchsize can improve training parallelism in distributed training. However, if the batchsize is too large, it will bring difficulty to training process and introduce more training error. In this paper, we consider controlling the total batchsize and lowering batchsize on each GPU by increasing the number of GPUs in distributed training. We train Resnet50 [4] on CIFAR-10 dataset by different optimizers, such as SGD, Adam and NAG. the experimental results show that large batchsize speeds up convergence to some degree. However, if the batchsize of per GPU is too small, training process fails to converge. Large number of GPUs, which means a small batchsize on each GPU declines the training performance in distributed training. We tried several ways to reduce the training error on multiple GPUs. According to our results, increasing momentum is a well-behaved method in distributed training to improve training performance on condition of multiple GPUs of constant large batchsize.

关键词： Multiple GPUs Batchsize Distributed training Momentum

来源：评论

学校读者我要写书评

暂无评论

HyGrid: A CPU-GPU Hybrid Convolution-Based Gridding Algorithm in Radio Astronomy 18th

HyGrid: A CPU-GPU Hybrid Convolution-Based Gridding Algorith...

引用

18th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Luo, Qi Xiao, Jian Yu, Ce Bi, Chongke Ji, Yiming Sun, Jizhou Zhang, Bo Wang, Hao Tianjin Univ Sch Comp Sci & Technol 135 Yaguan RdHaihe Educ Pk Tianjin 300350 Peoples R China Tianjin Univ Sch Comp Software 135 Yaguan RdHaihe Educ Pk Tianjin 300350 Peoples R China Chinese Acad Sci Natl Astron Observ 20A Datun Rd Beijing 100012 Peoples R China

ISBN: (纸本)9783030050511;9783030050504

New-generation radio telescopes have been producing an unprecedented scale of data every day and requiring fast algorithms to speedup their data processing work flow urgently. the most data intensive computing phase during the entire work flow is gridding, which converts original data from irregular sampling space to regular grid space. Current methods are mainly focused on interferometers or have limitations on the resolutions due to the memory wall. Here we propose a CPU-GPU hybrid algorithm which accelerates the process of gridding. It employs multi-CPU to perform pre-ordering and GPU to speed up convolution-based gridding. Several optimization strategies are further proposed for reducing unnecessary memory access and maximizing the utilization of the heterogeneous architecture. Testing results demonstrate that the proposal is especially suitable for gridding large-scale data and can improve performance by up to 71.25 times compared to the traditional multi-thread CPU-based approach.

关键词： Gridding Heterogeneous computing Convolution Data pipeline Astroinformatics

来源：评论

学校读者我要写书评

暂无评论

FastDRC: Fast and Scalable Genome Compression Based on Distributed and parallel processing 19th

FastDRC: Fast and Scalable Genome Compression Based on Distr...

引用

19th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Ji, Yimu Fang, Houzhi Yao, Haichang He, Jing Chen, Shuai Li, Kui Liu, Shangdong Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing Peoples R China Nanjing Inst Ind Technol Sch Comp & Software Nanjing 210023 Peoples R China Swinburne Univ Technol Sch Software & Elect Engn Melbourne Vic 3122 Australia Nanjing Univ Posts & Telecommun Inst High Performance Comp & Big Data Nanjing 210003 Peoples R China Nanjing Ctr HPC China Nanjing 210003 Peoples R China Jiangsu HPC & Intelligent Proc Engineer Res Ctr Nanjing 210003 Peoples R China

ISBN: (纸本)9783030389611;9783030389604

With the advent of next-generation sequencing technology, sequencing costs have fallen sharply compared to the previous sequencing technologies. Genomic big data has become the significant big data application. In the face of growing genomic data, its storage and migration face enormous challenges. therefore, researchers have proposed a variety of genome compression algorithms, but these algorithms cannot meet the processing requirements for large amount of biological data and high processing speed. this manuscript proposes a parallel and distributed referential genome compression algorithm-Fast Distributed Referential Compression (FastDRC). this algorithm compresses a large number of genomic sequences in parallel under the Apache Hadoop distributed computing framework. Experiments show that the compression efficiency of the FastDRC is greatly improved when it compresses large quantities of genomic data. Moreover, FastDRC leads to the only distributed computing method known to us in the field of genome compression. the source code for FastDRC can be obtained from this link: https://***/GhostCCCathenry/FastDRC.

关键词： Genome compression Distributed processing Apache Hadoop FASTA

来源：评论

学校读者我要写书评

暂无评论

HDF5-Based I/O Optimization for Extragalactic HI Data Pipeline of FAST 19th

HDF5-Based I/O Optimization for Extragalactic HI Data Pipeli...

引用

19th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Ji, Yiming Yu, Ce Xiao, Jian Tang, Shanjiang Wang, Hao Zhang, Bo Tianjin Univ Coll Intelligence & Comp Tianjin Peoples R China Chinese Acad Sci CAS Key Lab FAST NAOC Beijing Peoples R China

ISBN: (纸本)9783030389611;9783030389604

the Five-hundred-meter Aperture Spherical Radio Telescope (FAST), which is the largest single-dish radio telescope in the world, has been producing a very large data volume with high speed. So it requires a high performance data pipeline to covert the huge raw observed data to science data product. However, the existing solutions of pipelines widely used in radio data processing cannot tackle this situation efficiently. the paper proposes a pipeline architecture for FAST based on HDF5 format and several I/O optimization strategies. First, we design the workflow engine driving the various tasks efficiently in the pipeline;second, we design a common radio data storage specification on the top of HDF5 format, and also developed a fast converter to map the original FITS format to the new HDF5 format;third, we apply several concrete strategies to optimize the I/O operations, including chunks storage, parallel reading/writing, on-demand dump, and stream process etc. In the experiment of processing 700 GB of FAST data, the results show that HDF5 based data structure without other optimizations was 1.7 times faster than original FITS format. If chunk storage and parallel I/O optimization are applied, the overall performance can reach 4.5 times as the original one. Moreover, due to the good expansibility and flexibility, our solution of FAST pipeline can be adapted to other radio telescopes.

关键词： FAST FITS HDF5 Pipeline in parallel High performance I/O

来源：评论

学校读者我要写书评

暂无评论

parallel social influence model with Levy flight pattern introduced for large-graph mining on ***

Parallel social influence model with Levy flight pattern int...

引用

13th international conference on algorithms and architectures for parallel processing, ica3pp 2013

作者： Wu, Benbin Yang, Jing He, Liang Department of Computer Science and Technology East China Normal University 200241 Shanghai China

ISBN: (纸本)9783319038889

With a suitable method to rank the user influence in micro-blogging service, we could get influential individuals to make information reach large populations. Here a novel parallel social influence model is proposed to face to these challenges. In this paper, we firstly propose impact factors named Social Network Centricity and Weibo Heat Trend, describe a general algorithm named ActionRank to calculate the user influence based on these factors and the user-weibo behavior graph. Secondly, we introduce the Levy flight pattern into ActionRank, for the random large distance jumping phenomenon and the power-law distribution of the retweet cascade hops on *** meet its requirement. thirdly, the parallel ActionRank is proposed with the help of MapReduce for large-scale graphs. Experiment results demonstrate that ActionRank on Levy flight pattern outperforms other algorithms and show the consistency of parallel ActionRank on datasets with sizes ranging from 20M to 1100 M edges. © Springer international Publishing Switzerland 2013.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

UniDegree: A GPU-based graph representation for SSSP 15th

UniDegree: A GPU-based graph representation for SSSP

引用

15th international conference on algorithms and architectures for parallel processing, ica3pp 2015

作者： Zhang, Changyou Wang, Feng Huang, Kun Liu, Zhiyou Chen, Yifeng Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing100190 China HCST Key Lab School of EECS Peking University Beijing100085 China School of Computer Beijing Institute of Technology Beijing100081 China

ISBN: (纸本)9783319271217

GPU is the mainstream co-processor computers of heterogeneous architecture. parallel graph algorithms are fundamental for many data-driven applications to be solved on heterogeneous clusters. SSSP (Single Source Shortest Path) algorithm is one of the most important one. We proposed a graph representation structure with unified vertex’s degree. this method ensures the data block size consistency. And then, the transferring in memory on this representation makes the data reading in cohesion for CUDA thread blocks. thirdly, vertex renumbering optimizes the locality of graph vertices to make the relaxing operation more efficient. With data of New York road, we implemented SSSP algorithms of delta-stepping on Nvida Tesla K20x GPU device. the experimental results show that the best unified-degree is approximate to the mode of vertex-degree of the graph. For example of the New York road map, all degrees were unified into 4-degree that results to the biggest speed-up of SSSP algorithm. © Springer international Publishing Switzerland 2015.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Power efficiency evaluation of block ciphers on GPU-integrated multicore processor

Power efficiency evaluation of block ciphers on GPU-integrat...

引用

12th international conference on algorithms and architectures for parallel processing, ica3pp 2012

作者： Nishikawa, Naoki Iwai, Keisuke Kurokawa, Takakazu Departmemt of Computer Science and Engineering National Defense Academy of Japan 1-10-20 Hashirimizu Yokosuka-shi Kanagawa-ken 239-8686 Japan

ISBN: (纸本)9783642330773

Computer systems with discrete GPUs are expected to become the standard methodology for high-speed encryption processing, but they require large amounts of power consumption and are inapplicable to embedded devices. therefore, we have specifically examined a new heterogeneous multicore processor with CPU-GPU integration architecture. We first implemented three 128-bit block ciphers (AES, Camellia, and SC2000) from several symmetric block ciphers in an e-government recommended ciphers list by CRYPTREC in Japan using OpenCL on AMD E-350 APU with CPU-GPU integration architecture and two traditional systems with discrete GPUs. then we evaluated their respective power efficiencies. Result showed that performance per watt of AES-128 on the APU including 80 cores were 743.0 Mbps/W and 44.0 % increases compared with those on a system equipped with a discrete AMD Radeon HD 6770 including 800 cores. this paper is the first to describe a study to evaluate the per-watt performance of block ciphers on GPUs. © 2012 Springer-Verlag.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

parallel Kirchhoff pre-stack depth migration on large high performance clusters 15th

Parallel Kirchhoff pre-stack depth migration on large high p...

引用

15th international conference on algorithms and architectures for parallel processing, ica3pp 2015

作者： Li, Chao Wang, Yida Zhao, Changhai Yan, Haihua Zhang, Jianlei School of Computer Science and Engineering Beihang University Beijing100191 China Research and Development Center BGP Inc. CNPC ZhuozhouHebei072751 China

ISBN: (纸本)9783319271361

Kirchhoff Pre-Stack Depth Migration (KPSDM) is a widely used algorithm for seismic imaging in petroleum industry. To provide higher FLOPS, modern high performance clusters are equipped with more computing nodes and more cores for each node. the evolution style of clusters leads to two problems for upper layer applications such as KPSDM: (1) the increasing disparity of the I/O capacity and computing performance is becoming a bottleneck for higher scalability;(2) the decreasing Mean Time Between Failures (MTBF) limits the availability of the applications. In this paper, we present an optimized parallel implementation of KPSDM to adapt to modern clusters. First, we convert the KPSDM into a clear and simple task-based parallel application by decomposing the computation along two dimensions: the imaging space and seismic data. then, those tasks are mapped to computing nodes that are organized using a two-level master/worker architecture to reduce the I/O workloads. And each task is further parallelized using multi-cores to fully utilize the computing resources. Finally, fault tolerance and checkpoint are implemented to meet the availability requirement in production environments. Experimental results with practical seismic data show that our parallel implementation of KPSDM can scale smoothly from 51 nodes (816 cores) to 211 nodes (3376 cores) with low I/O workloads on the I/O sub-system and multiple process failures can be tolerated efficiently. © Springer international Publishing Switzerland 2015.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共5页 << < 1 2 3 4 5 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：