S. Kaxiras. Identification and Optimization of Sharing Patterns for Scalable Shared-Memory Multiprocessors. Ph.D. thesis, University of Wisconsin-Madison, Madison, WI 53706, August 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hardware Prediction for Data Coherency of Scientific Codes on.. - Acquaviva, Jalby (2000) (Correct)
....consuming a non negligible portion of the network bandwidth. Previous studies have showed that coherency traffic exhibit some regular patterns [CBZ90] Corresponding optimizations have been proposed to address some of these 0 7803 9802 5 2000 10.00 (c) 2000 IEEE specific patterns [Per93] Kax98] More general schemes have also been proposed, but they remain costly in hardware, they require on chip modification, or large extension of directory structure (memory overhead) MH98] In the scientific computing world, it is well known that data access are highly structured. This property is ....
....should cooperate to exploit at best all of the opportunities by spatial and temporal locality. 7 Related works Anticipation is a very old technique which has been successfully exploited in various hardware mechanisms: branch prediction, prefetching, coherency anticipation. Following Kaxiras [Kax98] suggestion, anticipation mechanisms can be classified according first how anticipation actions are inserted (either statically by the compiler or dynamically at run time by a specialized hardware) and second on the type of information they are correlated to ( instructions or address) Address ....
[Article contains additional citation context not shown here]
Stefanos Kaxiras. Identification and Optimization of Sharing Patterns for Scalable Shared-Memory Multiprocessors. PhD thesis, University of Wisconsin-Madison, 1998.
Mechanisms for Efficient Shared-Memory, Lock-Based Synchronization - Kagi (1999) (2 citations) (Correct)
....of test set, the traffic generated by the processors competing for the lock further degrades performance. While local spinning helps test test set somewhat with this extra traffic, the release of the lock is substantially slowed down by the fact that SCI must invalidate the sharers one at a time [Kax98]. Other coherence protocols typically use broadcast to invalidate sharers, which would improve the release performance of test test set, and improve the performance of test test set over test set somewhat. Water Nsq is relatively insensitive to any of the applied optimizations. WaterNsq is a ....
Stefanos Kaxiras. Identification and Optimization of Sharing Patterns for Scalable Shared-Memory Multiprocessors. PhD thesis, University of Wisconsin, Madison, WI, 1998.
Memory Dependence Prediction - Andreas Ioannis Moshovos (Correct)
No context found.
S. Kaxiras. Identification and Optimization of Sharing Patterns for Scalable Shared-Memory Multiprocessors. Ph.D. thesis, University of Wisconsin-Madison, Madison, WI 53706, August 1998.
The Coherence Predictor Cache: A Resource-Efficient and .. - Nilsson, Landin.. (Correct)
No context found.
S. Kaxiras. Identification and Optimization of Sharing Patterns for Scalable Shared-Memory Multiprocessors. PhD thesis, University of Wisconsin-Madison, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC