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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

18 篇 会议
12 篇 期刊文献
4 册 图书
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

28 篇 工学
- 21 篇 计算机科学与技术...
- 20 篇 软件工程
- 1 篇 电气工程
- 1 篇 控制科学与工程
4 篇 理学
- 3 篇 数学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...

主题

35 篇 array programmin...
4 篇 programming soft...
4 篇 generalmanual
4 篇 nostromo array
4 篇 functional progr...
4 篇 nostromo
3 篇 dependent types
3 篇 array
3 篇 smalltalk
3 篇 rank-polymorphis...
3 篇 f-script
3 篇 single assignmen...
3 篇 select
2 篇 loadout manager
2 篇 high-level langu...
2 篇 macro
2 篇 gamepad
2 篇 message pattern
2 篇 dual analog
2 篇 type systems

机构

5 篇 radboud univ nij...
3 篇 mcgill univ mont...
2 篇 mit 77 massachus...
1 篇 inria
1 篇 google res montr...
1 篇 univ copenhagen ...
1 篇 univ amsterdam
1 篇 univ toronto on
1 篇 victoria univ we...
1 篇 heriot watt univ...
1 篇 dyalog ltd on
1 篇 ecole polytech f...
1 篇 shandong univ sc...
1 篇 google res warsa...
1 篇 med univ lubeck ...
1 篇 univ copenhagen ...
1 篇 indiana univ ope...
1 篇 natl univ singap...
1 篇 mit csail 77 mas...
1 篇 univ new s wales...

作者

6 篇 scholz sven-bodo
3 篇 ragan-kelley jon...
3 篇 koopman thomas
3 篇 grelck clemens
2 篇 hendren laurie
2 篇 philippe mougin
2 篇 kemme bettina
2 篇 liu amanda
2 篇 vytiniotis dimit...
2 篇 chlipala adam
2 篇 aaldering jordy
2 篇 chen hanfeng
1 篇 bernstein gilber...
1 篇 johnson matthew ...
1 篇 lumsdaine a
1 篇 dubach christoph...
1 篇 leshchinskiy rom...
1 篇 johnson daniel d...
1 篇 ankner johan
1 篇 lund simon andre...

语言

33 篇 英文
2 篇 其他

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

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

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

详细简洁

排序：

Improving Database Query Performance with Automatic Fusion 2020

Improving Database Query Performance with Automatic Fusion

引用

29th ACM SIGPLAN International Conference on Compiler Construction (CC)

作者： Chen, Hanfeng Krolik, Alexander Kemme, Bettina Verbrugge, Clark Hendren, Laurie McGill Univ Montreal PQ Canada

ISBN: (纸本)9781450371209

array-based programming languages have shown significant promise for improving performance of column-based in-memory database systems, allowing elegant representation of query execution plans that are also amenable to standard compiler optimization techniques. Use of loop fusion, however, is not straightforward, due to the complexity of built-in functions for implementing complex database operators. In this work, we apply a compiler approach to optimize SQL query execution plans that are expressed in an array-based intermediate representation. We analyze this code to determine shape properties of the data being processed, and use a subsequent optimization phase to fuse multiple database operators into single, compound operations, reducing the need for separate computation and storage of intermediate values. Experimental results on a range of TPC-H queries show that our fusion technique is effective in generating efficient code, improving query time over a baseline system.

关键词： IR Compiler optimizations array programming SQL database queries Loop

来源：评论

学校读者我要写书评

暂无评论

NumCIL and Bohrium: High Productivity and High Performance 11th

NumCIL and Bohrium: High Productivity and High Performance

引用

11th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Skovhede, Kenneth Lund, Simon Andreas Frimann Univ Copenhagen Niels Bohr Inst Copenhagen Denmark

ISBN: (纸本)9783319321523;9783319321516

In this paper, we explore the mapping of the NumCIL C# vector library where operations are offloaded to the Bohrium runtime system and evaluate the performance gains. By using a feature-rich language, such as C#, we argue that productivity can be increased. The use of the Bohrium runtime system allows all vector operations written in C# to be executed efficiently on multi-core systems. We evaluate the presented design through a setup that targets a 32 core machine. The evaluation includes well-known benchmark applications, such as Black Sholes, 5-point stencil, Shallow Water, and N-body.

关键词： C# NumCIL Bohrium High performance High productivity Vector programming array programming

来源：评论

学校读者我要写书评

暂无评论

Polymorphic Types with Polynomial Sizes 9

Polymorphic Types with Polynomial Sizes

引用

9th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for array programming (array)

作者： Colaco, Jean-Louis Pauget, Baptiste Pouzet, Marc ANSYS Toulouse France INRIA Paris France PSL Univ Ecole normale super Paris France

ISBN: (纸本)9798400701696

This article presents a compile-time analysis for tracking the size of data-structures in a statically typed and strict functional language. This information is valuable for static checking and code generation. Rather than relying on dependent types, we propose a type-system close to that of ML: polymorphism is used to define functions that are generic in types and sizes;both can be inferred. This approach is convenient, in particular for a language used to program critical embedded systems, where sizes are indeed known at compiletime. By using sizes that are multivariate polynomials, we obtain a good compromise between the expressiveness of the size language and its properties (verification, inference). The article defines a minimal functional language that is sufficient to capture size constraints in types. It presents its dynamic semantics, the type system and inference algorithm. Last, we sketch some practical extensions that matter for a more realistic language.

关键词： array programming type systems

来源：评论

学校读者我要写书评

暂无评论

Shray: An Owner-Compute Distributed Shared-Memory System 10

Shray: An Owner-Compute Distributed Shared-Memory System

引用

10th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for array programming (array)

作者： Schrijvers, Stefan Koopman, Thomas Scholz, Sven-Bodo Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9798400706202

In this paper, we propose a new library for storing arrays in a distributed fashion on distributed memory systems. From a programmer's perspective, these arrays behave for arbitrary reads as if they were allocated in shared memory. When it comes to writes into these arrays, the programmer has to ensure that all writes are restricted to a fixed range of address that are "owned" by the node executing the writing operation. We show how this design, despite the owner-compute restriction can aid programmer productivity by enabling straight-forward parallelisations of typical array-manipulating codes. Furthermore, we delineate an open-source implementation of the proposed library named Shray. Using the programming interface of Shray, we compare possible hand-parallelised codes of example applications with implementations in other DSM/PGAS systems demonstrating the programming style enabled by Shray, and providing some initial performance figures.

关键词： Distributed Shared Memory Partitioned Global Address Space array programming Parallel Computing

来源：评论

学校读者我要写书评

暂无评论

Latent Idiom Recognition for a Minimalist Functional array Language using Equality Saturation 24

Latent Idiom Recognition for a Minimalist Functional Array L...

引用

22nd IEEE/ACM International Symposium on Code Generation and Optimization (CGO)

作者： Van der Cruysse, Jonathan Dubach, Christophe McGill Univ Montreal PQ Canada Mila Montreal PQ Canada

ISBN: (纸本)9798350395099

Accelerating programs is typically done by recognizing code idioms matching high-performance libraries or hardware interfaces. However, recognizing such idioms automatically is challenging. The idiom recognition machinery is difficult to write and requires expert knowledge. In addition, slight variations in the input program might hide the idiom and defeat the recognizer. This paper advocates for the use of a minimalist functional array language supporting a small, but expressive, set of operators. The minimalist design leads to a tiny sets of rewrite rules, which encode the language semantics. Crucially, the same minimalist language is also used to encode idioms. This removes the need for hand-crafted analysis passes, or for having to learn a complex domain-specific language to define the idioms. Coupled with equality saturation, this approach is able to match the core functions from the BLAS and PyTorch libraries on a set of computational kernels. Compared to reference C kernel implementations, the approach produces a geometric mean speedup of 1.46x for C programs using BLAS, when generating such programs from the high-level minimalist language.

关键词： equality saturation functional programming array programming pattern matching libraries

来源：评论

学校读者我要写书评

暂无评论

Rank-Polymorphism for Shape-Guided Blocking 11

Rank-Polymorphism for Shape-Guided Blocking

引用

11th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing (FHPNC)

作者： Sinkarovs, Artjoms Koopman, Thomas Scholz, Sven-Bodo Heriot Watt Univ Edinburgh Midlothian Scotland Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9798400702969

Many numerical algorithms on matrices or tensors can be formulated in a blocking style which improves performance due to better cache locality. In imperative languages, blocking is achieved by introducing additional layers of loops in a nested fashion alongside with suitable adjustments in index computations. While this process is tedious and error-prone, it is also difficult to implement a generically blocked version that would support arbitrary levels of blocking. At the example of matrix multiply, this paper demonstrates how rank-polymorphic array languages enable the specification of such generically blocked algorithms in a simple, recursive form. The depth of the blocking as well as blocking factors can be encoded in the structure of array shapes. In turn, reshaping arrays makes it possible to switch between blocked and non-blocked arrays. Through rank-polymorphic array combinators, any specification of loop boundaries or explicit index computations can be avoided. Firstly, we propose a dependently-typed framework for rank-polymorphic arrays. We use it to demonstrate that all blocked algorithms can be naturally derived by induction on the argument shapes. Our framework guarantees lack of out-of-bound indexing, and we also prove that all the blocked versions compute the same results as the canonical algorithm. Secondly, we translate our specification to the array language SaC. Not only do we show that we achieve similar conciseness in the implementation, but we also observe good performance of the generated code. We achieve a 7% improvement compared to the highly-optimised OpenBLAS library, and 3% compared to Intel's MKL library when running on a 32-core shared-memory system.

关键词： array programming Rank-Polymorphism Dependent Types HPC Matrix Multiply

来源：评论

学校读者我要写书评

暂无评论

Modulo in high-performance code: strength reduction for modulo-based array indexing in loops 35

Modulo in high-performance code: strength reduction for modu...

引用

35th Symposium on Implementation and Application of Functional Languages (IFL)

作者： Verloop, Michiel Koopman, Thomas Scholz, Sven-Bodo Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9798400716317

Modulo operations on array indices provide a convenient means for specifying cyclic operations on arrays, such as rotations. A naive compilation of such operations involves integer divisions, which often can be avoided by partitioning or rearranging iteration spaces. This paper proposes an optimisation to this effect. The key idea is to systematically replace modulo operations within loops by partitioning such loops and replacing the modulo operations with division-free equivalents. We present two different code transformation schemes for the proposed optimisation, provide correctness arguments for both, and present initial performance observations of the effects of these transformations in the context of a compiler for the array language SaC. We look at several benchmarks ranging from micro-benchmarks to some more realistic applications and run them on hardware ranging from multi-core CPUs to GPUs. Depending on the problem size, machine characteristics, and application context, we see direct performance benefits of up to a factor of 25 and even higher indirect benefits due to other optimisations that the proposed transformations enable.

关键词： array programming Rank-Polymorphism Modulo Strength Reduction Optimisation Rotation

来源：评论

学校读者我要写书评

暂无评论

Type Patterns: Pattern Matching on Shape-Carrying array Types 35

Type Patterns: Pattern Matching on Shape-Carrying Array Type...

引用

35th Symposium on Implementation and Application of Functional Languages (IFL)

作者： Aaldering, Jordy Scholz, Sven-Bodo van Gastel, Bernard Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9798400716317

In this paperwe present type patterns: a notation for shape-carrying array types that enables the specification of dependent type signatures while maintaining flexibility and a high level of code readability. Similar notations pre-exist, but we extend them to support rank-polymorphism and specifications of arbitrarily complex constraints between values and types. Furthermore, we enable type patterns to double as a pattern matching mechanism against shapes and shape-components of array arguments, making those values directly available in the corresponding function bodies. While this notation could be used as a basis for a dependently typed language, in our prototypical implementation in the context of SaC we do not require all dependencies to be resolved statically. Instead, we follow a hybrid approach: we map the proposed type patterns into the pre-existing type system of SaC, and we generate additional constraints which we try to statically resolve as far as possible by means of partial evaluation. Any remaining constraints are checked at run-time. We outline our implementation in the context of the SaC ecosystem, and present several examples demonstrating the effectiveness of this hybrid approach based on partial evaluation.

关键词： array programming Single assignment C Rank-Polymorphism Hybrid Types Dependent Types Type Constraints Partial Evaluation Pattern Matching Shape Pattern Type Pattern

来源：评论

学校读者我要写书评

暂无评论

Recycle Your arrays!

引用

11th International Symposium on Practical Aspects of Declarative Languages

作者： Leshchinskiy, Roman Univ New S Wales Sch Engn & Comp Sci Sydney NSW 2052 Australia

ISBN: (纸本)9783540929949

Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforestation frameworks such as stream fusion achieve signficant improvements here but fail for a number of important operations which can nevertheless benefit from elimination of temporaries. To mitigate this problem, we extend stream fusion with support for in-place execution of array operations. This optimisation, which we call recycling, is easy to implement and can significantly reduce array allocation and copying in purely functional array algorithms.

关键词： Deforestation Optimisation array programming Functional programming

来源：评论

学校读者我要写书评

暂无评论

Destination-Passing Style for Efficient Memory Management 6

Destination-Passing Style for Efficient Memory Management

引用

6th ACM SIGPLAN International Workshop on Functional High-Performance Computing (FHPC)

作者： Shaikhha, Amir Fitzgibbon, Andrew Jones, Simon Peyton Vytiniotis, Dimitrios Ecole Polytech Fed Lausanne Lausanne Switzerland Microsoft HoloLens Cambridge England Microsoft Res Cambridge England

We show how to compile high-level functional array-processing programs, drawn from image processing and machine learning, into C code that runs as fast as hand-written C. The key idea is to transform the program to de... 详细信息

ISBN: (纸本)9781450351812

关键词： Destination-Passing Style array programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：