By Topic

Several approaches to parallel computing in the Boolean domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Steinbach, B. ; Inst. of Comput. Sci., Freiberg Univ. of Min. & Technol., Freiberg, Germany ; Wessely, W. ; Posthoff, C.

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.

Published in:

Parallel Distributed and Grid Computing (PDGC), 2010 1st International Conference on

Date of Conference:

28-30 Oct. 2010