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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是971-980 订阅

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

详细简洁

排序：

Fine-grain multithreading with minimal compiler support - A cost effective approach to implementing efficient multithreading languages

Fine-grain multithreading with minimal compiler support - A ...

引用

sigplan 97 conference on programming language design and implementation

作者： Taura, K Yonezawa, A Univ of Tokyo Tokyo Japan

It is difficult to map the execution model of multithreading languages (languages which support fine-grain dynamic thread creation) onto the single stack execution model of C. Consequently, previous work on efficient multithreading uses elaborate frame formats and allocation strategy, with compilers customized for them. This paper presents an alternative cost-effective implementation strategy for multithreading languages which can maximally exploit current sequential C compilers. We identify a set of primitives whereby efficient dynamic thread creation and switch can be achieved and clarify implementation issues and solutions which work under the stack frame layout and calling conventions of current C compilers. The primitives are implemented as a C library and named StackThreads. In StackThreads, a thread creation is done just by a C procedure call, maximizing thread creation performance. When a procedure suspends an execution, the context of the procedure, which is roughly a stack frame of the procedure, is saved into heap and resumed later. With StackThreads, the compiler writer can straightforwardly translate sequential constructs of the source language into corresponding C statements or expressions, while using StackThreads primitives as a blackbox mechanism which switches execution between C procedures.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Maintaining the consistency of class libraries during their evolution

Maintaining the consistency of class libraries during their ...

引用

1997 acm sigplan conference on Object-Oriented programming Systems, languages and Applications (OOPSLA 97)

作者： Mezini, M Univ of Siegen Siegen Germany

Two important problems of object-oriented reuse are the propagation of design and implementation specifics of the base software to the inheritors, and the protection of the inheritors against changes in the base software. In this paper, we argue that the simple inheritance rules of existing object-oriented languages are not sufficient for properly dealing with these problems. In the proposal presented in this paper, programmers are enabled to make metalevel declarations of the internal protocols and dependencies of their classes. Additionally, changes of the base module are automatically monitored to filter out information about the alterations that may invalidate already existing inheritors. Based on these informations, the subclassing semantics is adjusted such that the maintenance of the base module properties and the protection of the inheritor is ensured during their integration. In this way, language support is provided for keeping the behavior of reusable software consistent during its evolution.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Module-sensitive program specialization

Module-sensitive program specialization

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Dussart, Dirk Heldal, Rogardt Hughes, John

We present an approach for specializing large programs, such as programs consisting of several modules, or libraries. This approach is based on the idea of using a compiler generator (cogen) for creating generating extensions. Generating extensions are specializers specialized with respect to some input program. When run on some input data the generating extension produces a specialized version of the input program. Here we use the cogen to tailor modules for specialization. This happens once and for all, independently of all other modules. The resulting module can then be used as a building block for generating extensions for complete programs, in much the same way as the original modules can be put together into complete programs. The result of running the final generating extension is a collection of residual modules, with a module structure derived from the original program.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Generational garbage collection and the radioactive decay model 97

Generational garbage collection and the radioactive decay mo...

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Clinger, William D. Hansen, Lars T. Northeastern Univ United States

ISBN: (纸本)9780897919074

If a fixed exponentially decreasing probability distribution function is used to model every object's lifetime, then the age of an object gives no information about its future life expectancy. This radioactive decay model implies there can be no rational basis for deciding which live objects should be promoted to another generation. Yet there remains a rational basis for deciding how many objects to promote, when to collect garbage, and which generations to collect. Analysis of the model leads to a new kind of generational garbage collector whose effectiveness does not depend upon heuristics that predict which objects will live longer than others. This result provides insight into the computational advantages of generational garbage collection, with implications for the management of objects whose life expectancies are difficult to predict.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Efficient formulation for optimal modulo schedulers

Efficient formulation for optimal modulo schedulers

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Eichenberger, Alexandre E. Davidson, Edward S. North Carolina State Univ Raleigh United States

Modulo scheduling algorithms based on optimal solvers have been proposed to investigate and tune the performance of modulo scheduling heuristics. While recent advances have broadened the scope for which the optimal approach is applicable, this approach increasingly suffers from large execution times. In this paper, we propose a more efficient formulation of the modulo scheduling space that significantly decreases the execution time of solvers based on integer linear programs. For example, the total execution time is reduced by a factor of 8.6 when 782 loops from the Perfect Club, SPEC, and Livermore Fortran Kernels are scheduled for minimum register requirements using the more efficient formulation instead of the traditional formulation. Experimental evidence further indicates that significantly larger loops can be scheduled under realistic machine constraints.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Near-optimal intraprocedural branch alignment 97

Near-optimal intraprocedural branch alignment

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Young, Cliff Johnson, David S. Karger, David R. Smith, Michael D. Harvard Univ Cambridge MA United States

ISBN: (纸本)9780897919074

Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We present a branch alignment algorithm that usually achieves the minimum possible pipeline penalty and on our benchmarks averages within 0.3% of a provable optimum. We compare the control penalties and running times of our algorithm to an older, greedy approach and observe that both the greedy method and our method are close to the lower bound on control penalties, suggesting that greedy is good enough. Surprisingly, in actual execution our method produces programs that run noticeably faster than the greedy method. We also report results from training and testing on different data sets, validating that our results can be achieved in real-world usage. Training and testing on different data sets slightly reduced the benefits from both branch alignment algorithms, but the ranking of the algorithms does not change, and the bulk of the benefits remain.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Automatic verification of pointer programs using monadic second-order logic

Automatic verification of pointer programs using monadic sec...

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Jensen, Jakob L. Jorgensen, Michael E. Klarlund, Nils Schwartzbach, Michael I. Univ of Aarhus Aarhus Denmark

We present a technique for automatic verification of pointer programs based on a decision procedure for the monadic second-order logic on finite strings. We are concerned with a while-fragment of Pascal, which includes recursively-defined pointer structures but excludes pointer arithmetic. We define a logic of stores with interesting basic predicates such as pointer equality, tests for nil pointers, and garbage cells, as well as reachability along pointers. We present a complete decision procedure for Hoare triples based on this logic over loop-free code. Combined with explicit loop invariants, the decision procedure allows us to answer surprisingly detailed questions about small but non-trivial programs. If a program fails to satisfy a certain property, then we can automatically supply an initial store that provides a counterexample. Our technique has been fully and efficiently implemented for linear linked lists, and it extends in principle to tree structures. The resulting system can be used to verify extensive properties of smaller pointer programs and could be particularly useful in a teaching environment.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

The undergraduate capstone software design experience

The undergraduate capstone software design experience

引用

1997 conference on TRI-Ada, TRI-Ada 1997

作者： Blair, Jean R. S. Ressler, Eugene K. Wagner, Thomas D. Department of Electrical Engineering and Computer Science United States Military Academy West PointNY10996 United States

ISBN: (纸本)0897919815

Ada 95 is being used as the implementation language for a senior level compiler design course at the United States Military Academy. This paper describes experiences and lessons learned as well as the scenario based approach for a large object oriented compiler project in that course. The term-long compiler project gives the students experience as a part of a (fictitious) design- implementation team building a production compiler. Ada 95 is compared to Pascal and C++ for the same course and positive and negative aspects of the three languages are described. © 1997 acm.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Dynamic feedback: An effective technique for adapting computing

Dynamic feedback: An effective technique for adapting comput...

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Diniz, Pedro Rinard, Martin Univ of California Santa Barbara Santa Barbara United States

This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produces several different versions of the same source code;each version uses a different optimization policy. The generated code alternately performs sampling phases and production phases. Each sampling phase measures the overhead of each version in the current environment. Each production phase uses the version with the least overhead in the previous sampling phase. The computation periodically resamples to adjust dynamically to changes in the environment. We have implemented dynamic feedback in the context of a parallelizing compiler for object-based programs. The generated code uses dynamic feedback to automatically choose the best synchronization optimization policy. Our experimental results show that the synchronization optimization policy has a significant impact on the overall performance of the computation, that the best policy varies from program to program, that the compiler is unable to statically choose the best policy, and that dynamic feedback enables the generated code to exhibit performance that is comparable to that of code that has been manually tuned to use the best policy. We have also performed a theoretical analysis which provides, under certain assumptions, a guaranteed optimality bound for dynamic feedback relative to a hypothetical (and unrealizable) optimal algorithm that uses the best policy at every point during the execution.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Exploiting hardware performance counters with flow and context sensitive profiling 97

Exploiting hardware performance counters with flow and conte...

引用

proceedings of the 1997 acm SIGPLAM conference on programming language design and implementation, PLDI

作者： Ammons, Glenn Ball, Thomas Larus, James R. Univ of Wisconsin-Madison Madison WI United States

ISBN: (纸本)9780897919074

A program profile attributes run-time costs to portions of a program's execution. Most profiling systems suffer from two major deficiencies: first, they only apportion simple metrics, such as execution frequency or elapsed time to static, syntactic units, such as procedures or statements;second, they aggressively reduce the volume of information collected and reported, although aggregation can hide striking differences in program behavior. This paper addresses both concerns by exploiting the hardware counters available in most modern processors and by incorporating two concepts from data flow analysis-flow and context sensitivity-to report more context for measurements. This paper extends our previous work on efficient path profiling to flow sensitive profiling, which associates hardware performance metrics with a path through a procedure. In addition, it describes a data structure, the calling context tree, that efficiently captures calling contexts for procedure-level measurements. Our measurements show that the SPEC95 benchmarks execute a small number (3-28) of hot paths that account for 9-98% of their L1 data cache misses. Moreover, these hot paths are concentrated in a few routines, which have complex dynamic behavior.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共126页 << < 94 95 96 97 98 99 100 101 102 103 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：