An allocation algorithm for distributing Datalog programs

Author

Day, William B. ; McCreary, Carolyn L. ; Walls, Bryan

Author_Institution

Dept. of Comput. Sci. & Eng., Auburn Univ., AL, USA

Volume

23

Issue

2

fYear

1993

Firstpage

570

Lastpage

576

Abstract

An O(N³) algorithm for partitioning and allocating N Datalog procedural bundles among K distributed or dedicated processors is presented. The algorithm determines a static distribution of the bundles to all K processors. The independent variables of the objective function include both processing and communication costs, and the goal is to balance the processing requirements of the K processors while allocating bundles in such a way as to reduce the communication costs. The algorithm can be used with heterogeneous systems of processors, and it can accommodate a two-tier communication model in which both local area networks and more expensive wide area networks are used. The algorithm can be used interactively with a programmer or system designer. Example results from its implementation are given, and a comparison with another technique is shown

Keywords

computational complexity; distributed processing; logic programming; Datalog procedural bundles; LAN; WAN; dedicated processors; distributed processors; heterogeneous systems; local area networks; procedure partitioning; program distribution; program part allocation; two-tier communication model; wide area networks; Aerospace engineering; Algorithm design and analysis; Availability; Cost function; Local area networks; Logic programming; Parallel processing; Partitioning algorithms; Programming profession; Wide area networks;

fLanguage

English

Journal_Title

Systems, Man and Cybernetics, IEEE Transactions on

Publisher

ieee

ISSN

0018-9472

Type

jour

DOI

10.1109/21.229470

Filename

229470