Skip to main content
Log in

Experimental evaluation of objective functions for well-balanced mapping

  • Part II. Invited Lectures and Contributed Lectures
  • 1. Parallel Computer Systems and Applications
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

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 overheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinet execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantee the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective lanetions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bokhari, Shahid H., On the Mapping Problem,IEEE Transactions on Computers,C-30(3), March 1981, 207–214

    Article  MathSciNet  Google Scholar 

  2. Hanan, M. and Kurtzberg, J. M., A Review of The Placement and Quadratic Assignment Problems,SIAM Rev.,14, Apr. 1972, 324–342

    Article  MATH  MathSciNet  Google Scholar 

  3. Lee, Soo-young and Aggarwal, J. K., A Mapping Strategy for Parallel Processing,IEEE Transactions on Computers,C-36(4), April 1987, 433–442

    Article  Google Scholar 

  4. Arunkumar, S. and Chockalingam, T., Randomized Heuristic for The Mapping Problem,International Journal of High Speed Computing,4(4), 1992, 289–299

    Article  Google Scholar 

  5. Wu, Shen Shen and Sweeting, David, Heuristic Algorithms for Task Assignment and Scheduling in A Processor Network,Parallel Computing,20, 1994, 1–14

    Article  Google Scholar 

  6. Flower, J. W., Otto, S. W. and Salama, M. C., A Preprocessor for Irregular Finite Element Problems,C 3P292,CALT-68-1405

  7. Flower, J., Otto, S. and Salama, M., Optimal Mapping of Irregular Finite Element Domains to Parallel Processors,C 3P-292b

  8. Kang, Ohan and Kim, Byeong Man, Heuristic Subcube Allocation with Task Migration in Hypercube Systems,International Journal of High Speed Computing,4(2) 1992, 121–142

    Article  Google Scholar 

  9. Cvetanovic, Zarka, The Effects of Problem Partitioning, Allocation, and Granularity on The Performance of Multiple-Processor Systems,IEEE Transactions on Computers,C-36(4), April 1987, 421–432.

    Article  Google Scholar 

  10. Parker, J. R., and Groisman, G., Simulated Annealing for Data Modeling in Scientific Images,Journal of Scientific Computing,8(3), 1993, 243–266

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported in part by the National 863 Hi-Tech Project.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delai, C., Hong, X., Ying, Z. et al. Experimental evaluation of objective functions for well-balanced mapping. Wuhan Univ. J. of Nat. Sci. 1, 312–316 (1996). https://doi.org/10.1007/BF02900847

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02900847

Keywords

C. R. Categories

Navigation