In this thesis, a new pallel execution method is proposed of the database predicate in an OR-parllel Prolong system. it is an extension of SICS method in which the processors are suspended to meet the synchronization.
But, in our method, they search all possible branches and then check them. So, our method produces better performance than SICS when there are some idle processor and enough branches to search. We have applied our method to SRI Model and made a simulator. By analyzing simulation result, we describe several program characteristics which would guarantee better performance than SICS.
