A parallel branch-and-bound algorithm for MIN-based multiprocessors

Myung K. Yang, Chita R. Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

A parallel "Decomposite Best-First" search Branch-and-Bound algorithm (pdbsbb) for MIN-based multiprocessor systems is proposed in this paper. A conflict free mapping scheme, known as step-by-step spread, is used to map the algorithm efficiently on to a MIN-based system for reducing communication overhead. It is shown that the proposed algorithm provides better speed-up than other reported schemes when communication overhead is taken into consideration.

Original languageEnglish (US)
Title of host publicationProceedings of the 1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1991
PublisherAssociation for Computing Machinery, Inc
Pages222-223
Number of pages2
ISBN (Print)0897913922, 9780897913928
DOIs
StatePublished - Apr 2 1991
Event1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1991 - San Diego, United States
Duration: May 21 1991May 24 1991

Publication series

NameProceedings of the 1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1991

Other

Other1991 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 1991
CountryUnited States
CitySan Diego
Period5/21/915/24/91

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Software

Fingerprint Dive into the research topics of 'A parallel branch-and-bound algorithm for MIN-based multiprocessors'. Together they form a unique fingerprint.

Cite this