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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

875 篇 会议
36 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

654 篇 工学
- 590 篇 计算机科学与技术...
- 181 篇 软件工程
- 105 篇 电气工程
- 77 篇 信息与通信工程
- 53 篇 控制科学与工程
- 34 篇 电子科学与技术（可...
- 24 篇 仪器科学与技术
- 15 篇 网络空间安全
- 11 篇 机械工程
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 8 篇 动力工程及工程热...
- 7 篇 测绘科学与技术
- 6 篇 交通运输工程
- 5 篇 力学（可授工学、理...
- 5 篇 石油与天然气工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
139 篇 理学
- 100 篇 数学
- 14 篇 物理学
- 12 篇 生物学
- 10 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 地球物理学
- 6 篇 化学
62 篇 管理学
- 41 篇 管理科学与工程(可...
- 25 篇 图书情报与档案管...
- 12 篇 工商管理
14 篇 医学
- 14 篇 临床医学
3 篇 经济学
2 篇 法学
2 篇 农学

主题

90 篇 parallel process...
46 篇 graphics process...
46 篇 distributed comp...
40 篇 computer archite...
40 篇 computational mo...
37 篇 graphics process...
32 篇 hardware
31 篇 parallel process...
28 篇 kernel
27 篇 optimization
24 篇 parallel program...
24 篇 benchmark testin...
23 篇 instruction sets
23 篇 multicore proces...
22 篇 libraries
20 篇 parallel algorit...
20 篇 runtime
20 篇 concurrent compu...
20 篇 distributed data...
19 篇 parallel computi...

机构

6 篇 tsinghua univ de...
6 篇 virginia tech de...
4 篇 univ chinese aca...
4 篇 ohio state univ ...
3 篇 nanyang technol ...
3 篇 college of compu...
3 篇 georgia inst tec...
3 篇 georgia inst tec...
3 篇 pacific northwes...
3 篇 univ hamburg ham...
3 篇 univ calif irvin...
3 篇 pacific northwes...
3 篇 oak ridge natl l...
3 篇 univ calif irvin...
3 篇 lawrence berkele...
3 篇 department of co...
2 篇 university of ot...
2 篇 universidad cató...
2 篇 univ pisa dept c...
2 篇 shanghai jiao to...

作者

5 篇 buluc aydin
4 篇 franca felipe m....
4 篇 bader david a.
4 篇 liu jie
4 篇 torquati massimo
4 篇 panda dhabaleswa...
4 篇 wang qinglin
4 篇 owens john d.
4 篇 danelutto marco
3 篇 pearce roger
3 篇 hirmer pascal
3 篇 ferner clayton
3 篇 nakano koji
3 篇 marco danelutto
3 篇 azzedine boukerc...
3 篇 harshvardhan
3 篇 mitschang bernha...
3 篇 gerndt michael
3 篇 simmhan yogesh
3 篇 marzulo leandro ...

语言

905 篇 英文
4 篇 其他
4 篇 中文

检索条件"任意字段=23rd IEEE International Parallel and Distributed Processing Symposium"

共 913 条记录，以下是201-210 订阅

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

详细简洁

排序：

A Case Study for an Accelerated DCNN on FPGA-based Embedded distributed System 33

A Case Study for an Accelerated DCNN on FPGA-based Embedded ...

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Nestorov, Anna Maria Scolari, Alberto Reggiani, Enrico Stornaiuolo, Luca Santambrogio, Marco D. Politecn Milan Dipartimento Elettron Informaz & Bioingn Milan Italy

ISBN: (纸本)9781538655559

Face Detection (FD) recently became the base of multiple applications requiring low latency but also with limited resources and energy budgets. Deep Convolutional Neural Networks (DCNNs) are especially accurate in FD, but latency requirements and energy budgets call for Field Programmable Gate Arrays (FPGAs)-based solutions, trading flexibility and efficiency. Nonetheless, the offer of FPGAs solutions is limited and different chips often require expensive re-design phases, while developers desire solutions whose resources can scale proportionally to the demands. Therefore, this work presents an FD solution based on a DCNN on a distributed, embedded system with FPGAs, proposing a general approach to reduce the DCNN size and to design its FPGA cores and investigating its accuracy, performance, and energy efficiency.

关键词： DCNN CNN Quantization Embedded FPGA distributed Face detection PYNQ-Z1 HDL HLS

来源：评论

学校读者我要写书评

暂无评论

Modelling DVFS and UFS for Region-Based Energy Aware Tuning of HPC Applications 33

Modelling DVFS and UFS for Region-Based Energy Aware Tuning ...

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Chadha, Mohak Gerndt, Michael Tech Univ Munich Chair Comp Architecture & Parallel Syst Garching Germany

ISBN: (纸本)9781728112466

Energy efficiency and energy conservation are one of the most crucial constraints for meeting the 20MW power envelope desired for exascale systems. Towards this, most of the research in this area has been focused on the utilization of user-controllable hardware switches such as per-core dynamic voltage frequency scaling (DVFS) and software controlled clock modulation at the application level. In this paper, we present a tuning plugin for the Periscope Tuning Framework which integrates fine-grained autotuning at the region level with DVFS and uncore frequency scaling (UFS). The tuning is based on a feed-forward neural network which is formulated using Performance Monitoring Counters (PMC) supported by x86 systems and trained using standardized benchmarks. Experiments on five standardized hybrid benchmarks show an energy improvement of 16.1% on average when the applications are tuned according to our methodology as compared to 7.8% for static tuning.

关键词： Energy-efficiency autotuning dynamic voltage and frequency scaling uncore frequency scaling dynamic tuning

来源：评论

学校读者我要写书评

暂无评论

ParaVis: A Library for Visualizing and Debugging parallel Applications 33

ParaVis: A Library for Visualizing and Debugging Parallel Ap...

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Danner, Andrew Newhall, Tia Webb, Kevin C. Swarthmore Coll Comp Sci Dept Swarthmore PA 19081 USA

ISBN: (纸本)9781538655559

This paper presents ParaVis, a visualization library designed to aid programmers' understanding of their parallel programs and to help them identify bugs with parallelization. ParaVis is particularly targeted for programmers who are first learning parallel programming or learning a new parallel language. It provides easy-to-use C and C++ interfaces to create 2D animations of parallel computation that help programmers understand parallel data decomposition patterns. These visualizations are also helpful in illustrating errors in parallel programs. Additionally, because students often find visualization fun, the use of our library often results in students developing interesting extensions to problems, thus promoting a deeper understanding and richer experience with parallel computing. Currently we provide support and sample implementations for pthreads, OpenMP, CUDA, and sequential applications. To test its effectiveness for parallel computing education, we deployed ParaVis for lab assignments in both intermediate and upper level courses. We present example applications, and evaluate the use of the library across our undergraduate CS curriculum.

关键词： visualization library parallel computing CS Education CUDA pthreads OpenMP

来源：评论

学校读者我要写书评

暂无评论

Combining Prefetch Control and Cache Partitioning to Improve Multicore Performance 33

Combining Prefetch Control and Cache Partitioning to Improve...

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Sun, Gongjin Shen, Junjie Veidenbaum, Alexander V. Univ Calif Irvine Irvine CA 92717 USA

ISBN: (纸本)9781728112466

Modern commercial multi-core processors are equipped with multiple hardware prefetchers on each core. The prefetchers can significantly improve application performance. However, shared resources, such as last-level cache (LLC) and off-chip memory bandwidth and controller, can lead to prefetch interference. Multiple techniques have been proposed to reduce such interference and improve the performance isolation across cores, such as coordinated control among prefetchers and cache partitioning (CP). Each of them has its advantages and disadvantages. This paper proposes combining these two techniques in a coordinated way. Prefetchers and LLC are treated as separate resources and a multi-resource management mechanism is proposed to control prefetching and cache partitioning. This control mechanism is implemented as a Linux kernel module and can be applied to a wide variety of prefetch architectures. An implementation on Intel Xeon ES v4 processor shows that combining LLC partitioning and prefetch throttling provides a significant improvement in performance and fairness.

关键词： Prefetching Interference Benchmark testing Multicore processing Hardware Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Approximate and Exact Selection on GPUs 33

Approximate and Exact Selection on GPUs

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Ribizel, Tobias Anzt, Hartwig Karlsruhe Inst Technol Steinbuch Ctr Comp Karlsruhe Germany Univ Tennessee Innovat Comp Lab ICL Knoxville TN USA

ISBN: (纸本)9781538655559

We present a novel algorithm for parallel selection on GPUs. The algorithm requires no assumptions on the input data distribution, and has a much lower recursion depth compared to many state-of-the-art algorithms. We implement the algorithm for different GPU generations, always using the respectively-available low-level communication features, and assess the performance on server-line hardware. The computational complexity of our SampleSelect algorithm is comparable to specialized algorithms designed for - and exploiting the characteristics of - "pleasant" data distributions. At the same time, as the SampleSelect does not work on the actual values but the ranks of the elements only, it is robust to the input data and can complete significantly faster for adversarial data distributions. Additionally to the exact SampleSelect, we address the use case of approximate selection by designing a variant that radically reduces the computational cost while preserving high approximation accuracy.

关键词： parallel selection algorithm GPU kth order statistics approximate threshold selection

来源：评论

学校读者我要写书评

暂无评论

BigSpa: An Efficient Interprocedural Static Analysis Engine in the Cloud 33

BigSpa: An Efficient Interprocedural Static Analysis Engine ...

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Zuo, Zhiqiang Gu, Rong Jiang, Xi Wang, Zhaokang Huang, Yihua Wang, Linzhang Li, Xuandong Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China

ISBN: (纸本)9781728112466

Static program analysis is widely used in various application areas to solve many practical problems. Although researchers have made significant achievements in static analysis, it is still too challenging to perform sophisticated interprocedural analysis on large-scale modern software. The underlying reason is that interprocedural analysis for large-scale modern software is highly computation- and memory-intensive, leading to poor scalability. We aim to tackle the scalability problem by proposing a novel big data solution for sophisticated static analysis. Specifically, we propose a data-parallel algorithm and a join-process-filter computation model for the CFL-reachability based interprocedural analysis and develop an efficient distributed static analysis engine in the cloud, called BigSpa. Our experiments validated that BigSpa running on a cluster scales greatly to perform precise interprocedural analyses on millions of lines of code, and runs an order of magnitude or more faster than the existing state-of-the-art analysis tools.

关键词： Interprocedural static analysis distributed systems data-parallel computation

来源：评论

学校读者我要写书评

暂无评论

Computation of Matrix Chain Products on parallel Machines 33

Computation of Matrix Chain Products on Parallel Machines

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Schwartz, Oded Weiss, Elad Hebrew Univ Jerusalem Jerusalem Israel

ISBN: (纸本)9781728112466

The Matrix Chain Ordering Problem is a well studied optimization problem, aiming at finding optimal parentheses assignment for minimizing the number of arithmetic operations required when computing a chain of matrix multiplications. Existing algorithms include the O(N-3) dynamic programming of Godbole (1973) and the faster O(N log N) algorithm of Hu and Shing (1982). We show that both may result in suboptimal parentheses assignment on modern machines as they do not take into account inter-processor communication costs that often dominate the running time. Further, the optimal solution may change when using fast matrix multiplication algorithms. We show that the O(N-3) dynamic-programing algorithm easily adapts to provide optimal solutions for modern matrix multiplication algorithms, and obtain an adaption of the O(N log N) algorithm that guarantees a constant approximation.

关键词： Algorithms I/O Complexity Fast Matrix Multiplication parallel Computation Matrix Chain Products

来源：评论

学校读者我要写书评

暂无评论

parallel Clustering Search applied to Capacitated Centered Clustering Problem 33

Parallel Clustering Search applied to Capacitated Centered C...

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Morales, Davi Melo Chaves, Antonio Augusto Fazenda, Alvaro Luiz Univ Fed Sao Paulo Sao Jose Dos Campos Brazil

ISBN: (纸本)9781538655559

The Clustering Search (CS) is a hybrid method that tries to combine metaheuristics and local search heuristics so that the search is intensified only in promising regions of the solution space. In this paper we propose a new parallel method based on the CS, using the Genetic Algorithm as a solutions generator, to solve the Capacitated Centered Clustering Problem (CCCP). The CCCP is to partition a set of n points into p disjoint groups with limited capacity. Each point is associated with a demand value and the objective is to minimize the sum of the Euclidean distances between the points and their respective geometric centers. The parallel CS consists in a master-slave system implemented following a message passing approach in order to parallelize the local search component, which is the most computationally demanding procedure. The computational results show that the parallel CS is an effective strategy in terms of computational time and efficiency.

关键词： Clustering Capacitated Centered Clustering Problem hybrid metaheuristic MPI

来源：评论

学校读者我要写书评

暂无评论

Teaching High Performance Computing through parallel Programming Marathons 33

Teaching High Performance Computing through Parallel Program...

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Marzulo, Leandro A. J. Bianchini, Calebe P. Santiago, Leandro Ferreira, Victor C. Goldstein, Brunno F. Franca, Felipe M. G. Univ Estado Rio De Janeiro UERJ Inst Matemat & Estat Rio De Janeiro Brazil Univ Presbiteriana Mackenzie Fac Comp & Informat Sao Paulo SP Brazil Univ Fed Rio De Janeiro UFRJ Programa Engn Sistemas & Comp COPPE Rio De Janeiro Brazil

ISBN: (纸本)9781538655559

parallel and distributed programming is essential for exploiting the processing power of modern computing platforms. However, during the first years of a Computer Science course, students usually learn problem solving techniques, data structures and programming paradigms that are inherently sequential, hindering the transition to parallel architectures. parallel Programming Marathons organized in Brazil are similar to other Programming Competitions around the world and have been used for teaching and stimulating undergraduate and graduate students into learning to "think in parallel" and to develop applications for different parallel architectures, including multicores, clusters and accelerators. This paper presents the structure of this parallel Programming Marathon and an overview of how it supports regional and national contests. Also, this work presents use cases on parallel and distributed Computing course from two different Brazilian universities that use a challenge based learning approach and employ marathon problems as course assignments. This approach contributed to increase students' interest towards High Performance Computing.

关键词： High Performance Computing Marathon of parallel Programming parallel and distributed Computing

来源：评论

学校读者我要写书评

暂无评论

Local distributed Algorithms in Highly Dynamic Networks 33

Local Distributed Algorithms in Highly Dynamic Networks

引用

33rd ieee international parallel and distributed processing symposium (IPDPS)

作者： Bamberger, Philipp Kuhn, Fabian Maus, Yannic Univ Freiburg Freiburg Germany

ISBN: (纸本)9781728112466

We define a generalization of local distributed graph problems to (synchronous round-based) dynamic networks and present a framework for developing algorithms for these problems. The algorithms should satisfy non-trivial guarantees in every round. The guarantees should be stronger the more stable the graph has been during the last few rounds and coincide with the definition of the static graph problem if no topological change appeared recently. Moreover, if only a constant neighborhood around some part of the graph is stable during an interval, the algorithms should quickly converge to a solution for this part of the graph that remains unchanged throughout the interval. We demonstrate our generic framework with two classic distributed graph problems, namely (degree+1)-vertex coloring and maximal independent set (MIS). To illustrate the given guarantees consider the vertex coloring problem: Any conflict between two nodes caused by a newly inserted edge is resolved within T = O(log n) rounds. During this conflict resolving both nodes always output colors that are not in conflict with their respective 'old' neighbors. The largest color that a node is allowed to output is determined by the number of distinct neighbors that it has seen in the last T rounds.

关键词： highly dynamic networks distributed graph algorithms maximal independent set (MIS) vertex coloring

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：