The algorithm for dynamic distributing of processes in real time distributed computer systems

Bardis, EG; Bardis, NG; Simonenko, AV

dc.contributor.author	Bardis, EG	en
dc.contributor.author	Bardis, NG	en
dc.contributor.author	Simonenko, AV	en
dc.date.accessioned	2014-03-01T01:48:47Z
dc.date.available	2014-03-01T01:48:47Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25595
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-4944257909&partnerID=40&md5=63edde35f383f77c1c07cf37bfa7182b	en
dc.subject	Heterogeneity	en
dc.subject	Job scheduling strategy	en
dc.subject	Optimization algorithms	en
dc.subject	Parallel systems	en
dc.subject.other	Algorithms	en
dc.subject.other	Mathematical transformations	en
dc.subject.other	Optimization	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Program processors	en
dc.subject.other	Real time systems	en
dc.subject.other	Scheduling	en
dc.subject.other	Strategic planning	en
dc.subject.other	Heterogeneity	en
dc.subject.other	Job scheduling strategy	en
dc.subject.other	Optimization algorithms	en
dc.subject.other	Parallel systems	en
dc.subject.other	Distributed computer systems	en
dc.title	The algorithm for dynamic distributing of processes in real time distributed computer systems	en
heal.type	journalArticle	en
heal.publicationDate	1999	en
heal.abstract	The approach to a solution of the problem of dynamic distribution of jobs in real time systems is described, in this article. A method for transformation of initial data into the form that makes it possible to use the known algorithms to construct a plan of solution. The offered method allows scheduling of solution efficiency of computing units and the system of priorities -penalties- be fulfilled.	en
heal.publisher	World Scientific and Engineering Academy and Society	en
heal.journalName	Recent Advances in Signal Processing and Communications	en
dc.identifier.spage	166	en
dc.identifier.epage	169	en