Research On Synchronous Mechanism Based On PRAM Model

Abstract: With the development of network technology, distributed system has been widelyresearched and used. Distributed system adopts parallel computing model. PRAM model is a part ofparallel model; this paper mainly studies the application of PRAM model in the distributedsynchronization problem. Synchronization is the key problem in distributed system, whichguarantees concurrent processes access critical resources correctly. As the network bandwidth ofdistributed system is limited, and the number of critical resources is fixed, so the design of networkhas an important significance in light load, high rate of critical resources for distributedsynchronization algorithm.This paper firstly introduces some distributed algorithms, and analyzes their advantages anddisadvantages. This paper presents a new algorithm for synchronization based on token, introducingpriority and election algorithm,the token is no longer in accordance with circular logic ring,butaccording to the priority to transmit, reducing the synchronization delay. The distributed algorithm,this paper introduces the Maekawa algorithm. Maekawa algorithm is firstly put forward quorum,because of different quorum within the same node, and each set including a plurality of nodes, it ispossible to make the request message find a token holder by different set quickly. Finally, the TSPproblem is mapped to a network communication, using ant colony algorithm to find theoptimization route of network communication, and improve the efficiency of communicationbetween processes.