@Article{Mar20,
  author    = {Marotta, Romolo and Tiriticco, Davide and Di Sanzo, Pierangelo and Pellegrini, Alessandro and Ciciani, Bruno and Quaglia, Francesco},
  journal   = {Concurrency and Computation: Practice and Experience},
  title     = {Mutable Locks: Combining the Best of Spin and Sleep Locks},
  year      = {2020},
  issn      = {2169-3536},
  month     = {5},
  abstract  = {In this article we present Mutable Locks, a synchronization construct with the same semantic of traditional locks (such as spin locks or sleep locks), but with a self-tuned optimized trade off between responsiveness and CPU-time usage during threads’ wait phases. Mutable locks tackle the need for efficient synchronization supports in the era of multi-core machines, where the run-time performance should be optimized while reducing resource usage. This goal should be achieved with no intervention by the programmers. Our proposal is intended for exploitation in generic concurrent applications, where scarce or no knowledge is available about the underlying software/hardware stack and the workload. This is an adverse scenario for static choices between spinning and sleeping, which is tackled by our mutable locks thanks to their hybrid waiting phase and self-tuning capabilities.},
  publisher = {Wiley},
  series    = {CCPE},
  doi       = {10.1002/CPE.5858}
}

{"_id":"oNqhN6uNDdbKEP6uY","bibbaseid":"marotta-tiriticco-disanzo-pellegrini-ciciani-quaglia-mutablelockscombiningthebestofspinandsleeplocks-2020","authorIDs":[],"author_short":["Marotta, R.","Tiriticco, D.","Di Sanzo, P.","Pellegrini, A.","Ciciani, B.","Quaglia, F."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Marotta"],"firstnames":["Romolo"],"suffixes":[]},{"propositions":[],"lastnames":["Tiriticco"],"firstnames":["Davide"],"suffixes":[]},{"propositions":[],"lastnames":["Di","Sanzo"],"firstnames":["Pierangelo"],"suffixes":[]},{"propositions":[],"lastnames":["Pellegrini"],"firstnames":["Alessandro"],"suffixes":[]},{"propositions":[],"lastnames":["Ciciani"],"firstnames":["Bruno"],"suffixes":[]},{"propositions":[],"lastnames":["Quaglia"],"firstnames":["Francesco"],"suffixes":[]}],"journal":"Concurrency and Computation: Practice and Experience","title":"Mutable Locks: Combining the Best of Spin and Sleep Locks","year":"2020","issn":"2169-3536","month":"5","abstract":"In this article we present Mutable Locks, a synchronization construct with the same semantic of traditional locks (such as spin locks or sleep locks), but with a self-tuned optimized trade off between responsiveness and CPU-time usage during threads’ wait phases. Mutable locks tackle the need for efficient synchronization supports in the era of multi-core machines, where the run-time performance should be optimized while reducing resource usage. This goal should be achieved with no intervention by the programmers. Our proposal is intended for exploitation in generic concurrent applications, where scarce or no knowledge is available about the underlying software/hardware stack and the workload. This is an adverse scenario for static choices between spinning and sleeping, which is tackled by our mutable locks thanks to their hybrid waiting phase and self-tuning capabilities.","publisher":"Wiley","series":"CCPE","doi":"10.1002/CPE.5858","bibtex":"@Article{Mar20,\n author = {Marotta, Romolo and Tiriticco, Davide and Di Sanzo, Pierangelo and Pellegrini, Alessandro and Ciciani, Bruno and Quaglia, Francesco},\n journal = {Concurrency and Computation: Practice and Experience},\n title = {Mutable Locks: Combining the Best of Spin and Sleep Locks},\n year = {2020},\n issn = {2169-3536},\n month = {5},\n abstract = {In this article we present Mutable Locks, a synchronization construct with the same semantic of traditional locks (such as spin locks or sleep locks), but with a self-tuned optimized trade off between responsiveness and CPU-time usage during threads’ wait phases. Mutable locks tackle the need for efficient synchronization supports in the era of multi-core machines, where the run-time performance should be optimized while reducing resource usage. This goal should be achieved with no intervention by the programmers. Our proposal is intended for exploitation in generic concurrent applications, where scarce or no knowledge is available about the underlying software/hardware stack and the workload. This is an adverse scenario for static choices between spinning and sleeping, which is tackled by our mutable locks thanks to their hybrid waiting phase and self-tuning capabilities.},\n publisher = {Wiley},\n series = {CCPE},\n doi = {10.1002/CPE.5858}\n}\n\n","author_short":["Marotta, R.","Tiriticco, D.","Di Sanzo, P.","Pellegrini, A.","Ciciani, B.","Quaglia, F."],"key":"Mar20","id":"Mar20","bibbaseid":"marotta-tiriticco-disanzo-pellegrini-ciciani-quaglia-mutablelockscombiningthebestofspinandsleeplocks-2020","role":"author","urls":{},"downloads":0},"bibtype":"article","biburl":"https://raw.githubusercontent.com/alessandropellegrini/alessandropellegrini.github.io/master/pubs.bib","creationDate":"2021-02-05T20:44:07.937Z","downloads":0,"keywords":[],"search_terms":["mutable","locks","combining","best","spin","sleep","locks","marotta","tiriticco","di sanzo","pellegrini","ciciani","quaglia"],"title":"Mutable Locks: Combining the Best of Spin and Sleep Locks","year":2020,"dataSources":["PcuRWp2nBdXHxwj7e"]}