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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

783 篇 会议
135 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

806 篇 工学
- 792 篇 软件工程
- 529 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 12 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 生物工程
- 2 篇 安全科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 纺织科学与工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
99 篇 理学
- 84 篇 数学
- 10 篇 系统科学
- 8 篇 统计学（可授理学、...
- 4 篇 化学
- 3 篇 物理学
- 3 篇 生物学
- 1 篇 地质学
52 篇 管理学
- 35 篇 管理科学与工程(可...
- 23 篇 工商管理
- 20 篇 图书情报与档案管...
6 篇 经济学
- 6 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

164 篇 design
155 篇 languages
96 篇 performance
70 篇 computer program...
56 篇 algorithms
43 篇 experimentation
42 篇 computer program...
39 篇 verification
34 篇 reliability
32 篇 object oriented ...
27 篇 probabilistic pr...
26 篇 java programming...
26 篇 functional progr...
25 篇 program synthesi...
22 篇 java
19 篇 theory
19 篇 concurrency
18 篇 domain-specific ...
17 篇 compilers
17 篇 type systems

机构

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

作者

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

语言

841 篇 英文
76 篇 其他
1 篇 中文

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

共 918 条记录，以下是671-680 订阅

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

详细简洁

排序：

Field analysis: Getting useful and low-cost interprocedural information

Field analysis: Getting useful and low-cost interprocedural ...

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Ghemawat, S Randall, KH Scales, DJ Google Inc. Mountain View CA 94043 2400 Bayshore Parkway United States

We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as object-oriented programming, automatic memory management, and run-time checks required for type safety. Unlike many previous interprocedural analyses, our analysis is cheap, and does not require access to the entire program. Field analysis exploits the declared access restrictions placed on fields in a modular language (e.g. field access modifiers in Java) in order to determine useful properties of fields of an object, We describe our implementation of field analysis in the Swift optimizing compiler for Java, as well a set of optimizations that exploit the results of field analysis. These optimizations include removal of run-time tests, compile-time resolution of method calls, object inlining, removal of unnecessary synchronization, and stack allocation. Our results demonstrate that field analysis is efficient and effective. Speedups average 7% on a wide range of applications, with some times reduced by up to 27%. Compile time overhead of field analysis is about 10%.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

A single intermediate language that supports multiple implementations of exceptions

A single intermediate language that supports multiple implem...

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Ramsey, N Jones, SP Harvard Univ Cambridge MA 02138 USA

We present mechanisms that enable our compiler-target language, C--, to express four of the best known techniques for implementing exceptions, all within a single, uniform framework. We define the mechanisms precisely, using a formal operational semantics. We also show that exceptions need not require special treatment in the optimizer;by introducing extra dataflow edges, we make standard optimization techniques work even on programs that use exceptions. Our approach clarifies the design space of exception-handling techniques, and it allows a single optimizer to handle a variety of implementation techniques. Our ultimate goal is to allow a source-language compiler the freedom to choose its exception-handling policy, while encapsulating the architecture-dependent mechanisms and their optimization in an implementation of C-- that can be used by compilers for many source languages.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Optimal instruction scheduling using integer programming 00

Optimal instruction scheduling using integer programming

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Wilken, K Liu, J Heffernan, M Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

ISBN: (纸本)9781581131994

This paper presents a new approach to focal instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very large basic blocks. The new approach first uses a set of graph transformations to simplify the data-dependency graph while preserving the optimality of the final schedule. The simplified graph results in a simplified integer program which can be solved much faster. A new integer-programming formulation is then applied to the simplified graph. Various techniques are used to simplify the formulation, resulting in fewer integer-program variables, fever integer-program constraints and fewer terms in some of the remaining constraints, thus reducing integer-program solution time. The new formulation also uses certain adaptively added constraints (cuts) to reduce solution time. The proposed optimal instruction scheduler is built within the Gnu Compiler Collection (GCC) and is evaluated experimentally using the SPEC95 floating point benchmarks. Although optimal scheduling for the target processor is considered intractable, all of the benchmarks' basic blocks are optimally scheduled, including blocks with up to 1000 instructions, while total compile time increases by only 14%.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Dynamo: A transparent dynamic optimization system

Dynamo: A transparent dynamic optimization system

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Bala, V Duesterwald, E Banerjia, S Hewlett Packard Labs Cambridge MA 02142 USA

We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stream as it executes on the processor. The input native instruction stream to Dynamo can be dynamically generated (by a JIT for example), or it can come from the execution of a statically compiled native binary. This paper evaluates the Dynamo system in the latter, more challenging situation, in order to emphasize the limits, rather than the potential, of the system. Our experiments demonstrate that even statically optimized native binaries can be accelerated Dynamo, and often by a significant degree. For example, the average performance of -O optimized SpecInt95 benchmark binaries created by the HP product C compiler is improved to a level comparable to their -O4 optimized version running without Dynamo. Dynamo achieves this by focusing its efforts on optimization opportunities that tend to manifest only at runtime, and hence opportunities that might be difficult for a static compiler to exploit. Dynamo's operation is transparent in the sense that it does not depend on any user annotations or binary instrumentation, and does not require multiple runs, or any special compiler, operating system or hardware support. The Dynamo prototype presented here is a realistic implementation running on an HP PA-8000 workstation under the HPUX 10.20 operating system.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Type-based race detection for Java

Type-based race detection for Java

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Flanagan, C Freund, SN Compaq Syst Res Ctr Palo Alto CA 94301 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA

This paper presents a static race detection analysis for multithreaded Java programs. Our analysis is based on a formal type system that is capable of capturing many common synchronization patterns. These patterns include classes with internal synchronization, classes that require client-side synchronization, and thread-local classes. Experience checking over 40,000 lines of Java code with the type system demonstrates that it is an effective approach for eliminating races conditions. On large examples, fewer than 20 additional type annotations per 1000 lines of code were required by the type checker, and pie found a number of races in the standard Java libraries and other test programs.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation

Modular interprocedural pointer analysis using access paths:...

引用

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

作者： Cheng, B.-C. Hwu, W.W. Sun Microsystems Palo Alto CA 94303 United States

In this paper we present a modular interprocedural pointer analysis algorithm based on access-paths for C programs. We argue that access paths can reduce the overhead of representing context-sensitive transfer functions and effectively distinguish non-recursive heap objects. And when the modular analysis paradigm is used together with other techniques to handle type casts and function pointers, we are able to handle significant programs like those in the SPECcint92 and SPECcint95 suites. We have implemented the algorithm and tested it on a Pentium II 450 PC running Linux. The observed resource consumption and performance improvement are very encouraging.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

A framework for interprocedural optimization in the presence of dynamic class loading

A framework for interprocedural optimization in the presence...

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Sreedhar, VC Burke, M Choi, JD IBM TJ Watson Res Ctr Yorktown Heights NY 10598 USA

Dynamic class loading during program execution in the Java(TM) programming language is an impediment for generating code that is as efficient as code generated using static whole-program analysis and optimization. Whole-program analysis and optimization is possible for languages, such as C++, that do not allow new classes and/or methods to be loaded during program execution. One solution for performing whole-program analysis and avoiding incorrect execution after a new class is loaded is to invalidate and recompile affected methods. Runtime invalidation and recompilation mechanisms can be expensive in both space and time, and, therefore, generally restrict optimization. To address these drawbacks, we propose a new framework, called the errant analysis framework, for interprocedural optimization of programs that support dynamic class (or method) loading. Given a set of classes comprising the closed world, we perform an offline static analysis which partitions references into two categories: (1) unconditionally extant references which point only to objects whose runtime type is guaranteed to be in the closed world;and (2) conditionally extant references which point to objects whose runtime type is not guaranteed to be in the closed world. Optimizations solely dependent on the first category can be statically performed, and are guaranteed to be correct even with any future class/method loading. Optimizations dependent on the second category are guarded by dynamic tests, called extane safety tests, for correct execution behavior. We describe the properties for extant safety tests, and provide algorithms for their generation and placement.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

ABCD:: Eliminating array bounds checks on demand

<i>ABCD</i>:: Eliminating array bounds checks on demand

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Bodik, R Gupta, R Sarkar, V Univ Wisconsin Madison WI 53706 USA Univ Arizona Tucson AZ 85721 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA

To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because array-bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or instruction scheduling of memory operations. Furthermore, because it is not expressible at bytecode level, the elimination of bounds checks can only be performed at run time, after the bytecode program is loaded. Using existing powerful bounds-check optimizers at run time is not feasible, however, because they are too heavyweight for the dynamic compilation setting. ABCD is a light-weight algorithm for elimination of Array Bounds Checks on Demand. Its design emphasizes simplicity and efficiency. In essence, ABCD works by adding a few edges to the SSA value graph and performing a simple traversal of the graph. Despite its simplicity, ABCD is surprisingly powerful. On our benchmarks, ABCD removes on average 45% of dynamic bound check instructions, sometimes achieving near-ideal optimization. The efficiency of ABCD stems from two factors. First, ABCD works on a sparse representation. As a result, it requires on average fewer than 10 simple analysis steps per bounds check. Second, ABCD is demand-driven. It can be applied to a set of frequently executed (hot) bounds checks, which makes it suitable for the dynamic-compilation setting, in which compile-time cost is constrained but hot statements are known.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

A generational on-the-fly garbage collector for Java

A generational on-the-fly garbage collector for Java

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Domani, T Kolodner, EK Petrank, E Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications running on multiprocessor servers, where it is important to fully utilize all processors and provide even response time, especially for systems for which stopping the threads is a costly operation. In this work, we report on the incorporation of generations into an on-the-fly garbage collector. The incorporation is non-trivial since an on-the-fly collector avoids explicit synchronization with the program threads. To the best of our knowledge, such an incorporation has not been tried before. We have implemented the collector for a prototype Java Virtual Machine on AIX, and measured its performance on a 4-way multiprocessor. As for other generational collectors, an on-the-fly generational collector has the potential for reducing the overall running time and working set of an application by concentrating collection efforts on the young objects. However, in contrast to other generational collectors, on-the-fly collectors do not move the objects;thus, there is no segregation between the old and the young objects. Furthermore, on-the-fly collectors do not stop the threads, so there is no extra benefit for the short pauses obtained by generational collection. Nevertheless, comparing our on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications. The best reduction in overall running time for the benchmarks we measured was 25%. However, there were some benchmarks for which it had no effect and one for which the overall running time increased by 4%.

关键词： programming languages memory management garbage collection generational garbage collection

来源：评论

学校读者我要写书评

暂无评论

An automatic object inlining optimization and its evaluation

An automatic object inlining optimization and its evaluation

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Dolby, J Chien, AA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA

Automatic object inlining [19, 20] transforms heap data structures by fusing parent and child objects together. It can improve runtime by reducing object allocation and pointer dereference costs. We report continuing work studying object inlining optimizations. In particular, we present a new semantic derivation of the correctness conditions for object inlining, and program analysis which extends our previous work. And we present an object inlining transformation, focusing on a new algorithm which optimizes class field layout to minimize code expansion. Finally, we detail a fuller evaluation on eleven programs and libraries (including Xpdf, the 25,000 line Portable Document Format (PDF) file browser) that utilizes hardware measures of impact on the memory system. We show that our analysis scales effectively to large programs, finding many inlinable fields (45 in xpdf) at acceptable cost, and we show that, on some programs, it finds nearly all fields for which object inlining is correct, and averages 40% of such fields across our benchmarks. We implement our analyses in an advanced analysis infrastructure, and we show that, compared to traditional 1-CFA, that infrastructure provides better results and lower and more scalable cost. Across all programs, analysis identified about 30% of objects as inlinable on average. Our transformation increases code size by only 20% while inlining this 30% of fields. Inlining these objects eliminated on average 28% of field reads, 58% of object creations, 12% of all loads. Further, the optimized programs have significantly improved memory reference behavior, producing 25% fewer L1 data cache misses and 25% fewer read stalls. On average the runtime improved by 14%.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 64 65 66 67 68 69 70 71 72 73 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：