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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

29 篇 会议
7 篇 期刊文献
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

34 篇 工学
- 33 篇 计算机科学与技术...
- 14 篇 软件工程
- 9 篇 电气工程
- 2 篇 机械工程
- 2 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 网络空间安全
5 篇 理学
- 4 篇 数学
- 1 篇 物理学
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

37 篇 task-based progr...
4 篇 hpx
4 篇 multicore
4 篇 hpc
4 篇 openmp
3 篇 plasma
3 篇 xeon phi
3 篇 eigensolver
3 篇 scheduling
2 篇 parallelization
2 篇 runtime system
2 篇 dataflow
2 篇 cuda
2 篇 coordination lan...
2 篇 performance port...
2 篇 tile algorithms
2 篇 mapping
2 篇 exascale computi...
2 篇 parsec
2 篇 fpga

机构

2 篇 univ politecn ca...
2 篇 univ bayreuth de...
2 篇 tech univ chemni...
2 篇 oak ridge natl l...
2 篇 univ tennessee d...
1 篇 erasmus mc dept ...
1 篇 univ leeds inst ...
1 篇 univ durham inst...
1 篇 louisiana state ...
1 篇 univ neuchatel i...
1 篇 univ durham larg...
1 篇 inria le chesnay
1 篇 university of te...
1 篇 barcelona superc...
1 篇 inpt toulouse
1 篇 louisiana state ...
1 篇 slac natl accele...
1 篇 sandia natl labs...
1 篇 technical univer...
1 篇 univ bordeaux bo...

作者

3 篇 kaiser hartmut
3 篇 kurzak jakub
3 篇 dongarra jack
3 篇 haidar azzam
3 篇 rauber thomas
3 篇 ruenger gudula
3 篇 thibault samuel
3 篇 bosilca george
2 篇 schuchart joseph
2 篇 kalkhof torben
2 篇 calandra henri
2 篇 koch andreas
2 篇 guermouche abdou
2 篇 yarkhan asim
2 篇 luszczek piotr
2 篇 agullo emmanuel
2 篇 faverge mathieu
2 篇 herault thomas
2 篇 diehl patrick
2 篇 weinzierl tobias

语言

36 篇 英文
1 篇 其他

检索条件"主题词=Task-Based programming"

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

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

详细简洁

排序：

Elasticity in a task-based Dataflow Runtime Through Inter-node GPU Work Stealing 24

Elasticity in a Task-based Dataflow Runtime Through Inter-no...

引用

24th IEEE/ACM International Symposium on Cluster, Cloud, and Internet Computing (CCGrid)

作者： John, Joseph Milthorpe, Josh Natl Computat Infrastruct Canberra ACT Australia Australian Natl Univ Sch Comp Canberra ACT Australia Oak Ridge Natl Lab Oak Ridge TN USA

ISBN: (纸本)9798350395679;9798350395662

Most contemporary HPC programming models assume an inelastic runtime in which the resources allocated to an application remain fixed throughout its execution. Conversely, elastic runtimes can expand and shrink resources based on availability and/or dynamic application requirements. In this paper, we implement elasticity for PaRSEC, a task-based dataflow runtime, using inter-node GPU work stealing. In addition to supporting elasticity, we demonstrate that inter-node GPU work stealing can enhance the performance of imbalanced applications by up to 45%.

关键词： Distributed Work Stealing Elastic computing Malleable computing task-based programming Dataflow PaRSEC

来源：评论

学校读者我要写书评

暂无评论

Parallel and Distributed task-based Kirchhoff Seismic Pre-Stack Depth Migration Application 20

Parallel and Distributed Task-Based Kirchhoff Seismic Pre-St...

引用

20th International Symposium on Parallel and Distributed Computing (ISPDC)

作者： Gurhem, Jerome Calandra, Henri Petiton, Serge G. Univ Lille UMR 9189 CRIStAL CNRS Lille France CNRS USR 3441 Maison Simulat Saclay France Total SA Pau France

ISBN: (纸本)9781665432818

Since the middle of the 1990s, message passing libraries are the most used technology to implement parallel and distributed scientific applications. However, they may not be a solution efficient enough on exascale machines since scalability issues will appear due to the increase in computing resources. task-based programming models can be used to avoid collective communications like reductions, broadcast, or gather by transforming them into multiple operations on tasks. Then, these operations can be scheduled by the programming scheduler to place the data and computations in a way that optimizes and reduces the data communications. These properties could help to solve some MPI and exascale computing challenges. The oil and gas applications could also benefit from task-based programming properties. We developed a simplified version of the Kirchhoff seismic pre-stack depth migration, a subsurface exploration application, to experiment with HPX, a task-based programming model as well and MPI and MPI+OpenMP. Then, we perform strong scaling and weak scaling experiments on Pangea, Total supercomputer. We also study the variation of the number of OpenMP threads per MPI process. We show that the current task-based programming model schedulers lack the capability to completely manage the memory used and are not efficient enough to reduce the data migrations.

关键词： Kirchhoff Seismic Pre-Stack Depth Migration task-based programming Parallel and Distributed Application

来源：评论

学校读者我要写书评

暂无评论

An execution environment for flexible task-oriented software on multicore systems

An execution environment for flexible task-oriented software...

引用

International Conference on Complex Systems Design and Management (CSDM)

作者： Rauber, Thomas Ruenger, Gudula Univ Bayreuth Dept Comp Sci Bayreuth Germany Tech Univ Chemnitz Dept Comp Sci Chemnitz Germany

The article addresses the challenges of software development for current and future parallel computers, which are expected to be dominated by multicore and many-core architectures. Using these multicore processors for cluster systems will create systems with thousands of cores and deep memory hierarchies. To efficiently exploit the tremendous parallelism of these hardware platforms, a new generation of programming methodologies is needed. This article proposes a parallel programming methodology exploiting a task-based representation of application software. For the specification of task-based programs, a coordination language is presented, which uses external variables to express the cooperation between tasks. For the actual execution of a task-based program on a specific parallel architecture, different dynamic scheduling algorithms embedded into an execution environment are introduced. Runtime experiments for complex methods from a numerical analysis are performed on different parallel execution platforms.

关键词： task-based programming coordination language scheduling parallel execution mapping

来源：评论

学校读者我要写书评

暂无评论

From tasks graphs to asynchronous distributed checkpointing with local restart 10

From tasks graphs to asynchronous distributed checkpointing ...

引用

IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)

作者： Lion, Romain Thibault, Samuel Univ Bordeaux Inria Bordeaux Sud Ouest Bordeaux France

ISBN: (纸本)9780738110806

The ever-increasing number of computation units assembled in current HPC platforms leads to a concerning increase in fault probability. Traditional checkpoint/restart strategies avoid wasting large amounts of computation time when such fault occurs. With the increasing amount of data dealt with by current applications, these strategies however suffer from their data transfer demand becoming unreasonable, or the entailed global synchronizations. Meanwhile, the current trend towards task-based programming is an opportunity to revisit the principles of the checkpoint/restart strategies. We here propose a checkpointing scheme which is closely tied to the execution of task graphs. We describe how it allows for completely asynchronous and distributed checkpointing, as well as localized node restart, thus opening up for very large scalability. We also show how a synergy between the application data transfers and the checkpointing transfers can lead to a reasonable additional network load, measured to be lower than +10% on a dense linear algebra example.

关键词： Fault tolerance task-based programming checkpoint-restart buddy in-memory

来源：评论

学校读者我要写书评

暂无评论

Towards seismic wave modeling on heterogeneous many-core architectures using task-based runtime system 27

Towards seismic wave modeling on heterogeneous many-core arc...

引用

IEEE 27th International Symposium on Computer Architecture and High Performance Computing

作者： Martinez, Victor Michea, David Dupros, Fabrice Aumage, Olivier Thibault, Samuel Aochi, Hideo Navaux, Philippe O. A. Univ Fed Rio Grande do Sul Inst Informat Av Bento Gonsalves 9500Campus Vale Porto Alegre RS Brazil Bur Rech Geol & Minieres Orleans France Inria Bordeaux Sud Ouest Bordeaux France

ISBN: (纸本)9781467380119

Understanding three-dimensional seismic wave propagation in complex media is still one of the main challenges of quantitative seismology. Because of its simplicity and numerical efficiency, the finite-differences method is one of the standard techniques implemented to consider the elastodynamics equation. Additionally, this class of modeling heavily relies on parallel architectures in order to tackle large scale geometries including a detailed description of the physics. Last decade, significant efforts have been devoted towards efficient implementation of the finite-differences methods on emerging architectures. These contributions have demonstrated their efficiency leading to robust industrial applications. The growing representation of heterogeneous architectures combining general purpose multicore platforms and accelerators leads to re-design current parallel application. In this paper, we consider StarPU task-based runtime system in order to harness the power of heterogeneous CPU+GPU computing nodes. We detail our implementation and compare the performance obtained with the classical CPU or GPU only versions. Preliminary results demonstrate significant speedups in comparison with the best implementation suitable for homogeneous cores.

关键词： GPU Heterogeneous architectures Seismic wave simulation task-based programming

来源：评论

学校读者我要写书评

暂无评论

Optimizing Distributed Load Balancing for Workloads with Time-Varying Imbalance

Optimizing Distributed Load Balancing for Workloads with Tim...

引用

IEEE International Conference on Cluster Computing (Cluster)

作者： Lifflander, Jonathan Slattengren, Nicole Lemaster Pebay, Philippe P. Miller, Phil Rizzi, Francesco Bettencourt, Matthew T. Sandia Natl Labs Livermore CA 94550 USA NexGen Analyt Sheridan WY USA Intense Comp New York NY USA

ISBN: (纸本)9781728196664

This paper explores dynamic load balancing algorithms used by asynchronous many-task (AMT), or 'task-based', programming models to optimize task placement for scientific applications with dynamic workload imbalances. AMT programming models use overdecomposition of the computational domain. Overdecompostion provides a natural mechanism for domain developers to expose concurrency and break their computational domain into pieces that can be remapped to different hardware. This paper explores fully distributed load balancing strategies that have shown great promise for exascale-level computing but are challenging to theoretically reason about and implement effectively. We present a novel theoretical analysis of a gossip-based load balancing protocol and use it to build an efficient implementation with fast convergence rates and high load balancing quality. We demonstrate our algorithm in a next-generation plasma physics application (EMPIRE) that induces time-varying workload imbalance due to spatial non-uniformity in particle density across the domain. Our highly scalable, novel load balancing algorithm, achieves over a 3x speedup (particle work) compared to a bulk-synchronous MPI implementation without load balancing.

关键词： dynamic load balancing overdecomposition exascale computing asynchronous many-task (AMT) task-based programming distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Detrimental task Execution Patterns in Mainstream OpenMP® Runtimes 20th

Detrimental Task Execution Patterns in Mainstream OpenMP® R...

引用

20th International Workshop on OpenMP (IWOMP)

作者： Tuft, Adam S. Weinzierl, Tobias Klemm, Michael Univ Durham Dept Comp Sci Durham England Adv Micro Devices GmbH Dornach Munich Germany OpenMP Architecture Review Board Beaverton OR USA

ISBN: (纸本)9783031725661;9783031725678

The OpenMP (R) API offers both task-based and data-parallel concepts to scientific computing. While it provides descriptive and prescriptive annotations, it is in many places deliberately unspecific how to implement its annotations. As the predominant OpenMP implementations share design rationales, they introduce "quasi-standards" how certain annotations behave. By means of a task-based astrophysical simulation code, we highlight situations where this "quasi-standard" reference behaviour introduces performance flaws. Therefore, we propose prescriptive clauses to constrain the OpenMP implementations. Simulated task traces uncover the clauses' potential, while a discussion of their realization highlights that they would manifest in rather incremental changes to any OpenMP runtime supporting task priorities.

关键词： OpenMP Scheduling task-based programming

来源：评论

学校读者我要写书评

暂无评论

mCluster: A Software Framework for Portable Device-based Volunteer Computing 16

mCluster: A Software Framework for Portable Device-based Vol...

引用

16th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)

作者： Theodoropoulos, Dimitris Chrysos, Grigorios Koidis, Iosif Charitopoulos, George Pissadakis, Emmanouil Varikos, Antonis Pnevmatikatos, Dionisios Smaragdos, Georgios Strydis, Christos Zervos, Nikos Tech Univ Crete Chania Dept Elect & Comp Engn Microprocessor & Hardware Lab Khania Greece Erasmus MC Dept Neurosci Rotterdam Netherlands Algosystems SA Athens Greece

ISBN: (纸本)9781509024537

Recent market forecasts predict that the portable computing trend will vastly spread, as by 2020 there will be more than 3 billion LTE device users worldwide. Motivated by this fact, many companies and research institutes have already launched research projects that utilize portable devices, voluntarily provided by users, to perform the required computations. Many such projects employ Berkeley's BOINC middleware, since it can support a large variety of stationary and mobile devices. However, currently available BOINC high-level APIs, either do not support portable devices or lack advanced processing capabilities (such as inter-node task dependencies) and/or easiness of use. To resolve these issues, we propose the mCluster software framework for application execution powered by the BOINC middleware on portable devices. mCluster adopts a task-based programming model that requires simple, pragma-based annotations of the application software, in order to dynamically resolve task dependencies. To evaluate our framework, we have have mapped a scientific application from the neuroscience domain on an small-scaled network of portable devices. mCluster significantly reduces the required programming effort and complexity to efficiently map BOINC-powered applications with task dependencies on portable devices compared to previous approaches.

关键词： task-based programming internet of things volunteer computing

来源：评论

学校读者我要写书评

暂无评论

Runtime-Driven Shared Last-Level Cache Management for task-Parallel Programs 15

Runtime-Driven Shared Last-Level Cache Management for Task-P...

引用

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

作者： Pan, Abhisek Pai, Vijay S. Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

ISBN: (纸本)9781450337236

task-parallel programming models with input annotation-based concurrency extraction at runtime present a promising paradigm for programming multicore processors. Through management of dependencies, task assignments, and orchestration, these models markedly simplify the programming effort for parallelization while exposing higher levels of concurrency. In this paper we show that for multicores with a shared last-level cache (LLC), the concurrency extraction framework can be used to improve the shared LLC performance. based on the input annotations for future tasks, the runtime instructs the hardware to prioritize data blocks with future reuse while evicting blocks with no future reuse. These instructions allow the hardware to preserve all the blocks for at least some of the future tasks and evict dead blocks. This leads to a considerable improvement in cache efficiency over what is achieved by hardware-only replacement policies, which can replace blocks for all future tasks resulting in poor hit-rates for all future tasks. The proposed hardware-software technique leads to a mean improvement of 18% in application performance and a mean reduction of 26% in misses over a shared LLC managed by the Least Recently Used replacement policy for a set of input-annotated task-parallel programs using the OmpSs programming model implemented on the NANOS++ runtime. In contrast, the state-of-the-art thread-based partitioning scheme suffers an average performance loss of 2% and an average in crease of 15% in misses over the baseline.

关键词： Shared cache partitioning task-based programming Reuse distance Multicore

来源：评论

学校读者我要写书评

暂无评论

Particle-In-Cell Simulation Using Asynchronous tasking 27th

Particle-In-Cell Simulation Using Asynchronous Tasking

引用

27th International European Conference on Parallel and Distributed Computing (Euro-Par)

作者： Guidotti, Nicolas Ceyrat, Pedro Barreto, Joao Monteiro, Jose Rodrigues, Rodrigo Fonseca, Ricardo Martorell, Xavier Pena, Antonio J. Univ Lisbon Inst Super Tecn INESC ID Lisbon Portugal Univ Lisbon Inst Super Tecn IPFN Lisbon Portugal DCTI ISCTE IUL Lisbon Portugal Barcelona Supercomp Ctr BSC Barcelona Spain

ISBN: (纸本)9783030856656;9783030856649

Recently, task-based programming models have emerged as a prominent alternative among shared-memory parallel programming paradigms. Inherently asynchronous, these models provide native support for dynamic load balancing and incorporate data flow concepts to selectively synchronize the tasks. However, tasking models are yet to be widely adopted by the HPC community and their effective advantages when applied to non-trivial, real-world HPC applications are still not well comprehended. In this paper, we study the parallelization of a production electromagnetic particle-in-cell (EM-PIC) code for kinetic plasma simulations exploring different strategies using asynchronous task-based models. Our fully asynchronous implementation not only significantly outperforms a conventional, synchronous approach but also achieves near perfect scaling for 48 cores.

关键词： Manycore parallelism task-based programming Asynchronous parallelism Particle-in-cell Kinetic plasma simulations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：