Reactive NUMA: a design for unifying S-COMA and CC-NUMA Export

@inproceedings{Falsafi97, abstract = {This paper proposes and evaluates a new approach to directory-based cache coherence protocols called Reactive NUMA (R-NUMA). An R-NUMA system combines a conventional CC-NUMA coherence protocol with a more-recent Simple-COMA (S-COMA) protocol. What makes R-NUMA novel is the way it dynamically reacts to program and system behavior to switch between CC-NUMA and S-COMA and exploit the best aspects of both protocols. This reactive behavior allows each node in an R-NUMA system to independently choose the best protocol for a particular page, thus providing much greater performance stability than either CC-NUMA or S-COMA alone. Our evaluation is both qualitative and quantitative. We first show the theoretical result that R-NUMA's worst-case performance is bounded within a small constant factor (i.e., two to three times) of the best of CC-NUMA and S-COMA. We then use detailed execution-driven simulation to show that, in practice, R-NUMA usually performs better than either a pure CC-NUMA or pure S-COMA protocol, and no more than 57\% worse than the best of CC-NUMA and S-COMA, for our benchmarks and base system assumptions.}, address = {New York, NY, USA}, author = {Falsafi, Babak and Wood, David A.}, booktitle = {ISCA '97: Proceedings of the 24th annual international symposium on Computer architecture}, citeulike-article-id = {5926231}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=264205}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/264107.264205}, doi = {10.1145/264107.264205}, isbn = {0-89791-901-7}, keywords = {data, placement}, location = {Denver, Colorado, United States}, pages = {229--240}, posted-at = {2009-10-12 12:02:13}, priority = {2}, publisher = {ACM}, title = {Reactive NUMA: a design for unifying S-COMA and CC-NUMA}, url = {http://dx.doi.org/10.1145/264107.264205}, year = {1997} }

TY - CONF ID - Falsafi97 L3 - citeulike-article-id:5926231 N2 - This paper proposes and evaluates a new approach to directory-based cache coherence protocols called Reactive NUMA (R-NUMA). An R-NUMA system combines a conventional CC-NUMA coherence protocol with a more-recent Simple-COMA (S-COMA) protocol. What makes R-NUMA novel is the way it dynamically reacts to program and system behavior to switch between CC-NUMA and S-COMA and exploit the best aspects of both protocols. This reactive behavior allows each node in an R-NUMA system to independently choose the best protocol for a particular page, thus providing much greater performance stability than either CC-NUMA or S-COMA alone. Our evaluation is both qualitative and quantitative. We first show the theoretical result that R-NUMA's worst-case performance is bounded within a small constant factor (i.e., two to three times) of the best of CC-NUMA and S-COMA. We then use detailed execution-driven simulation to show that, in practice, R-NUMA usually performs better than either a pure CC-NUMA or pure S-COMA protocol, and no more than 57% worse than the best of CC-NUMA and S-COMA, for our benchmarks and base system assumptions. CY - Denver, Colorado, United States SN - 0-89791-901-7 AD - New York, NY, USA EP - 240 TI - Reactive NUMA: a design for unifying S-COMA and CC-NUMA PB - ACM T2 - ISCA '97: Proceedings of the 24th annual international symposium on Computer architecture SP - 229 KW - data KW - placement AU - Falsafi, Babak AU - Wood, David PY - 1997/// UR - http://dx.doi.org/10.1145/264107.264205 ER -