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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

180 篇 期刊文献
106 篇 会议
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

223 篇 工学
- 197 篇 计算机科学与技术...
- 61 篇 软件工程
- 56 篇 电气工程
- 8 篇 信息与通信工程
- 3 篇 机械工程
- 3 篇 电子科学与技术（可...
- 3 篇 控制科学与工程
- 3 篇 环境科学与工程（可...
- 3 篇 生物工程
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
51 篇 管理学
- 26 篇 管理科学与工程(可...
- 21 篇 农林经济管理
- 11 篇 工商管理
38 篇 理学
- 31 篇 数学
- 5 篇 生物学
- 4 篇 物理学
- 4 篇 生态学
- 2 篇 地理学
- 1 篇 地球物理学
- 1 篇 地质学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
36 篇 经济学
- 31 篇 应用经济学
- 27 篇 理论经济学
4 篇 农学
- 3 篇 农业资源与环境
1 篇 哲学
- 1 篇 哲学
1 篇 教育学
- 1 篇 教育学
1 篇 军事学
1 篇 艺术学

主题

289 篇 programming mode...
19 篇 openmp
15 篇 performance
15 篇 dynamic modeling
15 篇 dynamic programm...
13 篇 mpi
13 篇 parallel program...
13 篇 runtime systems
12 篇 performance port...
11 篇 languages
11 篇 parallel computi...
11 篇 hpc
10 篇 modeling
9 篇 programming
9 篇 linear programmi...
9 篇 design
9 篇 heterogeneous co...
8 篇 algorithms
8 篇 determinism
8 篇 high-performance...

机构

6 篇 barcelona superc...
5 篇 stanford univ st...
4 篇 univ politecn ca...
4 篇 sandia natl labs...
3 篇 los alamos natl ...
3 篇 barcelona superc...
3 篇 virginia tech de...
2 篇 uk atom weap est...
2 篇 univ penn wharto...
2 篇 microsoft corp r...
2 篇 lawrence livermo...
2 篇 barcelona superc...
2 篇 oak ridge natl l...
2 篇 univ pisa pisa
2 篇 north carolina s...
2 篇 lawrence berkele...
2 篇 sandia natl labs...
2 篇 los alamos natl ...
2 篇 univ bristol dep...
2 篇 lawrence berkele...

作者

11 篇 badia rosa m.
9 篇 ayguade eduard
6 篇 labarta jesus
6 篇 martorell xavier
5 篇 mcintosh-smith s...
5 篇 jimenez-gonzalez...
5 篇 pakin scott
5 篇 quintana-orti en...
4 篇 balaji pavan
4 篇 yeom jae-seung
4 篇 kim jungwon
4 篇 mayo rafael
4 篇 vetter jeffrey s...
4 篇 nikolopoulos dim...
4 篇 lordan francesc
4 篇 teranishi keita
4 篇 ejarque jorge
3 篇 schneider scott
3 篇 lezzi daniele
3 篇 castello adrian

语言

279 篇 英文
10 篇 其他

检索条件"主题词=Programming models"

共 289 条记录，以下是211-220 订阅

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

详细简洁

排序：

Heterogeneous Task Scheduling for Accelerated OpenMP

Heterogeneous Task Scheduling for Accelerated OpenMP

引用

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

作者： Scogland, Thomas R. W. Rountree, Barry Feng, Wu-chun de Supinski, Bronis R. Virginia Tech Dept Comp Sci Blacksburg VA 24060 USA Lawrence Livermore Natl Lab Ctr Appl Sci Comp Livermore CA 94551 USA

ISBN: (纸本)9780769546759

Heterogeneous systems with CPUs and computational accelerators such as GPUs, FPGAs or the upcoming Intel MIC are becoming mainstream. In these systems, peak performance includes the performance of not just the CPUs but also all available accelerators. In spite of this fact, the majority of programming models for heterogeneous computing focus on only one of these. With the development of Accelerated OpenMP for GPUs, both from PGI and Cray, we have a clear path to extend traditional OpenMP applications incrementally to use GPUs. The extensions are geared toward switching from CPU parallelism to GPU parallelism. However they do not preserve the former while adding the latter. Thus computational potential is wasted since either the CPU cores or the GPU cores are left idle. Our goal is to create a runtime system that can intelligently divide an accelerated OpenMP region across all available resources automatically. This paper presents our proof-of-concept runtime system for dynamic task scheduling across CPUs and GPUs. Further, we motivate the addition of this system into the proposed OpenMP for Accelerators standard. Finally, we show that this option can produce as much as a two-fold performance improvement over using either the CPU or GPU alone.

关键词： GPGPU OpenMP programming models

来源：评论

学校读者我要写书评

暂无评论

Mapping Constraint Problems onto Quantum Gate and Annealing Devices 2

Mapping Constraint Problems onto Quantum Gate and Annealing ...

引用

2nd International Workshop on Quantum Computing Software (QCS)

作者： Wilson, Ellis Mueller, Frank Pakin, Scott North Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA Los Alamos Natl Lab Comp Computat & Stat Sci Div Los Alamos NM 87545 USA

ISBN: (纸本)9781728186740

This work presents NchooseK, a unified programming model for constraint satisfaction problems that can be mapped to both quantum circuit and annealing devices through Quadratic Unconstrained Binary Operators (QUBOs). Our mapping provides an approachable and effective way to program both types of quantum computers. We provide examples of NchooseK being used.

关键词： circuit-model quantum computing quantum annealing programming models

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multigrain Parallelization on the Cell Broadband Engine 07

Dynamic Multigrain Parallelization on the Cell Broadband Eng...

引用

ACM SIGPLAN Symposium on Principles and Practice of Parallel programming

作者： Blagojevic, Filip Nikolopoulos, Dimitrios S. Stamatakis, Alexandros Antonopoulos, Christos D. Virginia Tech Ctr High End Comp Syst Blacksburg VA 24061 USA

ISBN: (纸本)9781595936028

This paper addresses the problem of orchestrating and scheduling parallelism at multiple levels of granularity on heterogeneous multicore processors. We present mechanisms and policies for adaptive exploitation and scheduling of layered parallelism on the Cell Broadband Engine. Our policies combine event-driven task scheduling with malleable loop-level parallelism, which is exploited from the runtime system whenever task-level parallelism leaves idle cores. We present a scheduler for applications with layered parallelism on Cell and investigate its performance with RAxML, an application which infers large phylogenetic trees, using the Maximum Likelihood (ML) method. Our experiments show that the Cell benefits significantly from dynamic methods that selectively exploit the layers of parallelism in the system, in response to workload fluctuation. Our scheduler outperforms the MPI version of RAxML, scheduled by the Linux kernel, by up to a factor of 2.6. We are able to execute RAxML on one Cell four times faster than on a dual-processor system with Hyperthreaded Xeon processors, and 5-10% faster than on a single-processor system with a dual-core, quad-thread IBM Power5 processor.

关键词： IBM Cell programming models Process Scheduling RAxML

来源：评论

学校读者我要写书评

暂无评论

Toward a Comprehensive Benchmark Suite for Evaluating GASPI in HPC Environments

Toward a Comprehensive Benchmark Suite for Evaluating GASPI ...

引用

IEEE International Conference on Cluster Computing (Cluster)

作者： Neuwirth, Sarah Goethe Univ Frankfurt Inst Comp Sci Frankfurt Germany

ISBN: (纸本)9781728196664

With the forthcoming age of exascale computing, the efficient support of different programming models has become a crucial performance factor for high-performance computing systems. When adopting novel programming paradigms, the performance assessment through standardized and comparable benchmarks plays an essential role in both the effective use of the heterogeneous system hardware and the application performance tuning. Alternatives to MPI such as the partitioned global address space (PGAS) model have become increasingly popular. One such PGAS API is the Global Address Space programming Interface (GASPI). This paper introduces the GASPI Benchmark Suite (GBS), which combines a comprehensive, standardized set of microbenchmarks with application kernels. The microbenchmarks target common GASPI communication patterns, including one-sided, collective, passive, and global atomics, while the application kernels stress communication schemes commonly found in real HPC applications. The effectiveness of GBS is demonstrated by evaluating the GASPI communication performance for the two networking communication standards Ethernet and InfiniBand.

关键词： PGAS programming models Performance Characterization GASPI Benchmark Suite HPC

来源：评论

学校读者我要写书评

暂无评论

Worksharing Tasks: an Efficient Way to Exploit Irregular and Fine-Grained Loop Parallelism 26

Worksharing Tasks: an Efficient Way to Exploit Irregular and...

引用

26th International Conference on High Performance Computing, Data and Analytics (HiPCW)

作者： Maronas, Marcos Sala, Kevin Mateo, Sergi Ayguade, Eduard Beltran, Vicenc Barcelona Supercomp Ctr BSC Barcelona Spain Univ Politecn Catalunya UPC Barcelona Supercomp Ctr BSC Barcelona Spain

ISBN: (纸本)9781728145358

Shared memory programming models usually provide worksharing and task constructs. The former relies on the efficient fork-join execution model to exploit structured parallelism;while the latter relies on fine-grained synchronization among tasks and a flexible data-flow execution model to exploit dynamic, irregular, and nested parallelism. On applications that show both structured and unstructured parallelism, both worksharing and task constructs can be combined. However, it is difficult to mix both execution models without penalizing the data-flow execution model. Hence, on many applications structured parallelism is also exploited using tasks to leverage the full benefits of a pure data-flow execution model. However, task creation and management might introduce a non-negligible overhead that prevents the efficient exploitation of fine-grained structured parallelism, especially on many-core processors. In this work, we propose worksharing tasks. These are tasks that internally leverage worksharing techniques to exploit fine-grained structured loop-based parallelism. The evaluation shows promising results on several benchmarks and platforms.

关键词： fine grained loop parallelism programming models runtime systems

来源：评论

学校读者我要写书评

暂无评论

Automated rapid prototyping of regular grid-based numerical applications using generalized elemental subroutines

Automated rapid prototyping of regular grid-based numerical ...

引用

IEEE 27th International Parallel and Distributed Processing Symposium (IPDPS)

作者： Situ, Yingchong Wang, Ye Li, Zhiyuan Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)9780769549712

Computational scientists and engineers commonly rely on established software libraries to achieve high performance and reliability in their numerical applications. Unfortunately, this approach does not work well if the desired functionality is absent in existing libraries or if the integration is difficult. In such scenarios, one is often forced to explore alternative algorithms and in-house implementations. Such exploration can be a challenging task for computational scientists and engineers without sufficient computer science background. To address this issue, we design and build an automated rapid prototyping tool for regular grid-based numerical applications. This new tool allows programmers to specify algorithms as composition of familiar computation patterns such as those easily found in open literature expressed as generalized elemental subroutines. The tool then automatically transforms such subroutines into code which adapts to the prescribed data structures and delivers performance expected from the underlying algorithms. We demonstrate the tool in use cases including a production-grade computational fluid dynamic application.

关键词： compiler analysis and optimization program transformation programming models

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the Global Address Space programming Interface (GASPI) 28

Evaluation of the Global Address Space Programming Interface...

引用

28th IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)

作者： Breitbart, Jens Schmidtobreick, Mareike Heuveline, Vincent Tech Univ Munich Lehrstuhl Rechnertech & Rechnerorg Parallelrechne Munich Germany Heidelberg Univ Engn Math & Comp Lab Heidelberg Germany

ISBN: (纸本)9781479941162

The first exascale supercomputers are expected by the end of this decade and will presumably feature an increase in core count, but a decrease in the amount of memory available per core. As of now, it is still unclear if the current programming models will provide high performance on exascale systems. One programming model considered to be an alternative to MPI is the so-called partitioned global address space (PGAS) model. Within this paper we evaluate a relatively new PGAS API: the Global Address Space programming Interface (GASPI) and compare it to MPI on the basis of microbenchmarks. These benchmarks show that GASPI provides about the same level of performance for single-threaded communication, but is up to an order of magnitude faster than both Intel and IBM MPI for multi-threaded communication. Hereafter, we discuss the different features of GASPI in comparison to two main PGAS languages, namely UPC and CAF. In addition, we present a basic numerical algorithm, a dense matrix-matrix multiplication, as an example on how an implementation can make efficient use of GASPI's features, especially the asynchronous and one-sided communication mechanisms.

关键词： PGAS one-sided communication programming models GASPI

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Approximate Parametric Circuits for Variational Quantum Algorithms 5

Synthesis of Approximate Parametric Circuits for Variational...

引用

2024 International Conference on Quantum Computing and Engineering

作者： Burgstahler, Blake Wilson, Ellis Pakin, Scott Mueller, Frank North Carolina State Univ Raleigh NC 27695 USA Los Alamos Natl Lab Los Alamos NM USA

ISBN: (纸本)9798331541378

This work presents a novel approach to synthesize approximate circuits for the ansatze of variational quantum algorithms (VQA) and demonstrates its effectiveness in the context of solving integer linear programming (ILP) problems. Synthesis is generalized to produce parametric circuits in close approximation of the original circuit and to do so offline. This removes synthesis from the (online) critical path between repeated quantum circuit executions of VQA. We hypothesize that this approach will yield novel high fidelity results beyond those discovered by the baseline without synthesis. Simulation and real device experiments complement the baseline in finding correct results in many cases where the baseline fails to find any and do so with on average 32% fewer CNOTs in circuits.

关键词： circuit synthesis circuit-model quantum computing programming models QAOA VQA

来源：评论

学校读者我要写书评

暂无评论

Addressing Global Data Dependencies in Heterogeneous Asynchronous Runtime Systems on GPUs 3

Addressing Global Data Dependencies in Heterogeneous Asynchr...

引用

3rd IEEE International Workshop on Extreme Scale programming models and Middleware (ESPM2)

作者： Peterson, Brad Humphrey, Alan Schmidt, John Berzins, Martin Univ Utah Sci Comp & Imaging Inst Salt Lake City UT 84112 USA

ISBN: (纸本)9781450351331

Large-scale parallel applications with complex global data dependencies beyond those of reductions pose significant scalability challenges in an asynchronous runtime system. Internodal challenges include identifying the all-to-all communication of data dependencies among the nodes. Intranodal challenges include gathering together these data dependencies into usable data objects while avoiding data duplication. This paper addresses these challenges within the context of a large-scale, industrial coal boiler simulation using the Uintah asynchronous many-task runtime system on GPU architectures. We show significant reduction in time spent analyzing data dependencies through refinements in our dependency search algorithm. Multiple task graphs are used to eliminate subsequent analysis when task graphs change in predictable and repeatable ways. Using a combined data store and task scheduler redesign reduces data dependency duplication ensuring that problems fit within host and GPU memory. These modifications did not require any changes to application code or sweeping changes to the Uintah runtime system. We report results running on the DOE Titan system on 119K CPU cores and 7.5K GPUs simultaneously. Our solutions can be generalized to other task dependency problems with global dependencies among thousands of nodes which must be processed efficiently at large scale.

关键词： Data dependencies Asynchronous Many-Task programming models Runtime Systems Scalability GPU Uintah Coal Boiler Radiative Heat Transfer

来源：评论

学校读者我要写书评

暂无评论

DYNAMIC COUPLING, OPTIMIZING AND REGIONAL INTERDEPENDENCE

引用

JOURNAL OF FARM ECONOMICS 1964年第2期46卷 442-451页

作者： DAY, RH University of Wisconsin

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：