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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,078 篇 会议
132 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,046 篇 工学
- 982 篇 软件工程
- 752 篇 计算机科学与技术...
- 44 篇 控制科学与工程
- 42 篇 电气工程
- 32 篇 信息与通信工程
- 9 篇 电子科学与技术（可...
- 8 篇 机械工程
- 5 篇 土木工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 3 篇 生物工程
- 2 篇 光学工程
- 2 篇 冶金工程
- 2 篇 农业工程
126 篇 理学
- 106 篇 数学
- 12 篇 系统科学
- 8 篇 统计学（可授理学、...
- 5 篇 物理学
- 5 篇 生物学
- 4 篇 化学
81 篇 管理学
- 48 篇 管理科学与工程(可...
- 36 篇 图书情报与档案管...
- 26 篇 工商管理
12 篇 教育学
- 12 篇 教育学
6 篇 经济学
- 6 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
100 篇 computer program...
96 篇 performance
57 篇 algorithms
49 篇 computer program...
47 篇 object oriented ...
43 篇 experimentation
39 篇 verification
35 篇 java programming...
34 篇 reliability
29 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
17 篇 compilers
17 篇 type systems

机构

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
8 篇 sarkar vivek
7 篇 august david i.
7 篇 bacon david f.
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,132 篇 英文
77 篇 其他
1 篇 中文

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

共 1210 条记录，以下是1151-1160 订阅

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

详细简洁

排序：

Insight - Reverse Engineer Case Tool 99

Insight - Reverse Engineer Case Tool

引用

1999 International conference on Softeare Engineering

作者： Norman Rajala Djenana Campara Nikolai Mansurov SW Development Management NORTEL P.O. Box 3511 Station C Ottawa ON Canada K1Y 4H7 Head of Department Inst. for System Programming 25 B. Kommunisticheskaya 109004 Moscow Russia

ISBN: (纸本)9781581130744

building upon existing software systems while maintaining or improving software quality is a major goal of software engineering. To achieve this, every software engineering phase (requirements analysis, software design, implementation, testing and maintenance) must produce good quality outputs for the next phase. We believe that a next generation reverse engineering tool can assist in realizing this need.

关键词： Reverse Engineer, Software Maintenance

来源：评论

学校读者我要写书评

暂无评论

An implementation of complete, asynchronous, distributed garbage collection 98

An implementation of complete, asynchronous, distributed gar...

引用

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

作者： Fabrice Le Fessant Ian Piumarta Marc Shapiro INRIA Roquencourt B.P. 105 78153 Le Chesnay Cedex France

ISBN: (纸本)9780897919876

Most existing reference-based distributed object systems include some kind of acyclic garbage collection, but fail to provide acceptable collection of cyclic garbage. Those that do provide such GC currently suffer from one or more problems: synchronous operation, the need for expensive global consensus or termination algorithms, susceptibility to communication problems, or an algorithm that does not scale. We present a simple, complete, fault-tolerant, asynchronous extension to the (acyclic) cleanup protocol of the SSP Chains system. This extension is scalable, consumes few resources, and could easily be adapted to work in other reference-based distributed object systems---rendering them usable for very large-scale applications.

关键词： storage management distributed object systems garbage collection reference tracking

来源：评论

学校读者我要写书评

暂无评论

Aggressive inlining 97

Aggressive inlining

引用

proceedings of the acm sigplan 1997 conference on programming language design and implementation

作者： Andrew Ayers Richard Schooler Robert Gottlieb Hewlett-Packard Massachusetts Language Laboratory 300 Apollo Drive Chelmsford MA

ISBN: (纸本)9780897919074

Existing research understates the benefits that can be obtained from inlining and cloning, especially when guided by profile information. Our implementation of inlining and cloning yields excellent results on average and very rarely lowers performance. We believe our good results can be explained by a number of factors: inlining at the intermediate-code level removes most technical restrictions on what can be inlined; the ability to inline across files and incorporate profile information enables us to choose better inline candidates; a high-quality back end can exploit the scheduling and register allocation opportunities presented by larger subroutines; an aggressive processor architecture benefits from more predictable branch behavior; and a large instruction cache mitigates the impact of code expansion. We describe the often dramatic impact of our inlining and cloning on performance: for example, the implementations of our inlining and cloning algorithms in the HP-UX 10.20 compilers boost SPECint95 performance on a PA8000-based workstation by a factor of 1.32.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An expert system application in semicustom VLSI design 87

An expert system application in semicustom VLSI design

引用

proceedings of the 24th acm/IEEE design Automation conference

作者： R. L. Steele NCR Microelectronics 2001 Danfield Court Fort Collins Colorado

ISBN: (纸本)9780818607813

This paper describes the implementation of a prototype expert system that provides standard cell design advice in the areas of performance, manufacturability, testability, and overall design quality, from a netlist description of an application specific integrated circuit (ASIC) *** system is currently being developed on a Symbolics Lisp Machine using a hybrid AI programming language, called Proteus. The language integrates both known and novel AI programming techniques into a robust vehicle for the implementation of knowledge-based *** representation schemes, inference mechanisms, and knowledge acquisition techniques will be presented, including representative examples from within the knowledge base.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Æminium: a permission based concurrent-by-default programming language approach 14

Æminium: a permission based concurrent-by-default programmi...

引用

proceedings of the 35th acm sigplan conference on programming language design and implementation

作者： Sven Stork Karl Naden Joshua Sunshine Manual Mohr Alcides Fonseca Paulo Marques Jonathan Aldrich Carnegie Mellon University Karlsruhe Institute of Technology University of Coimbra

ISBN: (纸本)9781450327848

The aim of ÆMINIUM is to study the implications of having a concurrent-by-default programming language. This includes language design, runtime system, performance and software engineering *** conduct our study through the design of the concurrent-by-default ÆMINIUM programming language. ÆMINIUM leverages the permission flow of object and group permissions through the program to validate the program's correctness and to automatically infer a possible parallelization strategy via a dataflow graph. ÆMINIUM supports not only fork-join parallelism but more general dataflow patterns of *** this paper we present a formal system, called μÆMINIUM, modeling the core concepts of ÆMINIUM. μÆMINIUM's static type system is based on Featherweight Java with ÆMINIUM-specific extensions. Besides checking for correctness ÆMINIUM's type system it also uses the permission flow to compute a potential parallel execution strategy for the program. μÆMINIUM's dynamic semantics use a concurrent-by-default evaluation approach. Along with the formal system we present its soundness *** provide a full description of the implementation along with the description of various optimization techniques we used. We implemented ÆMINIUM as an extension of the Plaid programming language, which has first-class support for permissions built-in. The ÆMINIUM implementation and all case studies are publicly available under the General Public *** use various case studies to evaluate ÆMINIUM's applicability and to demonstrate that ÆMINIUM parallelized code has performance improvements compared to its sequential counterpart. We chose to use case studies from common domains or problems that are known to benefit from parallelization, to show that ÆMINIUM is powerful enough to encode them. We demonstrate through a webserver application, which evaluates ÆMINIUM's impact on latency-bound applications, that ÆMINIUM can achieve a 70% performance improvement over the sequential counterp

关键词： concurrency access permissions permissions data groups

来源：评论

学校读者我要写书评

暂无评论

Efficient and precise datarace detection for multithreaded object-oriented programs 02

Efficient and precise datarace detection for multithreaded o...

引用

proceedings of the acm sigplan 2002 conference on programming language design and implementation

作者： Jong-Deok Choi Keunwoo Lee Alexey Loginov Robert O'Callahan Vivek Sarkar Manu Sridharan IBM T. J. Watson Research Center Univ. of Washington Univ. of Wisconsin - Madison MIT

ISBN: (纸本)9781581134636

We present a novel approach to dynamic datarace detection for multithreaded object-oriented programs. Past techniques for on-the-fly datarace detection either sacrificed precision for performance, leading to many false positive datarace reports, or maintained precision but incurred significant overheads in the range of 3x to 30x. In contrast, our approach results in very few false positives and runtime overhead in the 13% to 42% range, making it both efficient and precise. This performance improvement is the result of a unique combination of complementary static and dynamic optimization techniques.

关键词： debugging multithreaded programming synchronization race conditions object-oriented programming dataraces parallel programs static-dynamic co-analysis

来源：评论

学校读者我要写书评

暂无评论

Teapot: language support for writing memory coherence protocols 96

Teapot: language support for writing memory coherence protoc...

引用

proceedings of the acm sigplan 1996 conference on programming language design and implementation

作者： Satish Chandra Brad Richards James R. Larus Computer Sciences Department University of Wisconsin-Madison 1210 West Dayton St. Madison WI

ISBN: (纸本)9780897917957

Recent shared-memory parallel computer systems offer the exciting possibility of customizing memory coherence protocols to fit an application's semantics and sharing patterns. Custom protocols have been used to achieve message-passing performance---while retaining the convenient programming model of a global address space---and to implement high-level language constructs. Unfortunately, coherence protocols written in a conventional language such as C are difficult to write, debug, understand, or modify. This paper describes Teapot, a small, domain-specific language for writing coherence protocols. Teapot uses continuations to help reduce the complexity of writing protocols. Simple static analysis in the Teapot compiler eliminates much of the overhead of continuations and results in protocols that run nearly as fast as hand-written C code. A Teapot specification can be compiled both to an executable coherence protocol and to input for a model checking system, which permits the specification to be verified. We report our experiences coding and verifying several protocols written in Teapot, along with measurements of the overhead incurred by writing a protocol in a higher-level language.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The implementation and evaluation of fusion and contraction in array languages 98

The implementation and evaluation of fusion and contraction ...

引用

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

作者： E. Christopher Lewis Calvin Lin Lawrence Snyder University of Washington Seattle WA University of Texas Austin TX

ISBN: (纸本)9780897919876

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

pHluid: the design of a parallel functional language implementation on workstations 96

pHluid: the design of a parallel functional language impleme...

引用

proceedings of the first acm sigplan international conference on Functional programming

作者： Cormac Flanagan Rishiyur S. Nikhil Rice University Department of Computer Science Houston Texas Digital Equipment Corp. Cambridge Research Laboratory One Kendall Square Bldg. 700 Cambridge Massachusetts

ISBN: (纸本)9780897917704

This paper describes the distributed memory implementation of a shared memory parallel functional language. The language is Id, an implicitly parallel, mostly functional language that is currently evolving into a dialect of Haskell. The target is a distributed memory machine, because we expect these to be the most widely available parallel platforms in the future. The difficult problem is to bridge the gap between the shared memory language model and the distributed memory machine model. The language model assumes that all data is uniformly accessible, whereas the machine has a severe memory hierarchy: a processor's access to remote memory (using explicit communication) is orders of magnitude slower than its access to local memory. Thus, avoiding communication is crucial for good performance. The Id language, and its general dataflow-inspierd compilation to multithreaded code are described elsewhere. In this paper, we focus on our new parallel runtime system and its features for avoiding communication and for tolerating its latency when necessary: multithreading, scheduling and load balancing; the distributed heap model and distributed coherent cacheing, and parallel garbage collection. We have completed the first implementation, and we present some preliminary performance mearsurements.

关键词： data flow parallel and distributed implementations garbage collection and run-time systems

来源：评论

学校读者我要写书评

暂无评论

Compiler support for garbage collection in a statically typed language 92

Compiler support for garbage collection in a statically type...

引用

proceedings of the acm sigplan 1992 conference on programming language design and implementation

作者： Amer Diwan Eliot Moss Richard Hudson

ISBN: (纸本)9780897914758

We consider the problem of supporting compacting garbage collection in the presence of modern compiler optimizations. Since our collector may move any heap object, it must accurately locate, follow, and update all pointers and values derived from pointers. To assist the collector, we extend the compiler to emit tables describing live pointers, and values derived from pointers, at each program location where collection may occur. Significant results include identification of a number of problems posed by optimizations, solutions to those problems, a working compiler, and experimental data concerning table sizes, table compression, and time overhead of decoding tables during collection. While gc support can affect the code produced, our sample programs show no significant changes, the table sizes are a modest fraction of the size of the optimized code, and stack tracing is a small fraction of total gc time. Since the compiler enhancements are also modest, we conclude that the approach is practical.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共121页 << < 112 113 114 115 116 117 118 119 120 121 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：