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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

491 篇 会议
37 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

488 篇 工学
- 485 篇 软件工程
- 291 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 6 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 3 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 航空宇航科学与技...
77 篇 理学
- 71 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 化学
- 1 篇 物理学
- 1 篇 生物学
35 篇 管理学
- 25 篇 管理科学与工程(可...
- 20 篇 工商管理
- 13 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学

主题

75 篇 design
66 篇 languages
65 篇 performance
43 篇 computer program...
38 篇 algorithms
36 篇 computer program...
31 篇 experimentation
24 篇 verification
23 篇 reliability
23 篇 program synthesi...
22 篇 probabilistic pr...
20 篇 java programming...
15 篇 functional progr...
13 篇 object oriented ...
12 篇 c (programming l...
11 篇 computer systems...
11 篇 static analysis
11 篇 measurement
11 篇 concurrency
10 篇 compilers

机构

12 篇 carnegie mellon ...
9 篇 univ michigan an...
9 篇 univ wisconsin m...
9 篇 princeton univ p...
8 篇 univ penn philad...
8 篇 purdue univ w la...
8 篇 stanford univ st...
8 篇 univ washington ...
8 篇 univ texas austi...
7 篇 mit cambridge ma...
6 篇 microsoft res re...
6 篇 swiss fed inst t...
6 篇 yale univ new ha...
6 篇 harvard univ cam...
6 篇 cornell univ ith...
5 篇 ibm research
5 篇 microsoft resear...
5 篇 univ calif berke...
4 篇 carnegie mellon ...
4 篇 microsoft res re...

作者

7 篇 dillig isil
6 篇 august david i.
6 篇 gulwani sumit
5 篇 mckinley kathryn...
5 篇 grossman dan
5 篇 aiken alex
5 篇 vechev martin
5 篇 bacon david f.
5 篇 su zhendong
5 篇 solar-lezama arm...
5 篇 myers andrew c.
5 篇 millstein todd
5 篇 walker david
5 篇 mansinghka vikas...
4 篇 wang xinyu
4 篇 nakatani t
4 篇 cheng perry
4 篇 adl-tabatabai al...
4 篇 gehr timon
4 篇 lueh guei-yuan

语言

526 篇 英文
2 篇 其他

检索条件"任意字段=PLDI 2006 - 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 528 条记录，以下是181-190 订阅

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

详细简洁

排序：

Register allocation by puzzle solving 08

引用

2008 acm sigplan conference on programming language design and implementation 2008, pldi'08

作者： Pereira, Fernando Magno Quintão Palsberg, Jens UCLA Computer Science Department University of California Los Angeles United States

ISBN: (纸本)9781595938602

We show that register allocation can be viewed as solving a collection of puzzles. We model the register file as a puzzle board and the program variables as puzzle pieces;pre-coloring and register aliasing fit in naturally. For architectures such as PowerPC, x86, and StrongARM, we can solve the puzzles in polynomial time, and we have augmented the puzzle solver with a simple heuristic for spilling. For SPEC CPU2000, the compilation time of our implementation is as fast as that of the extended version of linear scan used by LLVM, which is the JIT compiler in the openGL stack of Mac OS 10.5. Our implementation produces x86 code that is of similar quality to the code produced by the slower, state-of-the-art iterated register coalescing of George and Appel with the extensions proposed by Smith, Ramsey, and Holloway in 2004. Copyright © 2008 acm.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Orchestrating the Execution of Stream Programs on Multicore Platforms 08

Orchestrating the Execution of Stream Programs on Multicore ...

引用

acm sigplan conference on programming language design and implementation

作者： Kudlur, Manjunath Mahlke, Scott Univ Michigan Adv Comp Architecture Lab Ann Arbor MI 48109 USA

ISBN: (纸本)9781595938602

While multicore hardware has become ubiquitous, explicitly parallel programming models and compiler techniques for exploiting parallelism on these systems have noticeably lagged behind. Stream programming is one model that has wide applicability in the multimedia, graphics, and signal processing domains. Streaming models execute as a set of independent actors that explicitly communicate data through channels. This paper presents a compiler technique for planning and orchestrating the execution of streaming applications on multicore platforms. An integrated unfolding and partitioning step based on integer linear programming is presented that unfolds data parallel actors as needed and maximally packs actors onto cores. Next, the actors are assigned to pipeline stages in such a way that all communication is maximally overlapped with computation on the cores. To facilitate experimentation, a generalized code generation template for mapping the software pipeline onto the Cell architecture is presented. For a range of streaming applications, a geometric mean speedup of 14.7x is achieved on a 16-core Cell platform compared to a single core.

关键词： StreamIt Cell processor multicore stream programming software pipelining

来源：评论

学校读者我要写书评

暂无评论

Harmonizing Classes, Functions, Tuples, and Type Parameters in Virgil III 13

Harmonizing Classes, Functions, Tuples, and Type Parameters ...

引用

34th acm sigplan conference on programming language design and implementation (pldi)

作者： Titzer, Ben L. Google Mountain View CA USA

ISBN: (纸本)9781450320146

languages are becoming increasingly multi-paradigm. Subtype polymorphism in statically-typed object-oriented languages is being supplemented with parametric polymorphism in the form of generics. Features like first-class functions and lambdas are appearing everywhere. Yet existing languages like Java, C#, C++, D, and Scala seem to accrete ever more complexity when they reach beyond their original paradigm into another;inevitably older features have some rough edges that lead to nonuniformity and pitfalls. Given a fresh start, a new language designer is faced with a daunting array of potential features. Where to start? What is important to get right first, and what can be added later? What features must work together, and what features are orthogonal? We report on our experience with Virgil III, a practical language with a careful balance of classes, functions, tuples and type parameters. Virgil intentionally lacks many advanced features, yet we find its core feature set enables new species of design patterns that bridge multiple paradigms and emulate features not directly supported such as interfaces, abstract data types, ad hoc polymorphism, and variant types. Surprisingly, we find variance for function types and tuple types often replaces the need for other kinds of type variance when libraries are designed in a more functional style.

关键词： Multi-paradigm languages parametric types object-oriented programming functional programming monomorphization variance closures tuples flattening unboxing static compilation

来源：评论

学校读者我要写书评

暂无评论

Bamboo: A Data-Centric, Object-Oriented Approach to Many-core Software 10

Bamboo: A Data-Centric, Object-Oriented Approach to Many-cor...

引用

acm sigplan conference on programming language design and implementation

作者： Zhou, Jin Demsky, Brian Univ Calif Irvine Dept Elect Engn & Comp Sci Irvine CA 92697 USA

ISBN: (纸本)9781450300193

Traditional data-oriented programming languages such as dataflow languages and stream languages provide a natural abstraction for parallel programming. In these languages, a developer focuses on the flow of data through the computation and these systems free the developer from the complexities of low-level, thread-oriented concurrency primitives. This simplification comes at a cost traditional data-oriented approaches restrict the mutation of state and, in practice, the types of data structures a program can effectively use. Bamboo borrows from work in typestate and software transactions to relax the traditional restrictions of data-oriented programming models to support mutation of arbitrary data structures. We have implemented a compiler for Bamboo which generates code for the TILEPro64 many-core processor. We have evaluated this implementation on six benchmarks: Tracking, a feature tracking algorithm from computer vision;KMeans, a K-means clustering algorithm;Monte Carlo, a Monte Carlo simulation;Filter Bank, a multi-channel filter bank;Fractal, a Mandelbrot set computation;and Series, a Fourier series computation. We found that our compiler generated implementations that obtained speedups ranging from 26.2 x to 61.6 x when executed on 62 cores.

关键词： Many-core programming Data-Centric languages

来源：评论

学校读者我要写书评

暂无评论

Incremental Inference for Probabilistic Programs 2018

Incremental Inference for Probabilistic Programs

引用

39th acm sigplan conference on programming language design and implementation (pldi)

作者： Cusumano-Towner, Marco Bichsel, Benjamin Gehr, Timon Vechev, Martin Mansinghka, Vikash K. MIT 77 Massachusetts Ave Cambridge MA 02139 USA Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450356985

We present a novel approach for approximate sampling in probabilistic programs based on incremental inference. The key idea is to adapt the samples for a program P into samples for a program Q, thereby avoiding the expensive sampling computation for program Q. To enable incremental inference in probabilistic programming, our work: (i) introduces the concept of a trace translator which adapts samples from P into samples of Q, (ii) phrases this translation approach in the context of sequential Monte Carlo (SMC), which gives theoretical guarantees that the adapted samples converge to the distribution induced by Q, and (iii) shows how to obtain a concrete trace translator by establishing a correspondence between the random choices of the two probabilistic programs. We implemented our approach in two different probabilistic programming systems and showed that, compared to methods that sample the program Q from scratch, incremental inference can lead to orders of magnitude increase in efficiency, depending on how closely related P and Q are.

关键词： Probabilistic programming sequential Monte Carlo incremental computation

来源：评论

学校读者我要写书评

暂无评论

Compiling a high-level language for GPUs: Via language support for architectures and compilers

Compiling a high-level language for GPUs: Via language suppo...

引用

33rd acm sigplan conference on programming language design and implementation, pldi'12

作者： Dubach, Christophe Cheng, Perry Rabbah, Rodric Bacon, David F. Fink, Stephen J. University of Edinburgh United Kingdom IBM Research United States

ISBN: (纸本)9781450312059

languages such as OpenCL and CUDA offer a standard interface for general-purpose programming of GPUs. However, with these languages, programmers must explicitly manage numerous lowlevel details involving communication and synchronization. This burden makes programming GPUs difficult and error-prone, rendering these powerful devices inaccessible to most programmers. We desire a higher-level programming model that makes GPUs more accessible while also effectively exploiting their computational power. This paper presents features of Lime, a new Javacompatible language targeting heterogeneous systems, that allow an optimizing compiler to generate high quality GPU code. The key insight is that the language type system enforces isolation and immutability invariants that allow the compiler to optimize for a GPU without heroic compiler analysis. Our compiler attains GPU speedups between 75% and 140% of the performance of native OpenCL code. Copyright © 2012 acm.

关键词： Lime

来源：评论

学校读者我要写书评

暂无评论

Data flow frequency analysis

Data flow frequency analysis

引用

acm sigplan 96 conference on programming language design and implementation

作者： Ramalingam, G IBM T.J. Watson Research Cent Yorktown Heights United States

Conventional dataflow analysis computes information about what facts may or will not hold during the execution of a program. Sometimes it is useful, for program optimization, to know how often or with what probability a fact holds true during program execution. In this paper, we provide a precise formulation of this problem for a large class of dataflow problems - the class of finite bi-distributive subset problems. We show how it can be reduced to a generalization of the standard dataflow analysis problem, one that requires a sum-over-all-paths quantity instead of the usual meet-overall-paths quantity. We show that Kildall's result expressing the meet-over-all-paths value as a maximal-fixed-point carries over to the generalized setting, We then outline ways to adapt the standard dataflow analysis algorithms to solve this generalized problem, both in the intraprocedural and the interprocedural case.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Mostly-Automated Verification of Low-Level Programs in Computational Separation Logic 11

Mostly-Automated Verification of Low-Level Programs in Compu...

引用

32nd acm sigplan conference on programming language design and implementation (pldi 11)

作者： Chlipala, Adam Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781450306638

Several recent projects have shown the feasibility of verifying low-level systems software. Verifications based on automated theorem-proving have omitted reasoning about first-class code pointers, which is critical for tasks like certifying implementations of threads and processes. Conversely, verifications that deal with first-class code pointers have featured long, complex, manual proofs. In this paper, we introduce the Bedrock framework, which supports mostly-automated proofs about programs with the full range of features needed to implement, e.g., language runtime systems. The heart of our approach is in mostly-automated discharge of verification conditions inspired by separation logic. Our take on separation logic is computational, in the sense that function specifications are usually written in terms of reference implementations in a purely functional language. Logical quantifiers are the most challenging feature for most automated verifiers;by relying on functional programs (written in the expressive language of the Coq proof assistant), we are able to avoid quantifiers almost entirely. This leads to some dramatic improvements compared to both past work in classical verification, which we compare against with implementations of data structures like binary search trees and hash tables;and past work in verified programming with code pointers, which we compare against with examples like function memoization and a cooperative threading library.

关键词： interactive proof assistants separation logic low-level programming languages functional programming

来源：评论

学校读者我要写书评

暂无评论

The design, implementation, and evaluation of a compiler algorithm for CPU energy reduction

The design, implementation, and evaluation of a compiler alg...

引用

conference on programming language design and implementation

作者： Hsu, CH Kremer, U Rutgers State Univ Dept Comp Sci Piscataway NJ 08855 USA

This paper presents the design and implementation of a compiler algorithm that effectively optimizes programs for energy usage using dynamic voltage scaling (DVS). The algorithm identifies program regions where the CPU can be slowed down with negligible performance loss. It is implemented as a source-to-source level transformation using the SUIF2 compiler infrastructure. Physical measurements on a high-performance laptop show that total system (i.e., laptop) energy savings of up to 28% can be achieved with performance degradation of less than 5% for the SPECfp95 benchmarks. On average, the system energy and energy-delay product are reduced by 11% and 9%, respectively, with a performance slowdown of 2%. It was also discovered that the energy usage of the programs using our DVS algorithm is within 6% from the theoretical lower bound. To the best of our knowledge, this is one of the first work that evaluates DVS algorithms by physical measurements.

关键词： dynamic voltage scaling energy savings

来源：评论

学校读者我要写书评

暂无评论

Symbolic Reasoning for Automatic Signal Placement 2018

Symbolic Reasoning for Automatic Signal Placement

引用

39th acm sigplan conference on programming language design and implementation (pldi)

作者： Ferles, Kostas Van Geffen, Jacob Dillig, Isil Smaragdakis, Yannis Univ Texas Austin Austin TX 78712 USA Univ Athens Athens Greece

ISBN: (纸本)9781450356985

Explicit signaling between threads is a perennial cause of bugs in concurrent programs. While there are several runtime techniques to automatically notify threads upon the availability of some shared resource, such techniques are not widely-adopted due to their run-time overhead. This paper proposes a new solution based on static analysis for automatically generating a performant explicit-signal program from its corresponding implicit-signal implementation. The key idea is to generate verification conditions that allow us to minimize the number of required signals and unnecessary context switches, while guaranteeing semantic equivalence between the source and target programs. We have implemented our method in a tool called Expresso and evaluate it on challenging benchmarks from prior papers and open-source software. Expresso-generated code significantly outperforms past automatic signaling mechanisms (avg. 1.56x speedup) and closely matches the performance of hand-optimized explicit-signal code.

关键词： Implicit signal monitors concurrent programming symbolic reasoning verification conditions abductive reasoning monitor invariant

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共53页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：