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

Instant replay debugging of concurrent logic programs

NEW GENERATION COMPUTING 1996年第1期14卷 79-107页

作者： Shen, K Gregory, S Department of Computer Science University of Bristol Bristol U.K.

One problem with debugging (committed choice) concurrent logic programs is that their behaviour may be non-deterministic, in that successive executions of the same program may produce different results. We describe a scheme, based on the 'Instant Replay' scheme developed for more conventional parallel languages, that allows us to reproduce the execution behaviour of a concurrent logic program on subsequent executions, so that the execution may be examined for debugging purposes. The properties of concurrent logic programming languages allow us to simplify our scheme greatly. We have demonstrated our scheme with KLIC, and KL1 on the PIM multiprocessors, but it can also be applied to other committed choice concurrent logic programming languages.

关键词： concurrent programming logic programming debuggings instant replay compile-time analysis abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

COOPERATIVE DISTRIBUTED ALGORITHMS FOR DYNAMIC CYCLE PREVENTION

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第5期13卷 540-552页

作者： KATZ, S SHMUELI, O MCC DATABASE PROGRAM AUSTINTX 78759

Parallel distributed algorithms are introduced for adding and deleting edges in a directed graph without creating a cycle. These algorithms are useful for a variety of problems in distributed systems, such as preventing deadlock or ordering priorities. The algorithms operate in a realistic asynchronous computer network environment in which there are many possible interactions among overlapping instances of the algorithms. The distributed algorithms are obtained from a sequential algorithm. In formulating distributed versions of the algorithm from a sequentional version, the crucial role of an invariant is emphasized. Global correctness of the distributed algorithms depends upon (locally) preserving this invariant. Thus, the correctness of the algorithms is proven relatively easily. Interactions and cooperation between various activations of the algorithms are exploited to minimize redundant computation. A restricted freezing mechanism, definitive reranking, is shown to be incorporated easily into the proposed schemes.

关键词： Distributed Systems concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Empirical research on concurrent software testing: A systematic mapping study

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2019年 105卷 226-251页

作者： Melo, Silvana M. Carver, Jeffrey C. Souza, Paulo S. L. Souza, Simone R. S. Univ Sao Paulo Inst Math & Comp Sci Ave Trabalhador Sao Carlense400 Ctr BR-13566590 Sao Carlos SP Brazil Univ Alabama Dept Comp Sci 3441 SECBox 870290 Tuscaloosa AL 35487 USA

Background: concurrent software testing is a costly and difficult task, especially due to the exponential increase in the test sequences caused by non-determinism. Such an issue has motivated researchers to develop testing techniques that select a subset of the input domain that has a high probability of revealing faults. Academics and industrial practitioners rarely use most concurrent software testing techniques because of the lack of data about their applicability. Empirical evidence can provide an important scientific basis for the strengths and weaknesses of each technique to help researchers and practitioners choose concurrent testing techniques appropriate for their environments. Aim: This paper gathers and synthesizes empirical research on concurrent software testing to characterize the field and the types of empirical studies performed. Method: We performed a systematic mapping study to identify and analyze empirical research on concurrent software testing techniques. We provide a detailed analysis of the studies and their design choices. Results: The primary findings are: (1) there is a general lack of empirical validation of concurrent software testing techniques, (2) the type of evaluation method varies with the type of technique, (3) there are some key challenges to empirical study design in concurrent software testing, and (4) there is a dearth of controlled experiments in concurrent software testing. Conclusions: There is little empirical evidence available about some specific concurrent testing techniques like model-based testing and formal testing. Overall, researchers need to perform more empirical work, especially real-world case studies and controlled experiments, to validate properties of concurrent software testing techniques. In addition, researchers need to perform more analyses and synthesis of the existing evidence. This paper is a first step in that direction.

关键词： Empirical software engineering concurrent programming Software testing Systematic mapping

来源：评论

学校读者我要写书评

暂无评论

DHash: Dynamic Hash Tables With Non-Blocking Regular Operations

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第12期33卷 3274-3290页

作者： Wang, Junchang Liu, Dunwei Fu, Xiong Xiao, Fu Tian, Chen Nanjing Univ Posts & Telecommun Sch Comp Sci Nanjing 210023 Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210008 Peoples R China

Once started, existing hash tables cannot change their pre-defined hash functions, even if the incoming data cannot be evenly distributed to the hash table buckets. In this paper, we present DHash, a type of hash table for shared memory systems, that can change its hash function and rebuild the hash table on the fly, without noticeably degrading its service. The major technical novelty of DHash stems from an efficient distributing mechanism that can atomically distribute every node when rebuilding, without locking the corresponding hash table buckets. This not only enables non-blocking lookup, insert, and delete operations, but more importantly, makes DHash independent of the implementation of hash table buckets, such that DHash allows programmers to select the set algorithms that meet their requirements best from a variety of existing lock-free and wait-free set algorithms. Evaluations show that DHash can efficiently change its hash function on the fly. Moreover, when rebuilding, DHash consistently outperforms the state-of-the-art hash tables in terms of throughput and response time of concurrent operations, at different concurrency levels, and with different operation mixes and average load factors.

关键词： Hash functions Heuristic algorithms Robustness Kernel Synchronization Linux Time factors concurrent programming parallelism and concurrency dynamic hash tables

来源：评论

学校读者我要写书评

暂无评论

CAPSULES - A SHARED-MEMORY ACCESS MECHANISM FOR concurrent C/C++

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1993年第7期4卷 795-811页

作者： GEHANI, NH AT and T Bell Laboratories Inc. Murray Hill NJ USA

concurrent C/C++ is a superset of C and C++ that provides parallel programming facilities based on message passing. Upon porting concurrent C/C++ to a shared memory multiprocessor, we felt it would be appropriate to supplement concurrent C/C++ with explicit facilities for synchronizing accesses to shared data structures. The capsule is a shared memory access mechanism designed especially for concurrent C/C++ to match the C++ data abstraction facility called the class. Capsules are like monitors but they have significant advantages. Capsules satisfy Bloom's criteria for expressiveness of synchronization conditions, support inheritance, allow operations to execute in parallel, and permit them to time out. Although many concepts used in capsules have been suggested elsewhere, they are synthesized in a way which offers many advantages over classical shared memory mechanisms. In this paper, I will motivate the design of capsules, briefly review and evaluate existing shared memory mechanisms, describe capsules, give examples of capsules, compare capsules with monitors, and discuss how capsules are implemented by the concurrent C compiler.

关键词： CLASSES concurrent programming INHERITANCE MESSAGE PASSING PARALLEL programming

来源：评论

学校读者我要写书评

暂无评论

Data-race and concurrent-write freedom are undecidable

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2003年第1-2期29卷 1-13页

作者： Campos, AE Suazo, DA Pontificia Univ Catolica Chile Dept Ciencia Computac Santiago 22 Chile

In a distributed shared memory system, sequential consistency is often assumed as the model for the memory, because it is a natural extension from multitasking in uniprocessor systems. Weaker consistency models allow greater concurrency, but programming is harder, because programs may produce unexpected results. Data-race-free (DRF) and concurrent-write-free (CWF) programs have the same set of possible executions both under a sequentially consistent memory and under some other, weaker model, memories. They can be written for a sequential memory and run unchanged under such a weaker-model memory. Since the sets of possible executions are the same, the run will only produce results that are possible under sequential consistency. This article proves the undecidability of both classes of concurrent programs in a language with if statements, loops, barriers, dynamic process creation, dynamic storage, and recursive data structures, under many models weaker than sequential consistency. Moreover, the article also proves that methods that only add synchronization statements to programs written for sequential consistency must produce some conservatively DRF or CWF programs. (C) 2003 Elsevier Ltd. All rights reserved.

关键词： concurrent programming distributed shared memory static analysis data-race-free programs concurrent-write-free programs undecidability

来源：评论

学校读者我要写书评

暂无评论

Efficient clustering for ultra-scale application tracing

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2016年第0期98卷 25-39页

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

Extreme-scale computing poses a number of challenges to application performance. Developers need to study application behavior by collecting detailed information with the help of tracing toolsets to determine shortcomings. But not only applications are "scalability challenged", current tracing toolsets also fall short of exascale requirements for low background overhead since trace collection for each execution entity is becoming infeasible. One effective solution is to cluster processes with the same behavior into groups. Instead of collecting performance information from each individual node, this information can be collected from just a set of representative nodes. This work contributes a fast, scalable, signature-based clustering algorithm that clusters processes exhibiting similar execution behavior. Instead of prior work based on statistical clustering, our approach produces precise results nearly without loss of events or accuracy. The proposed algorithm combines low overhead at the clustering level with log(P) time complexity, and it splits the merge process to make tracing suitable for extreme-scale computing. Overall, this multi-level precise clustering based on signatures further generalizes to a novel multi-metric clustering technique with unprecedented low overhead. (C) 2016 Elsevier Inc. All rights reserved.

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

来源：评论

学校读者我要写书评

暂无评论

*** 3.0: Remote Robotic Platform for Teaching Innovation

引用

REVISTA IBEROAMERICANA DE AUTOMATICA E INFORMATICA INDUSTRIAL 2010年第1期7卷 54-+页

作者： Pavon, Nieves Ferruz, Joaquin Univ Huelva EPS Rabida Dept Tecnol Informac Palos De La Frontera 21071 Huelva Spain Univ Seville Dept INgn Sistemas & Automat Escuela Ingenieros Seville 41092 Spain

During the last three academic years, the Basic ENvironment for DEveloping Robotic software (BENDER robotic platform) has been used ill concurrent programming, (a subject lectured during the second year in the syllabus of the Computer Science Degree). From the first version to the third, several improvements have been made. This paper analyses these changes and shows low the robotic platform provides a new method to carry Out the practical work in a real environment. A project for extending the capabilities of the system is also presented in order to get a better remote access method. Copyright (C) 2010 CEA.

关键词： concurrent programming Teaching Innovation in Automation Real Time Systems Robotics

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTED TERMINATION OF concurrent PROCESSES IN OCCAM

引用

COMPUTER LANGUAGES 1993年第1期19卷 51-62页

作者： TALIA, D CRAI Localit&agrave S. Stefano 87036 Rende (CS) Italy

A typical tissue in concurrent programming is to ensure the correct distributed termination of processes which compose a concurrent program. A concurrent program is terminated when every process is passive and there are no messages in transit. The Occam concurrent language does not provide explicit mechanisms to handle program termination. This paper discusses how to implement distributed termination of Occam programs expressed as a network of concurrent processes, avoiding deadlock situations or never-ending execution. The technique is based on the definition of a termination hierarchy and the propagation of a termination message down the hierarchy of processes. Some Occam 2 concurrent programs which use this technique are presented.

关键词： concurrent programming DISTRIBUTED TERMINATION OCCAM DISTRIBUTED SYSTEMS PARALLEL COMPUTERS

来源：评论

学校读者我要写书评

暂无评论

Self-tuning reactive diffracting trees

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2007年第6期67卷 674-694页

作者： Ha, Phuong Hoai Papatriantafilou, Marina Tsigas, Philippas Chalmers Dept Comp Sci & Engn S-41296 Gothenburg Sweden

Reactive diffracting trees are efficient distributed objects that support synchronization, by distributing sets of memory accesses to different memory banks in a coordinated manner. They adjust their size in order to retain their efficiency in the presence of different contention levels. Their adjustment is sensitive to parameters that have to be manually determined after experimentation. Since these parameters depend on the application as well as on the system configuration and load, determining their optimal values is difficult in practice. Moreover, the adjustments are done one level at a time, hence the cost of multi-level adjustments can be high. This paper presents a new method for reactive diffracting trees, without the need of hand-tuned parameters. The new self-tuning trees (ST-trees) can balance, in an online manner, the trade-off between the tree-traversal latency and the latency due to contention on accessing the leaf nodes (i.e. the nodes where the desirable computation takes place). Moreover, the paper presents a data structure that enables the trees to grow or shrink by several levels in one adjustment step. The behavior of the reactive diffracting trees is illustrated in the paper via experiments performed on a well-known ccNUMA multiprocessor system. The experiments study the new self-tuning trees, also in connection with the original hand-tuned reactive diffracting trees. The experiments have showed that the new self-tuning trees are efficient, and that they react in the same way (i.e. select the same tree depth for the same contention level) as the hand-tuned trees, while they are able to adjust quicker than the latter (as they are able to grow or shrink by several levels in one adjustment step). (c) 2007 Elsevier Inc. All rights reserved.

关键词： synchronization concurrent programming dynamic data structures distributed data structures trees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：