By Topic

Parallel Implementation of OBDD-Based Splitting Surface Search for Power System

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
$33 $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

2 Author(s)
Xiao Li ; Tsinghua Univ., Beijing ; Qianchuan Zhao

Parallel computational structure is helpful for many complicated problems, especially those which can be divided into multiple independent simpler sub-problems. The ordered binary decision diagrams (OBDD)-based splitting surface search algorithm owns this kind of dividability, derived from the associative law of Boolean expression and the dividability of matrix operation. We have implemented the algorithm with the parallel computation structure MPI to save up computing time. Customized verification is available on our interactive illustrative website (login user name: mag, password: 199707).

Published in:

IEEE Transactions on Power Systems  (Volume:22 ,  Issue: 4 )