Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2009
Optimizing shared cache behavior of chip multiprocessors
MICRO 42: Proceedings of the 42nd Annual IEEE/ACM International Symposium on MicroarchitecturePages 505–516https://doi.org/10.1145/1669112.1669176One of the critical problems associated with emerging chip multiprocessors (CMPs) is the management of on-chip shared cache space. Unfortunately, single processor centric data locality optimization schemes may not work well in the CMP case as data ...
- research-articleDecember 2009
BulkCompiler: high-performance sequential consistency through cooperative compiler and hardware support
MICRO 42: Proceedings of the 42nd Annual IEEE/ACM International Symposium on MicroarchitecturePages 133–144https://doi.org/10.1145/1669112.1669131A platform that supported Sequential Consistency (SC) for all codes --- not only the well-synchronized ones --- would simplify the task of programmers. Recently, several hardware architectures that support high-performance SC by committing groups of ...
- research-articleDecember 2009
Portable compiler optimisation across embedded programs and microarchitectures using machine learning
MICRO 42: Proceedings of the 42nd Annual IEEE/ACM International Symposium on MicroarchitecturePages 78–88https://doi.org/10.1145/1669112.1669124Building an optimising compiler is a difficult and time consuming task which must be repeated for each generation of a microprocessor. As the underlying microarchitecture changes from one generation to the next, the compiler must be retuned to optimise ...
- research-articleDecember 2009
Tree register allocation
MICRO 42: Proceedings of the 42nd Annual IEEE/ACM International Symposium on MicroarchitecturePages 67–77https://doi.org/10.1145/1669112.1669123This paper presents tree register allocation, which maps the lifetimes of the variables in a program into a set of trees, colors each tree in a greedy style, which is optimal when there is no spilling, and connects dataflow between and within the trees ...