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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,037 篇 会议
1,442 篇 期刊文献
130 册 图书
75 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

6,684 篇 parallel program...
1,068 篇 concurrent compu...
1,006 篇 parallel process...
572 篇 programming prof...
482 篇 application soft...
466 篇 computer science
466 篇 computer archite...
402 篇 hardware
340 篇 message passing
335 篇 distributed comp...
320 篇 libraries
316 篇 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,497 篇 英文
133 篇 其他
22 篇 中文
17 篇 俄文
7 篇 土耳其文
2 篇 德文
2 篇 朝鲜文
1 篇 西班牙文
1 篇 日文
1 篇 葡萄牙文

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

共 6684 条记录，以下是451-460 订阅

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

详细简洁

排序：

Influence of Reflected Light in Illumination-Light VN-CodeSK Based Positioning Systems 17

Influence of Reflected Light in Illumination-Light VN-CodeSK...

引用

17th International Symposium on Information Theory and its Applications (ISITA)

作者： Ochiai, Yuta Ogawa, Daisuke Kozawa, Yusuke Habuchi, Hiromasa Ibaraki Univ Coll Engn Grad Sch Sci & Engn Hitachi Ibaraki Japan Ibaraki Univ Fac Engn Hitachi Ibaraki Japan

ISBN: (纸本)9784885523410

This paper evaluates the effect of reflected light on position error performance when measuring position in the Visible Light Communication (VLC) using the Variable N-parallel Code Shift Keying (VN-CodeSK) system. In particular, the trilateration method and optical fingerprinting method are discussed as positioning systems. Performance results are obtained by computer simulation on a well-known indoor room model. Consequently, it is shown that the trilateration method degrades more sensitively to reflected light than the optical fingerprinting method. The optical fingerprinting method is found to improve accuracy in some cases due to reflected light. In this room model, it is found that the effect of reflected light becomes smaller when the distance from wall is greater than 4[cm].

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Optimization possibilities for the shortest-path algorithms in the context of large volumes of information 8

Optimization possibilities for the shortest-path algorithms ...

引用

8th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Popa, Bogdan Selisteanu, Dan Lorincz, Alexandra Elisabeta Robert, Tudosie Univ Craiova Dept Automat & Elect Craiova Romania

ISBN: (纸本)9781665496070

The purpose of this research article is to create an optimized purpose for the Dijkstra algorithm, with a superior degree of efficiency. This research proposes also, in the first instance, an innovative and efficient analysis of the Dijkstra's and Roy-Floyd algorithms. This proposed method is useful in various application cases, such as information grouping systems associated with a graph with a small but high node density. The analysis part explains the strategies chosen for today's parallel solutions and comparisons with the implemented method. It can be stated that the parallelization solution proposed in the article is specific to a configuration. There will be also presented other strategies considering the grouping systems for the tests with many nodes and edges. The algorithm for determining the shortest path is presented and tested at the multi-language level in different contexts and scenarios.

关键词： Java Computer languages Costs Smart cities parallel programming Information processing Time factors

来源：评论

学校读者我要写书评

暂无评论

A Tools Information Interface for OpenSHMEM 8th

A Tools Information Interface for OpenSHMEM

引用

8th Workshop on OpenSHMEM and Related Technologies (OpenSHMEM)

作者： Wasi-ur-Rahman, Md Ozog, David Holland, Kieran Intel Corp Austin TX 78746 USA Intel Corp Hudson MA USA

ISBN: (纸本)9783031048883;9783031048876

The Partitioned Global Address Space (PGAS) programming model, OpenSHMEM, is getting more traction as a useful method for parallel programming on future-generation platforms. However, very few works have explored on the enabling of external tools to analyze and control performance behavior of OpenSHMEM runtimes. While the OpenSHMEM standard recently introduced the profiling interface allowing tools to collect and monitor performance, it still does not define a mechanism through which an implementation can expose its internal performance knobs and metrics to the end users. To write OpenSHMEM programs that perform efficiently in a uniform manner across different platforms, it is necessary to understand and control these internal performance metrics. Early work reveals that OpenSHMEM performance variables can provide insights that are crucial to performance debugging, analysis, and optimization. In this paper, we propose a generic tools information interface with flexible and portable variable representation and a set of APIs that provide users the capability to analyze and control the performance behavior. The goal of this paper is to establish the usefulness and feasibility of such an API that users can leverage to better understand the internal details of the runtime.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Towards an Overhead Estimation Model for Multithreaded parallel Programs 17

Towards an Overhead Estimation Model for Multithreaded Paral...

引用

17th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)

作者： Niculescu, Virginia Serban, Camelia Vescan, Andreea Babes Bolyai Univ Fac Math & Comp Sci Comp Sci Dept Cluj Napoca Romania

ISBN: (纸本)9789897585685

The main purpose of using parallel computation is to reduce the execution time. To reach this goal, reducing the overhead time induced by the additional operations that parallelism implicitly imposes, becomes a necessity. In this respect, the paper proposes a new model that evaluates the overhead introduced into parallel multithreaded programs that follows SPMD (Single Program Multiple Data) model. The model is based on a metric that is evaluated using the source code analysis. Java programs were considered for this proposal, but the metric could be easily adapted for any multithreading supporting imperative language. The metric is defined as a combination of several atomic metrics considering various synchronisation mechanisms. A theoretical validation of this metric is presented, together with an empirical evaluation of several use cases. Additionally, we propose an AI based strategy to refine the evaluation of the metric by obtaining accurate approximation for the weights that are used in combining the considered atomic metrics.

关键词： parallel programming Metrics Overhead Multithreading Synchronization Estimation Validation

来源：评论

学校读者我要写书评

暂无评论

UniQ: A Unified programming Model for Efficient Quantum Circuit Simulation

UniQ: A Unified Programming Model for Efficient Quantum Circ...

引用

International Conference for High Performance Computing, Networking, Storage and Analysis (HPC)

作者： Zhang, Chen Wang, Haojie Ma, Zixuan Xie, Lei Song, Zeyu Zhai, Jidong Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9781665454445

Quantum circuit simulation is critical for verifying quantum computers. Given exponential complexity in the simulation, existing simulators use different architectures to accelerate the simulation. However, due to the variety of both simulation methods and modern architectures, it is challenging to design a high-performance yet portable simulator. In this work, we propose UniQ, a unified programming model for multiple simulation methods on various hardware architectures. We provide a unified application abstraction to describe different applications, and a unified hierarchical hardware abstraction upon different hardware. Based on these abstractions, UniQ can perform various circuit transformations without being aware of either concrete application or architecture detail, and generate high-performance execution schedules on different platforms without much human effort. Evaluations on CPU, GPU, and Sunway platforms show that UniQ can accelerate quantum circuit simulation by up to 28.59x (4.47x on average) over state-of-the-art frameworks, and successfully scale to 399,360 cores on 1,024 nodes.

关键词： Quantum Simulation parallel programming

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis and Modelling of Concurrent Multi-access Data Structures 22

Performance Analysis and Modelling of Concurrent Multi-acces...

引用

34th ACM Symposium on parallelism in Algorithms and Architectures (SPAA)

作者： Rukundo, Adones Atalar, Aras Tsigas, Philippas Chalmers Univ Technol Gothenburg Sweden

ISBN: (纸本)9781450391467

The major impediment to scaling concurrent data structures is memory contention when accessing shared data structure access-points, leading to thread serialisation, hindering parallelism. Aiming to address this challenge, significant amount of work in the literature has proposed multi-access techniques that improve concurrent data structure parallelism. However, there is little work on analysing and modelling the execution behaviour of concurrent multi-access data structures especially in a shared memory setting. In this paper, we analyse and model the general execution behaviour of concurrent multi-access data structures in the shared memory setting. We study and analyse the behaviour of the two popular random access patterns: shared (Remote) and exclusive (Local) access, and the behaviour of the two most commonly used atomic primitives for designing lock-free data structures: Compare and Swap, and, Fetch and Add. We model the concurrent multi-accesses by splitting the thread execution procedure into five logical sessions: i) side-work, ii) access-point search iii) access-point acquisition, iv) access-point data acquisition and v) access-point data operation. We model the acquisition of an access-point, as a system of closed queuing networks with parallel servers, and data acquisition in terms of where the data is located within the memory system. We evaluate our model on a set of concurrent data structure designs including a counter, a stack and a FIFO queue. The evaluation is carried out on two state of the art multi-core processors: Intel Xeon Phi CPU 7290 with 72 physical cores and Intel Xeon E5-2695 with 14 physical cores. Our model is able to predict the throughput performance of the given concurrent data structures with 80% to 100% accuracy on both architectures.

关键词： concurrency data structures locality multi-access semantic relaxation performance modelling parallel programming lock-free parallelism cache multi-core queuing theorem

来源：评论

学校读者我要写书评

暂无评论

Conquering Noise With Hardware Counters on HPC Systems 4

Conquering Noise With Hardware Counters on HPC Systems

引用

IEEE/ACM Workshop on programming and Performance Visualization Tools (ProTools)

作者： Ritter, Marcus Tarraf, Ahmad Geiss, Alexander Daoud, Nour Mohr, Bernd Wolf, Felix Tech Univ Darmstadt Dept Comp Sci Darmstadt Germany Forschungszentrum Julich Julich Supercomp Ctr Julich Germany

ISBN: (纸本)9781665475648

With increasing system performance and complexity, it is becoming increasingly crucial to examine the scaling behavior of an application and thus determine performance bottlenecks at early stages. Unfortunately, modeling this trend is a challenging task in the presence of noise, as the measurements can become irreproducible and misleading, thus resulting in strong deviations from the actual behavior. While noise impacts the application runtime, it has little to no effect on some hardware counters like floating-point operations. However, selecting the appropriate counters for performance modeling demands some investigation. In this paper, we perform a noise analysis on various hardware counters. Using our noise generator, we add additional noise on top of the system noise to inspect the counters' variability. We perform the analysis on five systems with three applications in the presence of various noise patterns and categorize the counters across the systems according to their noise resilience.

关键词： Hardware counters performance analysis noise high-performance computing parallel programming

来源：评论

学校读者我要写书评

暂无评论

MiniKokkos: A Calculus of Portable parallelism 6

MiniKokkos: A Calculus of Portable Parallelism

引用

IEEE/ACM 6th International Workshop on Software Correctness for HPC Applications (Correctness)

作者： Jin, Feiyang Jacobson, John, III Pollard, Samuel D. Sarkar, Vivek Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Utah Sch Comp Salt Lake City UT USA Sandia Natl Labs Livermore CA USA

ISBN: (纸本)9781665463355

Kokkos is a C++ library and ecosystem for writing parallel programs on heterogeneous systems. One of the primary goals of Kokkos is portability: programs in Kokkos are expressed through general parallel constructs which can enable the same code to compile and execute on different parallel architectures. However, there is no known formal model of Kokkos's semantics, which must be generic enough to support current and future CPU and accelerator architectures. As a first step of formalizing Kokkos, We introduce MiniKokkos: a small language capturing the main features of Kokkos, and then prove that MiniKokkos ensures portability across all possible parallel executions. We also provide a case study of how MiniKokkos can help reason about Kokkos programs and help find a bug in the Kokkos implementation.

关键词： parallel programming semantics programming languages

来源：评论

学校读者我要写书评

暂无评论

Locality-Based Optimizations in the Chapel Compiler 34th

Locality-Based Optimizations in the Chapel Compiler

引用

34th International Workshop on Languages and Compilers for parallel Computing (LCPC)

作者： Kayraklioglu, Engin Ronaghan, Elliot Ferguson, Michael P. Chamberlain, Bradford L. Hewlett Packard Enterprise Seattle WA 98121 USA

ISBN: (纸本)9783030993726;9783030993719

One of the main challenges of distributed memory programming is achieving efficient access to data. Low-level programming paradigms such as MPI and SHMEM require programmers to explicitly move data between compute nodes, which typically results in good execution performance at the expense of programmer productivity. High-level paradigms such as the Chapel programming language aim to reduce programming difficulty by supporting a global memory view. However, implicit communication afforded by the global memory view can make it easier for the programmers to overlook performance considerations. In this paper, we show that Chapel's high-level abstractions such as data-parallel loops and distributed arrays that enable easier programming can also enable powerful compiler analyses and optimizations, which can mitigate these overheads. We demonstrate two compiler optimizations added to the Chapel compiler in versions 1.23 and 1.24. These optimizations rely on the use of data-parallel loops and distributed arrays to strength-reduce accesses to global memory and aggregate remote accesses. We test these optimizations with STREAM-Triad and index gather benchmarks and show that they result in around 2x performance improvements on a Cray XC supercomputer. Furthermore, we analyze two real-world applications, chplUltra and Arkouda, that use manual remedies to address the overheads addressed by these optimizations. We observe that more than half of the places in the source code where these remedies are applied can benefit from optimizations without any programmer effort.

关键词： parallel programming Compiler optimizations Productivity

来源：评论

学校读者我要写书评

暂无评论

parallelizing Git Checkout: a Case Study of I/O parallelism 34

Parallelizing Git Checkout: a Case Study of I/O Parallelism

引用

34th IEEE International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Bernardino, Matheus Tavares Goldman, Alfredo Univ Sao Paulo Inst Math & Stat Sao Paulo Brazil

ISBN: (数字)9781665451550

ISBN: (纸本)9781665451550

Version control systems (VCS) are tools used to track and manage the changes made to a set of files over time. Among the VCS tools available today, Git has become the most popular for software development. Being used in small personal projects of a few megabytes and massive corporate repositories with more than 300 GB and 3.5 million files, speed and scalability are among the top priorities for the tool. However, its performance sometimes falls short of what is desired on networked file systems (e.g. NFS), where input and output (I/O) operations tend to be more costly. In particular, that is the case for the checkout command, which is responsible for restoring files from specific versions of a project. Despite the optimizations implemented over the years, the sequential processing of files still carried a large time penalty for NFS, as well as being suboptimal for local file systems on SSDs. In this project, we worked to parallelize the Git checkout machinery, resulting in speedups of up to 4.5x on NFS and 3.6x on SSDs. We also studied how parallelism affects the I/O requests performed by checkout on different storage systems. The optimization was submitted upstream and made available to all Git users starting at version 2.32.0, from June 2021.

关键词： parallel programming git version control systems Network File System parallel I/O

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：