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

An event-driven framework for inter-user communication applications

INFORMATION AND SOFTWARE TECHNOLOGY 2006年第7期48卷 471-483页

作者： Hsu, Chien-Chih Wu, I. -Chen Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 300 Taiwan

This paper presents an event-driven framework for inter-user communication applications, such as Internet gaming or chatting, that require frequent communication among users. This paper addresses two major blocking problems for event-driven programming for inter-user communication applications, namely output blocking and request blocking. For the former, an output buffering mechanism is presented to solve this problem. For the latter, a service requesting mechanism with helper processes is presented to solve this problem. The above two mechanisms are incorporated into the framework presented in this paper to facilitate application development. In practice, this framework has been applied to online game development. (C) 2005 Elsevier B.V. All rights reserved.

关键词： inter-user communication applications event-driven programming concurrent programming framework threads

来源：评论

学校读者我要写书评

暂无评论

INTER-ENTRY SELECTION - NONDETERMINISM AND EXPLICIT CONTROL MECHANISMS

引用

COMPUTER LANGUAGES 1992年第4期17卷 269-282页

作者： OLSSON, RA MCNAMEE, CM Department of Computer Science University of California Davis CA 95616 U.S.A.

Many concurrent programming languages provide selection statements, which allow a task to select one of several entries to service. The choice as to which entry will be selected, if more than one has pending invocations, is generally defined to be non-deterministic. However, such non-deterministic inter-entry selection can result in undesirable program behavior. This paper examines the problems arising from such behavior and the existing approaches to remedy those problems. It indicates the inherent shortcomings of these approaches and purposes a new, more expressive extension of these approaches that remedies these shortcomings. This paper also considers how the different approaches can be implemented.

关键词： concurrent programming LANGUAGES concurrent programming SYNCHRONIZATION NONDETERMINISM RENDEZVOUS PREFERENCE CONTROL

来源：评论

学校读者我要写书评

暂无评论

artdaq: An Event-Building, Filtering, and Processing Framework

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 2013年第5期60卷 3764-3771页

作者： Biery, K. Green, C. Kowalkowski, J. Paterno, M. Rechenmacher, R. Fermilab Natl Accelerator Lab Div Comp Sci Batavia IL 60510 USA

Several current and proposed experiments at the Fermi National Accelerator Laboratory, Batavia, IL, USA, have novel data acquisition needs. These include 1) continuous digitization, using commercial high-speed digitizers, of signals from the detectors, 2) the transfer of all of the digitized waveform data to commercial off-the-shelf (COTS) processors, 3) the filtering or compression of the waveform data, or both, and 4) the writing of the resultant data to disk for later, more complete, analysis. To address these needs, members of the Accelerator and Detector Simulation and Support Department within the Scientific Computing Division at Fermilab are using parallel processing technologies in the development of artdaq, a generic data acquisition toolkit. The artdaq toolkit uses Message Passing Interface (MPI) and art, an established event-processing framework shared by new experiments at Fermilab. In an artdaq program, the digitized data are transferred into computing nodes using commodity Peripheral Component Interconnect Express (PCIe) cards, and event fragments are transferred between distributed processes using MPI and assembled into complete events. These events are then processed by a configurable selection of user-specified algorithms, commonly including filtering and compression algorithms, using the art event-processing framework. This paper describes the architecture and implementation of the first phase of the artdaq toolkit and shows early performance results with configurations that match upcoming experiments both at Fermilab and elsewhere.

关键词： concurrent programming data acquisition distributed programming

来源：评论

学校读者我要写书评

暂无评论

Reachability testing of concurrent programs

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2006年第6期32卷 382-403页

作者： Lei, Yu Carver, Richard H. Univ Texas Dept Comp Sci & Engn Arlington TX 76019 USA George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

One approach to testing concurrent programs, called reachability testing, generates synchronization sequences automatically and on-the-fly, without constructing any static models. In this paper, we present a general execution model for concurrent programs that allows reachability testing to be applied to several commonly used synchronization constructs. We also present a new method for performing reachability testing. This new method guarantees that every partially ordered synchronization sequence will be exercised exactly once without having to save any sequences that have already been exercised. We describe a prototype reachability testing tool called Rich Test and report some empirical results, including a comparison between Rich Test and a partial order reduction-based tool called VeriSoft. Rich Test performed significantly better for the programs in our study.

关键词： software testing reachability testing concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Scalable communication event tracing via clustering

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2017年 109卷 230-244页

作者： Bahmani, Amir Mueller, Frank North Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA

Communication traces help developers of high-performance computing (HPC) applications understand and improve their codes. When run on large-scale HPC facilities, the scalability of tracing tools becomes a challenge. To address this problem, traces can be clustered into groups of processes that exhibit similar behavior. Instead of collecting trace information of each individual node, it then suffices to collect a trace of a small set of representative nodes, namely one per cluster. However, clustering algorithms themselves need to have low overhead, be scalable, and adapt to application characteristics. We devised an adaptive clustering algorithm for large-scale applications called ACURDION that traces the MPI communication of code with O(log P) time complexity. First, ACURDION identifies the parameters that differ across processes by using a logarithmic algorithm called Adaptive Signature Building. Second, it clusters the processes based on those parameters. Experiments show that collecting traces of just nine nodes/clusters suffices to capture the communication behavior of all nodes for a wide set of HPC benchmarks codes while retaining sufficient accuracy of trace events and parameters. In summary, ACURDION improves trace scalability and automation over prior approaches. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Clustering algorithms programming techniques concurrent programming Performance measurement

来源：评论

学校读者我要写书评

暂无评论

THE VELOX TRANSACTIONAL MEMORY STACK

引用

IEEE MICRO 2010年第5期30卷 76-87页

作者： Felber, Pascal Riviere, Etienne Moreira, Walther Maldonado Harmanci, Derin Marlier, Patrick Diestelhorst, Stephan Hohmuth, Michael Pohlack, Martin Cristal, Adrian Hur, Ibrahim Unsal, Osman S. Stenstrom, Per Dragojevic, Aleksandar Guerraoui, Rachid Kapalka, Michal Gramoli, Vincent Drepper, Ulrich Tomic, Sasa Afek, Yehuda Korland, Guy Shavit, Nir Fetzer, Christof Nowack, Martin Riegel, Torvald Univ Neuchatel Dept Comp Sci CH-2009 Neuchatel Switzerland Univ Politecn Cataluna E-08028 Barcelona Spain Tel Aviv Univ Tel Aviv Israel Tech Univ Dresden Dresden Germany Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Chalmers Univ Technol Gothenburg Sweden Barcelona Supercomp Ctr Barcelona Spain

The transactional memory programming paradigm could become the coordination methodology of choice for actual and future multicore and many-core architectures. The transactional memory support spans a complete software and hardware stack, including programming language and hardware support, runtime and libraries, compilers, and application environments. The VELOX project has developed such a comprehensive transactional memory stack.

关键词： concurrent programming Software Transactional Memory Hardware Transactional Memory Compilers Language Extensions

来源：评论

学校读者我要写书评

暂无评论

Termination of just/fair computations in term rewriting

引用

INFORMATION AND COMPUTATION 2008年第5期206卷 652-675页

作者： Lucas, Salvador Meseguer, Jose Univ Politecn Valencia DSIC Valencia Spain Univ Illinois CS Dept Champaign IL 61820 USA

The main goal of this paper is to apply rewriting termination technology-enjoying a quite mature set of termination results and tools-to the problem of proving automatically the termination of concurrent systems under fairness assumptions. We adopt the thesis that a concurrent system can be naturally modeled as a rewrite system, and develop a theoretical approach to systematically transform, under reasonable assumptions, fair-termination problems into ordinary termination problems of associated relations, to which standard rewriting termination techniques and tools can be applied. Our theoretical results are combined into a practical proof method for proving fair-termination that can be automated and can be supported by current termination tools. We illustrate this proof method with some concrete examples and briefly comment on future extensions. (c) 2008 Published by Elsevier Inc.

关键词： concurrent programming fairness term rewriting program analysis termination

来源：评论

学校读者我要写书评

暂无评论

THE TEMPORAL LOGIC OF ACTIONS

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1994年第3期16卷 872-923页

作者： LAMPORT, L Digital Equipment Corp. Palo Alto CA

The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent systems. Systems and their properties are represented in the same logic, so the assertion that a system meets its specification and the assertion that one system implements another are both expressed by logical implication. TLA is very simple;its syntax and complete formal semantics are summarized in about a page. Yet, TLA is not just a logician's toy;it is extremely powerful, both in principle and in practice. This report introduces TLA and describes how it is used to specify and verify concurrent algorithms. The use of TLA to specify and reason about open systems will be described elsewhere.

关键词： THEORY VERIFICATION concurrent programming LIVENESS PROPERTIES SAFETY PROPERTIES

来源：评论

学校读者我要写书评

暂无评论

OC-FP, AN APPLICATIVE LANGUAGE COMBINATION WITH OCCAM AND THE ALGEBRA OF PROCESSES

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROprogramming 1987年第1-5期21卷 549-557页

作者： GLUCK, R DEMUTH, C VIENNA TECH UNIV INST PRAKT INFORMATA-1040 VIENNAAUSTRIA VIENNA TECH UNIV INST ANGEW INFORMAT & SYST ANALA-1040 VIENNAAUSTRIA

A functional language based on the FP-model is presented. The language combines occam processes and is used as a command level language for occam systems. It is well suited as a graphical language for concurrent programming. An algebra, based on the functional properties of the language, makes process-and communication structures accessible to (semi-) automatical transformations.

关键词： concurrent programming applicative programming occam FP transformations of process-structure algebra of processes graphical programming

来源：评论

学校读者我要写书评

暂无评论

A criterion to enforce correctness of indirectly cooperating applications

引用

INFORMATION SCIENCES 1998年第3-4期110卷 279-302页

作者： Canals, G Godart, C Molli, P Munier, M Univ Henri Poincare LORIA F-54506 Vandoeuvre Nancy France

Cooperative applications are expected to become commonplace in the future. We are concerned hen with a special case of cooperation called indirect cooperation. The idea of the paper is that a Concurrency Control approach better fits to indirect cooperation than a concurrent programming one. In other words, there do exist syntactic correctness criteria which define a large sphere of security in which application programmers are released from the burden of interaction explicit programming. This paper argues this point of view and describes such a criterion: the COO-serializability. It applies for a class of applications which cooperate indirectly. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： cooperation concurrency control concurrent programming correctness criterion cooperative programming cooperative execution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：