{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:59:59Z","timestamp":1648594799530},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0167-8191(01)00147-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T05:03:24Z","timestamp":1027573404000},"page":"503-523","source":"Crossref","is-referenced-by-count":0,"title":["The parallel client\u2013server paradigm"],"prefix":"10.1016","volume":"28","author":[{"given":"Yosi","family":"Ben-Asher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0167-8191(01)00147-8_BIB1","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/142111.142121","article-title":"A survey of asynchronous remote procedure calls","volume":"26","author":"Ananda","year":"1992","journal-title":"Oper. Syst. Rev."},{"key":"10.1016\/S0167-8191(01)00147-8_BIB2","series-title":"Symposium on Parallel Algorithms and Architectures","first-page":"169","article-title":"The APRAM: Incorporating asynchrony into the PRAM model","author":"Cole","year":"1989"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB3","first-page":"85","article-title":"The expected advantage of asynchrony","volume":"vol. 2","author":"Cole","year":"1990"},{"issue":"1","key":"10.1016\/S0167-8191(01)00147-8_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-8191(88)90094-4","article-title":"A single-program-multiple-data computational mode for EPEX\/FORTRAN","volume":"7","author":"Darema","year":"1988","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(01)00147-8_BIB5","series-title":"Proceedings of the 15th Symposium on Reliable Distributed Systems","first-page":"150","article-title":"The design of a corba group communication service","author":"Felbel","year":"1996"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB6","first-page":"260","article-title":"Process coordination with fetch-and-increment","volume":"vol. 4","author":"Freudenthal","year":"1991"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB7","series-title":"Symposium on Parallel Algorithms and Architectures","first-page":"158","article-title":"A more practical PRAM model","author":"Gibbons","year":"1989"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB8","doi-asserted-by":"crossref","unstructured":"P.B. Gibbons, Y. Matias, V. Ramachandran, The queue-read queue-write asynchronous pram model, in: Euro-Par'96, 1996","DOI":"10.1007\/BFb0024714"},{"issue":"2","key":"10.1016\/S0167-8191(01)00147-8_BIB9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/69624.357206","article-title":"Basic techniques for the efficient coordination of very large numbers of cooperating sequential processes","volume":"5","author":"Gottlieb","year":"1983","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"10.1016\/S0167-8191(01)00147-8_BIB10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU Ultracomputer \u2013 designing an MIMD shared memory parallel computer","volume":"C-32","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(01)00147-8_BIB11","unstructured":"B. Hall, Beej's Guide to Network Programming Using Internet Sockets Version 1.5.3., 1997 http:\/\/www.ecst.csuchico.edu\/beej\/guide\/net\/"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB12_1","first-page":"276","article-title":"Impossibility and universality results for wait-free synchronization","volume":"vol. 7","author":"Herlihy","year":"1988"},{"issue":"1","key":"10.1016\/S0167-8191(01)00147-8_BIB12_2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","year":"1991","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/S0167-8191(01)00147-8_BIB13","unstructured":"Sun Microsystems Inc., JavaSpace Specification (Revision 0.4), 1997 http:\/\/chatsubo.javasoft.com\/javaspaces\/js-spec\/index.html"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB14","unstructured":"D. Johansen, R. Renesse, F.B. Schneider, An introduction to the tacoma distributed system. Technical Report 9523, University of Tromso, June 1995"},{"issue":"1","key":"10.1016\/S0167-8191(01)00147-8_BIB15","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/63238.63249","article-title":"Concurrent operations on priority queues","volume":"32","author":"Jones","year":"1989","journal-title":"Communications of the ACM"},{"issue":"9","key":"10.1016\/S0167-8191(01)00147-8_BIB16","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"C-28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(01)00147-8_BIB17","unstructured":"C. Martel, A. Park, R. Subramonian, Optimal asynchronous algorithms for shared memory parallel computers, Technical Report CSE-89-8, University of California, Davis, July 1989"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB18","first-page":"76","article-title":"Asynchronous shared memory parallel computation","volume":"vol. 2","author":"Nishimura","year":"1990"},{"issue":"8","key":"10.1016\/S0167-8191(01)00147-8_BIB19","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/2.84877","article-title":"Distributed shared memory: a survey of issues and algorithms","volume":"24","author":"Nitzberg","year":"1991","journal-title":"Computer"},{"issue":"12","key":"10.1016\/S0167-8191(01)00147-8_BIB20","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1109\/12.9744","article-title":"Concurrent access of priority queues","volume":"37","author":"Rao","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(01)00147-8_BIB21","unstructured":"R.L. Rivest, A. Shamir, Payword and micromint: two simple micropayment schemes, Technical Report, Computer Science Laboratory, MIT, November 1995"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB22","series-title":"Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV","first-page":"64","article-title":"Implementing lock-free queues","author":"Valois","year":"1994"},{"key":"10.1016\/S0167-8191(01)00147-8_BIB23","unstructured":"J. Wilson, Operating system data structures for shared-memory machines with fetch-and-add, Ph.D thesis, NYU, 1988"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001478?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101001478?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:24:37Z","timestamp":1556969077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819101001478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0167819101001478"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(01)00147-8","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}