High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among th...High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinct execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantce the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective functions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems.展开更多
A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of a...A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest.展开更多
文摘High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinct execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantce the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective functions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems.
文摘A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest.