Name
Title | ||
|---|---|---|
Hypersphere mapper: a nonlinear programming approach to the hypercube embedding problem |
Abstract | ||
|---|---|---|
A nonlinear programming approach is introduced for solving the hypercube embedding problem. The basic idea of the proposed approach is to approximate the discrete space of an n-dimensional hypercube, i.e. (z:z in (0,1)/sup n/), with the continuous space of an n-dimensional hypersphere, i.e. (x:x in R/sup n/ and mod mod x mod mod /sup 2/=1). The mapping problem is initially solved in the continuous domain by employing the gradient projection technique to a continuously differentiable objective function. The optimal process 'locations' from the solution of the continuous hypersphere mapping problem are then discretized onto the n-dimensional hypercube. The proposed approach can solve, directly, the problem of mapping P processes onto N nodes for the general case where PN. In contrast, competing embedding heuristics from the literature can produce only one-to-one mappings and cannot, therefore, be directly applied when PN. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1006/jpdc.1993.1110 | Newport, CA |
Keywords | DocType | Volume |
mod mod,sup n,n-dimensional hypercube,nonlinear programming approach,continuous hypersphere mapping problem,n-dimensional hypersphere,continuous space,hypersphere mapper,continuous domain,hypercube embedding problem,mapping problem,network topology,hamming distance,objective function,software engineering,nonlinear programming,parallel processing,hypersphere,hypercubes | Journal | 19 |
Issue | ISSN | ISBN |
3 | Journal of Parallel and Distributed Computing | 0-8186-3442-1 |
Citations | PageRank | References |
1 | 0.37 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John K. Antonio | 1 | 44 | 6.32 |
| Richard C. Metzger | 2 | 1 | 0.70 |