Communicating Process Architectures Conference最新文献_第7页

Performance of the Distributed CPA Protocol and Architecture on Traditional Networks 传统网络中分布式CPA协议的性能与体系结构

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-60750-774-1-227

K. Chalmers

引用次数: 2

Designing a Mathematically Verified I2C Device Driver Using ASD 用ASD设计一个数学验证的I2C设备驱动程序

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-60750-065-0-105

A. Klomp, Herman W. Roebbers, Ruud Derwig, Leon Bouwmeester

引用次数: 1

Asynchronous Active Objects in Java Java中的异步活动对象

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-58603-907-3-237

George Oprean, J. Pedersen

引用次数: 1

Verification of a Dynamic Channel Model using the SPIN Model Checker 使用SPIN模型检查器验证动态通道模型

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-60750-774-1-35

R. M. Friborg, B. Vinter

{"title":"Verification of a Dynamic Channel Model using the SPIN Model Checker","authors":"R. M. Friborg, B. Vinter","doi":"10.3233/978-1-60750-774-1-35","DOIUrl":"https://doi.org/10.3233/978-1-60750-774-1-35","url":null,"abstract":"This paper presents the central elements of a new dynamic channel leading towards a flexible CSP design suited for high-level languages. This channel is separated into three models: a shared-memory channel, a distributed channel and a dynamic synchronisation layer. The models are described such that they may function as a basis for implementing a CSP library, though many of the common features known in available CSP libraries have been excluded from the models. The SPIN model checker has been used to check for the presence of deadlocks, livelocks, starvation, race conditions and correct channel communication behaviour. The three models are separately verified for a variety of different process configurations. This verification is performed automatically by doing an exhaustive verification of all possible transitions using SPIN. The joint result of the models is a single dynamic channel type which supports both local and distributed any-to-any communication. This model has not been verified and the large state-space may make it unsuited for exhaustive verification using a model checker. An implementation of the dynamic channel will be able to change the internal synchronisation mechanisms on-the-fly, depending on the number of channel-ends connected or their location.","PeriodicalId":246267,"journal":{"name":"Communicating Process Architectures Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123396137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

An Analysis of Programmer Productivity versus Performance for High Level Data Parallel Programming 高级数据并行编程的程序员生产力与性能分析

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-60750-774-1-111

A. Cole, A. McEwan, Satnam Singh

{"title":"An Analysis of Programmer Productivity versus Performance for High Level Data Parallel Programming","authors":"A. Cole, A. McEwan, Satnam Singh","doi":"10.3233/978-1-60750-774-1-111","DOIUrl":"https://doi.org/10.3233/978-1-60750-774-1-111","url":null,"abstract":"Abstract. Data parallel programming provides an accessible model for exploiting thepower of parallel computing elements without resorting to the explicit use of low levelprogramming techniques based on locks, threads and monitors. The emergence ofGraphics Processing Units (GPUs) with hundreds or thousands of processing cores hasmade data parallel computing available to a wider class of programmers. GPUs can beused not only for accelerating the processing of computer graphics but also for generalpurpose data-parallel programming. Low level data-parallel programming languagesbased on the Compute Uniﬁed Device Architecture (CUDA) provide an approach fordeveloping programs for GPUs but these languages require explicit creation and coor-dination of threads and careful data layout and movement. This has created a demandfor higher level programming languages and libraries which raise the abstraction levelof data-parallel programming and increase programmer productivity. The Acceleratorsystem was developed by Microsoft for writing data parallel code in a high level man-ner which can execute on GPUs, multicore processors using SSE3 vector instructionsand FPGA chips. This paper compares the performance and development effort of thehigh level Accelerator system against lower level systems which are more difﬁcult touse but may yield better results. Speciﬁcally, we compare against the NVIDIA CUDAcompiler and sequential C++ code considering both the level of abstraction in the im-plementation code and the execution models. We compare the performance of thesesystems using several case studies. For some classes of problems, Accelerator has aperformance comparable to CUDA, but for others its performance is signiﬁcantly re-duced; however in all cases it provides a model which is easier to use and enablesgreater programmer productivity.Keywords. GPGPU, Accelerator, CUDA, comparisons.","PeriodicalId":246267,"journal":{"name":"Communicating Process Architectures Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124232652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

An Application of CoSMoS Design Methods to Pedestrian Simulation CoSMoS设计方法在行人仿真中的应用

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-60750-065-0-197

Sarah Clayton, N. Urquhart, J. Kerridge

引用次数: 0

Mobile Agents and Processes using Communicating Process Architectures 使用通信过程体系结构的移动代理和进程

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-58603-907-3-397

J. Kerridge, Jens-Oliver Haschke, K. Chalmers

{"title":"Mobile Agents and Processes using Communicating Process Architectures","authors":"J. Kerridge, Jens-Oliver Haschke, K. Chalmers","doi":"10.3233/978-1-58603-907-3-397","DOIUrl":"https://doi.org/10.3233/978-1-58603-907-3-397","url":null,"abstract":"The mobile agent concept has been developed over a number of years and is widely accepted as one way of solving problems that require the achievement of a goal that cannot be serviced at a specific node in a network. The concept of a mobile process is less well developed because implicitly it requires a parallel environment within which to operate. In such a parallel environment a mobile agent can be seen as a specialization of a mobile process and both concepts can be incorporated into a single application environment, where both have well defined requirements, implementation and functionality. These concepts are explored using a simple application in which a node in a network of processors is required to undertake some processing of a piece of data for which it does not have the required process. It is known that the required process is available somewhere in the network. The means by which the required process is accessed and utilized is described. As a final demonstration of the capability we show how a mobile meeting organizer could be built that allows friends in a social network to create meetings using their mobile devices given that they each have access to the others' on-line diaries.","PeriodicalId":246267,"journal":{"name":"Communicating Process Architectures Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133831689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Object Store Based Simulation Interworking 基于对象存储的仿真互联

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-60750-774-1-243

Carl G. Ritson, P. Andrews, Adam T. Sampson

引用次数: 1

Combining EDF Scheduling with occam using the Toc Programming Language 用Toc编程语言将EDF调度与occam相结合

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-58603-907-3-55

Martin Korsgaard, S. Hendseth

引用次数: 6

The SCOOP Concurrency Model in Java-like Languages 类java语言中的SCOOP并发模型

Communicating Process Architectures Conference Pub Date : 1900-01-01 DOI: 10.3233/978-1-60750-065-0-7

F. Torshizi, J. Ostroff, R. Paige, M. Chechik

引用次数: 12