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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,684 篇 会议
58 册 图书
54 篇 期刊文献

馆藏范围

2,796 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,840 篇 工学
- 1,627 篇 计算机科学与技术...
- 845 篇 软件工程
- 338 篇 电气工程
- 220 篇 电子科学与技术（可...
- 208 篇 信息与通信工程
- 84 篇 控制科学与工程
- 62 篇 光学工程
- 57 篇 机械工程
- 41 篇 仪器科学与技术
- 38 篇 生物医学工程（可授...
- 38 篇 生物工程
- 31 篇 材料科学与工程（可...
- 25 篇 动力工程及工程热...
- 21 篇 化学工程与技术
- 20 篇 建筑学
- 15 篇 土木工程
- 13 篇 力学（可授工学、理...
- 12 篇 交通运输工程
499 篇 理学
- 342 篇 数学
- 113 篇 物理学
- 51 篇 系统科学
- 48 篇 生物学
- 30 篇 统计学（可授理学、...
- 26 篇 化学
173 篇 管理学
- 119 篇 管理科学与工程(可...
- 62 篇 图书情报与档案管...
- 49 篇 工商管理
40 篇 医学
- 30 篇 临床医学
- 14 篇 基础医学(可授医学...
15 篇 法学
- 15 篇 社会学
9 篇 经济学
9 篇 农学
8 篇 文学
2 篇 军事学
1 篇 教育学

主题

360 篇 parallel process...
219 篇 computer archite...
205 篇 graphics process...
146 篇 parallel archite...
135 篇 graphics process...
129 篇 hardware
115 篇 parallel algorit...
112 篇 image processing
98 篇 computational mo...
94 篇 concurrent compu...
87 篇 instruction sets
86 篇 field programmab...
83 篇 algorithm design...
79 篇 multicore proces...
77 篇 signal processin...
76 篇 parallel process...
66 篇 parallel program...
60 篇 gpu
59 篇 throughput
59 篇 kernel

机构

11 篇 natl univ def te...
6 篇 college of compu...
6 篇 school of comput...
6 篇 hosei univ dept ...
6 篇 natl univ def te...
5 篇 univ aizu dept c...
5 篇 carleton univ sc...
5 篇 school of comput...
5 篇 computer science...
5 篇 inria rennes
5 篇 city university ...
4 篇 chinese acad sci...
4 篇 univ michigan ad...
4 篇 institute of com...
4 篇 univ chinese aca...
4 篇 school of comput...
4 篇 univ jaume 1 dep...
4 篇 hainan internati...
4 篇 tech univ cluj n...
4 篇 department of co...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
9 篇 konrad karczewsk...
9 篇 quintana-orti en...
7 篇 dongarra jack
7 篇 kothapalli kisho...
6 篇 hannig frank
6 篇 liu jie
6 篇 su jinshu
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 wyrzykowski roma...
6 篇 thulasiraman par...
5 篇 ito yasuaki
5 篇 jerzy waśniewski
5 篇 wang guojun
5 篇 geyong min
5 篇 wanlei zhou

语言

2,760 篇 英文
14 篇 中文
11 篇 俄文
11 篇 其他
2 篇 乌克兰文
1 篇 西班牙文

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

共 2796 条记录，以下是481-490 订阅

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

详细简洁

排序：

An Empirical Comparison of k-Shortest Simple Path algorithms on Multicores 18

An Empirical Comparison of <i>k</i>-Shortest Simple Path Alg...

引用

47th international conference on parallel processing (ICPP)

作者： Ajwani, Deepak Duriakova, Erika Hurley, Neil Meyer, Ulrich Schickedanz, Alexander Nokia Bell Labs Dublin Ireland Univ Coll Dublin Sch Comp Sci Insight Ctr Data Analyt Dublin Ireland Goethe Univ Frankfurt Germany

ISBN: (纸本)9781450365109

We consider the loop less k-shortest path (KSP) problem. Although this problem has been studied in the sequential setting for at least the last two decades, no good parallel implementations are known. In this paper, we provide (i) a first systematic empirical comparison of various KSP algorithms and heuristic optimisations, (ii) carefully engineer various parallel implementations of these sequential algorithms and (iii) perform an extensive study of these parallel implementations on a range of graph classes and multicore architectures to determine the best algorithm and parallelization strategy for different graph classes. We find that even though the worst-case complexity of the best undirected KSP algorithm O (k (m + n log n)) is significantly better than that of the popular and considerably simpler directed KSP algorithm O(kn(m + n log n)), the two algorithms are fairly competitive in terms of their empirical performance on small diameter graphs. Furthermore, we show that a few simple optimisations help to bridge the gap between these KSP algorithms even more. However, on moderate to large diameter graphs, the undirected KSP algorithm is considerably faster than the directed algorithms, both in sequential and parallel settings. In terms of the parallelisation strategy, simply replacing the shortest path subroutine by parallel A-stepping algorithm can provide a good speed-up for many KSP algorithms on random graphs. In contrast, for graphs with skewed degree distribution, a more complex strategy of parallelizing the different deviations and then parallelizing the shortest path computation inside the deviations with the remaining threads, provides a better performance.

关键词： Algorithm Engineering parallel k-Shortest Path parallel Graph algorithms parallel Single Source Shortest Path

来源：评论

学校读者我要写书评

暂无评论

An Axiomatization for BSP algorithms 18th

An Axiomatization for BSP Algorithms

引用

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

作者： Marquer, Yoann Gava, Frederic Univ Paris East Lab Algorithms Complex & Log LACL Creteil France

ISBN: (纸本)9783030050573;9783030050566

the Gurevich's thesis stipulates that sequential abstract state machines (ASMS) capture the essence of sequential algorithms. On another hand, the bulk-synchronous parallel (BSP) bridging model is a well known model for HPC algorithm design. It provides a conceptual bridge between the physical implementation of the machine and the abstraction available to a programmer of that machine. the assumptions of the BSP model are thus provide portable and scalable performance predictions on most HPC systems. We follow Gurevich's thesis and extend the sequential postulates in order to intuitively and realistically capture BSP algorithms.

关键词： BSP ASM parallel algorithm HPC Postulates Cost model

来源：评论

学校读者我要写书评

暂无评论

parallel Computing for processing Data from Intelligent Transportation Systems 10th

Parallel Computing for Processing Data from Intelligent Tran...

引用

10th international conference on Supercomputing, ISUM 2019

作者： Denis, Jonathan Massobrio, Renzo Nesmachnow, Sergio Cristóbal, Alfredo Tchernykh, Andrei Meneses, Esteban Universidad de la República Montevideo Uruguay Universidad Veracruzana Heroica Veracruz Mexico Centro de Investigación Científica y Educación Superior de Ensenada Ensenada Mexico Centro Nacional de Alta Tecnología San José Costa Rica Instituto Tecnológico de Costa Rica Cartago Costa Rica

ISBN: (纸本)9783030380427

this article describes the application of parallel computing techniques for efficiently processing large volumes of data from ITS. this is a relevant problem in nowadays societies, especially when working under the novel paradigm of smart cities. the proposed approach applies parallel multithreading computing for processing Global Positioning System records for a case study on the Intelligent Transportation System in Montevideo, Uruguay. the experimental analysis is performed on a high performance computing platform, considering a large volume of data and different computing resources. the main results indicate that the proposed approach allows achieving good speedup values, thus reducing the execution time to process more than 120 GB of data from 921 to 77 min, when using 32 threads. In addition, a web application to illustrate the results of the proposed approach for computing the average speed of public transportation in Montevideo, Uruguay, is described. © Springer Nature Switzerland AG 2019.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Off-Chip Congestion Management for GPU-based Non-Uniform processing-in-Memory Networks

Off-Chip Congestion Management for GPU-based Non-Uniform Pro...

引用

Euromicro conference on parallel, Distributed and Network-Based processing

作者： Kishore Punniyamurthy Andreas Gerstlauer The University of Texas at Austin

ISBN: (数字)9781728165820

ISBN: (纸本)9781728165837

Advancements in packaging and 3D-stacking technology have enabled novel non-uniform processing-in-memory (NUPIM) architectures integrating a network of hybrid modules each with varying sizes and proportions of compute and memory. In such systems, network congestion can have a significant impact on performance and energy-efficiency scaling. At the same time, NUPIM systems often have strict power and thermal constraints, where traditional routing/redundancy or buffering based approaches to reduce congestion cannot be *** this paper, we propose a low-overhead yet scalable scheme for congestion management in off-chip networks of emerging GPU-based NUPIM systems. We note that congestion in NUPIM networks exhibits a form of tree saturation in which individually congested links form congested paths, where congestion effects due to back pressure vary across paths. Additionally, memory responses can have different performance impact due to memory divergence. Our approach exploits differences in performance impact of NUPIM traffic to mitigate congestion effects. We dynamically track congested paths and divergent data to manage priorities and accelerate performance-critical traffic. We further use critical paths knowledge to dynamically manage link widths and save I/O *** show that our congestion management outperforms a configuration with double the number of virtual channels and buffers indicating its effectiveness in managing congestion under stringent constraints. It improves performance by 15% (and up to 31%) over baseline and 10% (and up to 29%) against a memory distance based approach for congestion-affected benchmarks. Our scheme reduces 78% of I/O energy on average and up to 29% of system energy across all benchmarks.

关键词： Benchmark testing Delays Market research Systems architecture Packaging Memory management

来源：评论

学校读者我要写书评

暂无评论

A Post-processing Approach in Moving Objects Detection via Feature Pyramid Networks 9

A Post-Processing Approach in Moving Objects Detection via F...

引用

9th international conference on parallel architectures, algorithms and Programming (PAAP)

作者： Lin, Li Wang, Bin Gu, Yinjuan Shanghai Univ Shanghai Inst Adv Commun & Data Sci Shanghai Peoples R China Shanghai Univ Sch Commun & Informat Engn Shanghai Peoples R China

ISBN: (纸本)9781538694039

Recent work has shown that Convolutional Neural Networks (CNNs) have great ability to deal with classification problems in pattern recognition field. Moving objects detection, regarding as a classification process, labels every pixel as a foreground pixel or a background pixel. In this paper, we proposed an effective post-processing approach, Residual Background Networks (ResBGNets), to improve the accuracy of moving objects detection in video sequences. Instead of learning the ground truth directly, our model learns the residual pictures between the results of existing methods and the ground truth. It benefits to understand the hidden character of each algorithm and correct the misclassification. Inside ResBGNets, we build Feature Pyramid Networks (FPN) to combine spatial information of the low-resolution level with semantical features of high-level of the high-resolution level. Evaluation performed on the 2014 CDnet dataset reveals that through our approach, most of the existing background subtraction methods can get better detection results and a significant higher FM score.

关键词： Moving objects detection convolutional neural networks background subtraction residual pictures feature pyramids

来源：评论

学校读者我要写书评

暂无评论

Fine Granular parallel Algorithm for HEVC Encoding Based on Multicore Platform 10th

Fine Granular Parallel Algorithm for HEVC Encoding Based on ...

引用

10th international conference on Image and Graphics (ICIG)

作者： Li, Yi Hu, Dong Yin, Chuanwei Qiu, Yingcan Nanjing Univ Posts & Telecommun Key Lab Broadband Wireless Commun & Sensor Networ Educ Minist Nanjing 210003 Peoples R China Nanjing Univ Posts & Telecommun Engn Res Ctr Ubiquitous Network & Hlth Serv Educ Minist Nanjing 210003 Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Prov Key Lab Image Proc & Image Commun Nanjing 210003 Peoples R China

ISBN: (纸本)9783030341138;9783030341121

Compared with the previous standards, the coding efficiency and complexity of High Efficiency Video Coding (HEVC) have been greatly improved. parallel encoding scheme based on CTU rows like wavefront parallel processing (WPP) and inter-frame wavefront (IFW) can efficiently reduce the encoding time of HEVC. However, due to the coding complexity of CTU within various rows may be quite different, WPP and IFW have the problem of unbalanced load among threads for parallel encoding tasks. To address this issue, in this paper, factors affecting coding efficiency are found by analyzing the data dependence and load relationship of intra- and inter-frame CTUs, and we propose a fine granular parallel strategy accordingly. In the meanwhile, refine the parallel granularity while maintaining the accuracy of symbol prediction requires additional context information in CABAC encoding, which leads to higher bit rate, and will reduce the efficiency of CABAC encoding. In order to decrease the bit rate without affecting the quality, we also making some modifications for the CABAC encoding. the proposed method is implemented on the Tilera-GX36 multicore platform. Experiment results show that our algorithm achieves up to 1.6 and 2.8 times speedup improvement compared with IFW and WPP respectively.

关键词： HEVC encoding CTU IFW WPP CABAC Multicore platform

来源：评论

学校读者我要写书评

暂无评论

15th international Symposium on Applied Reconfigurable Computing, ARC 2019

15th International Symposium on Applied Reconfigurable Compu...

引用

15th international Symposium on Applied Reconfigurable Computing, ARC 2019

ISBN: (纸本)9783030172268

the proceedings contain 28 papers. the special focus in this conference is on Applied Reconfigurable Computing. the topics include: Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan;secure Local Configuration of Intellectual Property Without a Trusted third Party;HiFlipVX: An Open Source High-Level Synthesis FPGA Library for Image processing;Real-Time FPGA Implementation of Connected Component Labelling for a 4K Video Stream;A Scalable FPGA-Based Architecture for Depth Estimation in SLAM;Evaluating LULESH Kernels on OpenCL FPGA;the TaPaSCo Open-Source Toolflow for the Automated Composition of Task-Based parallel Reconfigurable Computing Systems;Graph-Based Code Restructuring Targeting HLS for FPGAs;UltraSynth: Integration of a CGRA into a Control Engineering Environment;exploiting Reconfigurable Vector processing for Energy-Efficient Computation in 3D-Stacked Memories;Optimizing CNN-Based Hyperspectral Image Classification on FPGAs;Automatic Toolflow for VCGRA Generation to Enable CGRA Evaluation for Arithmetic algorithms;reM: A Reconfigurable Multipotent Cell for New Distributed Reconfigurable architectures;Update or Invalidate: Influence of Coherence Protocols on Configurable HW Accelerators;hybrid Prototyping for Manycore Design and Validation;Evaluation of FPGA Partitioning Schemes for Time and Space Sharing of Heterogeneous Tasks;third Party CAD Tools for FPGA Design—A Survey of the Current Landscape;Filter-Wise Pruning Approach to FPGA Implementation of Fully Convolutional Network for Semantic Segmentation;Exploring Data Size to Run Convolutional Neural Networks in Low Density FPGAs;Faster Convolutional Neural Networks in Low Density FPGAs Using Block Pruning;Supporting Columnar In-memory Formats on FPGA: the Hardware Design of Fletcher for Apache Arrow;A Novel Encoder for TDCs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accelerating FM-index Search for Genomic Data processing 18

Accelerating FM-index Search for Genomic Data Processing

引用

47th international conference on parallel processing (ICPP)

作者： Wang, Yuanrong Li, Xueqi Zang, Dawei Tan, Guangming Sun, Ninghui Univ Chinese Acad Sci CAS ICT SKL Comp Architecture Beijing Peoples R China Chinese Acad Sci SKL Comp Architecture ICT Beijing Peoples R China

ISBN: (纸本)9781450365109

the deluge of genomics data is incurring prohibitively high computational costs. As an important building block for genomic data processing algorithms, FM-index search occupies most of execution time in sequence alignment. Due to massive random streaming memory references relative to only small amount of computations, FM-index search algorithm exhibits extremely low efficiency on conventional architectures. this paper proposes Niubility, an accelerator for FM-index search in genomic sequence alignment. Based on our algorithm-architecture co-design analysis, we found that conventional architectures exploit low memory-level parallelism so that the available memory bandwidth cannot be fully utilized. Niubility accelerator customizes bit-wise operations and exploit data-level parallelism, that produces maximal concurrent memory accesses to saturate memory bandwidth. We implement an accelerator ASIC in a ST 28nm process that achieves up to 990x speedup over the state-of-the-art software.

关键词： Energy efficiency Hardware-acceleration Genome alignment

来源：评论

学校读者我要写书评

暂无评论

Implementation and Performance Comparison of Partitioning Techniques in Apache Spark

Implementation and Performance Comparison of Partitioning Te...

引用

international conference on Computing and Networking Technology (ICCNT)

作者： J Geetha N. G. Harshit M S Ramaiah Institute of Technology Bangalore Karnataka

Apache spark is one of the most demanded frameworks for High performance computing of Big Data. Data is growing day by day to such a large extent that the power of existing analytical tool is not sufficient. the degree of parallelism achieved directly impacts the performance of the framework. parallelism can be achieved only when there is a proper division among the dataset. Partitioning helps in this division of work. Appropriate number of partitions and related data in partition will ensure the proper storage and faster access of data. Spark provides the inbuilt libraries and also flexibility to mould the available methods of partitioning according to convenience. In this paper we discuss about the architecture of storage structure in spark, implementation of various partitioning techniques and performance comparison of those techniques.

关键词： Sparks parallel processing Big Data Partitioning algorithms Cluster computing Python Hash functions

来源：评论

学校读者我要写书评

暂无评论

An Efficient Graph Accelerator with parallel Data Conflict Management 18

An Efficient Graph Accelerator with Parallel Data Conflict M...

引用

27th IEEE/ACM/IFIP international conference on parallel architectures and Compilation Techniques (PACT)

作者： Yao, Pengcheng Zheng, Long Liao, Xiaofei Jin, Hai He, Bingsheng Huazhong Univ Sci & Technol Big Data Technol & Syst Lab Cluster & Grid Comp Lab Serv Comp Technol & Syst Lab Wuhan 430074 Hubei Peoples R China Natl Univ Singapore Sch Comp Singapore 117418 Singapore

ISBN: (纸本)9781450359863

Graph-specific computing with the support of dedicated accelerator has greatly boosted the graph processing in both efficiency and energy. Nevertheless, their data conflict management is still sequential when certain vertex needs a large number of conflicting updates at the same time, leading to prohibitive performance degradation. this is particularly true and serious for processing natural graphs. In this paper, we have the insight that the atomic operations for the vertex updating of many graph algorithms (e.g., BFS, PageRank, and WCC) are typically incremental and simplex. this hence allows us to parallelize the conflicting vertex updates in an accumulative manner. We architect AccuGraph, a novel graph-specific accelerator that can simultaneously process atomic vertex updates for massive parallelism while ensuring the correctness. A parallel accumulator is designed to remove the serialization in atomic protections for conflicting vertex updates through merging their results in parallel. Our implementation on Xilinx FPGA with a wide variety of typical graph algorithms shows that our accelerator achieves an average throughput by 2.36 GTEPS as well as up to 3.14x performance speedup in comparison with state-of-the-art ForeGraph (with its single-chip version).

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共280页 << < 45 46 47 48 49 50 51 52 53 54 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：