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

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

来源：评论

学校读者我要写书评

暂无评论

xCalls: Safe I/O in Memory Transactions 09

xCalls: Safe I/O in Memory Transactions

引用

4th ACM European Conference on Computer Systems (EuroSys 09)

作者： Volos, Haris Tack, Andres Jaan Goyal, Neelarn Swift, Michael M. Welc, Adam Univ Wisconsin Madison Madison WI 53706 USA

ISBN: (纸本)9781605584829

Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolated. Thus, programs using transactions do not suffer from deadlock. However, when a transaction performs I/O or accesses kernel resources, the atomicity and isolation guarantees from the TM system do not apply to the kernel. The xCall interface is a new API that provides transactional semantics for system calls. With a combination of deferral and compensation, xCalls enable transactional memory programs to use common OS functionality within transactions. We implement xCalls for the Intel Software Transactional Memory compiler, and found it straightforward to convert programs to use transactions and xCalls. In tests on a 16-core NUMA machine, we show that xCalls enable concurrent I/O and system calls within transactions. Despite the overhead of implementing transactions in software, transactions with xCalls improved the performance of two applications with poor locking behavior by 16 and 70%.

关键词： concurrent programming Transactional memory xCalls System calls I/O

来源：评论

学校读者我要写书评

暂无评论

Flexible Image Acquisition Service for Distributed Robotic Systems 2

Flexible Image Acquisition Service for Distributed Robotic S...

引用

2nd IEEE International Conference on Robotic Computing (IRC)

作者： Semeniuta, Oleksandr Falkman, Petter NTNU Norwegian Univ Sci & Technol Dept Mfg & Civil Engn Gjovik Norway Chalmers Univ Technol Dept Elect Engn Gothenburg Sweden

ISBN: (纸本)9781538646519

The widespread use vision systems in robotics introduces a number of challenges related to management of image acquisition and image processing tasks, as well as their coupling to the robot control function. With the proliferation of more distributed setups and flexible robotic architectures, the workflow of image acquisition needs to support a wider variety of communication styles and application scenarios. This paper presents FxIS, a flexible image acquisition service targeting distributed robotic systems with event-based communication. The principal idea a FxIS is in composition of a number of execution threads with a set of concurrent data structures, supporting acquisition from multiple cameras that is closely synchronized in time, both between the cameras and with the request timestamp.

关键词： Computer vision concurrent programming Distributed systems GigE vision Image acquisition Service oriented architecture

来源：评论

学校读者我要写书评

暂无评论

Experiences of Applying One-Sided Communication to Nearest-Neighbor Communication 1

Experiences of Applying One-Sided Communication to Nearest-N...

引用

1st PGAS Applications Workshop (PAW)

作者： Shan, Hongzhang Williams, Samuel Zheng, Yili Zhang, Weiqun Wang, Bei Ethier, Stephane Zhao, Zhengji Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA 94720 USA Princeton Univ PICSciE Princeton NJ 08540 USA Princeton Univ Princeton Plasma Phys Lab Princeton NJ 08540 USA Lawrence Berkeley Natl Lab NERSC Berkeley CA 94720 USA

ISBN: (纸本)9781509052141

Nearest-neighbor communication is one of the most important communication patterns appearing in many scientific applications. In this paper, we discuss the results of applying UPC++, a library-based partitioned global address space (PGAS) programming extension to C++, to an adaptive mesh framework (BoxLib), and a full scientific application GTC-P, whose communications are dominated by the nearest-neighbor communication. The results on a Cray XC40 system show that compared with the highly-tuned MPI two-sided implementations, UPC++ improves the communication performance up to 60% and 90% for BoxLib and GTC-P, respectively. We also implement the nearest-neighbor communication using MPI one-sided messages. The performance comparison demonstrates that the MPI one-sided implementation can also improve the communication performance over the two-sided version but not so significantly as UPC++ does.

关键词： concurrent programming Performance measures

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Complexity of Pattern-based Verification for Multithreaded Programs 11

Complexity of Pattern-based Verification for Multithreaded P...

引用

38th Symposium on Principles of programming Languages

作者： Esparza, Javier Ganty, Pierre Tech Univ Munich Fak Informat D-8000 Munich Germany

ISBN: (纸本)9781450304900

Pattern-based verification checks the correctness of the program executions that follow a given pattern, a regular expression over the alphabet of program transitions of the form w(1)* ... w(n)*. For multithreaded programs, the alphabet of the pattern is given by the synchronization operations be tween threads. We study the complexity of pattern-based verification for abstracted multithreaded programs in which, as usual in program analysis, conditions have been replaced by nondeterminism (the technique works also for boolean programs). While unrestricted verification is undecidable for abstracted multithreaded programs with recursive procedures and PSPACE-complete for abstracted multithreaded while-programs, we show that pattern-based verification is NP-complete for both classes. We then conduct a multiparameter analysis in which we study the complexity in the number of threads, the number of procedures per thread, the size of the procedures, and the size of the pattern. We first show that no algorithm for pattern-based verification can be polynomial in the number of threads, procedures per thread, or the size of the pattern (unless P=NP). Then, using recent results about Parikh images of regular languages and semilinear sets, we present an algorithm exponential in the number of threads, procedures per thread, and size of the pattern, but polynomial in the size of the procedures.

关键词： concurrent programming safety context-free languages

来源：评论

学校读者我要写书评

暂无评论

Resource Sharing via Capability-Based Multiparty Session Types 15th

Resource Sharing via Capability-Based Multiparty Session Typ...

引用

15th International Conference on integrated Formal Methods (IFM)

作者： Voinea, A. Laura Dardha, Ornela Gay, Simon J. Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland

ISBN: (纸本)9783030349684;9783030349677

Multiparty Session Types (MPST) are a type formalism used to model communication protocols among components in distributed systems, by specifying type and direction of data transmitted. It is standard for multiparty session type systems to use access control based on linear or affine types. While useful in offering strong guarantees of communication safety and session fidelity, linearity and affinity run into the well-known problem of inflexible programming, excluding scenarios that make use of shared channels or need to store channels in shared data structures. In this paper, we develop capability-based resource sharing for multiparty session types. In this setting, channels are split into two entities, the channel itself and the capability of using it. This gives rise to a more flexible session type system, which allows channel references to be shared and stored in persistent data structures. We illustrate our type system through a producer-consumer case study. Finally, we prove that the resulting language satisfies type safety.

关键词： Session types Sharing concurrent programming

来源：评论

学校读者我要写书评

暂无评论

pseuCo Book: An Interactive Learning Experience 22

pseuCo Book: An Interactive Learning Experience

引用

27th ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE)

作者： Freiberger, Felix Saarland Univ Comp Sci Saarland Informat Campus Saarbrucken Germany

ISBN: (纸本)9781450392013

Software tools and apps are pervading educational technology in many areas, not least in the field of computer science education. However, many of these tools have a very narrow scope and lack context, or only work as add-ons to textbooks and other course materials. This paper advocates an alternative: a truly interactive textbook experience where interactive demonstrations and exercises are interwoven with more classical textual elements. We present a framework that provides authors with the infrastructure for writing such books, and present pseuCo Book, an interactive book for teaching concurrent programming. The effectiveness of this approach is demonstrated by a user study encompassing a detailed empirical evaluation.

关键词： computer science education concurrent programming concurrency theory interactive textbook

来源：评论

学校读者我要写书评

暂无评论

A mechanically verified incremental garbage collector

引用

Formal Aspects of Computing 1994年第4期6卷 359-390页

作者： Russinoff, David M. Computational Logic Inc. Austin 78703-4776 TX 1717 West Sixth Street Suite 290 United States

As an application of a system designed for concurrent program verification, we describe a formalisation and mechanical proof of the correctness of Ben-Ari's incremental garbage collection algorithm. The proof system is based on the Manna-Pnueli model of concurrency and is implemented as an extension of the Boyer-Moore prover. The correctness of the garbage collector is represented by two theorems, stating a) that nothing except garbage is ever collected (safety), and b) that all garbage is eventually collected (liveness). We compare our mechanised treatment with several published proofs of the same results. © 1994 BCS.

关键词： Boyer-Moore prover concurrent programming Incremental garbage collection Mechanical program verification

来源：评论

学校读者我要写书评

暂无评论

A train control modeling with the real-time object paradigm 3rd

引用

ECOOP 98 Workshop on Object-Oriented Technology

作者： Gérard, S Lanusse, A Terrier, F CEA Saclay Direct Technol Informat & Informat PSA Peugeot Citroen F-91191 Gif Sur Yvette France CEA Saclay DEIN LETI CEA Technol Avancees F-91191 Gif Sur Yvette France

ISBN: (纸本)3540654607

The train case study is tackled with the ACCORD method developed at the CEA-LETI. This approach aims to provide a framework for real-time development as close as possible to classic object oriented methods. Thanks to high level abstractions (namely the real-time active object concept) real-time modeling can be achieved without mixing up implementation issues with domain specific one. This approach maximizes reusability and designers may fully benefit from object oriented experience acquired in other domains. In the first part of this paper, we rapidly describe the ACCORD CASE tool, especially the method step and the underlying models. In this part, we will describe too the Framework itself and the automatic implementation aspect. Second we will go back through each stage of the method by illustrating them thanks to the train control example. [2] We focus on the real-time aspects and we will try to answer to both the main questions: Hour and where real-time may be specified?

关键词： real-time UML concurrent programming active object

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：