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

acm sigplan '92 conference on programming language design and implementation, pldi 1992

作者： Jagannathan, Suresh Philbin, Jim NEC Research Inst Princeton NJ United States

ISBN: (纸本)0897914759

We describe an approach to implementing a wide-range of concurrency paradigms in high-level (symbolic) programming languages. The focus of our discussion is STING, a dialect of Scheme, that supports lightweight threads of control and virtual processors as first-class objects. Given the significant degree to which the behavior of these objects may be customized, we can easily express a variety of concurrency paradigms and linguistic structures within a common framework without loss of efficiency. Unlike parallel systems that rely on operating system services for managing concurrency, STING implements concurrency management entirely in terms of Scheme objects and procedures. It, therefore, permits users to optimize the runtime behavior of their applications without requiring knowledge of the underlying runtime system. This paper concentrates on (a) the implications of the design for building asynchronous concurrency structures, (b) organizing large-scale concurrent computations, and (c) implementing robust programming environments for symbolic computing.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

TAG-FREE GARBAGE COLLECTION FOR STRONGLY TYPED programming-languageS 91

TAG-FREE GARBAGE COLLECTION FOR STRONGLY TYPED PROGRAMMING-L...

引用

CONF ON programming language : design AND implementation

作者： GOLDBERG, B NYU COURANT INST MATH SCIDEPT COMP SCINEW YORKNY 10012

ISBN: (纸本)9780897914284

With the emergence of a number of strongly typed languages with very dynamic storage allocation, efficient methods of storage reclamation have become especially important. Even though no type tags are required for type checking programs written in these languages, current implementations do use tags to support run time garbage collection. This often inflicts a high time and space overhead on program execution. Since the early days of LISP (and Algo168 later on), there have been schemes for performing tag-free garbage collection. In this paper, we describe an improvement of existing methods that leads to more effective storage reclamation in the absence of tags. Garbage collection has also traditionally been viewed as being independent of the particular program being executed. This means that results of compile-time analyses which could increase the effectiveness of garbage collection cannot be incorporated easily into the garbage collection process. This paper describes a method for performing garbage collection 1) in the absence of tagged data, and 2) using compile-time information. This method relies on compiler-generated garbage collection routines specific to the program being executed and incurs no time overhead during execution other then the cost of the garbage collection process itself. We describe tag-free garbage collection methods for monomorphically typed and polymorphically typed languages, and suggest how they might be extended to support parallel languages.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

language requirements for large-scale generic libraries 05

Language requirements for large-scale generic libraries

引用

4th International conference on Generative programming and Component Engineering

作者： Siek, J Lumsdaine, A Indiana Univ Open Syst Lab Bloomington IN 47405 USA

ISBN: (纸本)3540291385

The past decade of experience has demonstrated that the generic programming methodology is highly effective for the design, implementation, and use of large-scale software libraries. The fundamental principle of generic programming is the realization of interfaces for entire sets of components, based on their essential syntactic and semantic requirements, rather than for any particular components. Many programming languages have features for describing interfaces between software components, but none completely support the approach used in generic programming. We have recently developed G, a language designed to provide first-class language support for generic programming and large-scale libraries. In this paper, we present an overview of g and analyze the interdependence between language features and library design in light of a complete implementation of the Standard Template Library using G. In addition, we discuss important issues related to modularity and encapsulation in large-scale libraries and how language support for validation of components in isolation can prevent many common problems in component integration.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

Interaction-based programming with classages 05

Interaction-based programming with classages

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Liu, Yu David Smith, Scott F. Department of Computer Science Johns Hopkins University Baltimore MD 21218 United States

ISBN: (纸本)1595930310

This paper presents Classages, a novel interaction-centric object-oriented language. Classes and objects in Classages are fully encapsulated, with explicit interfaces for all interactions they might be involved in. The design of Classages touches upon a wide range of language design topics, including encapsulation, object relationship representation, and object confinement. An encoding of Java's OO model in Classages is provided, showing how standard paradigms are supported. A prototype Classages compiler is described. Copyright 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

PAD: A Pattern-Driven Analysis and design Method

PAD: A Pattern-Driven Analysis and Design Method

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Hamza, Haitham S. Chen, Yi Department of Computer Science and Engineering University of Nebraska-Lincoln LincolnNE68588-0115 United States Microsoft Corporation 1 Microsoft Way RedmondWA98052 United States

We describe a Pattern-Driven Analysis and design (PDA) method for developing software systems. PDA promotes the use of patterns throughout the different phases of software development from analysis to implementation. ... 详细信息

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

A comparison of empirical and model-driven optimization 03

引用

acm sigplan conference on programming language design and implementation

作者： K., Yotov X., Li G., Ren M., Cibulskis G., DeJong M., Garzaran D., Padua K., Pingali P., Stodghill P., Wu Univ. Illinois at Urbana-Champaign Urbana-Champaign IL United States IBM T.J. Watson Research Center Yorktown Heights NY United States

ISBN: (纸本)9781581136623

Empirical program optimizers estimate the values of key optimization parameters by generating different program versions and running them on the actual hardware to determine which values give the best performance. In contrast, conventional compilers use models of programs and machines to choose these parameters. It is widely believed that model-driven optimization does not compete with empirical optimization, but few quantitative comparisons have been done to date. To make such a comparison, we replaced the empirical optimization engine in ATLAS (a system for generating a dense numerical linear algebra library called the BLAS) with a model-driven optimization engine that used detailed models to estimate values for optimization parameters, and then measured the relative performance of the two systems on three different hardware platforms. Our experiments show that model-driven optimization can be surprisingly effective, and can generate code whose performance is comparable to that of code generated by empirical optimizers for the BLAS.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Theory of type qualifiers

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

引用

Proceedings of the acm sigplan conference on programming language design and implementation (pldi) 1999年 192-203页

作者： Foster, Jeffrey S. Fahndrich, Manuel Aiken, Alexander Univ of California Berkeley United States

We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qualifiers through a program, where each qualifier or set of qualifiers comes with additional rules that capture its semantics. Our framework allows types to be polymorphic in the type qualifiers. We present a const-inference system for C as an example application of the framework. We show that for a set of real C programs, many more consts can be used than are actually present in the original code.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

YARV: Yet Another RubyVM: Innovating the Ruby Interpreter

YARV: Yet Another RubyVM: Innovating the Ruby Interpreter

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Sasada, Koichi Graduate School of Technology Tokyo University of Agriculture and Technology Koganeishi Nakacho Tokyo22416 Japan

Ruby-an Object-Oriented scripting language-is used world-wide because of its ease of use. However, the current interpreter is slow. To solve this problem, some virtual machines were developed, but none with adequate performance or functionality. To fill this gap, I have developed a Ruby interpreter called YARV (Yet Another Ruby VM). YARV is based on a stack machine architecture and features optimizations for high speed execution of Ruby programs. In this poster, I introduce the Ruby programming language, discuss certain characteristics of Ruby from the aspect of a Ruby interpreter implementer, and explain methods of implementation and optimization. Benchmark results are given at the end. © 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Semantics for imprecise exceptions

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

引用

Proceedings of the acm sigplan conference on programming language design and implementation (pldi) 1999年 25-36页

作者： Jones, Simon Peyton Reid, Alastair Hoare, Tony Marlow, Simon Henderson, Fergus Microsoft Research Ltd Cambridge United States

Some modern superscalar microprocessors provide only imprecise exceptions. That is, they do not guarantee to report the same exception that would be encountered by a straightforward sequential execution of the program. In exchange, they offer increased performance or decreased chip area (which amount to much the same thing). This performance/precision tradeoff has not so far been much explored at the programming language level. In this paper we propose a design for imprecise exceptions in the lazy functional programming language Haskell. We discuss several designs, and conclude that imprecision is essential if the language is still to enjoy its current rich algebra of transformations. We sketch a precise semantics for the language extended with exceptions. The paper shows how to extend Haskell with exceptions without crippling the language or its compilers. We do not yet have enough experience of using the new mechanism to know whether it strikes an appropriate balance between expressiveness and performance.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Control CPR: A branch height reduction optimization for EPIC architectures

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

引用

Proceedings of the acm sigplan conference on programming language design and implementation (pldi) 1999年 155-168页

作者： Schlansker, Michael Mahlke, Scott Johnson, Richard Hewlett-Packard Lab Palo Alto United States

The challenge of exploiting high degrees of instruction-level parallelism is often hampered by frequent branching. Both exposed branch latency and low branch throughput can restrict parallelism. Control critical path reduction (control CPR) is a compilation technique to address these problems. Control CPR can reduce the dependence height of critical paths through branch operations as well as decrease the number of executed branches. In this paper, we present an approach to control CPR that recognizes sequences of branches using profiling statistics. The control CPR transformation is applied to the predominant path through this sequence. Our approach, its implementation, and experimental results are presented. This work demonstrates that control CPR enhances instruction-level parallelism for a variety of application programs and improves their performance across a range of processors.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：