Abstract
This paper examines task partition problem in a Multiagent-based Distributed Open Computing Environment Model (MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T Raz, N A Botten. The knowledge base partitioning problem; mathematical formulation and heuristic clustering [J].Data and Knowledge Eng, 1994,8(4): 329–337.
He Yan-xiang, Chen Yanto. Multiagent-based distributed open computing environment model[J].High Technology Letters, 1998,8(6): 16–17 (Ch).
V R Lesser, D D Corkill. Functionally accurate cooperative distributed systems[J].IEEE Trans on Syst, Man Cybernet, 1981, SMC-11, (10): 81–96.
M R Garey, D S Johnson.Computers and Interactability: A Guide to the Theory of NP-Completeness [M]. New York: W H Freeman, 1979.
He Yan-xiang. Analysis and improvement on three types typical algorithms for task assignment in distributed system [J].Mini-Micro Computer Systems, 1997,18(11): 1–6 (Ch).
G Cornuejols, G Nembouser, L Wolsey (eds).The Uncapacited Facility Location Problem [M]. Pittsburgh, PA: Carnegie-Mellon University Press, 1983.
Author information
Authors and Affiliations
Additional information
Foundation item: Supported partially by the National 863 High Technology Project (863-306-05-01-1B)
Biography: He Yan-xiang (1952-), male, Professor, Research interests include distributed OS and distributed information processing, distributed software engineering, parallel compiler.
Rights and permissions
About this article
Cite this article
Yan-xiang, H., Xin-mong, C., Cooley, D.H. et al. A heuristic algorithm to solve the task partition problem in MDOCEM. Wuhan Univ. J. Nat. Sci. 4, 146–149 (1999). https://doi.org/10.1007/BF02841485
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02841485