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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

22 篇 期刊文献
20 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

39 篇 工学
- 32 篇 计算机科学与技术...
- 15 篇 软件工程
- 9 篇 电气工程
- 2 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 网络空间安全
2 篇 理学
- 1 篇 数学
- 1 篇 天文学

主题

43 篇 parallel program...
4 篇 granularity cont...
3 篇 parallel archite...
3 篇 software tools
3 篇 multiprocessors
3 篇 gpu
3 篇 work stealing
2 篇 parallel algorit...
2 篇 performance
2 篇 compilers
2 篇 parallel process...
2 篇 runtime system
2 篇 numerical algori...
2 篇 efficient portab...
2 篇 determinism
2 篇 parallel program...
2 篇 heterogeneous co...
2 篇 just-in-time com...
2 篇 object-oriented ...
2 篇 high performance...

机构

5 篇 carnegie mellon ...
2 篇 kyoto univ kyoto
2 篇 kyushu inst tech...
2 篇 lewis & clark co...
2 篇 inria bordeaux
2 篇 univ fed ceara f...
2 篇 knox college gal...
1 篇 inria
1 篇 bogazici univ de...
1 篇 cnrs univ versai...
1 篇 codeplay softwar...
1 篇 kyoto tachibana ...
1 篇 digital equipmen...
1 篇 japanese french ...
1 篇 queens univ king...
1 篇 indiana univ blo...
1 篇 ad sol nissin co...
1 篇 institute for sy...
1 篇 iit il 60616 usa
1 篇 1. swedish insti...

作者

4 篇 rainey mike
4 篇 acar umut a.
3 篇 yasugi masahiro
3 篇 hiraishi tasuku
2 篇 pinho eduardo gu...
2 篇 umatani seiji
2 篇 chargueraud arth...
2 篇 goli mehdi
2 篇 de carvalho juni...
2 篇 michael graf
2 篇 yoritaka hiroshi
2 篇 sommer lukas
2 篇 jens mache
1 篇 codognet p.
1 篇 miriam robinson
1 篇 matsuoka s.
1 篇 clark kl
1 篇 ledovskikh i
1 篇 cardenas-rodrigu...
1 篇 andrei papancea

语言

42 篇 英文
1 篇 其他

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

共 43 条记录，以下是21-30 订阅

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

详细简洁

排序：

Towards Exascale with the ANR-JST Japanese-French Project FP3C

Towards Exascale with the ANR-JST Japanese-French Project FP...

引用

9th International Conference on Computer Science and Information Technologies (CSIT)

作者： Antoniu, G. Boku, T. Buttari, A. Calvin, C. Codognet, P. Dayde, M. Emad, N. Ishikawa, Y. Joslin, G. Matsuoka, S. Nakajima, K. Nakashima, H. Namyst, R. Petiton, S. Sakurai, T. Sato, M. INRIA Rennes Rennes France CEA Saclay CEA DEN DANS DM2S Saclay France INRIA Bordeaux France CNRS Univ Toulouse INPT IRIT F-31042 Toulouse France Japanese French Lab Informat F-31042 Toulouse France CNRS Univ Versailles PRISM Versailles France Tokyo Inst Technol Tokyo Japan Kyoto Univ Kyoto 6068501 Japan Univ Tokyo Tokyo 1138654 Japan Univ Tsukuba Tsukuba Ibaraki 305 Japan

ISBN: (纸本)9781479924608

The Japanese-french FP3C (Framework and programming for Post-Petascale Computing) Project ANR/JST-2010- JTIC-003 aims at studying the software technologies, languages and programming models on the road to exascale computing. The ability to efficiency exploit these future systems is challenging because of their ultra large-scale and highly hierarchical architecture with computational nodes including many-core processors and accelerators. We give an overview of some of the main issues explored within the project.

关键词： Exascale computing many-core processors GPU parallel programming languages numerical algorithms runtime system

来源：评论

学校读者我要写书评

暂无评论

Extending aWork-Stealing Framework with Probabilistic Guards 45

Extending aWork-Stealing Framework with Probabilistic Guards

引用

45th International Conference on parallel Processing (ICPP)

作者： Yoritaka, Hiroshi Matsui, Ken Yasugi, Masahiro Hiraishi, Tasuku Umatani, Seiji Kyushu Inst Technol Fukuoka Japan Kyoto Univ Kyoto Japan Nintendo Co Ltd Kyoto Kyoto Japan

ISBN: (纸本)9781509028252

We propose probabilistic guards and analyze their performance. To reduce the total task division cost, probabilistic guards can prevent thief workers from stealing small tasks from victim workers probabilistically. In this study, we have implemented probabilistic guards on a work-stealing framework called Tascell and have confirmed that they perform well. In theory, a thief may repeat an unbounded number of probabilistically prevented steal attempts until success if a victim uses a probabilistic guard that rejects steal attempts with a non-zero probability. Therefore, in this paper, we also propose a mechanism that invalidates probabilistic guards on demand by setting an upper limit to the number of repeated probabilistically prevented steal attempts. We evaluate its potential effects on probabilistic guards by measuring the actual numbers of repeated attempts until success. We also evaluate the performance of probabilistic guards with various upper limits. Finally, we propose and evaluate virtual probabilistic guards that act as probabilistic guards without repeating probabilistically prevented steal attempts and they exhibit superior performance.

关键词： parallel programming languages work stealing probability concurrency many-core Barnes-Hut algorithm

来源：评论

学校读者我要写书评

暂无评论

Extending a Work-Stealing Framework with Priorities and Weights 9

Extending a Work-Stealing Framework with Priorities and Weig...

引用

9th IEEE/ACM Workshop on Irregular Applications - Architectures and Algorithms (IA3)

作者： Nakashima, Ryusuke Yoritaka, Hiroshi Yasugi, Masahiro Hiraishi, Tasuku Umatani, Seiji Kyushu Inst Technol Fukuoka Japan Kyoto Univ Kyoto Japan Kanagawa Univ Yokohama Kanagawa Japan Ad Sol Nissin Corp Tokyo Japan

ISBN: (纸本)9781728159874

This paper proposes priority- and weight-based steal strategies for an idle worker (thief) to select a victim worker in work-stealing frameworks. Typical work-stealing frameworks employ uniformly random victim selection. We implemented the proposed strategies on a work-stealing framework called Tascell;Tascell programmers can let each worker estimate and declare, as a real number, the amount of remaining work required to complete its current task so that declared values are used as priorities or weights in the enhanced Tascell framework. To reduce the total task-division cost, the proposed strategies avoid stealing small tasks. With a priority-based strategy, a thief selects the victim that has the highest known priority at that point in time. With a weight-based non-uniformly random strategy, a thief uses the relative weights of victim candidates as their selection probabilities. The proposed selection strategies outperformed uniformly random victim selection. Our evaluation uses a parallel implementation of the "highly serial" version of the Barnes-Hut force-calculation algorithm in a shared memory environment and five benchmark programs in a distributed memory environment.

关键词： parallel programming languages work stealing priority weight concurrency many-core Barnes-Hut algorithm

来源：评论

学校读者我要写书评

暂无评论

Enabling Fast and Highly Effective FPGA Design Process Using the CAPI SNAP Framework 34th

Enabling Fast and Highly Effective FPGA Design Process Using...

引用

34th International Conference on High Performance Computing (ISC High Performance)

作者： Castellane, Alexandre Mesnet, Bruno OpenCAPI & CAPI Snap Enablement IBM France 1 Rue Vieille Poste F-34006 Montpellier France

ISBN: (纸本)9783030343569;9783030343552

The CAPI SNAP (Storage, Network, and Analytics programming) is an open source framework which enables C/C++ as well as FPGA programmers to quickly create FPGA-based accelerated computing that works on server host data, as well as data from storage, flash, Ethernet, or other connected resources. The SNAP framework is based on the IBM Coherent Accelerator Processor Interface (CAPI). From POWER8 with CAPI1.0, to POWER9 with CAPI2.0 and OpenCAPI, programmers can have access to a very simple framework to develop accelerated applications using high speed and very lowlatency interfaces to access an external FPGA. With SNAP, no specific hardware skill is required to port or develop an application and then accelerate it. Even more, a cloud environment is being offered as a cost effective, ready-to-use environment for a first-time right experience as well as a deeper development so that it can be achieved with very little investment.

关键词： Innovative hardware/software co-design Processor architecture Chip multiprocessors Custom and reconfigurable logic Solutions for parallel programming challenges parallel programming languages Libraries Models and notations Alternative and specialized parallel operating systems and runtime systems

来源：评论

学校读者我要写书评

暂无评论

An object-oriented parallel programming language for distributed-memory parallel computing platforms

An object-oriented parallel programming language for distrib...

引用

14th Brazilian Symposium on programming languages (SBLP)

作者： Pinho, Eduardo Gurgel de Carvalho Junior, Francisco Heron Univ Fed Ceara Fortaleza Ceara Brazil

In object-oriented programming (OOP) languages, the ability to encapsulate software concerns of the dominant decomposition in objects is the key to reaching high modularity and loss of complexity in large scale designs. However, distributed-memory parallelism tends to break modularity, encapsulation, and the functional independence of objects, since parallel computations cannot be encapsulated in individual objects, which reside in a single address space. For reconciling object-orientation and distributed-memory parallelism, this paper introduces OOPP (Object-Oriented parallel programming), a style of OOP where objects are distributed by default. As an extension of C++, a widespread language in HPC, the PObC++ language has been designed and prototyped, incorporating the ideas of OOPP. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Object-oriented programming languages parallel programming languages parallel programming techniques High performance computing

来源：评论

学校读者我要写书评

暂无评论

Portable Implementations of Work Stealing 24

Portable Implementations of Work Stealing

引用

7th International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia)

作者： Yasugi, Masahiro Hiraishi, Tasuku Takeuchi, Chihiro Kyushu Inst Technol Iizuka Fukuoka Japan Kyoto Tachibana Univ Kyoto Japan Japan Res Inst Ltd Tokyo Japan

ISBN: (纸本)9798400708893

Work stealing is a well-known technique for dynamic load balancing;however, manually writing work-stealing protocols is errorprone. We can use the Tascell parallel programming language for the correct and portable implementation of work stealing;the implementation combines polling and adequate mutual exclusion. In Tascell, we can express on-demand concurrency for backtracking-based load balancing where a worker performs a sequential computation with its own execution stack unless it is requested to spawn a task. To spawn a larger task by temporarily backtracking, nested functions can be used for legitimate execution stack access. As nested functions for extended C languages, we can use GCC's heavyweight implementation with runtime code generation or lightweight implementations by enhancing GCC;however, compiler-based implementations are poor in portability. In this study, we implement and evaluate more portable Tascell frameworks called "Tascell/SC" by using transformation-based portable implementations of nested functions. In addition, we propose Tascell-inspired portable frameworks only in C++ called "Tascell++" by using lambda expressions in C++11 for legitimate execution stack access.

关键词： work stealing dynamic load balancing parallel programming languages

来源：评论

学校读者我要写书评

暂无评论

Analyzing parallel programming Models for Magnetic Resonance Imaging 1

引用

29th International Workshop on languages and Compilers for parallel Computing (LCPC)

作者： Danford, Forest Welch, Eric Cardenas-Rodriguez, Julio Strout, Michelle Mills Univ Arizona Dept Comp Sci Tucson AZ 85721 USA Univ Arizona Dept Med Imaging Tucson AZ USA

ISBN: (数字)9783319527093

ISBN: (纸本)9783319527093;9783319527086

The last several decades have been marked by dramatic increases in the use of diagnostic medical imaging and improvements in the modalities themselves. As such, more data is being generated at an ever increasing rate. However, in the case of Magnetic Resonance Imaging (MRI) analysis and reports remain semi-quantitative, despite reported advantages of quantitative analysis (QA), due to prohibitive execution times. We present a collaborator's QA algorithm for Dynamic Contrast-Enhanced (DCE) MRI data written in MATLAB as a case study for exploring parallel programming in MATLAB and Julia. parallelization resulted in a 7.66x speedup in MATLAB and a 72x speedup in Julia. To the best of our knowledge, this comparison of Julia's performance in a parallel, application-level program is novel. On the basis of these results and our experiences while programming in each language, our collaborator now prototypes in MATLAB and then ports to Julia when performance is critical.

关键词： MATLAB Julia parallel programming languages parallel applications Medical imaging Dynamic Contrast-Enhanced MRI

来源：评论

学校读者我要写书评

暂无评论

A cost model for asynchronous and structured message passing

A cost model for asynchronous and structured message passing

引用

5th International Euro-Par Conference

作者： Melin, E Raffin, B Rebeuf, X Virot, B Univ Orleans LIFO F-45067 Orleans 02 France

ISBN: (纸本)3540664432

We present a cost model that relies on an asynchronous and structured parallel execution model for message passing. We show that it is possible to define a complexity function for programs that yields a symbolic date for each communication event. By ordering these dates, an upper bound for the network load can be computed. In contrast to classical approaches this cost computation can handle asynchronism for message passing and communication/computation overlap.

关键词： cost model symbolic date parallel programming languages asynchronous execution structural clock

来源：评论

学校读者我要写书评

暂无评论

Provably and Practically Efficient Granularity Control 19

Provably and Practically Efficient Granularity Control

引用

24th ACM SIGPLAN Symposium on Principles and Practice of parallel programming (PPoPP)

作者： Acar, Umut A. Aksenov, Vitaly Chargueraud, Arthur Rainey, Mike Carnegie Mellon Univ Pittsburgh PA 15213 USA INRIA Paris France ITMO Univ St Petersburg Russia Univ Strasbourg ICube CNRS Strasbourg France Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781450362252

Over the past decade, many programming languages and systems for parallel-computing have been developed, e.g., Fork/Join and Habanero Java, parallel Haskell, parallel ML, and X10. Although these systems raise the level of abstraction for writing parallel codes, performance continues to require labor-intensive optimizations for coarsening the granularity of parallel executions. In this paper, we present provably and practically efficient techniques for controlling granularity within the run-time system of the language. Our starting point is "oracle-guided scheduling", a result from the functional-programming community that shows that granularity can be controlled by an "oracle" that can predict the execution time of parallel codes. We give an algorithm for implementing such an oracle and prove that it has the desired theoretical properties under the nested-parallel programming model. We implement the oracle in C++ by extending Cilk and evaluate its practical performance. The results show that our techniques can essentially eliminate hand tuning while closely matching the performance of hand tuned codes.

关键词： parallel programming languages granularity control

来源：评论

学校读者我要写书评

暂无评论

Task parallel Assembly Language for Uncompromising parallelism 2021

Task Parallel Assembly Language for Uncompromising Paralleli...

引用

42nd ACM SIGPLAN International Conference on programming Language Design and Implementation (PLDI)

作者： Rainey, Mike Newton, Ryan R. Hale, Kyle Hardavellas, Nikos Campanoni, Simone Dinda, Peter Acar, Umut A. Carnegie Mellon Univ Pittsburgh PA 15213 USA Facebook New York NY USA IIT Chicago IL 60616 USA Northwestern Univ Chicago IL 60611 USA

ISBN: (纸本)9781450383912

Achieving parallel performance and scalability involves making compromises between parallel and sequential computation. If not contained, the overheads of parallelism can easily outweigh its benefits, sometimes by orders of magnitude. Today, we expect programmers to implement this compromise by optimizing their code manually. This process is labor intensive, requires deep expertise, and reduces code quality. Recent work on heartbeat scheduling shows a promising approach that manifests the potentially vast amounts of available, latent parallelism, at a regular rate, based on even beats in time. The idea is to amortize the overheads of parallelism over the useful work performed between the beats. Heartbeat scheduling is promising in theory, but the reality is complicated: it has no known practical implementation. In this paper, we propose a practical approach to heartbeat scheduling that involves equipping the assembly language with a small set of primitives. These primitives leverage existing kernel and hardware support for interrupts to allow parallelism to remain latent, until a heartbeat, when it can be manifested with low cost. Our Task parallel Assembly Language (TPAL) is a compact, RISC-like assembly language. We specify TPAL through an abstract machine and implement the abstract machine as compiler transformations for C/C++ code and a specialized run-time system. We present an evaluation on both the Linux and the Nautilus kernels, considering a range of heartbeat interrupt mechanisms. The evaluation shows that TPAL can dramatically reduce the overheads of parallelism without compromising scalability.

关键词： parallel programming languages granularity control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：