Heuristic software partitioning algorithms for distributed real-time applications

Author

Xin, Huanhai ; Hong, Zhang ; Xiyao, Cai

Author_Institution

Dept. of Comput. Sci., Northwest Telecommun. Eng. Inst., Xian, China

fYear

1988

fDate

11-15 Apr 1988

Firstpage

116

Lastpage

121

Abstract

The authors deal with the problems of software partition for distributed real-time applications. The software-partitioning models analyzed are those that take maximizing the efficiency in resource utilization for their objective, while observing the constraints on CPU throughput, memory space available, maximally allowed task execution time, and the order of module execution. The problem of software partition based on the models is proved to be NP-complete. There is no efficient partitioning algorithm for the models. The authors present two heuristic software-partitioning algorithms

Keywords

distributed processing; program compilers; real-time systems; CPU throughput; NP-completeness; distributed real-time applications; heuristic software-partitioning algorithms; memory space available; module execution; partitioning algorithm; resource utilization; software partition; task execution time; Application software; Costs; Delay; Heuristic algorithms; Partitioning algorithms; Real time systems; Resource management; Software algorithms; Software performance; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Software Engineering, 1988., Proceedings of the 10th International Conference on

Print_ISBN

0-89791-258-6

Type

conf

DOI

10.1109/ICSE.1988.93694

Filename

93694