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

HIRONDML: FAIR THREADS MIGRATIONS FOR OBJECTIVE CAML

PARALLEL PROCESSING LETTERS 2008年第1期18卷 55-69页

作者： Chailloux, Emmanuel Ravet, Vivien Verlaguet, Julien Univ Pierre & Marie Curie Paris 6 CNRS UMR 7606 Lab Informat Paris 6 4 Pl Jussieu F-75005 Paris France Esterel Technol R&D F-06270 Villeneuve France

In this paper, we present HirondML, an Objective Caml library implementing migrating threads. Our library is based on a simplified implementation of the Fair Threads, a reactive threads system originally developed at INRIA. The Fair Threads scheduling policy is based on mixing cooperative and preemptive threads. We designed a thread migration system based on the cooperativeness of Fair Threads. To minimize data copying, we adopted an original rebinding policy distinguishing local variables, which are copied, from global variables, which are rebound when a migration takes place. Such a choice allows two styles of programming, by copy or by sharing. This will be illustrated by different distributed applications.

关键词： threads migration Fair Threads distributed programming functional programming Objective Caml

来源：评论

学校读者我要写书评

暂无评论

Reducing distributed JR program start-up time via extending JR's operation abstraction

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2018年第14期30卷

作者： Olsson, Ronald A. Keen, Aaron W. Williamson, Todd Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Calif Polytech State Univ San Luis Obispo Comp Sci & Software Engn Dept San Luis Obispo CA 93407 USA

This paper shows how to simplify and speed up distributed JR program start-up. We accomplish this goal by extending JR's operation abstraction so that it includes the creation of virtual machines and remote objects, the key components in distributed JR programs. This extension is conceptually simple, fits well with the rest of the JR language, and provides additional flexibility. Extending JR's operation abstraction yields a considerably less complex solution and a simpler implementation than other approaches, which would have led to redundant or ad-hoc language mechanisms. The extension also allows for reduced distributed JR program start-up costs because the creation of virtual machines and remote objects can now be done in parallel. This paper also describes how we have simulated this extension and have implemented a prototype that provides this extension. These reflect closely what we would need to do to actually include the extension within the standard JR implementation. Using the simulation and prototype, we obtained performance data on a few typical distributed applications written to use the extension. The data show large reductions, ranging from about 50% to 95%, in distributed JR program start-up times. Our experiments also explored a few strategies to further reduce start-up times, but, among our strategies, the straightforward strategies seem the best. This paper also discusses design alternatives for creating virtual machines and remote objects. Our experience suggests that the proposed extension to JR's operation abstraction is actually worthwhile to add to the standard JR language and implementation.

关键词： collective communication concurrency distributed programming JR programming language program start-up virtual machine creation

来源：评论

学校读者我要写书评

暂无评论

THE CONCURRENT LANGUAGE, SHARED PROLOG

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1991年第1期13卷 99-123页

作者： BROGI, A CIANCARINI, P Univ. di Pisa Italy Univ. di Pisa Italy

Shared Prolog is a new concurrent logic language. A Shared Prolog system is composed of a set of parallel agents that are Prolog programs extended by a guard mechanism. The programmer controls the granularity of parallelism, coordinating communication and synchronization of the agents via a centralized data structure. The communication mechanism is inherited from the blackboard model of problem solving. Intuitively, the granularity of the logic processes to be elaborated in parallel is large, while the resources shared on the blackboard can be very fine grained. An operational semantics for Shared Prolog is given in terms of a distributed model. Through an abstract notion of computation, the kinds of parallelism supported by the language, as well as properties of infinite computations, such as local deadlocks, are studied. The expressiveness of the language is shown with respect to the specification of two classes of applications: metaprogramming and blackboard systems.

关键词： BLACKBOARD distributed programming LANGUAGES FOR distributed programming LOGIC programming META-INTERPRETATION PARALLEL programming TRANSITION SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

The missing link - Dynamic components for ML

引用

ACM SIGPLAN NOTICES 2006年第9期41卷 99-110页

作者： Rossberg, Andreas Univ Saarland D-6600 Saarbrucken Germany

Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so far. We present the design and semantics of a simple yet expressive first-class component system for ML. It provides dynamic linking in a type-safe and type-flexible manner, and allows selective execution in sandboxes. The system is defined solely by reduction to higher-order modules plus an extension with simple module-level dynamics, which we call packages. To represent components outside processes we employ generic pickling. We give a module calculus formalising the semantics of packages and pickling.

关键词： modules units separate compilation dynamic linking components dynamic typing distributed programming pickling

来源：评论

学校读者我要写书评

暂无评论

Phoenix: a parallel programming model for accommodating dynamically joining/leaving resources

引用

ACM SIGPLAN NOTICES 2003年第10期38卷 215-228页

作者： Taura, K Kaneda, K Endo, T Yonezawa, A Univ Tokyo Bunkyo Ku Tokyo 1130033 Japan PRESTO JST Kawaguchi Saitama 3320012 Japan

This paper proposes Phoenix, a programming model for writing parallel and distributed applications that accommodate dynamically joining/leaving compute resources. In the proposed model, nodes involved in an application see a large and fixed virtual node name space. They communicate via messages, whose destinations are specified by virtual node names, rather than names bound to a physical resource. We describe Phoenix API and show how it allows a transparent migration of application states, as well as dynamically joining/leaving nodes as its by-product. We also demonstrate through several application studies that Phoenix model is close enough to regular message passing, thus it is a general programming model that facilitates porting many parallel applications/algorithms to more dynamic environments. Experimental results indicate applications that have a small task migration cost can quickly take advantage of dynamically joining resources using Phoenix. Divide-and-conquer algorithms written in Phoenix achieved a good speedup with a large number of nodes across multiple LANs (120 times speedup using 169 CPUs across three LANs). We believe Phoenix provides a useful programming abstraction and platform for emerging parallel applications that must be deployed across multiple LANs and/or shared clusters having dynamically varying resource conditions.

关键词： performance parallel programming distributed programming message passing migration resource reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Generic Pickling and Minimization

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2006年第2期148卷 79-103页

作者： Tack, Guido Kornstaedt, Leif Smolka, Gert Univ Saarland Programming Syst Lab Saarbrucken Germany

This paper presents generic pickling and minimization mechanisms that are provided as services similar to garbage collection. Pickling is used to externalize and internalize data. Minimization means to maximize the sharing in arbitrary data structures. The paper introduces the notion of an abstract store as a formal basis for the algorithms, and analyzes design decisions for the implementation aspects of pickling and minimization. The mechanisms presented here are fully implemented in the Alice programming system.

关键词： pickling marshalling serialization graph minimization persistence distributed programming

来源：评论

学校读者我要写书评

暂无评论

A model for correlation-based choreographic programming

引用

PEERJ COMPUTER SCIENCE 2024年 10卷 e1907-e1907页

作者： Giallorenzo, Saverio Montesi, Fabrizio Gabbrielli, Maurizio INRIA Sophia Antipolis France Univ Bologna Dept Comp Sci & Engn Bologna Italy Univ Southern Denmark Dept Math & Comp Sci Odense Denmark

Choreographies provide a clear way to specify the intended communication behaviour of concurrent and distributed systems. Previous theoretical work investigated the translation of choreographies into (models of) programs based on message passing. However, existing theories still present a gap between how they model communications-using channel names & agrave;la CCS or p-calculus-and implementations-which use lower-level mechanisms for message routing. We start bridging this gap with a new formal framework called Applied Choreographies. In Applied Choreographies, developers write choreographies in a familiar syntax (from previous work) and reason about their behaviour through simple, abstract name-based communication semantics. The framework offers state-of-the-art features of choreographic models, e.g., modular programming supported via choreographic types. To provide its correctness guarantee, Applied Choreographies comes with a compilation procedure that transforms a choreography into a low-level, implementation-adherent calculus of Service-Oriented Computing (SOC). To manage the complexity of the compilation, we divide its formalisation and proof into three stages, respectively dealing with: (a) the translation of name-based communications into their SOC equivalents, namely, using correlation mechanisms based on message data;(b) the projection of the given choreography into a composition of partial, single-participant choreographies (towards their translation into SOC processes);(c) the translation of partial choreographies and the distribution of global, choreography-level state into local SOC processes. We provide behavioural correspondence results for each stage. Thus, given a choreography specification, we guarantee to synthesise its faithful service-oriented implementation.

关键词： Concurrency distributed programming Service-oriented computing Choreographic programming

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of Practical MPI Programs

引用

ACM SIGPLAN NOTICES 2009年第4期44卷 261-269页

作者： Vo, Anh Vakkalanka, Sarvani DeLisi, Michael Gopalakrishnan, Ganesh Kirby, Robert M. Thakur, Rajeev Univ Utah Sch Comp Salt Lake City UT 84112 USA Argonne Natl Lab Div Math & Comp Sci Argonne IL 60439 USA

This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our approach, we directly model-check the MPI/C source code, executing its interleavings with the help of a verification scheduler. Unfortunately, the total feasible number of interleavings is exponential, and impractical to examine even for our modest goals. Our earlier publications formalized and implemented a partial order reduction approach that avoided exploring equivalent interleavings, and presented a verification tool called ISP. This paper presents algorithmic and engineering innovations to ISP, including the use of OpenMP parallelization, that now enables it to handle practical MPI programs, including: (i) ParMETIS - a widely used hypergraph partitioner, and (ii) MADRE - a Memory Aware Data Re-distribution Engine, both developed outside our group. Over these benchmarks, ISP has automatically verified up to 14K lines of MPI/C code, producing error traces of deadlocks and assertion violations within seconds.

关键词： Verification MPI Message Passing Interface distributed programming model checking dynamic partial order reduction

来源：评论

学校读者我要写书评

暂无评论

Instant Pickles: Generating Object-Oriented Pickler Combinators for Fast and Extensible Serialization

引用

ACM SIGPLAN NOTICES 2013年第10期48卷 183-201页

作者： Miller, Heather Haller, Philipp Burmako, Eugene Odersky, Martin Ecole Polytech Fed Lausanne Lausanne Switzerland Typesafe Inc San Francisco CA USA

As more applications migrate to the cloud, and as "big data" edges into even more production environments, the performance and simplicity of exchanging data between compute nodes/devices is increasing in importance. An issue central to distributed programming, yet often under-considered, is serialization or pickling, i.e., persisting runtime objects by converting them into a binary or text representation. Pickler combinators are a popular approach from functional programming;their composability alleviates some of the tedium of writing pickling code by hand, but they don't translate well to object-oriented programming due to qualities like open class hierarchies and subtyping polymorphism. Furthermore, both functional pickler combinators and popular, Java-based serialization frameworks tend to be tied to a specific pickle format, leaving programmers with no choice of how their data is persisted. In this paper, we present object-oriented pickler combinators and a framework for generating them at compile-time, called scala/pickling, designed to be the default serialization mechanism of the Scala programming language. The static generation of OO picklers enables significant performance improvements, outperforming Java and Kryo in most of our benchmarks. In addition to high performance and the need for little to no boilerplate, our framework is extensible: using the type class pattern, users can provide both (1) custom, easily interchangeable pickle formats and (2) custom picklers, to override the default behavior of the pickling framework. In benchmarks, we compare scala/pickling with other popular industrial frameworks, and present results on time, memory usage, and size when pickling/unpickling a number of data types used in real-world, large-scale distributed applications and frameworks.

关键词： Serialization pickling meta-programming distributed programming Scala

来源：评论

学校读者我要写书评

暂无评论

Implementing distribution and persistence aspects with AspectJ

引用

ACM SIGPLAN NOTICES 2002年第11期37卷 174-190页

作者： Soares, S Laureano, E Borba, P Univ Fed Pernambuco Informat Ctr Recife PE Brazil Catholic Univ Pernambuco Informat & Stat Dept Recife PE Brazil

This paper reports our experience using AspectJ, a general-purpose aspect-oriented extension to Java, to implement distribution and persistence aspects in a web-based information system. This system was originally implemented in Java and restructured with AspectJ. Our main contribution is to show that AspectJ is useful for implementing several persistence and distribution concerns in the application considered, and other similar applications. We have also identified a few drawbacks in the language and suggest some minor modifications that could significantly improve similar implementations. Despite the drawbacks, we argue that the AspectJ implementation is superior to the pure Java implementation. Some of the aspects implemented in our experiment are abstract and constitute a simple aspect framework. The other aspects are application specific but we suggest that different implementations might follow the same aspect pattern. The framework and the pattern allow us to propose architecture-specific guidelines that provide practical advice for both restructuring and implementing certain kinds of persistent and distributed applications with AspectJ.

关键词： languages standardization experimentation aspect-oriented programming separation of concerns AspectJ distributed programming object persistence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：