An Efficient Algorithm for the Optimal Linear Schedule of Uniform Dependence Algorithms

Andronikos, T; Koziris, N; Tsiatsoulis, Z; Papakonstantinou, G; Tsanakas, P

dc.contributor.author	Andronikos, T	en
dc.contributor.author	Koziris, N	en
dc.contributor.author	Tsiatsoulis, Z	en
dc.contributor.author	Papakonstantinou, G	en
dc.contributor.author	Tsanakas, P	en
dc.date.accessioned	2014-03-01T01:43:03Z
dc.date.available	2014-03-01T01:43:03Z
dc.date.issued	1995	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24021
dc.subject	automatic parallelization	en
dc.subject	Data Dependence	en
dc.subject	Dynamic Control	en
dc.subject	Efficient Algorithm	en
dc.subject	Parallel Architecture	en
dc.subject	Parallel Processing	en
dc.subject	Robot Manipulator	en
dc.subject	Time Complexity	en
dc.title	An Efficient Algorithm for the Optimal Linear Schedule of Uniform Dependence Algorithms	en
heal.type	journalArticle	en
heal.publicationDate	1995	en
heal.abstract	Real-time dynamic control of robot manipulators incurs s ignificant computational load, that can be tackled by parallel processing techniques. One of the most promising areas of research in this field is the area o f automatic parallelization of sequential algorithms. In this paper we present an efficient algorithm for the parallelization o f nested FOR(DO)-loops with uniform data dependencies. Our	en