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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

30 篇 会议
4 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

26 篇 工学
- 25 篇 软件工程
- 20 篇 计算机科学与技术...
- 3 篇 电子科学与技术（可...
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 环境科学与工程（可...
9 篇 理学
- 7 篇 数学
- 2 篇 生物学
- 1 篇 系统科学
4 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 工商管理
- 2 篇 图书情报与档案管...
1 篇 教育学
- 1 篇 教育学

主题

5 篇 parallel program...
2 篇 parallelism
2 篇 graphics process...
2 篇 stream processin...
2 篇 functional progr...
2 篇 codes (symbols)
2 篇 multicore progra...
1 篇 object oriented ...
1 篇 sequence scoring
1 篇 parallel standar...
1 篇 message passing
1 篇 programming theo...
1 篇 data parallelism
1 篇 computer archite...
1 篇 software enginee...
1 篇 signal processin...
1 篇 theorem proving ...
1 篇 isabelle
1 篇 computer communi...
1 篇 ypnos

机构

2 篇 university of he...
2 篇 university of ch...
1 篇 computer science...
1 篇 university of he...
1 篇 yale university ...
1 篇 microsoft resear...
1 篇 department of co...
1 篇 oxford e-researc...
1 篇 univ calabria di...
1 篇 prolingua ltd ed...
1 篇 mashhad
1 篇 imperial college...
1 篇 university of lü...
1 篇 alma mater studi...
1 篇 programming syst...
1 篇 anafocus seville
1 篇 department of co...
1 篇 new mexico state...
1 篇 univ amsterdam i...
1 篇 computer and aut...

作者

3 篇 scholz sven-bodo
3 篇 grelck clemens
2 篇 shafarenko alex
2 篇 chakravarty manu...
2 篇 reppy john
2 篇 penczek frank
2 篇 keller gabriele
1 篇 michaelson g.
1 篇 guo jing
1 篇 spoonhower danie...
1 篇 berthold j.
1 篇 xiao yingqi
1 篇 chakravarty manu...
1 篇 treggiari leo
1 篇 leshchinskiy rom...
1 篇 moradi morteza
1 篇 vieira rui
1 篇 peter földesy
1 篇 wenzel makarius
1 篇 matthews david c...

语言

35 篇 英文

检索条件"任意字段=Workshop on Declarative Aspects of Multicore Programming 2010"

共 35 条记录，以下是11-20 订阅

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

详细简洁

排序：

PASTHA - Parallelizing Stencil Calculations in Haskell

PASTHA - Parallelizing Stencil Calculations in Haskell

引用

workshop on declarative aspects of multicore programming 2010

作者： Lesniak, Michael Univ Kassel Res Grp Programming Languages Methodol Kassel Germany

ISBN: (纸本)9781605588599

Stencils are typical building blocks for many numerical scientific applications. Different parallelization methods exist, the choice of a method depends on the given stencil, parallel programming system etc. Implementing stencils in a library simplifies application programming, allows to experiment with different parallelization methods, and supports their automatic adaptation to a given stencil. This paper introduces PASTHA, a prototype for a Haskell library that allows to declaratively describe stencil-based problems and calculate them in parallel. The description is flexible enough to cover all 2D stencils we are aware of. Implementation is based on task queues and strict evaluation. We report on experiments with a Gauss-Seidel stencil, where we achieved speedups of up to 4 on six cores, and with global and local sequence scoring from the Haskell bioinformatics library bio. For local scoring, the running time was reduced by a factor of 55, which is partially due to PASTHA.

关键词： Haskell Sequence scoring Stencil

来源：评论

学校读者我要写书评

暂无评论

A Parallel ASP Instantiator Based on DLV

A Parallel ASP Instantiator Based on DLV

引用

workshop on declarative aspects of multicore programming 2010

作者： Perri, Simona Ricca, Francesco Sirianni, Marco Univ Calabria Dipartimento Matemat I-87030 Arcavacata Di Rende Italy

ISBN: (纸本)9781605588599

Answer Set programming (ASP) is a purely-declarative logic programming language allowing for disjunction and nonmonotonic negation. The evaluation of ASP programs is traditionally carried out in two steps. In the first step an input program 2 undergoes the so-called instantiation (or grounding) process, which produces a program P' semantically equivalent to 7, but not containing any variable;in turn, P' is evaluated by using a backtracking search algorithm in the second step. It is well-known that instantiation is important for the efficiency of the whole evaluation, might becomes a bottleneck in common situations, and is particularly crucial when huge input data has to be dealt with. In the last few years, several instantiators have been proposed but none of them is able to take advantage from the latest hardware offering SMP (Symmetric Multi Processing) also for entry-level systems and PCs. This paper presents a new parallel version of the instantiator of DLV which is able to exploit the processing power offered by multi-core/multi-processor SMP machines. In particular, the employed parallelization methods, load-balancing and granularity control heuristics, tailored for parallel ASP instantiation process are described. The results of an experimental analysis are also presented, which confirm that multi-core/multi-processor technology can be efficiently exploited for ASP instantiation.

关键词： Answer Set programming Instantiation Grounding Parallelism

来源：评论

学校读者我要写书评

暂无评论

Concurrent programming constructs in multi-engine prolog: Parallelism just for the cores (and not more!)

Concurrent programming constructs in multi-engine prolog: Pa...

引用

6th workshop on declarative aspects of multicore programming, DAMP 2011

作者： Tarau, Paul Department of Computer Science and Engineering University of North Texas United States

ISBN: (纸本)9781450304863

We discuss the impact of the separation of logic engines (independent logic processing units) and multi-threading on the design of parallel programming constructs aware of the fundamental invariant of today's typical computer architectures: the presence of a few independent cores. We advocate a combination of coroutining constructs with focus on expressiveness and a simplified, multithreading API that ensures optimal use of a desired number of cores. In this context, native multi-threading is made available to the application programmer as a set of high-level primitives with a declarative flavor. © 2011 ACM.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Efficient Parallel programming in Poly/ML and Isabelle/ML

Efficient Parallel Programming in Poly/ML and Isabelle/ML

引用

workshop on declarative aspects of multicore programming 2010

作者： Matthews, David C. J. Wenzel, Makarius Prolingua Ltd Edinburgh EH4 3BB Midlothian Scotland

ISBN: (纸本)9781605588599

The ML family of languages and LCF-style interactive theorem proving have been closely related from their beginnings about 30 years ago. Here we report on a recent project to adapt both the Poly/ML compiler and the Isabelle theorem prover to current multicore hardware. Checking theories and proofs in typical Isabelle application takes minutes or hours, and users expect to make efficient use of "home machines" with 2-8 cores, or more. Poly/ML and Isabelle are big and complex software systems that have evolved over more than two decades. Faced with the requirement to deliver a stable and efficient parallel programming environment, many infrastructure layers had to be reworked: from low-level system threads to high-level principles of value-oriented programming. At each stage we carefully selected from the many existing concepts for parallelism, and integrated them in a way that fits smoothly into the idea of purely functional ML with the addition of synchronous exceptions and asynchronous interrupts. From the Isabelle/ML perspective, the main concept to manage parallel evaluation is that of "future values". Scheduling is implicit, but it is also possible to specify dependencies and priorities. In addition, block-structured groups of futures with propagation of exceptions allow for alternative functional evaluation (such as parallel search), without requiring user code to tackle concurrency. Our library also provides the usual parallel combinators for functions on lists, and analogous versions on prover tactics. Despite substantial reorganization in the background, only minimal changes are occasionally required in user ML code, and none at the Isabelle application level (where parallel theory and proof processing is fully implicit). The present implementation is able to address more than 8 cores effectively, while the earlier version of the official Isabelle2009 release works best for 2-4 cores. Scalability beyond 16 cores still poses some extra challenges, and will re

关键词： Parallel Standard ML data parallelism Poly/ML Isabelle theorem proving applications

来源：评论

学校读者我要写书评

暂无评论

Computing with streams

Computing with streams

引用

6th workshop on declarative aspects of multicore programming, DAMP 2011

作者： Aguado, Joaquín Mendler, Michael Faculty of Information Systems and Applied Computer Sciences University of Bamberg Germany

ISBN: (纸本)9781450304863

In functional programming, the general technique for supporting stream-based computations is by means of (higher-order) functions external to the underline stream's structure. The proposal of this paper is orthogonal to this view and it is based on an alternative representation of streams that allows employing different functions as stream's constructors (re-constructors). The internal computation prescribed by a stream is realised by constructing the stream with its own re-constructors. This provides us with a computationally more active and self-contained stream's notion that allows: (1) deriving new re-constructors by combining other re-constructors, (2) specifying dataflow computations directly inside streams and, dually, (3) defining re-constructors out of dataflow combinators. Moreover, this modelling supports to some degree parallel (sequential) evaluations of unbounded (recursive) structures in the style of Evaluation Strategies. All these possibilities are achieved thanks to a comonadic development able to capture co-inductive streams, parallelism (sequentiality) and causality aspects directly. © 2011 ACM.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Implementing deterministic declarative concurrency using sieves

Implementing deterministic declarative concurrency using sie...

引用

DAMP 2007: workshop on declarative aspects of multicore programming

作者： Lindley, Sam University of Edinburgh United Kingdom

ISBN: (纸本)1595936904

The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a simple way of adding deterministic declarative concurrency to imperative programming languages. Sieve programs have a straightforward semantics, are not significantly more difficult to reason about than sequential imperative programs, and should scale to large numbers of processors as well as different processor architectures. Copyright 2007 ACM.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

declarative aspects of memory management in the concurrent collections parallel programming model

Declarative aspects of memory management in the concurrent c...

引用

4th ACM SIGPLAN workshop on declarative aspects of multicore programming, DAMP'09

作者： Budimlic, Zoran Chandramowlishwaran, Aparna Knobe, Kathleen Lowney, Geoff Sarkar, Vivek Treggiari, Leo Rice University United States Georgia Institute of Technology United States Intel Corporation

ISBN: (纸本)9781605584171

Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level computations called steps that communicate via single-assignment data structures called items. A CnC program is specified in two levels. At the bottom level, an existing imperative language implements the computations within the individual computation steps. At the top level, CnC describes the relationships (ordering constraints) among the steps. The memory management mechanism of the existing imperative language manages data whose lifetime is within a computation step. A key limitation in the use of CnC for long-running programs is the lack of memory management and garbage collection for data items with lifetimes that are longer than a single computation *** the goal here is the same as that of classical garbage collection, the nature of problem and therefore nature of the solution is distinct. The focus of this paper is the memory management problem for these data items in CnC. We introduce a new declarative slicing annotation for CnC that can be transformed into a reference counting procedure for memory management. Preliminary experimental results obtained from a Cholesky example show that our memory management approach can result in space reductions for CnC data items of up to 28 relative to the baseline case of standard CnC without memory management. © 2009 ACM.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Accelerating Haskell array codes with multicore GPUs

Accelerating Haskell array codes with multicore GPUs

引用

6th workshop on declarative aspects of multicore programming, DAMP 2011

作者： Chakravarty, Manuel M.T. Keller, Gabriele Lee, Sean McDonell, Trevor L. Grover, Vinod University of New South Wales Australia NVIDIA Corporation United States

ISBN: (纸本)9781450304863

Current GPUs are massively parallel multicore processors optimised for workloads with a large degree of SIMD parallelism. Good performance requires highly idiomatic programs, whose development is work intensive and requires expert knowledge. To raise the level of abstraction, we propose a domain-specific high-level language of array computations that captures appropriate idioms in the form of collective array operations. We embed this purely functional array language in Haskell with an online code generator for NVIDIA's CUDA GPGPU programming environment. We regard the embedded language's collective array operations as algorithmic skeletons;our code generator instantiates CUDA implementations of those skeletons to execute embedded array programs. This paper outlines our embedding in Haskell, details the design and implementation of the dynamic code generator, and reports on initial benchmark results. These results suggest that we can compete with moderately optimised native CUDA code, while enabling much simpler source programs. © 2011 ACM.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Compilers must speak properties, not just code: CAL: Constraint aggregation language for declarative component-coordination

Compilers must speak properties, not just code: CAL: Constra...

引用

7th workshop on declarative aspects and Applications of multicore programming, DAMP'12, Co-located with POPL 2012

作者： Kirner, Raimund Penczek, Frank Shafarenko, Alex University of Hertfordshire United Kingdom

ISBN: (纸本)9781450311175

This is a work-in-progress presentation in which we will argue that approaches based on components coordinated declaratively, such as S-Net, are ideally placed for automatic multicore optimisation. We will present our case for a component compiler producing not only object code, but also symbolic constraints describing the functional, and more importantly extra-functional, properties of the source component, such as computational complexity, resource and configuration requirements. We also argue that if the coordination language is well structured, which is easily achievable when it is declarative, it is possible to aggregate the constraints yielded by the components stage-wise and to represent the multicore optimisation problem in standard CSP form to use general-purpose constraint solvers. The use of symbolic constraints to describe system behaviour is shown by some examples of S-Net network combinators. If successful our approach will achieve an unprecedented degree of flexibility in programming for a wide range of heterogeneous multi-/many-core architectures. We would like to initiate a discussion on the interplay of constraint solving and declarative coordination programming. Copyright © 2012 ACM.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

SAC: Off-the-shelf support for data-parallelism on multicores

SAC: Off-the-shelf support for data-parallelism on multicore...

引用

DAMP 2007: workshop on declarative aspects of multicore programming

作者： Grelck, Clemens Scholz, Sven-Bodo University of Lübeck Institute of Software Technology and Programming Languages Ratzeburger Allee 160 23538 Lübeck Germany University of Hertfordshire Department of Computer Science College Lane Hatfield AL10 9AB United Kingdom University of Hertfordshire United Kingdom

ISBN: (纸本)1595936904

The advent of multicore processors has raised new demand for harnessing concurrency in the software mass market. We summarise our previous work on the data parallel, functional array processing language SaC. Its compiler technology is geared towards highly runtime-efficient support for shared memory multiprocessors and, thus, is readily applicable to today's off-the-shelf multicore systems. Copyright 2007 ACM.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：