{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:51Z","timestamp":1725663591395},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572718"},{"type":"electronic","value":"9783540480297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57271-6_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:35:30Z","timestamp":1330259730000},"page":"99-114","source":"Crossref","is-referenced-by-count":6,"title":["Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract)"],"prefix":"10.1007","author":[{"given":"Paris C.","family":"Kanellakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Michailidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, R., Woll, H.: Wait-Free Parallel Algorithms for the Union-Find Problem. Proc. 23rd ACM STOC (1991) 370\u2013380","DOI":"10.1145\/103418.103458"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Rabin, M. O.: Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. Proc. 34th IEEE FOCS (1992) 147\u2013156","DOI":"10.1109\/SFCS.1992.267777"},{"key":"8_CR3","unstructured":"Beame, P., Kik, M., Kutylowski, M.: Information Broadcast by Exclusive Read PRAMs. Manuscript (1992)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Buss, J., Kanellakis, P. C., Ragde, P., Shvaitsman, A. A.: Parallel Algorithms with Processor Failures and Delays. Brown Univ. TR CS-91-54 (1991) (prel. version Kanellakis, P. C., Shvartsman, A. A.: Efficient Parallel Algorithms On Restartable Fail-Stop Processors. Proc. 10th ACM PODC (1991) 23\u201336)","DOI":"10.21236\/ADA242764"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Zajicek, O.: The APRAM: Incorporating Asynchrony into the PRAM Model. Proc. 1st ACM SPAA (1989) 170\u2013178","DOI":"10.1145\/72935.72954"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Zajicek, O.: The Expected Advantage of Asynchrony. Proc. 2nd ACM SPAA (1990) 85\u201394","DOI":"10.1145\/97444.97673"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","volume":"3","author":"D. Eppstein","year":"1988","unstructured":"Eppstein, D., Galil, Z.: Parallel Techniques for Combinatorial Computation. Annual Computer Science Review 3 (1988) 233\u2013283","journal-title":"Annual Computer Science Review"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fortune, S., Wyllie, J.: Parallelism in Random Access Machines. Proc. 10th ACM STOC (1978) 114\u2013118","DOI":"10.1145\/800133.804339"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gibbons, P.: A More Practical PRAM Model. Proc. 1st SPAA (1989) 158\u2013168","DOI":"10.1145\/72935.72953"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P. C. Kanellakis","year":"1992","unstructured":"Kanellakis, P. C., Shvartsman, A. A.: Efficient Parallel Algorithms Can Be Made Robust. Distributed Computing 5 (1992) 201\u2013217 (prel. version in Proc. 8th ACM PODC (1989) 138\u2013148)","journal-title":"Distributed Computing"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R. M., Ramachandran, V.: A Survey of Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, (ed. J. van Leeuwen) 1 (1990) North-Holland","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Kedem, Z. M., Palem, K. V., Spirakis, P.: Efficient Robust Parallel Computations. Proc. 22nd ACM STOC (1990) 138\u2013148","DOI":"10.1145\/100216.100231"},{"key":"8_CR13","unstructured":"Kedem, Z. M., Palem, K. V., Rabin, M. O., Raghunathan, A.: Program Transformations for Resilient Parallel Computation via Randomization. Proc. 24th ACM STOC (1992) 306\u2013318"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Kedem, Z. M., Palem, K. V., Raghunathan, A., Spirakis, P.: Combining Tentative and Definite Executions for Dependable Parallel Computing. Proc. 23d ACM STOC (1991) 381\u2013390","DOI":"10.1145\/103418.103459"},{"key":"8_CR15","unstructured":"Martel, C.: Personal communication (1991)"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1137\/0221063","volume":"21","author":"C. Martel","year":"1992","unstructured":"Martel, C., Park, A., Subramonian, R.: Work-optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM Journal on Computing 21 (1992) 1070\u20131099","journal-title":"SIAM Journal on Computing"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Martel, C., Subramonian, R., Park, A.: Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs. Proc. 32d IEEE FOCS (1990) 590\u2013599","DOI":"10.1109\/FSCS.1990.89580"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Nishimura, N.: Asynchronous Shared Memory Parallel Computation. Proc. 2nd ACM SPAA (1990) 76\u201384","DOI":"10.1145\/97444.97672"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(91)90156-C","volume":"39","author":"A. A. Shvartsman","year":"1991","unstructured":"Shvartsman, A. A.: Optimal CRCW PRAM Fault-Tolerance. Information Processing Letters 39 (1991) 59\u201366","journal-title":"Information Processing Letters"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(92)90090-I","volume":"44","author":"A. A. Shvartsman","year":"1992","unstructured":"Shvartsman, A. A.: Efficient Write-All Algorithm for Fail-Stop PRAM without Initialized Memory. Information Processing Letters 44 (1992) 223\u2013231","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57271-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:32Z","timestamp":1605647432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57271-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572718","9783540480297"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-57271-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}