Dynamic adaptation of sharing granularity in dsm systems

Itzkovitz, Ayal; Niv, N.; Schuster, Assaf

doi:10.1016/s0164-1212(00)00044-3

Cited by 2 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparing the overheads measured from our experimental evaluation, we can observe that LMW incurs significantly less overhead than ABLSW (by a factor of 2.5-15) or ABSC (by a factor of [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. LSW, despite …”

Section: Validation Of Manual Analysismentioning

confidence: 99%

See 1 more Smart Citation

Performance analysis of methods that overcome false sharing effects in software DSMs

Kudlur

Govindarajan

2004

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Page-based software DSMs experience high degrees of false sharing especially in irregular applications with fine grain sharing granularity. The overheads due to false sharing is considered to be a dominant factor limiting the performance of software DSMs. Several approaches have been proposed in the literature to reduce/eliminate false sharing. In this paper, we evaluate two of these approaches, viz., the Multiple Writer approach and the emulated fine grain sharing (EmFiGS) approach. Our evaluation strategy is two pronged. First, we use an implementation-independent analysis that uses overhead counts to compare the different approaches. Our analysis show that the benefits gained by eliminating false sharing are far outweighed by the performance penalty incurred due to the reduced exploitation of spatial locality in the EmFiGS approach. As a consequence, any implementation of the EmFiGS approach is likely to perform significantly worse than the Multiple Writer approach. Second, we use experimental evaluation to validate and complement our analysis. The experimental results match well with our analysis. Also the execution times of the application follow the same trend as in our analysis, reinforcing our conclusions. More specifically, the performance of the EmFiGS approach is significantly worse, by a factor of 1.5 to as much as 90 times, compared to the Multiple Writer approach. In many cases, the EmFiGS approach performs worse than even a single writer lazy release protocol which experiences very high overheads due to false sharing.The performance of the EmFiGS approach remains worse than the Multiple Writer approach even after incorporating Tapeworm-a record and replay technique that fetches pages ahead of demand in an aggregated fashion-to alleviate the spatial locality effect. We next present the effect of asynchronous message handling on the performance of different methods. Finally, we investigate the inter-play between spatial locality exploitation and false sharing elimination with varying sharing granularities in the EmFiGS approach and report the tradeoffs.

show abstract

Section: Validation Of Manual Analysismentioning

confidence: 99%

“…The successor to Millipage [13,23] extends the technique to adapt the sharing granularity across variables and code sections dynamically. This is a much recent work and is not addressed elaborately in our work.…”

Section: Related Workmentioning

confidence: 99%

Performance analysis of methods that overcome false sharing effects in software DSMs

Kudlur

Govindarajan

2004

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Another application which was chosen for behaving worst with respect to our approach pays a penalty of a few tens of percents, and this overhead decreases when the number of hosts increases. Still, by increasing the detection granularity on sections of data that are known to have essentially no chance for data races (a technique which is straightforward using our adaptive detection granularity approach [8]), the overhead for this application also drops down to only a few percentage points. These results make the use of data race detection as an on-the-fly add-on for regular execution in dsm systems feasible for the first time.…”

Section: Introductionmentioning

confidence: 99%