Several approaches to parallel computing in the Boolean domain

Each additional variable doubles the number of function values of a Boolean function. This exponential increase is known as combinational explosion and limits strongly the solvable problems for a given computer. In order to solve larger Boolean problems, it is necessary to exploit each concept that reduces the required efforts. The parallel consideration of all Boolean variables that are assigned to a machine word of the computer, the mapping of an exponential number of Boolean vectors to a single ternary vector, and the distribution of the calculations to several Boolean spaces are some approaches which were realized in the software package XBOOLE. An important further approach is the segmentation of the Boolean tasks and their parallel computation using several connected computers as well as the available processor cores of these computers. In this paper we explore alternative approaches to parallel computations of Boolean problems. Experimental results document the achieved benefits.