{"type":"ScholarlyArticle","title":"Parallelism in AI Programs","authors":[{"name":"Dennis F. Kibler","slug":"dennis-f-kibler","given":"Dennis F.","family":"Kibler","affiliation":""},{"name":"John S. Conery","slug":"john-s-conery","given":"John S.","family":"Conery","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1985/11","pdf":"https://ijcai.org/proceedings/1985/0011.pdf","markdown":"https://ijcai.org/proceedings/1985/11.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/11","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"AI Architectures","track":"AI Architectures","number":11,"pages":{"first":53,"last":55},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}