Process Synchronization Problems Research Articles

Research on Application of Computer Big Data in Mathematical Polymorphic Game Algorithm Theory

In large-scale game activities, the computer big data system is collected, and then large-scale real-time data collection, processing and control systems are used to bring mathematical algorithm models, and state information reliability algorithms are used to illustrate the system control machine design and its Implementation based on VMS. This article calculates the most by calculation. The main design ideas in the game mathematical model, the research found that the system controller proposed by the system is a method to solve the multi-state process synchronization problem in the Client/Server computing system, and can effectively deal with the algorithm application research in the model.

Self-stabilizing distributed algorithm for local mutual inclusion

Local mutual inclusion is a process synchronization problem where, for each process, at least one of its processes and neighbors must be in the critical section. We propose a self-stabilizing distributed solution to the local mutual inclusion problem. Convergence time of the proposed algorithm is one round under the weakly fair distributed daemon.

On the family of critical section problems

Mutual exclusion is a fundamental process synchronization problem in concurrent systems. In this paper, we propose a unified framework for mutual exclusion, k-mutual exclusion, mutual inclusion, ℓ-mutual inclusion and such, what we call critical section problem. Then, we show that critical section problem is characterized by a pair of integers.

'Laurel and Hardy' model for analyzing process synchronization algorithms and primitives

The initial software solutions to solve the Process Synchronization problems, which ultimately led to the use of Semaphores are usually hard for a beginner to understand and appreciate. The reason is that one has to do lots of book keeping in tracing these algorithms, which involve multiple processes and variable instances. In order to prove the correctness of any synchronization problem, it has to be tested over the Critical Section conditions which again might be a tough exercise. In this paper we propose a model called "Laurel and Hardy" to understand and prove the (in)completeness of the software solutions to the Process Synchronization problem. A series of dramas is enacted between the two comedians Laurel and Hardy which makes understanding of synchronization problem solutions and testing it over Critical Section conditions very simple. We attempt to convince the readers that Laurel and Hardy model can be used as a potential tool for the analysis of any synchronization algorithms and also in assessing the (in)completeness of it. In addition, Laurel and Hardy model can be used as a teaching aid in beginner's Operating System course.

Dynamic Distribution of Processes for Intelligent System Design

This paper focuses on software implementation issues related to rapid design and prototyping of distributed systems that integrate the methods and techniques of computational intelligence, such as genetic search, neural networks, and fuzzy logic, with symbolic and algorithmic processing. In order to dynamically assign computational processes to the resources of a distributed computing system, a process algebraic approach is proposed that is based on MAPA (Multi-Action Process Algebra), with special emphasis placed on process synchronization problems.

Efficient fault-tolerant algorithms for distributed resource allocation

Solutions to resource allocation problems and other related synchronization problems in distributed systems are examined with respect to the measures ofresponse time, message complexity,andfailure locality. Response time measures the time it takes for an algorithm to respond to the requests of a process; message complexity measures the number of messages sent and received by a process; and failure locality characterizes the size of the network that is affected by the failure of a single process. An algorithm for the resource allocation problem that achieves a constant failure locality of four along with a quadratic response time and a quadratic message complexity is presented. Applications of the algorithm to other process synchronization problems in distributed systems are also demonstrated.

Constructing protocols with alternative functions

The author describes a method for designing communication protocols which can perform several distinct functions, but are limited to the execution of one function at a time. The construction of such a protocol consists of two steps: (1) developing a component protocol for each function to be included, and (2) integrating the components into the target protocol. The integration involves the resolution of potential component competition and process synchronization problems. A sufficient condition for the safety of the integrated protocol is also discussed. This design method is simple to use and promotes reuse of existing protocols. The construction of two protocols-the call setup phase of a data link control protocol and a portion of the CCITT's X.21 Recommendation-is demonstrated.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives

Many of the process synchronization problems studied in the literature are of the form of a conjunction of finitely many conditions of the type “process $p_i$ blocks process $p_j$”. Such problems may be expressed as directed graphs whose nodes represent the processes and where there is an edge from node i to node j if and only if process $p_i$ blocks process $p_j$. We characterize the class of graphs which correspond to the system of synchronizing primitives of Vantilborgh and van Lamsweerde in terms of a normal form representation and present an efficient algorithm for determining whether an arbitrary graph is in this class.