{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:33:07Z","timestamp":1649208787946},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2001,3]]},"abstract":"<jats:p> In this article, we introduce a new logical clock, the barrier-lock clock, whose conception is based on the lazy release consistency memory model (LRC) supported by several distributed shared memory (DSM) systems. Since in the LRC, the propagation of shared memory updates performed by the processes of a parallel application is induced by lock and barrier operations, our logical clock has been modeled on those operations. Each barrier-lock times-tamp encodes the synchronization operation with which it is associated. Its size is not dependent on the number of processes of the system, as the traditional logical vector clocks, but it is proportional to the number of locks. The barrier-lock time characterizes the causality of shared memory updates performed by processes of a parallel application running on a LRC-based DSM system. A formal proof and experimental tests have confirmed such property. <\/jats:p>","DOI":"10.1142\/s0129626401000439","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:00:37Z","timestamp":1027767637000},"page":"65-76","source":"Crossref","is-referenced-by-count":0,"title":["THE BARRIER-LOCK CLOCK: A SCALABLE SYNCHRONIZATION-ORIENTED LOGICAL CLOCK"],"prefix":"10.1142","volume":"11","author":[{"given":"LUCIANA","family":"ARANTES","sequence":"first","affiliation":[{"name":"Laboratoire d'Informatique de Paris 6, Universit\u00e9 Pierre et Marie Curie, Paris, France"}]},{"given":"DENIS","family":"POITRENAUD","sequence":"additional","affiliation":[{"name":"Laboratoire d'Informatique de Paris 6, Universit\u00e9 Pierre et Marie Curie, Paris, France"}]},{"given":"PIERRE","family":"SENS","sequence":"additional","affiliation":[{"name":"Laboratoire d'Informatique de Paris 6, Universit\u00e9 Pierre et Marie Curie, Paris, France"}]},{"given":"BERTIL","family":"FOLLIOT","sequence":"additional","affiliation":[{"name":"Laboratoire d'Informatique de Paris 6, Universit\u00e9 Pierre et Marie Curie, Paris, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485843"},{"issue":"8","key":"p_3","first-page":"28","volume":"24","author":"Fidge C.","year":"1991","journal-title":"Distributed Computing Systems. IEEE Computer"},{"issue":"3","key":"p_4","first-page":"U9","volume":"7","year":"1994","journal-title":"Distributed Computations: In Search of the Holy GraiL Distributed Computing"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90055-M"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90028-T"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1493"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050065"},{"key":"p_13","first-page":"7","volume":"224","author":"Parker D.S.","year":"1983","journal-title":"IEEE Transaction on Software Engineering,9(S):214"},{"issue":"1","key":"p_14","first-page":"5","volume":"20","author":"Singh P.","year":"1992","journal-title":"SPLASH: Stanford Parallel Applications for Shared-memory. Computer Architecture News"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626401000439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:21:25Z","timestamp":1565108485000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626401000439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2001,3]]}},"alternative-id":["10.1142\/S0129626401000439"],"URL":"https:\/\/doi.org\/10.1142\/s0129626401000439","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}