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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,038 篇 会议
1,444 篇 期刊文献
129 册 图书
75 篇 学位论文

馆藏范围

6,686 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,970 篇 工学
- 3,387 篇 计算机科学与技术...
- 2,002 篇 软件工程
- 990 篇 电气工程
- 237 篇 信息与通信工程
- 178 篇 电子科学与技术（可...
- 136 篇 控制科学与工程
- 66 篇 机械工程
- 52 篇 生物医学工程（可授...
- 52 篇 生物工程
- 44 篇 仪器科学与技术
- 33 篇 材料科学与工程（可...
- 30 篇 力学（可授工学、理...
- 28 篇 动力工程及工程热...
- 28 篇 土木工程
- 21 篇 光学工程
- 20 篇 石油与天然气工程
677 篇 理学
- 396 篇 数学
- 118 篇 物理学
- 87 篇 生物学
- 78 篇 系统科学
- 33 篇 化学
- 28 篇 统计学（可授理学、...
- 25 篇 地球物理学
354 篇 管理学
- 262 篇 管理科学与工程(可...
- 98 篇 图书情报与档案管...
- 62 篇 工商管理
68 篇 教育学
- 62 篇 教育学
59 篇 医学
- 44 篇 临床医学
- 22 篇 基础医学(可授医学...
30 篇 法学
- 27 篇 社会学
17 篇 农学
15 篇 经济学
12 篇 文学
6 篇 艺术学
4 篇 军事学

主题

6,686 篇 parallel program...
1,067 篇 concurrent compu...
1,005 篇 parallel process...
572 篇 programming prof...
482 篇 application soft...
466 篇 computer science
466 篇 computer archite...
401 篇 hardware
340 篇 message passing
335 篇 distributed comp...
320 篇 libraries
315 篇 computational mo...
248 篇 computer languag...
231 篇 high performance...
230 篇 program processo...
229 篇 runtime
198 篇 parallel archite...
196 篇 parallel algorit...
193 篇 yarn
179 篇 costs

机构

14 篇 carnegie mellon ...
13 篇 barcelona superc...
11 篇 brno university ...
11 篇 univ illinois de...
11 篇 school of comput...
11 篇 intel corporatio...
10 篇 univ pisa dept c...
10 篇 stanford univ st...
9 篇 school of applie...
9 篇 department of co...
9 篇 carnegie mellon ...
9 篇 mathematics and ...
9 篇 department of co...
9 篇 rice univ housto...
8 篇 department of co...
8 篇 ibm thomas j. wa...
8 篇 univ alberta dep...
8 篇 department of co...
8 篇 irisa rennes
8 篇 tech univ berlin

作者

31 篇 griebler dalvan
25 篇 sarkar vivek
21 篇 danelutto marco
20 篇 fernandes luiz g...
19 篇 loulergue freder...
17 篇 badia rosa m.
16 篇 torquati massimo
15 篇 mencagli gabriel...
15 篇 olukotun kunle
14 篇 wolf felix
12 篇 g. runger
12 篇 gonzalez-escriba...
12 篇 ayguade eduard
12 篇 m. sato
11 篇 hoefler torsten
11 篇 dinavahi venkata
11 篇 benini luca
11 篇 valero mateo
11 篇 sato mitsuhisa
11 篇 t. rauber

语言

6,494 篇 英文
139 篇 其他
21 篇 中文
17 篇 俄文
7 篇 土耳其文
2 篇 德文
2 篇 朝鲜文
1 篇 西班牙文
1 篇 日文
1 篇 葡萄牙文

检索条件"主题词=Parallel programming"

共 6686 条记录，以下是1141-1150 订阅

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

详细简洁

排序：

A parallelism Profiler with What-If Analyses for OpenMP Programs

A Parallelism Profiler with What-If Analyses for OpenMP Prog...

引用

International Conference on High Performance Computing, Networking, Storage, and Analysis (SC)

作者： Boushehrinejadmoradi, Nader Yoga, Adarsh Nagarakatte, Santosh Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA

ISBN: (纸本)9781538683842

This paper proposes OMP-WHIP, a profiler that measures inherent parallelism in the program for a given input and provides what-if analyses to estimate improvements in parallelism. We propose a novel OpenMP series-parallel graph representation (OSPG) that precisely captures series-parallel relations induced by various directives between different fragments of dynamic execution. OMP-WHIP constructs the OSPG and measures the computation performed by each dynamic fragment using hardware performance counters. This series-parallel representation along with measurement of computation is a performance model of the program for a given input, which enables computation of inherent parallelism. This novel performance model also enables what-if analyses where a programmer can estimate improvements in parallelism when bottlenecks are addressed. We have used OMP-WHIP to identify parallelism bottlenecks in more than forty applications and then designed strategies to improve the speedup in seven applications.

关键词： parallel programming Performance analysis

来源：评论

学校读者我要写书评

暂无评论

AutoPar-Clava: An Automatic parallelization source-to-source tool for C code applications 18

AutoPar-Clava: An Automatic Parallelization source-to-source...

引用

9th Workshop on parallel programming and Run-Time Management Techniques for Many-Core Architectures (PARMA) / 7th Workshop on Design Tools and Architectures for Multicore Embedded Computing Platforms (DITAM)

作者： Arabnejad, Hamid Bispo, Joao Barbosa, Jorge G. Cardoso, Joao M. P. Univ Porto Fac Engn FEUP Porto Portugal Univ Porto Fac Engn FEUP INESC TEC Porto Portugal Univ Porto Fac Engn FEUP LIACC Porto Portugal

ISBN: (纸本)9781450364447

Automatic parallelization of sequential code has become increasingly relevant in multicore programming. In particular, loop parallelization continues to be a promising optimization technique for scienti.c applications, and can provide considerable speedups for program execution. Furthermore, if we can verify that there are no true data dependencies between loop iterations, they can be easily parallelized. This paper describes Clava AutoPar, a library for the Clava weaver that performs automatic and symbolic parallelization of C code. The library is composed of two main parts, parallel loop detection and source-to-source code parallelization. The system is entirely automatic and attempts to statically detect parallel loops for a given input program, without any user intervention or profiling information. We obtained a geometric mean speedup of 1.5 for a set of programs from the C version of the NAS benchmark, and experimental results suggest that the performance obtained with Clava AutoPar is comparable or better than other similar research and commercial tools.

关键词： Automatic parallelization source-to-source Compilation parallel programming OpenMP

来源：评论

学校读者我要写书评

暂无评论

Unobtrusive Asynchronous Exception Handling with Standard Java Try/Catch Blocks 32

Unobtrusive Asynchronous Exception Handling with Standard Ja...

引用

32nd IEEE International parallel and Distributed Processing Symposium (IPDPS)

作者： Mehrabi, Mostafa Giacaman, Nasser Sinnen, Oliver Univ Auckland Dept Elect & Comp Engn Parallel & Reconfigurable Comp Lab Auckland New Zealand

ISBN: (纸本)9781538643686

The sophisticated nature of parallel computing concepts makes parallel programming challenging. This has encouraged higher-level frameworks that conceal much of the complications behind abstraction layers. Paradigms in this category are mostly performance centric, and do not share the same sentiments for the robustness of asynchronous executions. This is while current applications demand consistency in addition to fast performance. Therefore, programming environments that offer high-level support for asynchronous exception handling will have higher chances for popularity. This paper discusses our latest enhancements to @PT, a parallel programming environment that is based on Java annotations. The proposed concept promotes the robustness of parallelized programs by adhering to the familiar exception handling standards of sequential code, and reducing the asynchronous execution concerns at the API level. This study suggests that the concept simplifies efficient management of asynchronous exceptions, which appears to be a challenge in parallel programming.

关键词： parallel programming exception handling asynchronous annotations @PT

来源：评论

学校读者我要写书评

暂无评论

faimGraph: High Performance Management of Fully-Dynamic Graphs Under Tight Memory Constraints on the GPU

faimGraph: High Performance Management of Fully-Dynamic Grap...

引用

International Conference on High Performance Computing, Networking, Storage, and Analysis (SC)

作者： Winter, Martin Mlakar, Daniel Zayer, Rhaleb Seidel, Hans-Peter Steinberger, Markus Graz Univ Technol Graz Austria Max Planck Inst Informat Saarbrucken Germany

ISBN: (纸本)9781538683842

In this paper, we present a fully-dynamic graph data structure for the Graphics Processing Unit (GPU). It delivers high update rates while keeping a low memory footprint using autonomous memory management directly on the GPU. The data structure is fully-dynamic, allowing not only for edge but also vertex updates. Performing the memory management on the GPU allows for fast initialization times and efficient update procedures without additional intervention or reallocation procedures from the host. Our optimized approach performs initialization completely in parallel;up to 300x faster compared to previous work. It achieves up to 200 million edge updates per second for sorted and unsorted update batches;up to 30x faster than previous work. Furthermore, it can perform more than 300 million adjacency queries and millions of vertex updates per second. On account of efficient memory management techniques like a queuing approach, currently unused memory is reused later on by the framework, permitting the storage of tens of millions of vertices and hundreds of millions of edges in GPU memory. We evaluate algorithmic performance using a PageRank and a Static Triangle Counting (STC) implementation, demonstrating the suitability of the framework even for memory access intensive algorithms.

关键词： parallel programming GPU Massively parallel algorithms Dynamic graphs

来源：评论

学校读者我要写书评

暂无评论

Characterizing Extracurricular Effort on Concurrent and Distributed programming Learning

Characterizing Extracurricular Effort on Concurrent and Dist...

引用

Investigación en Computación e Informática (JoCICI), Jornadas Costarricenses de

作者： Jeisson Hidalgo-Céspedes ECCI-CITIC Universidad de Costa Rica San José Costa Rica

ISBN: (数字)9781728147871

ISBN: (纸本)9781728147888

The importance of concurrent and distributed programming is increasing on Computer Science curricula. This exploratory research identifies additional notions required by the official topics of "parallel and Concurrent programming" course, taught at the University of Costa Rica. This paper characterizes previous knowledge that students had about these notions and the extracurricular effort that they made to overcome the lack of notions. Findings show that students were able to overcome the lack of notions at expense of more extracurricular effort. Exploratory evidence indicates that students' election of professors in previous courses influenced their performance and extracurricular effort in the parallel programming course.

关键词： previous knowledge extracurricular effort course concurrent programming parallel programming distributed programming parallel programming Distributed software Programmed Learning Costa Rica Students Teachers

来源：评论

学校读者我要写书评

暂无评论

Real-Time Stereo Matching System 11th

Real-Time Stereo Matching System

引用

11th International Conference on Intelligent Robotics and Applications (ICIRA)

作者： Zhu, Angfan Cao, Zhiguo Xiao, Yang Huazhong Univ Sci & Technol Guangdong HUST Ind Technol Res Inst Guangdong Prov Key Lab Digital Mfg EquipmentSch Key Lab Image Proc & Intelligent Control EducMin Wuhan 430074 Hubei Peoples R China

ISBN: (纸本)9783319975894;9783319975887

Getting depth information by stereo matching is one of the key steps in 3D reconstruct. In many practical applications, there are high requirements for the speed of processing and the accuracy of the results. Many algorithms have obtained good results in processing precision, like SGM. However, the processing speed often does not meet the real-time requirements. In this paper, we improve the traditional stereo matching method SGM so that it is able to meet the real-time requirements. We implement our improved algorithm in TX2 with parallel programming. And in the experiments, it shows that our algorithm obtains 21 fps for the video gained by ZED camera size of 640 * 360 pixels, 32 disparity levels and using 4 path directions for the traditional SGM method. To measure the accuracy of our method, we use Middlebury dataset as indoor scene and the video obtained by ZED camera as outdoor scene to exam our algorithm separately. The results show that we get great balance between the speed and the accuracy.

关键词： Stereo matching SGM parallel programming

来源：评论

学校读者我要写书评

暂无评论

SPMP: A JavaScript Support for Shared Persistent Memory on *** 18th

SPMP: A JavaScript Support for Shared Persistent Memory on *...

引用

18th International Conference on Algorithms and Architectures for parallel Processing (ICA3PP)

作者： Zhang, Qipeng Li, Tianyou Deng, Pan Chen, Yuting Huang, Linpeng Rudoff, Andy Shanghai Jiao Tong Univ Shanghai Peoples R China Intel Asia Pacific R&D Co LTD Shanghai Peoples R China Intel Corp Santa Clara CA USA

ISBN: (纸本)9783030050542;9783030050535

JavaScript is widely used for scripting on client side. *** is a JavaScript runtime environment, allowing Javascript to be used for building scalable network applications on server side. However, *** does not support parallel programming, making it difficult to enhance applications' performance. Meanwhile, persistent memory (PM) shows optimistic prospects of being used in server-side applications, while few researches do exist in allowing script languages to support PM-based parallel programming. In this paper, we introduce SPMP, a JavaScript support for shared persistent memory on ***. With SPMP, each process needs to hold PersistentArrayBuffer, an object that is responsible for allocating, managing, and accessing persistent memory. Multiple processes can then share persistent memory and communicate each other by their PersistentArrayBuffer objects. Furthermore, SPMP supports dynamic load-balancing strategies and ensures data coherency, and also supports data persistence in a secondary storage. We have evaluated SPMP against Extended Memory Semantics (EMS, a state-of-the-art model for parallel programming on ***) on two data-intensive tasks. The results show that SPMP is 100 similar to 300x faster than EMS on five basic operations, and 2x faster on complicated parallel computing tasks such as counting words, due to its particular way on memory allocation and mapping.

关键词： Node.js parallel programming Shared persistent memory

来源：评论

学校读者我要写书评

暂无评论

TaskGenX: A Hardware-Software Proposal for Accelerating Task parallelism 33rd

TaskGenX: A Hardware-Software Proposal for Accelerating Task...

引用

33rd International Conference on High Performance Computing (ISC High Performance)

作者： Chronaki, Kallia Casas, Marc Moreto, Miquel Bosch, Jaume Badia, Rosa M. BSC Barcelona Spain UPC Barcelona Spain CSIC Spanish Natl Res Council Bellaterra Spain

ISBN: (纸本)9783319920405;9783319920399

As chip multi-processors (CMPs) are becoming more and more complex, software solutions such as parallel programming models are attracting a lot of attention. Task-based parallel programming models offer an appealing approach to utilize complex CMPs. However, the increasing number of cores on modern CMPs is pushing research towards the use of fine grained parallelism. Task-based programming models need to be able to handle such workloads and offer performance and scalability. Using specialized hardware for boosting performance of task-based programming models is a common practice in the research community. Our paper makes the observation that task creation becomes a bottleneck when we execute fine grained parallel applications with many taskbased programming models. As the number of cores increases the time spent generating the tasks of the application is becoming more critical to the entire execution. To overcome this issue, we propose TaskGenX. TaskGenX offers a solution for minimizing task creation overheads and relies both on the runtime system and a dedicated hardware. On the runtime system side, TaskGenX decouples the task creation from the other runtime activities. It then transfers this part of the runtime to a specialized hardware. We draw the requirements for this hardware in order to boost execution of highly parallel applications. From our evaluation using 11 parallel workloads on both symmetric and asymmetric multicore systems, we obtain performance improvements up to 15x , averaging to 3.1x over the baseline.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Optimizations of Dual Polarization FMCW Weather Radar Signal Processing on CUDA Platform 5

Optimizations of Dual Polarization FMCW Weather Radar Signal...

引用

5th International Conference on Data and Software Engineering (ICoDSE)

作者： Rukmono, Satrio Adi Kistijantoro, Achmad Imam Perdana, Riza Satria Inst Teknol Bandung Sch Elect Engn & Informat Bandung Indonesia

ISBN: (纸本)9781538672594

Weather radar is a system that utilizes advanced radio wave engineering to detect precipitation in the atmosphere. One of the wave generation technique used in weather radar is frequency-modulated continuous wave (FMCW), with dual polarization for differentiating detected precipitation types by its shape and size. Weather radar signal processing is usually performed using digital signal processing and field programmable gate array (FPGA), that performs well but with difficulty in system development and deployment. Software implementation of weather radar signal processing enables easier and faster development and deployment with the cost of performance when done serially. parallel implementation using general purpose graphics processing units (GP-GPU) may provide best of both worlds with easier development and deployment compared to hardware-based solutions but with better performance than serial CPU implementations. In this paper, implementation of various optimization strategies weather signal radar processing in GP-GPU environment on the Nvidia CUDA platform is shown. Performance measurements show that among optimization strategies implemented, only the utilization of multiple CUDA streams give significant performance gain. This paper contributes in attempts to build full weather radar signal processing stack on GPU.

关键词： weather radar signal processing parallel programming GP-GPU Nvidia CUDA

来源：评论

学校读者我要写书评

暂无评论

Synchronization Techniques for parallel Redundant Execution of Applications

Synchronization Techniques for Parallel Redundant Execution ...

引用

ARCS Workshop 2019;32nd International Conference on Architecture of Computing Systems

作者： Christian Nagengast Lukas Osinski Juergen Mottok Laboratory for Safe and Secure Systems - LaS~3 Technical University of Applied Sciences Regensburg

ISBN: (纸本)9783800749577

In fault tolerant systems, applications are replicated and executed to enable error detection and recovery. If one replica application fails, another is able to take its place and provide the correct results. This concept can benefit from parallel execution on separate execution units. The rise of multicore platforms supports the development of parallel software, by providing the adequate hardware. However, this raises challenges regarding the synchronization of the redundant strings of execution. Replica determinism means that given the same input, identical programs provide the same output. To ensure replica determinism, requirements regarding the synchronization can be split in two domains: data and time. This paper examines the state of the art of synchronization techniques for parallel replicated execution in the context of fault tolerant systems. We analyze the requirements regarding synchronization within the time and data domain and compare different concepts of hardware (multicore, multiprocessor and multi-PCB) and software (processes, threads).

关键词： Fault tolerance Synchronization Replica determinism Multicore parallel computing Multi-core processors Fault tolerance parallel PROCESSING (COMPUTERS) Fault tolerant systems Legal Executions state of the art parallel programming active redundancy parallel execution Error detection and recovery

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 111 112 113 114 115 116 117 118 119 120 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：