An enhanced static-list scheduling algorithm for temporal partitioning onto RPUs
This paper presents a novel algorithm for temporal partitioning of graphs representing a behavioral description. The algorithm is based on an extension of the traditional static-list scheduling that tailors it to resolve both scheduling and temporal partitioning. The nodes to be mapped into a partit...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2018
|
| Texto completo: | http://hdl.handle.net/10400.1/12146 |
| País: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/12146 |