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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

774 篇 会议
129 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

801 篇 工学
- 787 篇 软件工程
- 527 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 11 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 纺织科学与工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物工程
100 篇 理学
- 86 篇 数学
- 10 篇 系统科学
- 9 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 物理学
- 2 篇 生物学
- 1 篇 地质学
49 篇 管理学
- 33 篇 管理科学与工程(可...
- 21 篇 工商管理
- 19 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

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

机构

15 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 stanford univ st...
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 篇 univ washington ...
8 篇 yale univ new ha...
8 篇 cornell univ ith...
8 篇 univ chicago il ...
7 篇 mit cambridge ma...
7 篇 northeastern uni...
7 篇 microsoft resear...
6 篇 microsoft res re...
6 篇 microsoft res re...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 aiken alex
9 篇 chlipala adam
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 篇 foster nate
6 篇 bacon david f.
6 篇 gulwani sumit
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 bodik rastislav
5 篇 mckinley kathryn...

语言

825 篇 英文
77 篇 其他
1 篇 中文

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

共 903 条记录，以下是761-770 订阅

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

详细简洁

排序：

Concurrent Haskell

Concurrent Haskell

引用

The 1996 acm sigplan-SIGACT Symposium on Principles of programming languages, POPL'96

作者： Jones, Simon Peyton Gordon, Andrew Finne, Sigbjorn Univ of Glasgow Glasgow United Kingdom

Some applications are most easily expressed in a programming language that supports concurrency, notably interactive and distributed systems. We propose extensions to the purely-functional language Haskell that allow it to express explicitly concurrent applications;we call the resulting language Concurrent Haskell. The resulting system appears to be both expressive and efficient, and we give a number of examples of useful abstractions that can be built from our primitives. We have developed a freely-available implementation of Concurrent Haskell, and are now using it as a substrate for a graphical user interface toolkit.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Provable time and space efficient implementation of NESL

Provable time and space efficient implementation of NESL

引用

Proceedings of the 1996 acm sigplan International conference on Functional programming, ICFP'96

作者： Blelloch, Guy E. Greiner, John Carnegie Mellon Univ Pittsburgh United States

In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed λ-calculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable implementation bounds for functional languages by considering space and by including arrays. For modeling the cost of NESL we augment a standard call-by-value operational semantics to return two cost measures: a DAG representing the sequential dependences in the computation, and a measure of the space taken by a sequential implementation. We show that a NESL program with w work (nodes in the DAG), d depth (levels in the DAG), and s sequential space can be implemented on a p processor butterfly network, hypercube, or CRCW PRAM using O(w/p+d log p) time and O(s+dp log p) reachable space. For programs with sufficient parallelism these bounds are optimal in that they give linear speedup and use space within a constant factor of the sequential space.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Provably time-efficient parallel implementation of full speculation

Provably time-efficient parallel implementation of full spec...

引用

The 1996 acm sigplan-SIGACT Symposium on Principles of programming languages, POPL'96

作者： Greiner, John Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA United States

Speculative evaluation, including leniency and futures, is often used to produce high degrees of parallelism. Existing speculative implementations, however, may serialize computation because of their implementation of queues of suspended threads. We give a provably efficient parallel implementation of a speculative functional language on various machine models. The implementation includes proper parallelization of the necessary queuing operations on suspended threads. Our target machine models are a butterfly network, hypercube, and PRAM. To prove the efficiency of our implementation, we provide a cost model using a profiling semantics and relate the cost model to implementations on the parallel machine models.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the acm sigplan conference on programming language design and implementation (PLDi)

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

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

ISBN: (纸本)0897916972

The proceedings contain 28 papers. The topics discussed include: efficient building and placing of gating functions;avoiding conditional branches by code replication;accurate static branch prediction by value range propagation;improving balanced scheduling with compiler optimizations that increase instruction-level parallelism;selective specialization for object-oriented languages;corpus-based static branch prediction;flow-sensitive interprocedural constant propagation;efficient context-sensitive pointer analysis for c programs;simple and effective link-time optimization of modula-3 program;APT: a data structure for optimal control dependence computation;implementation of the data-flow synchronous language signal;scheduling and mapping: software pipelining in the presence of structural hazards;register allocation using lazy saves, eager restores, and greedy shuffling;context-insensitive alias analysis reconsidered;a type-based compiler for standard ML;unifying data and control transformations for distributed shared-memory machines;storage assignment to decrease code size;optimizing parallel programs with explicit synchronization;the LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization;and the power of assignment motion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GUM: a portable parallel implementation of Haskell 96

GUM: a portable parallel implementation of Haskell

引用

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

作者： P. W. Trinder K. Hammond J. S. Mattson A. S. Partridge S. L. Peyton Jones Department of Computing Science Glasgow University Hewlett-Packard California Language Laboratory and Department of Computing Science Glasgow University Department of Computer Science University of Tasmania and Department of Computing Science Glasgow University

ISBN: (纸本)9780897917957

GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained research interest in parallel functional programming, GUM is one of the first such systems to be made publicly *** is message-based, and portability is facilitated by using the PVM communications harness that is available on many multi-processors. As a result, GUM is available for both shared-memory (Sun SPARCserver multiprocessors) and distributed-memory (networks of workstations) architectures. The high message-latency of distributed machines is ameliorated by sending messages asynchronously, and by sending large packets of related data in each *** performance figures demonstrate absolute speedups relative to the best sequential compiler technology. To improve the performance of a parallel Haskell program GUM provides tools for monitoring and visualising the behaviour of threads and of processors during execution.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Practical program analysis using general purpose logic programming systems—a case study 96

Practical program analysis using general purpose logic progr...

引用

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

作者： Steven Dawson C. R. Ramakrishnan David S. Warren SRI International 333 Ravenswood Ave. Menlo Park CA and Department of Computer Science SUNY at Stony Brook Stony Brook NY Department of Computer Science SUNY at Stony Brook Stony Brook NY

ISBN: (纸本)9780897917957

Many analysis problems can be cast in the form of evaluating minimal models of a logic program. Although such formulations are appealing due to their simplicity and declarativeness, they have not been widely used in practice because, either existing logic programming systems do not guarantee completeness, or those that do have been viewed as too inefficient for integration into a compiler. The objective of this paper is to re-examine this issue in the context of recent advances in implementation technologies of logic programming *** find that such declarative formulations can indeed be used in practical systems, when combined with the appropriate tool for evaluation. We use existing formulations of analysis problems --- groundness analysis of logic programs, and strictness analysis of functional programs --- in this case study, and the XSB system, a table-based logic programming system, as the evaluation tool of choice. We give experimental evidence that the resultant groundness and strictness analysis systems are practical in terms of both time and space. In terms of implementation effort, the analyzers took less than 2 man-weeks (in total), to develop, optimize and evaluate. The analyzer itself consists of about 100 lines of tabled Prolog code and the entire system, including the components to read and preprocess input programs and to collect the analysis results, consists of about 500 lines of code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

implementation of the data-flow synchronous language signal 95

Implementation of the data-flow synchronous language signal

引用

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

作者： Amagbegnon, Pascalin Besnard, Loic Guetnic, Paul Le IRISA-INRIA Campus de Beaulieu Rennes Cedex350412 France

ISBN: (纸本)0897916972

This paper presents the techniques used for the compilation of the data-flow, synchronous language SIGNAL. The key feature of the compiler is that it performs formal calculus on systems of boolean equations. The originality of the implementation of the compiler lies in the use of a tree structure to solve the equations. © 1995 acm.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

CONTEXT-INSENSITIVE ALIAS ANALYSIS RECONSIDERED 95

CONTEXT-INSENSITIVE ALIAS ANALYSIS RECONSIDERED

引用

acm sigplan 95 conference on programming language design and implementation

作者： RUF, E Microsoft Research One Microsoft Way Redmond WA

ISBN: (纸本)9780897916974

Recent work on alias analysis in the presence of pointers has concentrated on context-sensitive interprocedural analyses, which treat multiple calls to a single procedure independently rather than constructing a single approximation to a procedure's effect on all of its callers. While context-sensitive modeling offers the potential for greater precision by considering only realizable call-return paths, its empirical benefits have yet to be measured. This paper compares the precision of a simple, efficient, context-insensitive points-to analysis for the C programming language with that of a maximally context-sensitive version of the same analysis. We demonstrate that, for a number of pointer-intensive benchmark programs, context-insensitivity exerts little to no precision penalty. We also describe techniques for using the output of context-insensitive analysis to improve the efficiency of context-sensitive analysis without affecting precision.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共91页 << < 73 74 75 76 77 78 79 80 81 82 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：