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

18th ACM SIGPLAN International Conference on Functional programming

作者： Schmidt-Schauss, Manfred Sabel, David Goethe Univ Frankfurt Frankfurt Germany

ISBN: (纸本)9781450323260

A concurrent implementation of software transactional memory in concurrent Haskell using a call-by-need functional language with processes and futures is given. The description of the small-step operational semantics is precise and explicit, and employs an early abort of conflicting transactions. A proof of correctness of the implementation is given for a contextual semantics with may- and should-convergence. This implies that our implementation is a correct evaluator for an abstract specification equipped with a bigstep semantics.

关键词： Languages Theory Verification Functional programming concurrent programming Semantics Software Transactional Memory Haskell

来源：评论

学校读者我要写书评

暂无评论

Automatic concurrent Program Generation from Petri nets

Automatic concurrent Program Generation from Petri nets

引用

12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)

作者： Liao, Weizhi Li, Wenjing Jiaxing Univ Coll Math Phys & Informat Engn Jiaxing Peoples R China Guangxi Teachers Educ Univ Coll Comp & Inf Eng Nanning Peoples R China

ISBN: (纸本)9780769550602

Automatic generation of code from Petri-Nets is an important topic. This paper presents a new approach to automatically translate Petri nets into concurrent program. In the proposed approach, place in Petri net is viewed as variable and transition as operating statement which change place marking according to enable and firing semantics. In order to conveniently translate Petri net to CC++ program code, sequence block and independent transition is defined and a graph called virtual Petri net is constructed. The translation rules of sequence structure, concurrent structure, select structure and loop structure of Petri nets are developed. According to these presented translation rules, an algorithm of concurrent program code generated automatically for Petri net was proposed. Finally, through case study, the effectiveness of the developed approach is illustrated.

关键词： Petri nets automatic concurrent programming CC plus

来源：评论

学校读者我要写书评

暂无评论

Correctness of an STM Haskell Implementation

引用

ACM SIGPLAN NOTICES 2013年第9期48卷 161-172页

作者： Schmidt-Schauss, Manfred Sabel, David Goethe Univ Frankfurt Frankfurt Germany

关键词： Languages Theory Verification Functional programming concurrent programming Semantics Software Transactional Memory Haskell

来源：评论

学校读者我要写书评

暂无评论

Deterministic Parallel programming with Haskell

引用

COMPUTING IN SCIENCE & ENGINEERING 2012年第6期14卷 36-42页

作者： Coutts, Duncan Loh, Andres Well-Typed LLP Well-Typed LLP

Haskell is a modern, functional programming language with an interesting story to tell about parallelism: rather than using concurrent threads and locks, Haskell offers a variety of libraries that enable concise, high-level parallel programs with results that are guaranteed to be deterministic (independent of the number of cores and the scheduling being used).

关键词： Parallel programming Functional Languages Functional programming Haskell Code Deterministic Parallel programming Functional programming Language High Level Parallel Programs Parallel Processing concurrent Computing Parallel programming Poisson Equations Message Systems Computer Languages programming Scientific Computing High Performance Code Haskell Applicative Functional programming concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Concurrency and Message Passing in Erlang

引用

COMPUTING IN SCIENCE & ENGINEERING 2012年第6期14卷 24-34页

作者： Vinoski, Steve Basho Technologies

Developers use the open source Erlang programming language in domains such as telecommunications, database systems, and the Web due to its superior support for concurrency and reliability. Erlang applications comprise numerous processes-lightweight user-space threads-that communicate via message passing. This article focuses on Erlang's concurrency support and details an example 1D Poisson solver program.

关键词： Welding concurrent Computing programming Telecommunications Reliability Syntactics Pattern Matching Scientific Computing Applicative Functional programming concurrent programming programming Paradigms concurrent Languages Distributed Languages Parallel Languages

来源：评论

学校读者我要写书评

暂无评论

Supporting Cloud Computing Using Erlang programming Language

Supporting Cloud Computing Using Erlang Programming Language

引用

20th Telecommunications Forum

作者： Hussein, Abd El-Fattah Ibrahim, Osman Arab Acad Mari Transport & Technol AAST Fac Engn Cairo Egypt British Univ Egypt BUE Fac Comp Sc & Informat Cairo Egypt

ISBN: (纸本)9781467329842;9781467329835

Cloud computing is the delivery of computing as a service rather than a product, whereby shared resources, software, and information are provided to computers and other devices as a utility over a network (typically the Internet). Erlang programming Language is a perfect fit for cloud computing, not only for developing applications, but also for powering cloud infrastructure. In this paper we propose two frameworks employing Erlang programming language for building reliable and scalable cloud applications using Erlang features and its related components and libraries. Erlang native features of directly supporting distribution, fault tolerance will help write, deploy, and run applications easily in the cloud.

关键词： Cloud Computing concurrent programming Distribution Computation Erlang programming Language

来源：评论

学校读者我要写书评

暂无评论

Finding Atomicity-Violation Bugs through Unserializable Interleaving Testing

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2012年第4期38卷 844-860页

作者： Lu, Shan Park, Soyeon Zhou, Yuanyuan Univ Wisconsin Dept Comp Sci Madison WI 53706 USA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA

Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violations are common and important. How to test the interleaving space and expose atomicity-violation bugs is an open problem. This paper makes three contributions. First, it designs and evaluates a hierarchy of four interleaving coverage criteria using 105 real-world concurrency bugs. This study finds a coverage criterion (Unserializable Interleaving Coverage) that balances the complexity and the capability of exposing atomicity-violation bugs well. Second, it studies stress testing to understand why this common practice cannot effectively expose atomicity-violation bugs from the perspective of unserializable interleaving coverage. Third, it designs CTrigger following the unserializable interleaving coverage criterion. CTrigger uses trace analysis to identify feasible unserializable interleavings, and then exercises low-probability interleavings to expose atomicity-violation bugs. We evaluate CTrigger with real-world atomicity-violation bugs from seven applications. CTrigger efficiently exposes these bugs within 1-235 seconds, two to four orders of magnitude faster than stress testing. Without CTrigger, some of these bugs do not manifest even after seven days of stress testing. Furthermore, once a bug is exposed, CTrigger can reliably reproduce it, usually within 5 seconds, for diagnosis.

关键词： Testing and debugging debugging aids diagnostics testing strategies test coverage of code concurrent programming bug characteristics

来源：评论

学校读者我要写书评

暂无评论

Autotuning Skeleton-Driven Optimizations for Transactional Worklist Applications

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2012年第12期23卷 2205-2218页

作者： Wanderley Goes, Luis Fabricio Ioannou, Nikolas Xekalakis, Polychronis Cole, Murray Cintra, Marcelo Pontificia Univ Catolica Minas Gerais BR-31015190 Belo Horizonte MG Brazil IBM Zurich Res Lab CH-8803 Ruschlikon Switzerland Intel Labs Barcelona Intel Barcelona Res Ctr Barcelona 08034 Spain Univ Edinburgh Edinburgh EH8 9AB Midlothian Scotland

Skeleton or pattern-based programming allows parallel programs to be expressed as specialized instances of generic communication and computation patterns. In addition to simplifying the programming task, such well structured programs are also amenable to performance optimizations during code generation and also at runtime. In this paper, we present a new skeleton framework that transparently selects and applies performance optimizations in transactional worklist applications. Using a novel hierarchical autotuning mechanism, it dynamically selects the most suitable set of optimizations for each application and adjusts them accordingly. Our experimental results on the STAMP benchmark suite show that our skeleton autotuning framework can achieve performance improvements of up to 88 percent, with an average of 46 percent, over a baseline version for a 16-core system and up to 115 percent, with an average of 56 percent, for a 32-core system. These performance improvements match or even exceed those obtained by a static exhaustive search of the optimization space.

关键词： concurrent programming transactional memory parallel patterns and application-transparent adaptation

来源：评论

学校读者我要写书评

暂无评论

Static slicing of explicitly synchronized languages

引用

INFORMATION AND COMPUTATION 2012年 214卷 10-46页

作者： Leuschel, Michael Llorens, Marisa Oliver, Javier Silva, Josep Tamarit, Salvador Univ Politecn Valencia E-46022 Valencia Spain Univ Dusseldorf Inst Informat D-40225 Dusseldorf Germany

Static analysis of concurrent languages is a complex task due to the non-deterministic execution of processes. If the concurrent language being studied allows process synchronization, then the analyses are even more complex (and thus expensive), e.g., due to the phenomenon of deadlock. In this work we introduce a static analysis technique based on program slicing for concurrent and explicitly synchronized languages in general, and CSP in particular. Concretely. given a particular point in a specification, our technique allows us to know what parts of the specification must necessarily be executed before this point, and what parts of the specification could be executed before it. Our technique is based on a new data structure that extends the Synchronized Control Flow Graph (SCFG). We show that this new data structure improves the SCFG by taking into account the context in which processes are called and, thus, it makes the slicing process more precise. The technique has been implemented and tested with real specifications, producing good results. After formally defining our technique, we describe our tool, its architecture, its main applications and the results obtained from several experiments conducted in order to measure the performance of the tool. (C) 2012 Elsevier Inc. All rights reserved.

关键词： concurrent programming CSP Program slicing

来源：评论

学校读者我要写书评

暂无评论

Relaxed Concurrency Control in Software Transactional Memory

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2012年第7期23卷 1312-1325页

作者： Aydonat, Utku Abdelrahman, Tarek S. Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

Some of today's TM systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict occurs. 2PL is a simple algorithm that provides fast transactional operations. However, it limits concurrency in benchmarks with high contention because it increases the rate of aborts. We propose the use of a more relaxed concurrency control algorithm to provide better concurrency. This algorithm is based on the conflict-serializability (CS) model. Unlike 2PL, it allows some transactions to commit successfully even when they make conflicting accesses. We implement this algorithm in a STM system and evaluate its performance on 16 cores using standard benchmarks. Our evaluation shows that the algorithm improves the performance of applications with long transactions and high abort rates. Throughput is improved by up to 2.99 times despite the overheads of testing for CS at runtime. These improvements come with little additional implementation complexity and require no changes to the transactional programming model. We also propose an adaptive approach that switches between 2PL and CS to mitigate the overhead in applications that have low abort rates.

关键词： Transactional memory serializability concurrent programming synchronization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：