Open AccessStudy on the application of elementary number theory in conflict algorithm
Author(s) -
ZhiPing Zhao,
Jinde Huang
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1650/3/032022
Subject(s) - commit , computer science , database transaction , hash function , algorithm , task (project management) , value (mathematics) , time complexity , parallel computing , computer security , database , management , machine learning , economics
Analyze the time complexity of the algorithm, for multiple threads to execute multiple transactions at the same time, and map the result of the remainder of the prime number to the hash address. After calculation, the formula is a convergent array. The larger the value of x, the smaller the calculated value, indicating that the algorithm can complete the task in a certain limited time. Applying the probability of random prime numbers to the design of conflict management algorithms can avoid endless waiting for each other between transactions, and also avoid the waste of computing resources caused by cancelling earlier transactions. Compared with the radical algorithm of direct termination, this algorithm gives the transaction a certain waiting and retry time, avoids the long execution of the long transaction, and guarantees the commit time of the transaction.