The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—The problem of mapping the parallel bottom up execution of Datalog programs to an interconnected network of processors is studied. The parallelization is achieved by using hash functions that partition the set of instantiations for the rules. We first examine this problem in an environment where the number of processors and the interconnection topology is known, and communication between program segments residing at non-adjacent processors is not permitted. An algorithm is presented that decides whether a given Datalog program can be mapped onto such an architecture. We then relax the constraint on the architecture by allowing program segments residing at non-adjacent processors to communicate. A theory of approximate mappings is developed, and an algorithm to obtain the closest approximate mapping of a given Datalog program onto a given architecture is presented.</p>
Shalom Tsur, Abraham Silberschatz, Sumit Ganguly, "Mapping Datalog Program Execution to Networks of Processors", IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 351-361, June 1995, doi:10.1109/69.390243
86 ms
(Ver 3.3 (11022016))