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

16th International Parallel and Distributed Processing Symposium, IPDPS 2002

作者： Ehmety, S.O. Paulson, L.C. Cambridge University Computer Laboratory J J Thomson Avenue CambridgeCB3 0FD United Kingdom

ISBN: (纸本)0769515738

We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Chandy and Sanders [2, 3], based on the so-called existential and universal properties. We show that, while avoiding hand proof mistakes, a such compositional reasoning can be mechanized quite straightforwardly. We also present the mechanization of some theoretical results [5] concerning existential properties and their relation with the guarantees concept. The result is a new module added to the existing Isabelle/UNITY theory for composition. © 2002 IEEE.

关键词： Isabelle program composition UNITY universal and existential properties

来源：评论

学校读者我要写书评

暂无评论

On the degeneration of program generators by program composition

引用

NEW GENERATION COMPUTING 1998年第1期16卷 75-95页

作者： Gluck, R Klimov, A Univ Copenhagen Dept Comp Sci DK-2100 Copenhagen Denmark Russian Acad Sci MV Keldysh Appl Math Inst RU-125047 Moscow Russia

One of the main discoveries in the seventies was that the concept of a generating extension covers a very wide class of apparently different program generators. program specialization, or partial evaluation, is powerful because it provides uniform techniques for the automatic implementation of generating extensions from ordinary programs. The Futamura projections stand as the cornerstone of the development of program specialization. This paper takes the idea of the Futamura projections further. Three degeneration projections are formulated which tell us how to achieve the reverse goal by program composition, namely turning a generating extension into an ordinary program. The fact that program composition can invert the effect of program specialization shows that these projections are dual in a sense. The degeneration projections complete a missing link between programs and generating extensions and allow for novel applications of program transformation.

关键词： programming languages program transformation partial evaluation program specialization program composition metacomputation

来源：评论

学校读者我要写书评

暂无评论

Low Latency and Resource-aware program composition for Large-scale Data Analysis 16

Low Latency and Resource-aware Program Composition for Large...

引用

16th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)

作者： Tanaka, Masahiro Taura, Kenjiro Torisawa, Kentaro Natl Inst Informat & Commun Technol NICT Universal Commun Res Inst 3-5 Hikaridai Seika Kyoto 6190289 Japan Univ Tokyo Grad Sch Informat Sci & Technol Dept Informat & Commun Engn 7-3-1 Hongo Bunkyo Ku Tokyo 1130033 Japan

ISBN: (纸本)9781509024537

The importance of large-scale data analysis has shown a recent increase in a wide variety of areas, such as natural language processing, sensor data analysis, and scientific computing. Such an analysis application typically reuses existing programs as components and is often required to continuously process new data with low latency while processing large-scale data on distributed computation nodes. However, existing frameworks for combining programs into a parallel data analysis pipeline (e.g., workflow) are plagued by the following issues: (1) Most frameworks are oriented toward high-throughput batch processing, which leads to high latency. (2) A specific language is often imposed for the composition and/or such a specific structure as a simple unidirectional dataflow among constituting tasks. (3) A program used as a component often takes a long time to start up due to the heavy load at initialization, which is referred to as the startup overhead. Our solution to these problems is a remote procedure call (RPC)-based composition, which is achieved by our middleware Rapid Service Connector (RaSC). RaSC can easily wrap an ordinary program and make it accessible as an RPC service, called a RaSC service. Using such component programs as RaSC services enables us to integrate them into one program with low latency without being restricted to a specific workflow language or dataflow structure. In addition, a RaSC service masks the startup overhead of a component program by keeping the processes of the component program alive across RPC requests. We also proposed architecture that automatically manages the number of processes to maximize the throughput. The experimental results showed that our approach excels in overall throughput as well as latency, despite its RPC overhead. We also showed that our approach can adapt to runtime changes in the throughput requirements.

关键词： Large-scale data processing program composition service composition

来源：评论

学校读者我要写书评

暂无评论

Parallel program composition with Paragraphs in Stapl

Parallel Program Composition with Paragraphs in Stapl

引用

作者： Smith, Timmie Texas A&M University

Languages and tools currently available for the development of parallel applications are difficult to learn and use. The Standard Template Adaptive Parallel Library (STAPL) is being developed to make it easier for programmers to implement a parallel application. STAPL is a parallel programming library for C++ that adopts the generic programming philosophy of the C++ Standard Template Library. STAPL provides collections of parallel algorithms (pAlgorithms) and containers (pContainers) that allow a developer to write their application without reimplementing the algorithms and data structures commonly used in parallel computing. pViews in STAPL are abstract data types that provide generic data access operations independently of the type of pContainer used to store the data. Algorithms and applications have a formal, high level representation in STAPL. A computation in STAPL is represented as a parallel task graph, which we call a PARAGRAPH. A PARAGRAPH contains a representation of the algorithm’s input data, the operations that are used to transform individual data elements, and the ordering between the application of operations that transform the same data element. Just as programs are the result of a composition of algorithms, STAPL programs are the result of a composition of PARAGRAPHs. This dissertation develops the PARAGRAPH program representation and its compositional methods. PARAGRAPHs improve the developer’s difficult situation by simplifying what she must specify when writing a parallel algorithm. The performance of the PARAGRAPH is evaluated using parallel generic algorithms, benchmarks from the NAS suite, and a nuclear particle transport application that has been written using STAPL. Our experiments were performed on Cray XT4 and Cray XE6 massively parallel systems and an IBM Power5 cluster, and show that scalable performance beyond 16,000 processors is possible using the PARAGRAPH.

关键词： program Representation program composition programming Libraries programming Languages Parallel Thesis

来源：评论

学校读者我要写书评

暂无评论

'What Works, for Whom?' Sexual Offence Treatment Dosage, Duration, Sequence, and composition

引用

CURRENT PSYCHIATRY REPORTS 2025年第1期27卷 58-65页

作者： Mckillop, Nadine Rayment-McHugh, Susan Univ Sunshine Coast Sch Law & Soc Sexual Violence Res & Prevent Unit Sippy Downs Australia

Purpose of ReviewRecent scholarship has advocated the need for more detailed analysis of key components within sexual offender treatment programs that contribute to successful outcomes;and importantly to delineate 'what works best, for whom.' The present review interrogates recent scholarship on treatment duration and dosage, program composition and sequencing, to advance critical discussion on 'for whom' treatment works *** FindingsAlthough we now know more about what key program components are associated with better outcomes overall, observed differences at an individual level reemphasize the importance of attending to specific responsivity factors in *** the specific responsivity principle demands more tailored methods to program design and implementation. However, implementing nuanced programming within 'real-world' correctional settings poses significant challenges. Therefore, we call to action the adoption of an implementation science lens in future research, to optimize translation of research knowledge on 'what works, and for whom' into practice.

关键词： Sexual offender treatment Correctional programming What works program composition Treatment dosage and duration program sequencing

来源：评论

学校读者我要写书评

暂无评论

A regeneration scheme for generating extensions

引用

INFORMATION PROCESSING LETTERS 1997年第3期62卷 127-134页

作者： Gluck, R Klimov, A RUSSIAN ACAD SCI KELDYSH INST APPL MATHRU-125047 MOSCOWRUSSIA

A regeneration scheme is presented which shows how to change the computation staging of a generating extension by a two-level metasystem structure using program specialization and program composition. From the results described in this paper we can see that program generation and program degeneration are two extremes of the same transformation dimension;this relates several well-known program transformations under a general scheme. (C) 1997 Elsevier Science B.V.

关键词： programming languages program generation partial evaluation program composition metacomputation

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE programMING

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1991年第9期17卷 911-921页

作者： GOUDA, MG HERMAN, T Department of Computer Sciences University of Texas at Austin Austin TX 78712

An adaptive program is one that changes its behavior based on the current state of its environment. This notion of adaptivity is formalized and a logic for reasoning about adaptive programs is presented. The logic includes several composition operators that can be used to define an adaptive program in terms of given constituent programs;programs resulting from these compositions retain the adaptive properties of their constituent programs.

关键词： DISTRIBUTED COMPUTING ADAPTIVE SYSTEMS programMING METHODOLOGY program composition SELF-STABILIZATION

来源：评论

学校读者我要写书评

暂无评论

programming by combining general logic programs

引用

JOURNAL OF LOGIC AND COMPUTATION 1999年第1期9卷 7-24页

作者： Brogi, A Contiero, S Turini, F Univ Pisa Dipartimento Informat I-56125 Pisa Italy

The program composition approach can be fruitfully applied to combine general logic programs, that is, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabilities of logic programming for non-monotonic reasoning. Examples of modular programming, hierarchical reasoning, constraints and rules with exceptions will be illustrated. The semantics of programs and program compositions is defined in terms of three-valued logic by extending the three-valued semantics for logic programs proposed by Fitting. A computational interpretation of program compositions is formalised by means of an equivalence preserving syntactic transformation of arbitrary program compositions into standard general programs.

关键词： logic programming program composition non-monotonic reasoning three-valued logic

来源：评论

学校读者我要写书评

暂无评论

Dynamic composition of parameterised logic modules

引用

COMPUTER LANGUAGES 1999年第4期25卷 211-242页

作者： Brogi, A Renso, C Turini, F Univ Pisa Dept Comp Sci I-56125 Pisa Italy

We present a logic-based programming language that features meta-level composition operations over programs. Object programs are parameterised named collections of definite clauses which may contain formulae of the form A in Pexp, where A is a standard atomic formula and Pex p is a program expression obtained by applying composition operations over named object programs. The semantics of the language is presented in two different equivalent styles. An operational, top-down semantics is given by means of inference rules, while a denotational, bottom-up semantics is given via an immediate consequence operator associated with program expressions. A meta-programming implementation of the language is also presented by transforming the operational inference rules into meta-level axioms. Several programming examples are discussed to illustrate the expressive power of the language. (C) 2001 Elsevier Science Ltd. All rights reserved.

关键词： logic programming program composition semantics

来源：评论

学校读者我要写书评

暂无评论

CHALLENGING PROBLEMS IN PARTIAL EVALUATION AND MIXED COMPUTATION

引用

NEW GENERATION COMPUTING 1988年第2-3期6卷 291-302页

作者： JONES, ND 1. DIKU University of Copenhagen Universitetsparken 1 DK-2100 Copenhagen ? Denmark

This paper collects together a variety of problems in partial evaluation and mixed computation that appear to be worth solving but as yet lack solutions or (in some cases) precise formulations. The problems come largely from discussions with and notes by participants in the 1987 workshop on Partial Evaluation and Mixed Computation.

关键词： Partial Evaluation Mixed Computation program Specialisation Challenging Problems Open Problems Automation Automatic programming Semantics Based program Manipulation Self Applicable programs programming Tools program composition program Decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：