Algebraic Bayesian networks belong to the class of machine-learning probabilistic graphical models. One of the main tasks during researching machine learning models is the optimization of their time of work. This paper presents approaches to parallelizing algorithms for maintaining local consistency in algebraic Bayesian networks as one of the ways to optimize their time of work. An experiment provided to compare the time of parallel and nonparallel realizations of algorithms for maintaining local consistency.