Decomposition and allocation of flat-structured problems

Author

Hu, Peng ; Su, Bogong ; Shi, Chunyi

Author_Institution

Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China

fYear

1991

fDate

11-13 Sep 1991

Firstpage

659

Lastpage

664

Abstract

A classification is made of the applications of distributed problem solving (DPS) into hierarchically structured problems (HP) and flatly structured problems (FP). A formal description is given of an FP and its solving system. An improved problem decomposition (IPD) algorithm is presented by which a problem is decomposed in size into several tasks of identical property and each task is allocated to a proximate agent. Heuristic state space search is used to balance load. Experiments on a distributed transport dispatching system, DTD-1, indicate that this algorithm is effective and superior

Keywords

distributed processing; formal specification; problem solving; DTD-1; distributed problem solving; distributed transport dispatching system; flatly structured problems; formal description; heuristic state space search; hierarchically structured problems; problem decomposition; Application software; Computer science; Dispatching; Earthquakes; Monitoring; Problem-solving; Production facilities; Speech; State-space methods; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International

Conference_Location

Tokyo

Print_ISBN

0-8186-2152-4

Type

conf

DOI

10.1109/CMPSAC.1991.170257

Filename

170257