Name
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. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1145/107971.108000 | SIGMETRICS |
Keywords | Field | DocType |
min-based system,min-based multiprocessor system,better speed-up,branch-and-bound algorithm,parallel branch-and-bound algorithm,decomposite best-first,communication overhead,step-by-step spread,conflict free mapping scheme,min-based multiprocessors,proposed algorithm,branch and bound algorithm | Branch and bound,Computer science,Parallel algorithm,Parallel computing,Multiprocessing,Real-time computing,Distributed computing | Conference |
Volume | Issue | ISSN |
19 | 1 | 0163-5999 |
ISBN | Citations | PageRank |
0-89791-392-2 | 2 | 0.40 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Myung K. Yang | 1 | 3 | 1.33 |
| Chita R. Das | 2 | 258 | 28.49 |