A heuristic algorithm to solve the task partition problem in MDOCEM |
| |
| Authors: | He Yan-xiang Chen Xin-mong Donald H Cooley Zhang Jian-ping |
| |
| Institution: | (1) College of Computer Science and Technology, Wuhan University, 430072 Wuhan, China;(2) State Key Laboratory of Software Engineering, Wuhan University, 430072 Wuhan, China;(3) Department of Computer Science, Utah State University, 84322-4205 Logan, UT, USA |
| |
| 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.
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. |
| |
| Keywords: | distributed open computing environment task partition planning management operation set |
| 本文献已被 SpringerLink 等数据库收录！ |
|
