Exploiting pseudo-schedules to guide data dependence graph partitioning
Alex Aletà, Josep Codina, F.J. Alejandre Sánchez, Antonio M. González, David R Kaeli · International Conference on Parallel Architectures and Compilation Techniques · 2002
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
International Conference on Parallel Architectures and Compilation Techniques · OpenAlex · conference-paper · 2002
Abstract
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters is done by means of graph partitioning algorithms that are guided by a pseudo-scheduler. This pseudo-scheduler is a simplified version of the full instruction scheduler and estimates key constraints that would be encountered in the final schedule.
Open the resolved locator · 10.5555/645989.674323
Metadata licence: OpenAlex metadata (CC0)