Parallelized path-based search for constraint satisfaction in autonomous cognitive agents
| Autor: | Tanvir Atahary, Scott Douglass, Tarek M. Taha |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
020203 distributed computing
Speedup Computer science Process (engineering) Distributed computing 02 engineering and technology Constraint satisfaction Supercomputer Theoretical Computer Science Hardware and Architecture Component (UML) Path (graph theory) 0202 electrical engineering electronic engineering information engineering Look-ahead Software Constraint satisfaction problem Information Systems |
| Zdroj: | The Journal of Supercomputing. 77:1667-1692 |
| ISSN: | 1573-0484 0920-8542 |
| DOI: | 10.1007/s11227-020-03339-2 |
| Popis: | Cognitive agents are typically utilized in autonomous systems for automated decision making. With the widespread use of autonomous systems in complex environments, the need for real-time cognitive agents is essential. Cognitive agents are more capable when they are able to process larger amounts of information to make more informed and intelligent decisions. The solution search space for cognitive agents increases exponentially with large volumes of varied data. In this paper, we present the parallelization of the knowledge-mining component of a cognitive agent that can be programmed to reason like humans. This study examined a novel high-performance path-based forward checking algorithm on 128 compute nodes at the Ohio Supercomputing Center (768 cores) to achieve a speedup of over 200 times compared to a serial implementation of our algorithm. The serial implementation is around 10–25 times faster than a conventional Java-based constraint solver at generating the first solution. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink