Record number :
Title of article :
An Efficient Meta-lock for Implementing Ubiquitous Synchronization
Author/Authors :
Agesen، Ole نويسنده , , Detlefs، David نويسنده , , Garthwaite، Alex نويسنده , , Knippel، Ross نويسنده , , Ramakrishna، Y.S. نويسنده , , White، Derek نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Pages :
From page :
To page :
Abstract :
Escape analysis [27, 14, 5] is a static analysis that determines whether the lifetime of data exceeds its static scope. The main originality of our escape analysis is that it determines precisely the effect of assignments, which is necessary to apply it to object oriented languages with promising results, whereas previous work [27, 14, 5] applied it to functional languages and were very imprecise on assignments. Our implementation analyses the full Java^tm Language. We have applied our analysis to stack allocation and synchronization elimination. We manage to stack allocate 13% to 95% of data, eliminate more than 20% of synchronizations on most programs (94% and 99% on two examples) and get up to 44% speedup (21% on average). Our detailed experimental study on large programs shows that the improvement comes more from the decrease of the garbage collection and allocation times than from improvements on data locality [7], contrary to what happened for ML [5].
Keywords :
concurrent threads , object-oriented language implementation , Synchronization
Journal title :
A C M Sigplan (Programming Languages) Sigplan Notices
Serial Year :
Link To Document :