Scheduling problems for parallel and distributed systems

Rusanova, O; Korochkin, A

dc.contributor.author	Rusanova, O	en
dc.contributor.author	Korochkin, A	en
dc.date.accessioned	2014-03-01T01:15:09Z
dc.date.available	2014-03-01T01:15:09Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13365
dc.subject	Dynamic Scheduling	en
dc.subject	Parallel and Distributed Computing	en
dc.subject	Parallel and Distributed System	en
dc.subject	Scheduling Algorithm	en
dc.subject	Scheduling Problem	en
dc.title	Scheduling problems for parallel and distributed systems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/319294.319323	en
heal.identifier.secondary	http://dx.doi.org/10.1145/319294.319323	en
heal.publicationDate	1999	en
heal.abstract	A two-pass scheduling algorithm for parallel and distributed computer systems is presented in this paper. We consider this algorithm as a complex of two stages: process queue formation and assignment procedure. A new approach of both stages realization is proposed. Our algorithm can be used to increase efficiency of static and dynamic scheduling.	en
heal.journalName	ACM Sigada Ada Letters	en
dc.identifier.doi	10.1145/319294.319323	en