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

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2021年第6期32卷 1425-1436页

作者： Galindo, Carlos Nishida, Naoki Silva, Josep Tamarit, Salvador Univ Politecn Valencia Dept Sistemas Informat & Comp Valencia 46022 Spain Nagoya Univ Grad Sch Informat Nagoya Aichi 4648603 Japan PFS Tech Valencia 46015 Spain

Reversibility enables a program to be executed both forwards and backwards. This ability allows programmers to backtrack the execution to a previous state. This is essential if the computation is not deterministic because re-running the program forwards may not lead to that state of interest. Reversibility of sequential programs has been well studied and a strong theoretical basis exists. Contrarily, reversibility of concurrent programs is still very young, especially in the practical side. For instance, in the particular case of the Communicating Sequential Processes (CSP) language, reversibility is practically missing. In this article, we present a new technique, including its formal definition and its implementation, to reverse CSP computations. Most of the ideas presented can be directly applied to other concurrent specification languages such as Promela or CCS, but we center the discussion and the implementation on CSP. The technique proposes different forms of reversibility, including strict reversibility and causal-consistent reversibility. On the practical side, we provide an implementation of a system to reverse CSP computations that is able to highlight the source code that is being executed in each forwards/backwards computation step, and that has been optimized to be scalable to real systems.

关键词： Synchronization Syntactics Semantics History Standards Data structures Debugging concurrent programming tracing debugging aids code inspections and walkthroughs

来源：评论

学校读者我要写书评

暂无评论

An efficient and precise dynamic slicing for concurrent component-oriented programs

引用

INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS 2021年第4期25卷 449-464页

作者： Pujari, Niharika Ray, Abhishek Singh, Jagannath Deemed Be Univ Sch Comp Engn KIIT Bhubaneswar Odisha India

A dynamic slicing algorithm is proposed in this paper along with its implementation which is dynamic for concurrent Component-oriented programs carrying multiple threads. As a part of representing the concurrent COP (CCOP) effectively, an intermediate graph is developed called concurrent Component Dependency Graph (CCmDG). The system dependence graph (SDG) for individual components and interfaces are integrated to represent the above intermediate graph. It also consists of some new dependence edges which have been triggered for connecting the individual dependence graph of each component with the interface. Based on the graph created for the CCOP, a dynamic slicing algorithm is proposed, which sets the resultant by making the executed nodes marked during run time in concurrent Components Dynamic Slicing (CCmDS) appropriately. For checking the competence of our algorithm, five case studies have been considered and also compared with an existing technique. From the study, we found that our algorithm results in smaller and precise size slice compared to the existing algorithm in less time.

关键词： Program slicing concurrent programming web scrapper component-oriented programs thread connect edge concurrent control flow graph (CCFG)

来源：评论

学校读者我要写书评

暂无评论

Virtual Machine and Integrated Developer Environment for Sleptsov Net Computing

引用

PARALLEL PROCESSING LETTERS 2023年第3期33卷 2350006-2350006页

作者： Zaitsev, Dmitry A. Shmeleva, Tatiana R. Zhang, Qing Zhao, Hongfei Univ Cote dAzur I3S CNRS 28 Ave Valrose F-06103 Nice France XIDIAN Univ 266 Xinglong Sect Xifeng Rd Xian 710126 Shaanxi Peoples R China

Modern computing is a path of violations and transformations coming from an intrinsically concurrent application domain into a sequence of instructions and then back to concurrency with OpenMP, MPI and CUDA/OpenCL. Why we create so many difficulties? Sleptsov Net Computing (SNC) maps a task into an appropriate computing structure implemented as a re-configurable multidimensional sparse matrix of computing memory. It has entirely graphical mass parallel language for concurrent programming and a framework of techniques for concurrent program verification to develop reliable software. Estimated efficiency of SNC is higher than 50% compared to actual less that 1% efficiency of the most powerful supercomputers. It yields hyper-performance capable of efficient control of hyper-sonic objects, colliders, thermonuclear reaction. This paper presents an open source prototype VM and IDE for SNC with a view on upcoming hardware implementation of the corresponding computer.

关键词： Sleptsov net computing concurrent programming efficient computing computing memory virtual machine integrated developer environment

来源：评论

学校读者我要写书评

暂无评论

CSMV: A highly scalable multi-versioned software transactional memory for GPUs

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2023年第1期180卷

作者： Nunes, Diogo Castro, Daniel Romano, Paolo Univ Lisbon INESC ID Rua Alves Redol 9 P-1000029 Lisbon Portugal Univ Lisbon Inst Super Tecn Rua Alves Redol 9 P-1000029 Lisbon Portugal

This paper introduces CSMV (Client Server Multiversioned), a multi-versioned Software TM (STM) for GPUs that adopts an innovative client-server design. By decoupling the execution of transactions from their commit process, CSMV provides two main benefits: (i) it enables the use of fast on chip memory to access the global metadata used to synchronize transaction (ii) it allows for implementing highly efficient collaborative commit procedures, tailored to take full advantage of the architectural characteristics of GPUs. Via an extensive experimental study, we show that CSMV achieves up to 3 orders of magnitude speed-ups with respect to state of the art STMs for GPUs and that it can accelerate by up to 20x irregular applications running on state of the art STMs for CPUs. & COPY;2023 Elsevier Inc. All rights reserved.

关键词： Multi-version concurrency control Synchronization GPU Transactional memory concurrent programming

来源：评论

学校读者我要写书评

暂无评论

concurrent and Distributed Pseudocode: A Systematic Literature Review 47

Concurrent and Distributed Pseudocode: A Systematic Literatu...

引用

47th Latin American Computing Conference (CLEI)

作者： Ulate-Caballero, Bryan Alexander Berrocal-Rojas, Allan Hidalgo-Cespedes, Jeisson Univ Costa Rica Comp & Informat San Jose Costa Rica Univ Costa Rica ECCI San Jose Costa Rica Univ Costa Rica ECCI CITIC San Jose Costa Rica

ISBN: (纸本)9781665495035

Pseudocode is a valuable resource used in programming education, software development, and scientific reports for designing algorithmic solutions as it is easy to write, understand, and modify. Since pseudocode is lacking in its ability to be tested, it is difficult to determine whether a pseudocode solution is correct or not. Software tools are specially required to reach this goal, e.g., helping professors find race conditions, deadlocks, or starvation issues while grading students' concurrent pseudocode. Although there are various tools to work with sequential pseudocode, there is a lack of tools to work with concurrent pseudocode. This shortage motivated us to determine the state-of-the-art in notations and tools for testing concurrent and distributed pseudocode. We conducted a systematic literature review and found only a few related publications, confirming that this topic is understudied. We found and report about five software tools capable of interpreting concurrent or distributed pseudocode, and two software tools capable of verifying its correctness. As another result, no other literature review was found about this topic, conferring novelty to the contributions of this work.

关键词： concurrent pseudocode distributed pseudocode parallel pseudocode code correctness concurrent programming distributed programming parallel programming pseudocode pseudo-code pseudo-language education teaching

来源：评论

学校读者我要写书评

暂无评论

A Graph Transformation System formalism for correctness of Transactional Memory algorithms 21

A Graph Transformation System formalism for correctness of T...

引用

25th Brazilian Symposium on programming Languages (SBLP)

作者： Cardoso, Diogo J. Foss, Luciana Du Bois, Andre R. Univ Fed Pelotas Programa Posgrad Comp Pelotas RS Brazil

ISBN: (纸本)9781450390620

With the constant research and development of Transactional Memory (TM) systems, various algorithms have been proposed, and their correctness is always an important aspect to take into account. When analyzing TM algorithms, one of the most commonly used correctness criterion is opacity, which infers that the algorithm only generates executions that observe consistent states of the shared memory. In this work we present a formal definition to demonstrate that a given TM algorithm only generates opaque histories using a Graph Transformation System (GTS). We achieve that by introducing a methodology of translating an algorithm into production rules that manipulate the state of a graph. With a set initial state of transactions, the result of this method consists of a state space that includes every possible order of execution of transactional operations that are automatically checked for opacity, therefore all possible histories the algorithm can generate are checked for the safety property. As a case study we demonstrate our approach using the algorithm CaPR+.

关键词： Formal Semantics Graph Grammar Transactional Memory concurrent programming Model Checking

来源：评论

学校读者我要写书评

暂无评论

STRAB: State Recovery using Reverse Execution at IR Level for concurrent Programs 21

STRAB: State Recovery using Reverse Execution at IR Level fo...

引用

36th Annual ACM Symposium on Applied Computing (SAC)

作者： Hoshino, Shinji Arahori, Yoshitaka Gondow, Katsuhiko Tokyo Inst Technol Tokyo Japan

ISBN: (纸本)9781450381048

Debugging failures of deployed concurrent software is important for quality assurance. However, such failures are difficult to debug because their behavior is non-deterministic and limited information can be obtained with conventional means. Reverse debuggers such as REPT [10] assists with debugging by recovering data values before the failure. This is achieved by using a hardware-tracer to log control-flowinformation, then using the information and a conventional coredump to recover data values via reverse-execution at machine-level. REPT's algorithm for data value recovery is reliable and fast. But the implementation cost is high because of its dependence on architecture. Applying REPT to more abstract IR (Intermediate Representation) level instructions in an attempt to counter this yielded limited results with low accuracy compared to the original x86_64 implementation. In this paper, we present STRAB (State Recovery at Abstract-level), a collection of our proposed methods to solve these problems. STRABworks in two phases. First, the data values in the core-dump are lifted from machine-level to IR-level using rich debug information and mid-recovery lifting. Second, REPT modified with our hybrid memory location resolving algorithm to solve problems that occur only at IR-level is used to recover data values with higher accuracy than REPT. Experimental results on a variety of real-world concurrent programs show that STRAB has significantly higher accuracy compared to REPT at IR-level (+40% on average) with only minor slowdowns (x2.7 on average), while also achieving architecture-independence.

关键词： reverse debugging concurrent programming state recovery data value inference intermediate representation

来源：评论

学校读者我要写书评

暂无评论

Structured Concurrency: A Review 22

Structured Concurrency: A Review

引用

Workshop Proceedings of the 51st International Conference on Parallel Processing

作者： Yi-An Chen Yi-Ping You Department of Computer Science National Yang Ming Chiao Tung University Taiwan

ISBN: (纸本)9781450394451

Today, mobile applications use thousands of concurrent tasks to process multiple sensor inputs to ensure a better user experience. With this demand, the ability to manage these concurrent tasks efficiently and easily is becoming a new challenge, especially in their lifetimes. Structured concurrency is a technique that reduces the complexity of managing a large number of concurrent tasks. There have been several languages or libraries (e.g., Kotlin, Swift, and Trio) that support such a paradigm for better concurrency management. It is worth noting that structured concurrency has been consistently implemented on top of coroutines across all these languages and libraries. However, there are no documents or studies in the literature that indicate why and how coroutines are relevant to structured concurrency. In contrast, the mainstream community views structured concurrency as a successor to structured programming; that is, the concept of “structure” extends from ordinary programming to concurrent programming. Nevertheless, such a viewpoint does not explain, as the concept of structured concurrency came out more than 40 years later after structured programming was introduced in the early 1970s, whereas concurrent programming started in the 1960s. In this paper, we introduce a new theory to complement the origin of structured concurrency from historical and technical perspectives—it is the foundation established by coroutines that gives birth to structured concurrency.

关键词： concurrent programming structured concurrency

来源：评论

学校读者我要写书评

暂无评论

Synthesis of multiple video streams through multi-thread programming 32

Synthesis of multiple video streams through multi-thread pro...

引用

32nd Chinese Control And Decision Conference (CCDC)

作者： Wang, Jian Duan, Shihui Xu, Jun Wang, Song Ling, Qiang Univ Sci & Technol China Hefei 230022 Peoples R China MIIT China Acad Informat & Commun Technol Key Lab Internet & Ind Integrat & Innovat Beijing 100191 Peoples R China

ISBN: (纸本)9781728158556

In some scenarios, we need to combine multiple video streams and pictures into a single video. In this paper, we develop an application to synthesize two channel video stream and two channel pictures. Our application can be used for synthetic display of multiple network video streams and offline video synthetic storage. As the single thread decoding of multiple video streams takes a lot of time, we propose the use of a multithreading producer-consumer pattern. It makes full use of the advantages of multi-core CPU and improves the programming efficiency. In our experiments, we compare video synthesis through single thread and multithreading. Multithreading is much faster than single threading.

关键词： Multiple video streams synthesis multithreading concurrent programming

来源：评论

学校读者我要写书评

暂无评论

ConTesa: Directed Test Suite Augmentation for concurrent Software

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2020年第4期46卷 405-419页

作者： Yu, Tingting Huang, Zunchen Wang, Chao Univ Kentucky Dept Comp Sci Lexington KY 40506 USA Univ Southern Calif Dept Comp Sci Los Angeles CA 90089 USA

As software evolves, test suite augmentation techniques may be used to identify which part of the program needs to be tested due to code changes and how to generate these new test cases for regression testing. However, existing techniques focus exclusively on sequential software, without considering concurrent software in which multiple threads may interleave with each other during the execution and thus lead to a combinatorial explosion. To fill the gap, we propose ConTesa, the first test suite augmentation tool for concurrent software. The goal is to generate new test cases capable of exercising both code changes and the thread interleavings affected by these code changes. At the center of ConTesa is a two-pronged approach. First, it judiciously reuses the current test inputs while amplifying their interleaving coverage using random thread schedules. Then, it leverages an incremental symbolic execution technique to generate more test inputs and interleavings, to cover the new concurrency-related program behaviors. We have implemented ConTesa and evaluated it on a set of real-world multithreaded Linux applications. Our results show that it can achieve a significantly high interleaving coverage and reveal more bugs than state-of-the-art testing techniques.

关键词： Testing Schedules Instruction sets concurrent computing Tools Context Regression testing concurrent programming symbolic execution dynamic analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：