{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:44:35Z","timestamp":1790502275475,"version":"4.1.0"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,5]]},"abstract":"<jats:p>A new technique for proving lower bounds for parallel computation is introduced. This technique enables us to obtain, for the first time, nontrivial tight lower bounds for shared-memory models of parallel computation that allow several processors to have simultaneous access to the same memory location. Specifically, we use a concurrent-read concurrent-write model of parallel computation. It has p processors, each has access to a common memory of size m (also called communication width or width in short). The input to the problem is located in an additional read-only portion of the common memory.<\/jats:p>\n                  <jats:p>For a wide variety of problems (including parity, majority and summation) we show that the time complexity T (depth) and the communication width m are related by the trade-off curve $mT^2 = \\Omega (n)$, (where n is the size of the input), regardless of the number of processors. Moreover, for every point on this curve with $m = O(n\/\\log ^2 n)$ we give a matching upper bound with the optimal number of processors.<\/jats:p>\n                  <jats:p>We extend our technique to prove $mT^3 = \\Omega (n)$ trade-off for a class of \u201csimpler\u201d functions (including Boolean OR) on a weaker model that forbids simultaneous write access. We also state and give a proof of a new result by Beame [B-83] that achieves a tight lower bound for the OR in this model, namely $mT^2 = \\Omega (n)$. These results improve the lower bound of Cook and Dwork [CD-82] when communication is limited.<\/jats:p>","DOI":"10.1137\/0214024","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"303-314","source":"Crossref","is-referenced-by-count":41,"title":["Trade-Offs between Depth and Width in Parallel Computation"],"prefix":"10.1137","volume":"14","author":[{"given":"Uzi","family":"Vishkin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RAHU-74","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"RB-83","unstructured":"P. Beame,  1983, personal communication"},{"key":"RCD-82","doi-asserted-by":"crossref","unstructured":"S. A. Cook, C. Dwork,  Bounds on the time for parallel RAM's to compute simple functions,  Proc. 14th ACM Symposium on Theory of Computing,  1982,  231\u2013233","DOI":"10.1145\/800070.802196"},{"key":"RCSV-82","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.3"},{"key":"RFW-78","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804339"},{"key":"RFSS-81","doi-asserted-by":"crossref","unstructured":"M. Furst, J. B. Saxe, M. Sipser,  Parity, circuits and the polynomial-time hierarchy,  Proc. 22nd Annual IEEE Symposium on Foundations of Computer Science,  1981,  260\u2013270","DOI":"10.1109\/SFCS.1981.35"},{"key":"RGGKMRS-83","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676201"},{"key":"RGO-78","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804336"},{"key":"RHU-79","unstructured":"J. Hopcroft, J. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley Publishing Co., Reading, Mass., 1979, 314\u201331883j:680020426.68001"},{"key":"RK-77","doi-asserted-by":"publisher","DOI":"10.1145\/356683.356686"},{"key":"RLS-81","doi-asserted-by":"crossref","unstructured":"R. Lipton, R. Sedgwick,  Lower bounds for VLSI,  Proc. 13th ACM Symposium on Theory of Computing,  1981,  300\u2013307","DOI":"10.1145\/800076.802482"},{"key":"RPS-82","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou, M. Sipser,  Communication complexity,  Proc. 14th ACM Symposium on Theory of Computing,  1982,  196\u2013200","DOI":"10.1145\/800070.802192"},{"key":"RSV-81","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90010-9"},{"key":"RSHV-82","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"RSV-82","doi-asserted-by":"publisher","DOI":"10.1137\/0213027"},{"key":"RV-82","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90028-8"},{"key":"RW-83","unstructured":"A. Wigderson, Ph.D. Thesis,  Studies in computational complexity, Princeton Univ., Princeton, NJ,  1983, May"},{"key":"RY-81","doi-asserted-by":"crossref","unstructured":"A. Yao,  The enthropic limitations on VLSI computations,  Proc. 13th ACM Symposium on Theory of Computing,  1981,  308\u2013311","DOI":"10.1145\/800076.802483"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:44Z","timestamp":1787337764000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["10.1137\/0214024"],"URL":"https:\/\/doi.org\/10.1137\/0214024","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}