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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,120 篇 会议
137 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

1,082 篇 工学
- 1,011 篇 软件工程
- 776 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 42 篇 电气工程
- 40 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
132 篇 理学
- 112 篇 数学
- 13 篇 系统科学
- 8 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 物理学
- 4 篇 化学
88 篇 管理学
- 52 篇 管理科学与工程(可...
- 40 篇 图书情报与档案管...
- 29 篇 工商管理
13 篇 教育学
- 13 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
5 篇 法学
- 4 篇 社会学
- 1 篇 法学
2 篇 农学
- 2 篇 作物学

主题

185 篇 design
173 篇 languages
102 篇 performance
96 篇 computer program...
62 篇 algorithms
50 篇 computer program...
47 篇 object oriented ...
46 篇 experimentation
43 篇 java programming...
40 篇 verification
35 篇 reliability
32 篇 functional progr...
31 篇 java
26 篇 program synthesi...
24 篇 probabilistic pr...
21 篇 domain-specific ...
20 篇 measurement
20 篇 concurrency
19 篇 theory
19 篇 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 篇 mit cambridge ma...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
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 篇 felleisen matthi...
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,176 篇 英文
81 篇 其他
1 篇 中文

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

共 1258 条记录，以下是941-950 订阅

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

详细简洁

排序：

Fast, effective code generation in a just-in-time Java compiler 98

Fast, effective code generation in a just-in-time Java compi...

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Adl-Tabatabai, Ali-Reza Cierniak, Michal Lueh, Guei-Yuan Parikh, Vishesh M. Stichnoth, James M. Intel Corp Santa Clara CA United States

ISBN: (纸本)9780897919876

A `Just-In-Time' (JIT) Java compiler produces native code from Java byte code instructions during program execution. As such, compilation speed is more important in a Java JIT compiler than in a traditional compiler, requiring optimization algorithms to be lightweight and effective. We present the structure of a Java JIT compiler for the Intel Architecture, describe the lightweight implementation of JIT compiler optimizations (e.g., common subexpression elimination, register allocation, and elimination of array bounds checking), and evaluate the performance benefits and tradeoffs of the optimizations. This JIT compiler has been shipped with version 2.5 of Intel's VTune for Java product.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Memory management with explicit regions

Memory management with explicit regions

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Gay, David Aiken, Alex Univ of California Berkeley United States

Much research has been devoted to studies of and algorithms for memory management based on garbage collection or explicit allocation and deallocation. An alternative approach, region-based memory management, has been known for decades, but has not been well-studied. In a region-based system each allocation specifies a region, and memory is reclaimed by destroying a region, freeing all the storage allocated therein. We show that on a suite of allocation-intensive C programs, regions are competitive with malloc/free and sometimes substantially faster. We also show that regions support safe memory management with low overhead. Experience with our benchmarks suggests that modifying many existing programs to use regions is not difficult.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Automatically closing open reactive programs

Automatically closing open reactive programs

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Colby, Christopher Godefroid, Patrice Jagadeesan, Lalita Jategaonkar Loyola Univ Chicago Chicago United States

We study in this paper the problem of analyzing implementations of open systems - systems in which only some of the components are present. We present an algorithm for automatically dosing an open concurrent reactive system with its most general environment, i.e., the environment that can provide any input at any time to the system. The result is a nondeterministic closed (i.e., self-executable) system which can exhibit all the possible reactive behaviors of the original open system. These behaviors can then be analyzed using VeriSoft, an existing tool for systematically exploring the state spaces of closed systems composed of multiple (possibly nondeterministic) processes executing arbitrary code. We have implemented the techniques introduced in this paper in a prototype tool for automatically closing open programs written in the C programming language. We discuss preliminary experimental results obtained with a large telephone-switching software application developed at Lucent Technologies.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

implementation of the Cilk-5 multithreaded language

Implementation of the Cilk-5 multithreaded language

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Frigo, Matteo Leiserson, Charles E. Randall, Keith H. MIT Lab for Computer Science Cambridge MA United States

The fifth release of the multithreaded language Cilk uses a provably good `work-stealing' scheduling algorithm similar to the first system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided by a clear strategy that arose from a theoretical analysis of the scheduling algorithm: concentrate on minimizing overheads that contribute to the work, even at the expense of overheads that contribute to the critical path. Although it may seem counterintuitive to move overheads onto the critical path, this `work-first' principle has led to a portable Cilk-5 implementation in which the typical cost of spawning a parallel thread is only between 2 and 6 times the cost of a C function call on a variety of contemporary machines. Many Cilk programs run on one processor with virtually no degradation compared to equivalent C programs. This paper describes how the work-first principle was exploited in the design of Cilk-5's compiler and its runtime system. In particular, we present Cilk-5's novel `two-clone' compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

implementation and evaluation of fusion and contraction in array languages

Implementation and evaluation of fusion and contraction in a...

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Lewis, E.Christopher Lin, Calvin Snyder, Lawrence Univ of Washington Seattle WA United States

Array languages such as Fortran 90, HPF and ZPL have many benefits in simplifying array-based computations and expressing data parallelism. However, they can suffer large performance penalties because they introduce intermediate arrays - both at the source level and during the compilation process - which increase memory usage and pollute the cache. Most compilers address this problem by simply scalarizing the array language and relying on a scalar language compiler to perform loop fusion and array contraction. We instead show that there are advantages to performing a form of loop fusion and array contraction at the array level. This paper describes this approach and explains its advantages. Experimental results show that our scheme typically yields runtime improvements of greater than 20% and sometimes up to 400%. In addition, it yields superior memory use when compared against commercial compilers and exhibits comparable memory use when compared with scalar languages. We also explore the interaction between these transformations and communication optimizations.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

Study of dead data members in C++ applications

Study of dead data members in C++ applications

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Sweeney, Peter P. Tip, Frank IBM Thomas J. Watson Research Cent Yorktown Heights United States

Object-oriented applications may contain data members that can be removed from the application without affecting program behavior. Such `dead' data members may occur due to unused functionality in class libraries, or due to the programmer losing track of member usage as the application changes over time. We present a simple and efficient algorithm for detecting dead data members in C++ applications. This algorithm has been implemented using a prototype version of the IBM VisualAge C++ compiler, and applied to a number of realistic benchmark programs ranging from 600 to 58,000 lines of code. For the non-trivial benchmarks, we found that up to 27.3% of the data members in the benchmarks are dead (average 12.5%), and that up to 11.6% of the object space of these applications may be occupied by dead data members at run-time (average 4.4%).

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Communication optimizations for parallel C programs 98

Communication optimizations for parallel C programs

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Zhu, Yingchun Hendren, Laurie J. McGill Univ Montreal Que Canada

ISBN: (纸本)9780897919876

This paper presents algorithms for reducing the communication overhead for parallel C programs that use dynamically-allocated data structures. The framework consists of an analysis phase called possible-placement analysis, and a transformation phase called communication selection. The fundamental idea of possible-placement analysis is to find all possible points for insertion of remote memory operations. Remote reads are propagated upwards, whereas remote writes are propagated downwards. Based on the results of the possible-placement analysis, the communication selection transformation selects the `best' place for inserting the communication, and determines if pipelining or blocking of communication should be performed. The framework has been implemented in the EARTH-McCAT optimizing/parallelizing C compiler, and experimental results are presented for five pointer-intensive benchmarks running on the EARTH-MANNA distributed-memory parallel architecture. These experiments show that the communication optimization can provide performance improvements of up to 16% over the unoptimized benchmarks.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Proper tail recursion and space efficiency 98

Proper tail recursion and space efficiency

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Clinger, William D. Northeastern Univ Boston MA United States

ISBN: (纸本)9780897919876

The IEEE/ANSI standard for Scheme requires implementations to be properly tail recursive. This ensures that portable code can rely upon the space efficiency of continuation-passing style and other idioms. On its face, proper tail recursion concerns the efficiency of procedure calls that occur within a tall context. When examined closely, proper tail recursion also depends upon the fact that garbage collection can be asymptotically more space-efficient than Algol-like stack allocation. Proper tail recursion is not the same as ad hoc tail call optimization in stack-based languages. Proper tail recursion often precludes stack allocation of variables, but yields a well-defined asymptotic space complexity that can be relied upon by portable programs. This paper offers a formal and implementation-independent definition of proper tail recursion for Scheme. It also shows how an entire family of reference implementations can be used to characterize related safe-for-space properties, and proves the asymptotic inequalities that hold between them.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Run-time code generation and modal-ML 98

Run-time code generation and modal-ML

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Wickline, Philip Lee, Peter Pfenning, Frank Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897919876

This paper presents a typed programming language and compiler for run-time code generation. The language, called ML, extends ML with modal operators in the style of the Mini-MLe language of Davies and Pfenning. ML allows programmers to use types to specify precisely the stages of computation in a program. The types also guide the compiler in generating target code that exploits the staging information through the use of run-time code generation. The target machine is currently a version of the Categorical Abstract Machine, called the CCAM, which we have extended with facilities for run-time code generation. This approach allows the programmer to express the staging that he wants directly to the compiler. It also provides a typed framework in which to verify the correctness of his staging intentions, and to discuss his staging decisions with other programmers. Finally, it supports in a natural way multiple stages of run-time specialization, so that dynamically generated code can be used in the generation of yet further specialized code. This paper presents an overview of the language, with several examples of programs that illustrate key concepts and programming techniques. Then, it discusses the CCAM and the compilation of ML programs into CCAM code. Finally, the results of some experiments are shown, to demonstrate the benefits of this style of run-time code generation for some applications.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Using integer sets for data-parallel program analysis and optimization

Using integer sets for data-parallel program analysis and op...

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Adve, Vikram Mellor-Crummey, John Rice Univ Houston United States

In this paper, we describe our experience with using an abstract integer-set framework to develop the Rice dHPF compiler, a compiler for High Performance Fortran. We present simple, yet general formulations of the major computation partitioning and communication analysis tasks as well as a number of important optimizations in terms of abstract operations on sets of integer tuples. This approach has made it possible to implement a comprehensive collection of advanced optimizations in dHPF, and to do so in the context of a more general computation partitioning model than previous compilers. One potential limitation of the approach is that the underlying class of integer set problems is fundamentally unable to represent HPF data distributions on a symbolic number of processors. We describe how we extend the approach to compile codes for a symbolic number of processors, without requiring any changes to the set formulations for the above optimizations. We show experimentally that the set representation is not a dominant factor in compile times on both small and large codes. Finally, we present preliminary performance measurements to show that the generated code achieves good speedups for a few benchmarks. Overall, we believe we are the first to demonstrate by implementation experience that it is practical to build a compiler for HPF using a general and powerful integer-set framework.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 91 92 93 94 95 96 97 98 99 100 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：