{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:48Z","timestamp":1750307508100,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T00:00:00Z","timestamp":1249948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,8,11]]},"DOI":"10.1145\/1583991.1583997","type":"proceedings-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T18:34:59Z","timestamp":1250534099000},"page":"19-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Mapping filtering streaming applications with communication costs"],"prefix":"10.1145","author":[{"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[{"name":"MIT, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[{"name":"ENS Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanny","family":"Dufoss\u00e9","sequence":"additional","affiliation":[{"name":"ENS-Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[{"name":"ENS Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0076-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007615"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.11.004"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(03)00008-X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320249"},{"key":"e_1_3_2_1_10_1","unstructured":"DataCutter Project: Middleware for Filtering Large Archival Scientific Datasets in a Grid Environment. http:\/\/www.cs.umd.edu\/projects\/hpsl\/ResearchAreas\/DataCutter.htm.  DataCutter Project: Middleware for Filtering Large Archival Scientific Datasets in a Grid Environment. http:\/\/www.cs.umd.edu\/projects\/hpsl\/ResearchAreas\/DataCutter.htm."},{"volume-title":"CIDR 2003, First Biennial Conference on Innovative Data Systems Research, 2003. On-line proceedings at http:\/\/www-db.cs.wisc.edu\/cidr\/program\/p8.pdf.","author":"Florescu D.","key":"e_1_3_2_1_11_1","unstructured":"D. Florescu , A. Grunhagen , and D. Kossmann . Xl: A platform for web services . In CIDR 2003, First Biennial Conference on Innovative Data Systems Research, 2003. On-line proceedings at http:\/\/www-db.cs.wisc.edu\/cidr\/program\/p8.pdf. D. Florescu, A. Grunhagen, and D. Kossmann. Xl: A platform for web services. In CIDR 2003, First Biennial Conference on Innovative Data Systems Research, 2003. On-line proceedings at http:\/\/www-db.cs.wisc.edu\/cidr\/program\/p8.pdf."},{"key":"e_1_3_2_1_12_1","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability, a Guide to the Theory of NP-Completeness . W.H. Freeman and Company , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170078"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2003.1240621"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAPD.0000018574.71588.06"},{"key":"e_1_3_2_1_16_1","volume-title":"MPI the complete reference","author":"Snir M.","year":"1996","unstructured":"M. Snir , S. W. Otto , S. Huss-Lederman , D. W. Walker , and J. Dongarra . MPI the complete reference . The MIT Press , 1996 . M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI the complete reference. The MIT Press, 1996."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164159"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795691.797940"},{"key":"e_1_3_2_1_19_1","volume-title":"An approach for optimizing latency under throughput constraints for application workflows on clusters. Research Report OSU-CISRC-1\/07-TR03","author":"Vydyanathan N.","year":"2007","unstructured":"N. Vydyanathan , U. Catalyurek , T. Kurc , P. Saddayappan , and J. Saltz . An approach for optimizing latency under throughput constraints for application workflows on clusters. Research Report OSU-CISRC-1\/07-TR03 , Ohio State University , Columbus, OH , Jan. 2007 . N. Vydyanathan, U. Catalyurek, T. Kurc, P. Saddayappan, and J. Saltz. An approach for optimizing latency under throughput constraints for application workflows on clusters. Research Report OSU-CISRC-1\/07-TR03, Ohio State University, Columbus, OH, Jan. 2007."},{"key":"e_1_3_2_1_20_1","volume-title":"Optimizing latency and throughput of application workflows on clusters. Research Report OSU-CISRC-4\/08-TR17","author":"Vydyanathan N.","year":"2008","unstructured":"N. Vydyanathan , U. Catalyurek , T. Kurc , P. Saddayappan , and J. Saltz . Optimizing latency and throughput of application workflows on clusters. Research Report OSU-CISRC-4\/08-TR17 , Ohio State University , Columbus, OH , Apr. 2008 . N. Vydyanathan, U. Catalyurek, T. Kurc, P. Saddayappan, and J. Saltz. Optimizing latency and throughput of application workflows on clusters. Research Report OSU-CISRC-4\/08-TR17, Ohio State University, Columbus, OH, Apr. 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70777"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2008.40"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000036858.59787.c2"}],"event":{"name":"SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Calgary AB Canada","acronym":"SPAA 09"},"container-title":["Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1583997","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1583991.1583997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:57Z","timestamp":1750249077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1583997"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,11]]},"references-count":19,"alternative-id":["10.1145\/1583991.1583997","10.1145\/1583991"],"URL":"https:\/\/doi.org\/10.1145\/1583991.1583997","relation":{},"subject":[],"published":{"date-parts":[[2009,8,11]]},"assertion":[{"value":"2009-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}