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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,119 篇 会议
130 篇 期刊文献

馆藏范围

1,249 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,073 篇 工学
- 1,007 篇 软件工程
- 776 篇 计算机科学与技术...
- 44 篇 控制科学与工程
- 35 篇 信息与通信工程
- 34 篇 电气工程
- 10 篇 机械工程
- 9 篇 电子科学与技术（可...
- 5 篇 建筑学
- 5 篇 土木工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 3 篇 农业工程
- 3 篇 生物工程
- 2 篇 光学工程
- 2 篇 轻工技术与工程
131 篇 理学
- 111 篇 数学
- 12 篇 系统科学
- 9 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 物理学
- 4 篇 化学
88 篇 管理学
- 51 篇 管理科学与工程(可...
- 40 篇 图书情报与档案管...
- 28 篇 工商管理
12 篇 教育学
- 12 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
5 篇 法学
- 4 篇 社会学
3 篇 农学
- 3 篇 作物学

主题

170 篇 design
157 篇 languages
96 篇 performance
94 篇 computer program...
60 篇 object oriented ...
57 篇 algorithms
48 篇 computer program...
43 篇 experimentation
39 篇 verification
34 篇 reliability
34 篇 java programming...
29 篇 functional progr...
27 篇 program synthesi...
27 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
18 篇 compilers
18 篇 c (programming l...

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ washington ...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 univ penn philad...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 stanford univ st...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
8 篇 microsoft res re...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...
7 篇 northeastern uni...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
8 篇 gulwani sumit
7 篇 august david i.
7 篇 bacon david f.
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 bodik rastislav

语言

1,171 篇 英文
77 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation"

共 1249 条记录，以下是131-140 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

An optimizer for ada-design, experiences and results 88

An optimizer for ada-design, experiences and results

引用

acm sigplan conference on programming language design and implementation, PLDI 1988

作者： Schwarz, Birgit Kirchgiissner, Walter Landwehr, Rudolf GMD Forschungsstelle An der Universität Karlsruhe Haid-und-Neu-Str. 7 Karlsruhe 1D-7500 Germany

ISBN: (纸本)0897912691

In this paper we describe the design of a global machine independent low level optimizer for the Karlsruhe Ada Compiler. We give a short overview on the optimizations and data structures used in the optimizer as well as some experiences with the optimizer. Detailed measurements are prcl vided for a collection of benchmarks. The average improve ment of code speed is 40%. © 1988 acm.

关键词： Structural optimization

来源：评论

学校读者我要写书评

暂无评论

P: Safe Asynchronous Event-Driven programming

P: Safe Asynchronous Event-Driven Programming

引用

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

作者： Desai, Ankush Gupta, Vivek Jackson, Ethan Qadeer, Shaz Rajamani, Sriram Zufferey, Damien Microsoft Corp Redmond WA 98052 USA

ISBN: (纸本)9781450320146

We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to "close" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code;a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhandled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P);we have more confidence in the robustness of its design due to the language abstractions and verification provided by P.

关键词： domain-specific language device driver event-driven programming state machine verification systematic testing

来源：评论

学校读者我要写书评

暂无评论

Renaissance: Benchmarking Suite for Parallel Applications on the JVM 2019

Renaissance: Benchmarking Suite for Parallel Applications on...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Prokopec, Aleksandar Rosa, Andrea Leopoldseder, David Duboscq, Gilles Tuma, Petr Studener, Martin Bulej, Lubomir Zheng, Yudi Villazon, Alex Simon, Doug Wurthinger, Thomas Binder, Walter Oracle Labs Zurich Switzerland Univ Svizzera Italiana Lugano Switzerland Johannes Kepler Univ Linz Linz Austria Charles Univ Prague Prague Czech Republic Univ Privada Boliviana Colcapirhua Bolivia

ISBN: (纸本)9781450367127

Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo, ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel programming abstractions and concurrency primitives offered by the JVM and the Java Class Library. However, such workloads are fundamental for understanding the way in which modern applications and data-processing frameworks use the JVM's concurrency features, and for validating new just-in-time (JIT) compiler optimizations that enable more efficient execution of such workloads. We present Renaissance, a new benchmark suite composed of modern, real-world, concurrent, and object-oriented workloads that exercise various concurrency primitives of the JVM. We show that the use of concurrency primitives in these workloads reveals optimization opportunities that were not visible with the existing workloads. We use Renaissance to compare performance of two state-of-the-art, production-quality JIT compilers (HotSpot C2 and Graal), and show that the performance differences are more significant than on existing suites such as DaCapo and SPECjvm2008. We also use Renaissance to expose four new compiler optimizations, and we analyze the behavior of several existing ones. Evaluating these optimizations using four benchmark suites shows a more prominent impact on the Renaissance workloads than on those of other suites.

关键词： benchmarks JIT compilation parallelism concurrency JVM object-oriented programming benchmarks functional programming benchmarks Big Data benchmarks

来源：评论

学校读者我要写书评

暂无评论

A compiler approach to fast hardware design space exploration in FPGA-based systems

A compiler approach to fast hardware design space exploratio...

引用

conference on programming language design and implementation (PLDI 02)

作者： So, B Hall, MW Diniz, PC Univ So Calif Inst Informat Sci Marina Del Rey CA 90292 USA

This paper describes an automated approach to hardware design space exploration, through a collaboration between parallelizing compiler technology and high-level synthesis tools. We present a compiler algorithm that automatically explores the large design spaces resulting from the application of several program transformations commonly used in application-specific hardware designs. Our approach uses synthesis estimation techniques to quantitatively evaluate alternate designs for a loop nest computation. We have implemented this design space exploration algorithm in the context of a compilation and synthesis system called DE-FACTO, and present results of this implementation on five multimedia kernels. Our algorithm derives an implementation that closely matches the performance of the fastest design in the design space, and among implementations with comparable performance, selects the smallest design. We search on average only 0.3% of the design space. This technology thus significantly raises the level of abstraction for hardware design and explores a design space much larger than is feasible for a human designer.

关键词： algorithms performance design experimentationdesign space exploration data dependence analysis reuse analysis loop transformations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Incremental Precision-Preserving Symbolic Inference for Probabilistic Programs 2019

Incremental Precision-Preserving Symbolic Inference for Prob...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Zhang, Jieyuan Xue, Jingling UNSW Sydney Sch Comp Sci & Engn Sydney NSW Australia

ISBN: (纸本)9781450367127

We present ISymb, an incremental symbolic inference framework for probabilistic programs in situations when some loop-manipulated array data, upon which their probabilistic models are conditioned, undergoes small changes. To tackle the path explosion challenge, ISymb is intra-procedurally path-sensitive except that it conducts a "meet-over-all-paths" analysis within an iteration of a loop (conditioned on some observed array data). By recomputing only the probability distributions for the paths affected, ISymb avoids expensive symbolic inference from scratch while also being precision-preserving. Our evaluation with a set of existing benchmarks shows that ISymb can lead to orders of magnitude performance improvements compared to its non-incremental counterpart (under small changes in observed array data).

关键词： Probabilistic programming Symbolic Inference Incremental Computation Static analysis

来源：评论

学校读者我要写书评

暂无评论

DOC: A practical approach to source-level debugging of globally optimized code 88

DOC: A practical approach to source-level debugging of globa...

引用

acm sigplan conference on programming language design and implementation, PLDI 1988

作者： Coutant, Deborah S. Meloy, Sue Ruscetta, Michelle Hewlett-Packard 19447 Pruneridge Ave CupertinoCA95014 United States

ISBN: (纸本)0897912691

As optimizing compilers become more sophisticated, the problem of debugging the source code of an application becomes more difficult. In order to investigate this problem, we implemented DOC, a prototype solution for Debugging Optimized Code. DOC is a modification of the existing C compiler and source-level symbolic debugger for the HP9000 Series 800. This paper describes our experiences in this effort. We show in an actual implementation that source-level debugging of globally optimized code is viable. © 1988 acm.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Karp: A language for NP Reductions 2022

Karp: A Language for NP Reductions

引用

43rd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Zhang, Chenhao Hartline, Jason D. Dimoulas, Christos Northwestern Univ Evanston IL 60208 USA

ISBN: (纸本)9781450392655

In CS theory courses, NP reductions are a notorious source of pain for students and instructors alike. Invariably, students use pen and paper to write down reductions that "work" in many but not all cases. When instructors observe that a student's reduction deviates from the expected one, they have to manually compute a counterexample that exposes the mistake. In other words, NP reductions are subtle yet, most of the time, unimplemented programs. And for a good reason: there exists no language tailored to NP reductions. We introduce Karp, a language for programming and testing NP reductions. Karp combines an array of programming languages techniques: language-oriented programming and macros, solver-aided languages, property testing, higher-order contracts and gradual typing. To validate the correctness of Karp, we prove that its core is well-defined. To validate its pragmatics, we demonstrate that it is expressive and performant enough to handle a diverse set of reduction exercises from a popular algorithms textbook. Finally, we report the results from a preliminary user study with Karp.

关键词： domain-specific language solver-aided programming reduction teaching and learning theoretical computer science

来源：评论

学校读者我要写书评

暂无评论

Search, Align, and Repair: Data-Driven Feedback Generation for Introductory programming Exercises 2018

Search, Align, and Repair: Data-Driven Feedback Generation f...

引用

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

作者： Wang, Ke Singh, Rishabh Su, Zhendong Univ Calif Davis Davis CA 95616 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450356985

This paper introduces the "Search, Align, and Repair" data-driven program repair framework to automate feedback generation for introductory programming exercises. Distinct from existing techniques, our goal is to develop an efficient, fully automated, and problem-agnostic technique for large or MOOC-scale introductory programming courses. We leverage the large amount of available student submissions in such settings and develop new algorithms for identifying similar programs, aligning correct and incorrect programs, and repairing incorrect programs by finding minimal fixes. We have implemented our technique in the SARFGEN system and evaluated it on thousands of real student attempts from the Microsoft-DEV204.1x edX course and the Microsoft Code-Hunt platform. Our results show that SARFGEN can, within two seconds on average, generate concise, useful feedback for 89.7% of the incorrect student submissions. It has been integrated with the Microsoft-DEV204.1X edX class and deployed for production use.

关键词： Automatic Grading Computer-Aided Education Program Analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共125页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：