{"type":"ScholarlyArticle","title":"A Parallel Searching Scheme for Multiprocessor Systems and Its Application to Combinatorial Problems","authors":[{"name":"Masaharu Imai","slug":"masaharu-imai","given":"Masaharu","family":"Imai","affiliation":""},{"name":"Yuuji Yoshida","slug":"yuuji-yoshida","given":"Yuuji","family":"Yoshida","affiliation":""},{"name":"Teruo Fukumura","slug":"teruo-fukumura","given":"Teruo","family":"Fukumura","affiliation":""}],"abstract":"In this paper, we propose a parallelized computational scheme called Parallelized Depth-First Algorithm (PDFA) for Branch-and-Bound (B&B) method that works on multiprocessor systems. It is shown theoretically that the space requirement of PDFA on p processing units is at most p times as much as that of the sequential B&B algorithm with the depth-first search function. Moreover, from our experimental results through simulation, it is known that the computation time of PDFA on p processing units can be resuced to less than 1/p that of the sequential B&B algorithm with the depth-first search function. We name this reduction effect in the computation time Acceleration Effect.","doi":null,"url":"https://ijcai.org/proceedings/1979/90","pdf":"https://ijcai.org/proceedings/1979/0090.pdf","markdown":"https://ijcai.org/proceedings/1979/90.md","bibtex":"https://ijcai.org/proceedings/1979/bibtex/90","volume":{"slug":"1979","title":"Proceedings of the Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1979","url":"https://ijcai.org/proceedings/1979/","year":1979,"location":"Tokyo, Japan","dates":"August 20-23, 1979","editors":"Bruce G. Buchanan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":90,"pages":{"first":null,"last":null},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}