A Parallel Bottom-Up Resolution Algorithm Using Cilk

Rapid developments of multicore processors in the last ten years have accelerated the advancements in concurrency platforms. Performance of bottom-up resolution algorithms used in logic programming and artificial intelligent systems, can potentially be improved using the parallel programming constru...

Full description

Saved in:
Bibliographic Details
Published in2013 IEEE 25th International Conference on Tools with Artificial Intelligence pp. 95 - 100
Main Authors Basseda, Reza, Chowdhury, Rezaul Alam
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.01.2013
Subjects
Algorithm design and analysis
Algorithms
Artificial intelligence
Bottom-up Reasoning
Conferences
Construction
Expert systems
Knowledge based systems
Logic programming
Multicore processing
Parallel algorithms
Parallel Logic Programming
Parallel programming
Parallel Resolution Algorithm
Platforms
Program processors
Serials
Online AccessGet full text

Cover

More Information
Summary:Rapid developments of multicore processors in the last ten years have accelerated the advancements in concurrency platforms. Performance of bottom-up resolution algorithms used in logic programming and artificial intelligent systems, can potentially be improved using the parallel programming constructs offered by these platforms (e.g., OpenMP, Cilk++, etc.). In this work we use Cilk++ to implement a parallel bottom-up resolution algorithm, and study how different parallel programming constructs affect its performance. Our experimental results show that a careful Cilk++ implementation of the algorithm can lead to significant speedup w.r.t. its traditional serial implementation.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:1082-3409
DOI:10.1109/ICTAI.2013.24