Geometric scheduling of 2-D uniform dependence loops

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Drositis, I en
dc.contributor.author Andronikos, T en
dc.contributor.author Kokorogiannis, A en
dc.contributor.author Papakonstantinou, G en
dc.contributor.author Koziris, N en
dc.date.accessioned 2014-03-01T02:41:53Z
dc.date.available 2014-03-01T02:41:53Z
dc.date.issued 2001 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/30655
dc.subject Execution pattern en
dc.subject Scheduling en
dc.subject Uniform dependence loop en
dc.subject.other Algorithms en
dc.subject.other Computational complexity en
dc.subject.other Computational geometry en
dc.subject.other Polynomials en
dc.subject.other Geometric scheduling en
dc.subject.other Uniform dependence loops en
dc.subject.other Scheduling en
dc.title Geometric scheduling of 2-D uniform dependence loops en
heal.type conferenceItem en
heal.identifier.primary 10.1109/ICPADS.2001.934828 en
heal.identifier.secondary http://dx.doi.org/10.1109/ICPADS.2001.934828 en
heal.publicationDate 2001 en
heal.abstract One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this work, the problem of scheduling using wavefront prediction is presented. The geometric concepts of time instance subspaces and execution pattern are introduced. A quite simple and low complexity scheduling algorithm is presented. The index space is split into geometric subspaces and any point can be located in them. Each point is then scheduled according to the subspace where it belongs. en
heal.journalName Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS en
dc.identifier.doi 10.1109/ICPADS.2001.934828 en
dc.identifier.spage 259 en
dc.identifier.epage 264 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record