Mostra el registre d'ítem simple
Graph-partitioning based instruction scheduling for clustered processors
dc.contributor.author | Aleta Ortega, Alexandre |
dc.contributor.author | Codina Viñas, Josep M. |
dc.contributor.author | Sánchez Navarro, F. Jesús |
dc.contributor.author | González Colás, Antonio María |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.date.accessioned | 2016-11-17T13:34:38Z |
dc.date.available | 2016-11-17T13:34:38Z |
dc.date.issued | 2001 |
dc.identifier.citation | Aleta, A., Codina, J.M., Sanchez, F., Gonzalez, A. Graph-partitioning based instruction scheduling for clustered processors. A: Annual IEEE/ACM International Symposium on Microarchitecture. "34th ACM/IEEE International Symposium on Microarchitecture, 2001, MICRO-34: proceedings". Austin: Institute of Electrical and Electronics Engineers (IEEE), 2001, p. 150-159. |
dc.identifier.isbn | 0-7965-1369-7 |
dc.identifier.uri | http://hdl.handle.net/2117/96793 |
dc.description.abstract | This paper presents a novel scheme to schedule loops for clustered microarchitectures. The scheme is based on a preliminary cluster assignment phase implemented through graph partitioning techniques followed by a scheduling phase that integrates register allocation and spill code generation. The graph partitioning scheme is shown to be very effective due to its global view of the whole code while the partition is generated. Results show a significant speedup when compared with previously proposed techniques. For some processor configuration the average speedup for the SPECfp95 is 23% with respect to the published scheme with the best performance. Besides, the proposed scheme is much faster (between 2-7 times, depending on the configuration). |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors |
dc.subject.lcsh | Microprocessors |
dc.subject.other | Processor scheduling |
dc.subject.other | Delay |
dc.subject.other | Energy consumption |
dc.subject.other | Job shop scheduling |
dc.subject.other | Digital signal processing |
dc.subject.other | Microarchitecture |
dc.subject.other | Transistors |
dc.subject.other | Wires |
dc.subject.other | VLIW |
dc.title | Graph-partitioning based instruction scheduling for clustered processors |
dc.type | Conference report |
dc.subject.lemac | Microprocessadors |
dc.contributor.group | Universitat Politècnica de Catalunya. ARCO - Microarquitectura i Compiladors |
dc.identifier.doi | 10.1109/MICRO.2001.991114 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://ieeexplore.ieee.org/document/991114/ |
dc.rights.access | Open Access |
local.identifier.drac | 2357093 |
dc.description.version | Postprint (published version) |
local.citation.author | Aleta, A.; Codina, J.M.; Sanchez, F.; Gonzalez, A. |
local.citation.contributor | Annual IEEE/ACM International Symposium on Microarchitecture |
local.citation.pubplace | Austin |
local.citation.publicationName | 34th ACM/IEEE International Symposium on Microarchitecture, 2001, MICRO-34: proceedings |
local.citation.startingPage | 150 |
local.citation.endingPage | 159 |