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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

336 篇 会议
46 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

329 篇 工学
- 284 篇 软件工程
- 268 篇 计算机科学与技术...
- 12 篇 电子科学与技术（可...
- 7 篇 信息与通信工程
- 4 篇 机械工程
- 4 篇 控制科学与工程
- 4 篇 生物工程
- 3 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 核科学与技术
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
58 篇 理学
- 52 篇 数学
- 5 篇 系统科学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
15 篇 管理学
- 10 篇 管理科学与工程(可...
- 8 篇 工商管理
- 5 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学
1 篇 农学
- 1 篇 作物学

主题

71 篇 performance
49 篇 parallel process...
42 篇 algorithms
42 篇 parallel program...
39 篇 languages
34 篇 design
21 篇 gpu
20 篇 parallel algorit...
12 篇 experimentation
12 篇 measurement
9 篇 theory
9 篇 parallel computi...
8 篇 mpi
8 篇 parallel
7 篇 parallelism
7 篇 graphics process...
7 篇 logic programmin...
7 篇 concurrency
6 篇 openmp
5 篇 reliability

机构

7 篇 carnegie mellon ...
5 篇 indiana univ blo...
4 篇 univ wisconsin d...
3 篇 univ of tokyo
3 篇 univ chinese aca...
3 篇 massachusetts in...
3 篇 univ illinois ur...
3 篇 swiss fed inst t...
3 篇 mit csail united...
3 篇 shanghai jiao to...
3 篇 tsinghua univ pe...
3 篇 univ utah sch co...
3 篇 rice univ housto...
3 篇 purdue univ w la...
3 篇 univ calif berke...
2 篇 ist austria klos...
2 篇 princeton univ d...
2 篇 georgetown univ ...
2 篇 yale university ...
2 篇 coll william & m...

作者

8 篇 blelloch guy e.
6 篇 hoefler torsten
6 篇 garland michael
6 篇 chen haibo
6 篇 shun julian
5 篇 sun yihan
5 篇 zhai jidong
5 篇 tsigas philippas
5 篇 kennedy ken
4 篇 dhulipala laxman
4 篇 miller barton p.
4 篇 tan guangming
4 篇 wang haojie
4 篇 nikolopoulos dim...
4 篇 long guoping
4 篇 valero mateo
4 篇 mellor-crummey j...
4 篇 agrawal kunal
4 篇 gu yan
4 篇 leiserson charle...

语言

356 篇 英文
26 篇 其他

检索条件"任意字段=14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"

共 382 条记录，以下是151-160 订阅

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

详细简洁

排序：

Heuristics Entwined with Handlers Combined From Functional Specification to Logic programming Implementation 14

Heuristics Entwined with Handlers Combined From Functional S...

引用

16th International symposium on principles and practice of Declarative programming (PPDP)

作者： Schrijvers, Tom Wu, Nicolas Desouter, Benoit Demoen, Bart Univ Ghent Ghent Belgium Univ Oxford Oxford England Katholieke Univ Leuven Leuven Belgium

ISBN: (纸本)9781450329477

A long-standing problem in logic programming is how to cleanly separate logic and control. While solutions exist, they fall short in one of two ways: some are too intrusive, because they require significant changes to Prolog's underlying implementation;others are lacking a clean semantic grounding. We resolve both of these issues in this paper. We derive a solution that is both lightweight and principled. We do so by starting from a functional specification of Prolog based on monads, and extend this with the effect handlers approach to capture the dynamic search tree as syntax. Effect handlers then express heuristics in terms of tree transformations. Moreover, we can declaratively express many heuristics as trees themselves that are combined with search problems using a generic entwining handler. Our solution is not restricted to a functional model: we show how to implement this technique as a library in Prolog by means of delimited continuations.

关键词： monads effect handlers free monad transformer delimited continuations logic programming heuristic tree search

来源：评论

学校读者我要写书评

暂无评论

Structure-Preserving Compilation: Efficient Integration of Functional DSLs into Legacy Systems 14

Structure-Preserving Compilation: Efficient Integration of F...

引用

16th International symposium on principles and practice of Declarative programming (PPDP)

作者： Kranz, Julian Simon, Axel Tech Univ Munich Inst Informat 2 Garching Germany

ISBN: (纸本)9781450329477

We present a translation scheme from a pure functional domain-specific language (DSL) to C. the over-arching idea of this scheme is to preserve the structure of the input program as much as possible. this includes, among other things, to refrain from inlining user-written functions and to retain variable names as much as possible. We apply this translation scheme to GDSL, a DSL used for the specification of decoders for machine instructions. GDSL offers non-trivial language features such as monadic actions that our translation scheme maps one-to-one to C statements, resulting in code that closely resembles hand-written C code. Indeed, it is feasible to debug and profile the program at the C level and to interface the generated code with existing C code without marshaling data. Our translation scheme is therefore an attractive starting point for a light-weight DSL since no other language-specific tools besides the compiler are necessary. Moreover, the generated code is amenable to compiler optimizations found in off-the-shelf C compilers. this is illustrated by the performance achieved by a decoder for x86 machine instructions implemented in GDSL which is as fast as a production-quality decoding library shipped by Intel.

关键词： Domain specific languages translation scheme interfacing between programming languages code optimization functional languages type inference instruction decoding

来源：评论

学校读者我要写书评

暂无评论

Assertion-based Debugging of Higher-Order (C) LP Programs 14

Assertion-based Debugging of Higher-Order (C) LP Programs

引用

16th International symposium on principles and practice of Declarative programming (PPDP)

作者： Stulova, Nataliia Morales, Jose F. Hermenegildo, Manuel V. IMDEA Software Inst Madrid Spain Tech Univ Madrid UPM Sch Comp Sci Madrid Spain

ISBN: (纸本)9781450329477

Higher-order constructs extend the expressiveness of firstorder (Constraint) Logic programming ((C) LP) both syntactically and semantically. At the same time assertions have been in use for some time in (C) LP systems helping programmers detect errors and validate programs. However, these assertion-based extensions to (C) LP have not been integrated well with higher-order to date. this paper contributes to filling this gap by extending the assertion-based approach to error detection and program verification to the higher-order context within (C) LP. We propose an extension of properties and assertions as used in (C) LP in order to be able to fully describe arguments that are predicates. the extension makes the full power of the assertion language available when describing higher-order arguments. We provide syntax and semantics for (higher-order) properties and assertions, as well as for programs which contain such assertions, including the notions of error and partial correctness. We also discuss several alternatives for performing run-time checking of such programs.

关键词： Logic programming Constraint Logic programming Program Verification Higher Order Run-time Verification Error Detection Debugging Assertions

来源：评论

学校读者我要写书评

暂无评论

BiFluX: A Bidirectional Functional Update Language for XML 14

BiFluX: A Bidirectional Functional Update Language for XML

引用

16th International symposium on principles and practice of Declarative programming (PPDP)

作者： Pacheco, Hugo Zan, Tao Hu, Zhenjiang Cornell Univ Ithaca NY 14853 USA Grad Univ Adv Studies Hayama Kanagawa Japan Natl Inst Informat Tokyo Japan

ISBN: (纸本)9781450329477

Different XML formats are widely used for data exchange and processing, being often necessary to mutually convert between them. Standard XML transformation languages, like XSLT or XQuery, are unsatisfactory for this purpose since they require writing a separate transformation for each direction. Existing bidirectional transformation languages mean to cover this gap, by allowing programmers to write a single program that denotes both transformations. However, they often 1) induce a more cumbersome programming style than their traditionally unidirectional relatives, to establish the link between source and target formats, and 2) offer limited configurability, by making implicit assumptions about how modifications to both formats should be translated that may not be easy to predict. this paper proposes a bidirectional XML update language called BIFLUX (BIdirectional FunctionaL Updates for XML), inspired by the FLUX XML update language. Our language adopts a novel bidirectional programming by update paradigm, where a program succinctly and precisely describes how to update a source document with a target document, in an intuitive way, such that there is a unique " inverse" source query for each update program. BIFLUX extends FLUX with bidirectional actions that describe the connection between source and target formats. We introduce a core BIFLUX language, with a clear and well-behaved bidirectional semantics and a decidable static type system based on regular expression types.

关键词： XML bidirectional programming update languages

来源：评论

学校读者我要写书评

暂无评论

Teaching parallel Design Patterns to Undergraduates in Computer Science 14

Teaching Parallel Design Patterns to Undergraduates in Compu...

引用

45th acm SIGCSE Technical symposium on Computer Science Education (SIGCSE)

作者： Brown, Richard A. Adams, Joel C. Ferner, Clayton Shoop, Elizabeth Wilkinson, Barry St Olaf Coll Northfield MN 55057 USA Calvin Coll Grand Rapids MI 49506 USA UNC Wilmington Wilmington NC USA Macalester Coll St Paul MN 55105 USA UNC Charlotte Charlotte NC USA

ISBN: (纸本)9781450326056

the industry shift emerging forms of parallel and distributed computing (PDC), including multi-core CPUs, cloud computing, and general-purpose use of GPUs, have naturally led to increased presence of PDC elements undergraduate Computer Science curriculum recommendations, such as the new and substantial "PD" knowledge area in the joint acm/IEEE CS2013 recommendations[1]. How can undergraduate students grasp the extensive and complex range of PDC principles and practices, and apply that knowledge in problem solving, while PDC technologies continue to evolve rapidly? parallel design patterns are descriptions of effective solutions to recurring parallel programming problems in particular contexts and have emerged from long-standing industry practice. parallel patterns occur at all computational levels, ranging from low-level concurrent execution patterns (such as message passing or thread pool patterns) to high-level software design patterns suitable for organizing entire systems or their components (such as model-view-control or pipe and filter patterns). the sheer number of parallel patterns, which reflect the full breadth and complexity of PDC, can be quite daunting for a newcomer. However, the ubiquity of parallel patterns in all forms of parallel and distributed computation makes these patterns relevant and illuminating at all undergraduate levels. Knowledge of parallel patterns, being reusable elements of parallel design, guides problem-solving during the creation of parallel programs;and those enduring design patterns remain relevant and useful as new PDC infrastructure emerges in this rapidly evolving field. this panel presents four viewpoints representing various approaches for teaching parallel patterns to CS undergraduates at multiple academic levels. Moderator Dick Brown co-directs (with Adams and Shoop) the CSinparallel project (***), which produces and shares modular materials for incrementally adding parallelism to existing undergraduate comp

关键词： parallel computing parallelism distributed computing education parallel design patterns curriculum design patterns Seeds Paraguin patternlets exemplars

来源：评论

学校读者我要写书评

暂无评论

Session details: Session order 8: programming systems session 14

Session details: Session order 8: programming systems sessio...

引用

Proceedings of the 19th acm sigplan symposium on principles and practice of parallel programming

作者： Kunle Olukotun Stanford

No abstract available.

ISBN: (纸本)9781450326568

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Beyond parallel programming with domain specific languages 14

Beyond parallel programming with domain specific languages

引用

Proceedings of the 19th acm sigplan symposium on principles and practice of parallel programming

作者： Kunle Olukotun Stanford University Stanford CA USA

ISBN: (纸本)9781450326568

Today, almost all computer architectures are parallel and heterogeneous; a combination of multiple CPUs, GPUs and specialized processors. this creates a challenging problem for application developers who want to develop high performance programs without the effort required to use low-level, architecture specific parallel programming models (e.g. OpenMP for CMPs, CUDA for GPUs, MPI for clusters). Domain-specific languages (DSLs) are a promising solution to this problem because they can provide an avenue for high-level application-specific abstractions with implicit parallelism to be mapped directly to low level architecture-specific programming models; providing both high programmer productivity and high execution *** this talk I will describe an approach to building high performance DSLs, which is based on DSL embedding in a general purpose programming language, metaprogramming and a DSL infrastructure called Delite. I will describe how we transform DSL programs into efficient first-order low-level code using domain specific optimization, parallelism and locality optimization with parallel patterns, and architecture-specific code generation. All optimizations and transformations are implemented in Delite: an extensible DSL compiler infrastucture that significantly reduces the effort required to develop new DSLs. Delite DSLs for machine learning, data querying, graph analysis, and scientific computing all achieve performance competitive with manually parallelized C++ code.

关键词： domain specific languages

来源：评论

学校读者我要写书评

暂无评论

Reducing Contention through Priority Updates 13

Reducing Contention Through Priority Updates

引用

18th acm sigplan symposium on principles and practice of parallel programming

作者： Shun, Julian Blelloch, Guy E. Fineman, Jeremy T. Gibbons, Phillip B. Carnegie Mellon Univ Pittsburgh PA 15213 USA Georgetown Univ Washington DC 20057 USA Intel Labs Pittsburgh PA USA

No abstract available.

ISBN: (纸本)9781450319225

No abstract available.

关键词： Experimentation Performance parallel programming Contention

来源：评论

学校读者我要写书评

暂无评论

programming with Hardware Lock Elision 13

Programming with Hardware Lock Elision

引用

18th acm sigplan symposium on principles and practice of parallel programming

作者： Afek, Yehuda Levy, Amir Morrison, Adam Tel Aviv Univ Blavatnik Sch Comp Sci IL-69978 Tel Aviv Israel

We present a simple yet effective technique for improving performance of lock-based code using the hardware lock elision (HLE) feature in Intel's upcoming Haswell processor. We also describe how to extend Haswell&... 详细信息

ISBN: (纸本)9781450319225

关键词： Haswell hardware lock elision speculative execution

来源：评论

学校读者我要写书评

暂无评论

21st century computer architecture 14

21st century computer architecture

引用

Proceedings of the 19th acm sigplan symposium on principles and practice of parallel programming

作者： Mark D. Hill University of Wisconsin - Madison Madison WI USA

ISBN: (纸本)9781450326568

this talk has two parts. the first part will discuss possible directions for computer architecture research, including architecture as infrastructure, energy first, impact of new technologies, and cross-layer opportunities. this part is based on a 2012 Computing Community Consortium (CCC) whitepaper effort led by Hill, as well as other recent National Academy and ISAT studies. See: http://***/ccc/docs/init/***. the second part of the talk will discuss one or more exam-ples of cross-layer research advocated in the first part. For example, our analysis shows that many "big-memory" server workloads, such as databases, in-memory caches, and graph analytics, pay a high cost for page-based virtual memory: up to 50% of execution time wasted. Via small changes to the operating system (Linux) and hardware (x86-64 MMU), this work reduces execution time these workloads waste to less than 0.5%. the key idea is to map part of a process's linear virtual address space with a new incarnation of segmentation, while providing compatibility by mapping the rest of the virtual address space with pag-ing.

关键词： computer systems performace architechture programming methods new technology energy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共39页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：