2018/04/24 by O. A. Malafeyev, Malafeyev, O. A., S. A. Nemnyugin +1
Computer Science · #Computer Science and Game Theory (cs.GT) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC) #cs.DC #cs.GT
paper · pdf · doi:10.48550/arxiv.1804.08856
arxiv created 2018/04/24 · arxiv updated 2018/04/25
Game-theoretical approach to the analysis of parallel algorithms is proposed. The approach is based on presentation of the parallel computing as a congestion game. In the game processes compete for resources such as core of a central processing unit and a communication subsystem. There are players, resources and payoffs (time delays) of players which depend on resources usage. Comparative analysis of various optimality principles in the proposed model may be performed.