{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:19Z","timestamp":1750306999909,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"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":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312049","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"236-245","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Cache-conscious scheduling of streaming applications"],"prefix":"10.1145","author":[{"given":"Kunal","family":"Agrawal","sequence":"first","affiliation":[{"name":"Washington University in Saint Louis, Saint Louis, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington D.C, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordan","family":"Krage","sequence":"additional","affiliation":[{"name":"Washington University in Saint Louis, Saint Louis, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles E.","family":"Leiserson","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9453-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00162341"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ESTMED.2010.5666980"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796541"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961296.1950406"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"e_1_3_2_1_8_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman & Co. , New York, NY, USA , 1979 . Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979."},{"key":"e_1_3_2_1_9_1","unstructured":"GNU Radio 2001. Software gnuradio.org.  GNU Radio 2001. Software gnuradio.org."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224228"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/780731.780747"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_16_1","unstructured":"LabVIEW 2011. Software www.ni.com\/labview.  LabVIEW 2011. Software www.ni.com\/labview."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009446"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810526"},{"volume-title":"Simulink User's Guide","year":"2011","key":"e_1_3_2_1_20_1","unstructured":"Mathworks. Simulink User's Guide , 2011 . Release 2011b. Mathworks. Simulink User's Guide, 2011. Release 2011b."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403448"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the ACM SIGCOMM Conference on Networked Systems Design and Implementaion (NSDI 2009)","author":"Newton Ryan","year":"2009","unstructured":"Ryan Newton , Sivan Toledo , Lewis Girod , Hari Balakrishnan , and Samuel Madden . Wishbone : Profile-based partitioning for sensornet applications . In Proceedings of the ACM SIGCOMM Conference on Networked Systems Design and Implementaion (NSDI 2009) , April 2009 . Ryan Newton, Sivan Toledo, Lewis Girod, Hari Balakrishnan, and Samuel Madden. Wishbone: Profile-based partitioning for sensornet applications. In Proceedings of the ACM SIGCOMM Conference on Networked Systems Design and Implementaion (NSDI 2009), April 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810481"},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BFb0030842","volume-title":"Ding-Zhu Du and Ming Li","author":"Savage J. E.","year":"1995","unstructured":"J. E. Savage . Extending the Hong-Kung model to memory hierarchies . In Ding-Zhu Du and Ming Li , editors, Computing and Combinatorics, volume 959 of Lecture Notes in Computer Science , pages 270 -- 281 . Springer Verlag , 1995 . J. E. Savage. Extending the Hong-Kung model to memory hierarchies. In Ding-Zhu Du and Ming Li, editors, Computing and Combinatorics, volume 959 of Lecture Notes in Computer Science, pages 270--281. Springer Verlag, 1995."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070891.1065927"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.19"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/647478.727935"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278647"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733243"}],"event":{"name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pittsburgh Pennsylvania USA","acronym":"SPAA '12"},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:48Z","timestamp":1750236528000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":27,"alternative-id":["10.1145\/2312005.2312049","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312049","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}