{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:32:01Z","timestamp":1787340721118,"version":"build-2736575974"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1987,8]]},"abstract":"<jats:p>We show a nontrivial tradeoff between the communication c and time t required to compute a collection of values whose dependencies form a grid, i.e., value $(i,j)$ depends on the values $(i - 1,j)$ and $(i,j - 1)$. No matter how we share the responsibility for computing the nodes of the $n \\times n$ grid among processors, the law $(c + n)t = \\Omega (n^3 )$ must hold. Further, there must be a single path through the grid along which there are t communication steps, where $(d + 1)t = \\Omega (n^2 )$. Depending on the machine organization, either law may be the more significant.<\/jats:p>","DOI":"10.1137\/0216044","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:28:18Z","timestamp":1109226498000},"page":"639-646","source":"Crossref","is-referenced-by-count":61,"title":["A Communication-Time Tradeoff"],"prefix":"10.1137","volume":"16","author":[{"given":"Christos H.","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey D.","family":"Ullman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R2","unstructured":"D. Andivahis, Masters Thesis,  Time-communication tradeoff in multiprocessing systems, Diploma dissertation, National Technical University of Athens, Athens, Greece,  1984, (In Greek.)"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"S. A. Cook, R. Sethi,  Storage requirements for deterministic polynomial time recognizable languages,  Sixth Annual ACM Symposium on Theory of Computing (Seattle, Wash., 1974), Assoc. Comput. Mach., New York,  1974,  33\u201339, May 54:91660412.68078","DOI":"10.1145\/800119.803882"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"J.W. Hong, H.T. Kung,  I\/O complexity: the red\u2013blue pebble game,  Proc. 13th Annual ACM Symposium on the Theory of Computing,  1981,  326\u2013333, May","DOI":"10.1145\/800076.802486"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"M. M. Klawe,  A tight bound for black and white pebbles on the pyramid,  Proc. 24th Annual IEEE Symposium on Foundations of Computer Science,  1983, November","DOI":"10.1109\/SFCS.1983.3"},{"key":"R6","unstructured":"C. Thompson, Ph.D. Thesis,  A Complexity Theory for VLSI, Carnegie-Mellon University, Pittsburgh, PA,  1980"},{"key":"R7","unstructured":"F. Afrati, C. H. Papadimitriou, G. Papageorgiou,  Scheduling dags to minimize time and communication, Technical Report, National Technical University of Athens, Athens, Greece,  1985"},{"key":"R8","unstructured":"D. N. Jayasimha, M. C. Loui,  The communication complexity of parallel algorithms, Technical Report, CSRD 629, University of Illinois at Urbana-Champaign,  1986"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0219021"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0216044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:45:28Z","timestamp":1787337928000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0216044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["10.1137\/0216044"],"URL":"https:\/\/doi.org\/10.1137\/0216044","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}