DocumentCode :
3348636
Title :
Modeling resource contention among distributed periodic processes
Author :
Welch, Lonnie R. ; Stoyenko, Alexander D. ; Marlowe, Thoinas J.
Author_Institution :
Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA
fYear :
1992
fDate :
1-4 Dec 1992
Firstpage :
412
Lastpage :
415
Abstract :
A framework for analyzing resource usage of distributed periodic processes specified in RT-Chart is provided. Functions for reasoning about the quality of an assignment of processes to computation nodes are developed, and a novel model of resource use costs and communication costs is shown. The model allows reasoning about the rates of progress each action makes when using its resources, thus modeling contention among periodic processes sharing a resource. The computed rates of progress are accurate since impossible sources of resource contention are removed. These are useful techniques for assignment algorithms (such as simulated annealing) that repeatedly reassign actions until a close-to-optimal solution is obtained
Keywords :
distributed algorithms; formal specification; simulated annealing; RT-Chart; assignment algorithms; close-to-optimal solution; communication costs; distributed periodic processes; framework; reasoning; resource contention modelling; resource use costs; simulated annealing; Concurrent computing; Costs; Delay; Mathematical model; Parallel processing; Predictive models; Real time systems; Specification languages; Time factors; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-3200-3
Type :
conf
DOI :
10.1109/SPDP.1992.242716
Filename :
242716
Link To Document :
بازگشت