Scalable and Efficient Bounds Checking for Large-Scale CMP Environments Conference Paper

abstract

• We attempt to provide an architectural support for fast and efficient bounds checking for multithread workloads in chip-multiprocessor (CMP) environments. Bounds information sharing and smart tagging help to perform bounds checking more effectively utilizing the characteristics of a pointer. Also, the BCache architecture allows fast access to the bounds information. Simulation results show that the proposed scheme increases PC of memory operations by 29% on average compared to the previous hardware scheme. 2011 IEEE.

name of conference

• 2011 International Conference on Parallel Architectures and Compilation Techniques

authors

• Kim, Eun
• Yum, Ki

published proceedings

• 2011 International Conference on Parallel Architectures and Compilation Techniques

author list (cited authors)

• An, B. S., Yum, K. H., & Kim, E. J.

citation count

• 0

complete list of authors

• An, Baik Song||Yum, Ki Hwan||Kim, Eun Jung

editor list (cited editors)

• Rauchwerger, L., & Sarkar, V.

publication date

• January 2011

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT  Journal

Digital Object Identifier (DOI)

• 10.1109/pact.2011.36

International Standard Book Number (ISBN) 13

• 9780769545660

start page

• 193

end page

• 194

URL

• http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6112806