Skip to main content
Top

2014 | OriginalPaper | Chapter

Hardware Accelerated Mining of Domain Knowledge

Authors : Tanvir Atahary, Scott Douglass, Tarek M. Taha

Published in: Network Science and Cybersecurity

Publisher: Springer New York

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Agent-based decision aids can improve their performance by mining domain knowledge captured in cognitive domain ontologies (CDOs). The CDOs can be specialized to represent knowledge from any of a large variety of domains, including network security. Search algorithms mine data from these CDOs using constraints. While complex CDOs increase the capabilities of decision agents, they are computationally expensive to mine. Complex CDOs can function as powerful decision aids if they can be processed in realistic time frames. To achieve this, it is necessary to parallelize and accelerate the CDO knowledge mining algorithms. This chapter introduces CDOs and examines how they can be transformed into constraint networks for processing on high performance compute platforms. The constraint networks were solved using a parallelized generate and test exhaustive depth first search algorithm. Two compute platforms for acceleration are examined: Intel Xeon multicore processors, and NVIDIA graphics processors (GPGPUs). This chapter shows that 1 NVIDIA Tesla C2070 GPGPU can provide a speed-up of 100 times over 1 Xeon CPU core for the search algorithm. The scaling of the algorithm on a high performance GPGPU cluster achieved estimated speed-ups of over 1,000 times.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference A.K. Mackworth, Constraint Satisfaction, in Encyclopedia of Artificial Intelligence, ed. by S.C. Shapiro, (John Wiley and Sons, New York, 1987) A.K. Mackworth, Constraint Satisfaction, in Encyclopedia of Artificial Intelligence, ed. by S.C. Shapiro, (John Wiley and Sons, New York, 1987)
3.
go back to reference S.C. Brailsford, C.N. Potts, B.M. Smith, Constraint satisfaction problems: algorithms and applications. Eur. J. Oper. Res. 119, 557–581 (1999)MATHCrossRef S.C. Brailsford, C.N. Potts, B.M. Smith, Constraint satisfaction problems: algorithms and applications. Eur. J. Oper. Res. 119, 557–581 (1999)MATHCrossRef
4.
go back to reference S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, 3rd edn. (Prentice Hall, 2009) S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, 3rd edn. (Prentice Hall, 2009)
5.
go back to reference S. Douglass, C. Myers, Concurrent knowledge activation calculation in large declarative memories, in Proceedings of the 10th International Conference on Cognitive Modeling, 2010, pp. 55–60 S. Douglass, C. Myers, Concurrent knowledge activation calculation in large declarative memories, in Proceedings of the 10th International Conference on Cognitive Modeling, 2010, pp. 55–60
6.
go back to reference S. Douglass, S. Mittal, Using domain specific languages to improve scale and integration of cognitive models, in Proceedings of the Behavior Representation in Modeling and Simulation Conference, Utah, USA, 2011 S. Douglass, S. Mittal, Using domain specific languages to improve scale and integration of cognitive models, in Proceedings of the Behavior Representation in Modeling and Simulation Conference, Utah, USA, 2011
7.
go back to reference Z. Molnár, D. Balasubramanian, A. Lédeczi, An introduction to the GenericModeling Environment, in Proceedings of the TOOLS Europe 2007 Workshop on Model-Driven Development Tool Implementers Forum (Zurich, Switzerland, 2007) Z. Molnár, D. Balasubramanian, A. Lédeczi, An introduction to the GenericModeling Environment, in Proceedings of the TOOLS Europe 2007 Workshop on Model-Driven Development Tool Implementers Forum (Zurich, Switzerland, 2007)
8.
go back to reference A. Ledeczi, M. Maroti, A. Bakay, G. Karsai, J. Garrett, C. Thomason, G. Nordstrom, J. Sprinkle, P. Volgyesi, “The generic modeling environment,” Workshop on Intelligent Signal Processing, vol. 17, (Budapest, Hungary, 2001) A. Ledeczi, M. Maroti, A. Bakay, G. Karsai, J. Garrett, C. Thomason, G. Nordstrom, J. Sprinkle, P. Volgyesi, “The generic modeling environment,” Workshop on Intelligent Signal Processing, vol. 17, (Budapest, Hungary, 2001)
9.
go back to reference A. Ledeczi, P. Volgyesi, G. Karsai, Metamodel composition in the Generic Modeling Environment. Comm. at Workshop on Adaptive Object-Models and Metamodeling Techniques, Ecoop, vol. 1, 2001 A. Ledeczi, P. Volgyesi, G. Karsai, Metamodel composition in the Generic Modeling Environment. Comm. at Workshop on Adaptive Object-Models and Metamodeling Techniques, Ecoop, vol. 1, 2001
11.
go back to reference J.M. Siskind, Screaming Yellow Zonkers (MIT Articial Intelligence Laboratory, 1991) J.M. Siskind, Screaming Yellow Zonkers (MIT Articial Intelligence Laboratory, 1991)
12.
go back to reference P. Sanders, Better Algorithm for Parallel Backtracking, in Workshop on Algorithms for Irregularly Structured Problems, number 980 in LNCS, 1995 P. Sanders, Better Algorithm for Parallel Backtracking, in Workshop on Algorithms for Irregularly Structured Problems, number 980 in LNCS, 1995
13.
go back to reference E.C. Freuder, R. Dechter, M.L. Ginsberg, B. Selman, E.P.K. Tsang, Systematic versus stochastic constraint satisfaction, in Proceedings of the 14th International Joint Conference on Artificial Intelligence, vol. 2 (Morgan-Kaufmann, 1995), pp. 2027–2032 E.C. Freuder, R. Dechter, M.L. Ginsberg, B. Selman, E.P.K. Tsang, Systematic versus stochastic constraint satisfaction, in Proceedings of the 14th International Joint Conference on Artificial Intelligence, vol. 2 (Morgan-Kaufmann, 1995), pp. 2027–2032
14.
go back to reference M. Ginsberg, D. McAllester, GSAT and Dynamic Backtracking, in Proceedings of the Fourth Int’l Conf. Principles of Knowledge Representation and Reasoning, 1994, pp. 226–237 M. Ginsberg, D. McAllester, GSAT and Dynamic Backtracking, in Proceedings of the Fourth Int’l Conf. Principles of Knowledge Representation and Reasoning, 1994, pp. 226–237
15.
go back to reference I. Lynce, L. Baptista, J.P. Marques-Silva, Stochastic Systematic Search Algorithms for Satisfiability, in The LICS Workshop on Theory and Apps of Satisfiability Testing, 2001 I. Lynce, L. Baptista, J.P. Marques-Silva, Stochastic Systematic Search Algorithms for Satisfiability, in The LICS Workshop on Theory and Apps of Satisfiability Testing, 2001
16.
go back to reference J.R. Bitner, E. Reingold, Backtracking programming techniques. Commun. ACM 18(11), 651–656 (1975)MATHCrossRef J.R. Bitner, E. Reingold, Backtracking programming techniques. Commun. ACM 18(11), 651–656 (1975)MATHCrossRef
17.
go back to reference L.L. Wong, M.W.-M. Hwu, An effective GPU implementation of breadth-first search, Design Automation Conference (DAC), 2010, pp. 52–55 L.L. Wong, M.W.-M. Hwu, An effective GPU implementation of breadth-first search, Design Automation Conference (DAC), 2010, pp. 52–55
18.
go back to reference D. Sulewski, Large-Scale Parallel State Space Search Utilizing Graphics Processing Units and Solid State Disks, Dissertation, Dortmund University of Technology, 2011 D. Sulewski, Large-Scale Parallel State Space Search Utilizing Graphics Processing Units and Solid State Disks, Dissertation, Dortmund University of Technology, 2011
19.
go back to reference J. Jenkins, I. Arkatkar, J.D. Owens, A. Choudhary, N.F. Samatova, Lessons learned from exploring the backtracking paradigm on the GPU, in Euro-Par 2011: Proceedings of the 17th International European Conference on Parallel and Distributed Computing, Lecture Notes in Computer Science, vol. 6853 (Springer, August/September 2011), pp. 425–437 J. Jenkins, I. Arkatkar, J.D. Owens, A. Choudhary, N.F. Samatova, Lessons learned from exploring the backtracking paradigm on the GPU, in Euro-Par 2011: Proceedings of the 17th International European Conference on Parallel and Distributed Computing, Lecture Notes in Computer Science, vol. 6853 (Springer, August/September 2011), pp. 425–437
20.
go back to reference A. Buluc, K. Madduri, Parallel Breadth First Search on Distributed Memory Systems, in The International Conference for High Performance Computing, Networking, Storage and Analysis, 2011 A. Buluc, K. Madduri, Parallel Breadth First Search on Distributed Memory Systems, in The International Conference for High Performance Computing, Networking, Storage and Analysis, 2011
21.
go back to reference D. Merrill, M. Garland, A. Grimshaw, Scalable GPU Graph Traversal, in Proceedings of PPoPP, February 2012 D. Merrill, M. Garland, A. Grimshaw, Scalable GPU Graph Traversal, in Proceedings of PPoPP, February 2012
22.
go back to reference P. Harish, P. Narayanan, Accelerating large graph algorithms on the GPU using CUDA, in High Performance Computing—HiPC 2007: 14th International Conference, Proceedings, ed. by S. Aluru, M. Parashar, R. Badrinath, V. Prasanna. vol. 4873 (Springer-Verlag, Goa, India, 2007), pp. 197–208 P. Harish, P. Narayanan, Accelerating large graph algorithms on the GPU using CUDA, in High Performance Computing—HiPC 2007: 14th International Conference, Proceedings, ed. by S. Aluru, M. Parashar, R. Badrinath, V. Prasanna. vol. 4873 (Springer-Verlag, Goa, India, 2007), pp. 197–208
23.
go back to reference S. Hong, S. Kim, T. Oguntebi, K. Olukotun, Accelerating CUDA Graph Algorithms at Maximum Warp, in Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, 2011 S. Hong, S. Kim, T. Oguntebi, K. Olukotun, Accelerating CUDA Graph Algorithms at Maximum Warp, in Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, 2011
24.
go back to reference S.D. Joshi, V.S. Inamdar, Performance improvement in large graph algorithms on GPU using CUDA: an overview. Int. J. Comp. Appl. 10(10), 10–14 (2010) S.D. Joshi, V.S. Inamdar, Performance improvement in large graph algorithms on GPU using CUDA: an overview. Int. J. Comp. Appl. 10(10), 10–14 (2010)
25.
go back to reference Y. Wang, NVIDIA CUDA Architecture-based Parallel Incomplete SAT Solver, Master Project Final Report, Rochester Institute of Technology, 2010 Y. Wang, NVIDIA CUDA Architecture-based Parallel Incomplete SAT Solver, Master Project Final Report, Rochester Institute of Technology, 2010
26.
go back to reference P. Leong, C. Sham, W. Wong, W. Yuen, M. Leong, A bitstream reconfigurable FPGA implementation of the WSAT algorithm. IEEE Trans. VLSI Syst. 9(1), 197–201 (2001)CrossRef P. Leong, C. Sham, W. Wong, W. Yuen, M. Leong, A bitstream reconfigurable FPGA implementation of the WSAT algorithm. IEEE Trans. VLSI Syst. 9(1), 197–201 (2001)CrossRef
27.
go back to reference D. Diaz, S. Abreu, P. Codognet, Parallel constraint-based local search on the Cell/BE multicore architecture, in Intelligent Distributed Computing IV. Studies in Computational Intelligence, vol. 315, ed. by M. Essaaidi, M. Malgeri, C. Badica (Springer, Heidelberg, 2010), pp. 265–274 D. Diaz, S. Abreu, P. Codognet, Parallel constraint-based local search on the Cell/BE multicore architecture, in Intelligent Distributed Computing IV. Studies in Computational Intelligence, vol. 315, ed. by M. Essaaidi, M. Malgeri, C. Badica (Springer, Heidelberg, 2010), pp. 265–274
28.
go back to reference D. Diaz, S. Abreu, P. Codognet, Targeting the Cell Broadband Engine for Constraint-Based Local Search. (Published Online October 20, 2011). doi: 10.1002/cpe.1855 D. Diaz, S. Abreu, P. Codognet, Targeting the Cell Broadband Engine for Constraint-Based Local Search. (Published Online October 20, 2011). doi: 10.​1002/​cpe.​1855
29.
go back to reference Y. Caniou, P. Codognet, D. Diaz, S. Abreu, Experiments in parallel constraint-based local search, in EvoCOP’11, 11th European Conference on Evolutionary Computation in Combinatorial Optimisation. Lecture Notes in Computer Science (Springer Verlag, Torino, Italy, 2011) Y. Caniou, P. Codognet, D. Diaz, S. Abreu, Experiments in parallel constraint-based local search, in EvoCOP’11, 11th European Conference on Evolutionary Computation in Combinatorial Optimisation. Lecture Notes in Computer Science (Springer Verlag, Torino, Italy, 2011)
30.
go back to reference I.P. Gent, C. Jefferson, I. Miguel, N.C.A. Moore, P. Nightingale, P. Prosser, C. Unsworth, A Preliminary Review of Literature on Parallel Constraint Solving, Computing Science, Scotland Workshop on Parallel Methods for Constraint Solving (Glasgow and St. Andrews Universities, 2011) I.P. Gent, C. Jefferson, I. Miguel, N.C.A. Moore, P. Nightingale, P. Prosser, C. Unsworth, A Preliminary Review of Literature on Parallel Constraint Solving, Computing Science, Scotland Workshop on Parallel Methods for Constraint Solving (Glasgow and St. Andrews Universities, 2011)
31.
go back to reference C. Rolf, Parallelism in Constraint Programming, Ph.D. thesis, 2011 C. Rolf, Parallelism in Constraint Programming, Ph.D. thesis, 2011
32.
go back to reference C. Rolf and K. Kuchinski, Parallel Consistency in Constraint Programming. The International Conference on Parallel and Distributed Processing Techniques and Applications: SDMAS Workshop, 2009 C. Rolf and K. Kuchinski, Parallel Consistency in Constraint Programming. The International Conference on Parallel and Distributed Processing Techniques and Applications: SDMAS Workshop, 2009
33.
go back to reference C. Rolf and K. Kuchinski, Parallel Search and Parallel Consistency in Constraint Programming. International Conference on Principles and Practices of Constraint Programming, 2010 C. Rolf and K. Kuchinski, Parallel Search and Parallel Consistency in Constraint Programming. International Conference on Principles and Practices of Constraint Programming, 2010
36.
go back to reference M. Barnell, Q. Wu, R. Luley, Integration and development of the 500 TFLOPS heterogeneous cluster (Condor). IEEE High Perform. Extreme Comput. Conf. 2012 M. Barnell, Q. Wu, R. Luley, Integration and development of the 500 TFLOPS heterogeneous cluster (Condor). IEEE High Perform. Extreme Comput. Conf. 2012
Metadata
Title
Hardware Accelerated Mining of Domain Knowledge
Authors
Tanvir Atahary
Scott Douglass
Tarek M. Taha
Copyright Year
2014
Publisher
Springer New York
DOI
https://doi.org/10.1007/978-1-4614-7597-2_16

Premium Partner