Parallelism in AI Programs

Kibler, Dennis F.; Conery, John S.

Parallelism in AI Programs

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. AI Architectures. Pages 53-55.

Abstract

A folk theorem is developing which suggests that parallel solution of AI programs will not afford a speedup of more than one order of magnitude. We critically review this folk theorem by analyzing some of the problems used to "prove" it, and then cite work that provide examples of better than one order of magnitude improvement for these problems. We examine two representative AI algorithms where parallelism would achieve speedups of two orders of magnitude with a reasonable number of processors.

Dennis F. Kibler, and John S. Conery. 1985. Parallelism in AI Programs. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 53–55. https://ijcai.org/proceedings/1985/11

@inproceedings{ijcai1985p11,
  title     = {Parallelism in AI Programs},
  author    = {Kibler, Dennis F. and Conery, John S.},
  booktitle = {Proceedings of the Ninth International Joint Conference on
               Artificial Intelligence, {IJCAI-85}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Aravind Joshi},
  pages     = {53--55},
  year      = {1985},
  note      = {AI Architectures},
  url       = {https://ijcai.org/proceedings/1985/11},
}

TY  - CPAPER
TI  - Parallelism in AI Programs
AU  - Kibler, Dennis F.
AU  - Conery, John S.
T2  - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1985
SP  - 53
EP  - 55
UR  - https://ijcai.org/proceedings/1985/11
ER  -