{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:22Z","timestamp":1725663322682},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540991"},{"type":"electronic","value":"9783540474050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54099-7_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:29:24Z","timestamp":1330208964000},"page":"102-121","source":"Crossref","is-referenced-by-count":5,"title":["On the average performance of synchronized programs in distributed networks"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Rajsbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Sidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \"Complexity of Network Synchronization\", JACM, Vol. 32, No. 4, Oct. 1985, pp. 804\u2013823.","journal-title":"JACM"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/net.3230150404","volume":"15","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, \"Reducing Complexities of Distributed Max-Flow and Breadth-First-Search Algorithms by Means of Network Synchronization\", Networks 15, 1985, pp. 425\u2013437.","journal-title":"Networks"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, D. Peleg, \"Network Synchronization with Polylogarithmic Overhead\", Proc. IEEE FOCS, 1990.","DOI":"10.1109\/FSCS.1990.89572"},{"issue":"4","key":"8_CR4","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V.C. Barbosa","year":"1989","unstructured":"V.C. Barbosa, E. Gafni, \"Concurrency in Heavily Loaded Neighborhood-Constrained Systems\", ACM Trans. on Programming Languages and Systems, Vol. 11, No. 4, Oct. 1989, pp. 562\u2013584.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"P. Berman, J. Simon, \"Investigations of Fault-Tolerant Networks of Computers\", Proc. of the 20th ACM STOC, 1988.","DOI":"10.1145\/62212.62219"},{"key":"8_CR6","volume-title":"Parallel and Distributed Computation","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas, J. N. Tsitsiklis, Parallel and Distributed Computation, Prentice-Hall, N.J. 1989."},{"key":"8_CR7","unstructured":"K. L. Chung, Markov Chains With Stationary Transition Probabilities, Springer-Verlag, 2nd edition, 1967."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"K. M. Chandy and L. Lamport, \"Distributed Snapshots: Determining Global States of Distributed Systems\", ACM Trans. on Computer Systems, Vol. 3, No 1, Feb. 1985.","DOI":"10.1145\/214451.214456"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"F. Commoner, A.W. Holt, S. Even, A. Pnueli, \"Marked Directed Graphs\", J. of Computer and System Sciences, Vol, 5, No 5, Oct. 1971.","DOI":"10.1016\/S0022-0000(71)80013-2"},{"key":"8_CR10","unstructured":"H.A. David, Order Statistics, John Wiley & Sons, 1970."},{"key":"8_CR11","unstructured":"S. Even, S. Rajsbaum, \"Lack of Global Clock Does Not Slow Down the Computation in Distributed Networks\", TR #522, Department of Computer Science, Technion, Haifa, Israel, Oct. 1988. The first part of this paper appears with the title \"Unison in Distributed Networks\" in Sequences: Combinatorica, Compression, Security, and Transmission, R.M. Capocelli (ed.), Springer-Verlag, 1990."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"S. Even, S. Rajsbaum, \"The Use of a Synchronizer Yields Maximum Rate in Distributed Networks\", Proc. of the 22nd ACM STOC, 1990.","DOI":"10.1145\/100216.100227"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"M.A. Marsan, \"Stochastic Petri Nets: An Elementary Introduction\", in Advances in Petri Nets 1989, Lecture Notes in CS 424, Springer-Verlag, 1989, pp. 1\u201329.","DOI":"10.1007\/3-540-52494-0_23"},{"key":"8_CR14","first-page":"351","volume":"319","author":"J. Malka","year":"1988","unstructured":"J. Malka, S. Moran, S. Zaks, \"Analysis of a Distributed Scheduler for Communication Networks\", TR-495, Department of Computer Science, Technion, Haifa, Israel, Feb. 1988. Also in Lecture Notes on CS, Vol. 319, pp. 351\u2013360, Springer Verlag, 1988.","journal-title":"Lecture Notes on CS"},{"issue":"9","key":"8_CR15","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TC.1982.1676110","volume":"c-31","author":"M. K. Molloy","year":"1982","unstructured":"M. K. Molloy, \"Performance Analysis Using Stochastic Petri Nets\", IEEE Trans. on Computers, Vol. c-31, No. 9, Sep. 1982, pp. 913\u2013917.","journal-title":"IEEE Trans. on Computers"},{"key":"8_CR16","first-page":"244","volume-title":"Fast Bounds for Stochastic Petri Nets","author":"M. K. Molloy","year":"1985","unstructured":"M. K. Molloy, \"Fast Bounds for Stochastic Petri Nets\", International Workshop on Timed Petri Nets, Torino, Italy, July 1985, pp. 244\u2013249."},{"key":"8_CR17","unstructured":"Y. Ofek, I. Gopal, \"Generating a Global Clock in a Distributed System\", IBM Research Report, 1987."},{"issue":"1","key":"8_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and A. A. Schaffer, \"Graph Spanners\", J. of Graph Theory, Vol. 13, No. 1, 1989, pp. 99\u2013116.","journal-title":"J. of Graph Theory"},{"issue":"4","key":"8_CR19","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and J. D. Ullman, \"An Optimal Synchronizer for the Hypercube\", SIAM J. Computing, Vol. 18, No. 4, August 1989, pp. 740\u2013747.","journal-title":"SIAM J. Computing"},{"key":"8_CR20","unstructured":"A. L. Rosenberg, \"Shuffle-Oriented Interconnection Networks\", COINS Technical Report 88-84, Univ. of Massachusetts, 1988."},{"key":"8_CR21","unstructured":"S. Rajsbaum, Y. Malka, \"Synchronizers, Schedulers and Marked Graphs\", in preparation."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"S. M. Ross, Stochastic Processes, J. Wiley, 1983.","DOI":"10.1016\/B978-0-12-598420-1.50011-8"},{"key":"8_CR23","volume-title":"English Translation","author":"D. Stoyan","year":"1984","unstructured":"D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, English Translation (D.J. Daley, Ed.), J. Wiley & Sons, New York, 1984."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54099-7_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:52:24Z","timestamp":1605646344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54099-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540991","9783540474050"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-54099-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}