{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:24Z","timestamp":1750307244211,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T00:00:00Z","timestamp":1329350400000},"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":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2012,2,16]]},"abstract":"<jats:p>\n            We consider MapReduce clusters designed to support multiple concurrent jobs, concentrating on environments in which the number of distinct datasets is modest relative to the number of jobs. Many datasets in such scenarios wind up being scanned by multiple concurrent Map phase jobs. As has been noticed previously, this scenario provides an opportunity for Map phase jobs to\n            <jats:italic>cooperate<\/jats:italic>\n            , sharing the scans of these datasets, and thus reducing the costs of such scans. Our paper has two main contributions. First, we present a novel and highly general method for sharing scans and thus amortizing their costs. This concept, which we call\n            <jats:italic>cyclic piggybacking<\/jats:italic>\n            , has a number of advantages over the more traditional\n            <jats:italic>batching<\/jats:italic>\n            scheme described in the literature. Second, we describe a significant but natural generalization of the recently introduced flex scheduler, for optimizing schedules within the context of this cyclic piggybacking paradigm. The overall approach, including both cyclic piggybacking and the flex generalization, is called circumflex. We demonstrate the excellent performance of circumflex via a variety of simulation experiments.\n          <\/jats:p>","DOI":"10.1145\/2146382.2146388","type":"journal-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T18:42:36Z","timestamp":1329936156000},"page":"26-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["CIRCUMFLEX"],"prefix":"10.1145","volume":"46","author":[{"given":"Joel","family":"Wolf","sequence":"first","affiliation":[{"name":"IBM T.J. Watson Research, Hawthorne, NY"}]},{"given":"Andrey","family":"Balmin","sequence":"additional","affiliation":[{"name":"IBM Almaden Research, San Jose, CA"}]},{"given":"Deepak","family":"Rajan","sequence":"additional","affiliation":[{"name":"Lawrence Livermore Labs, Livermore, CA"}]},{"given":"Kirsten","family":"Hildrum","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research, Hawthorne, NY"}]},{"given":"Rohit","family":"Khandekar","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research, Hawthorne, NY"}]},{"given":"Sujay","family":"Parekh","sequence":"additional","affiliation":[{"name":"Bank of America, New York, NY"}]},{"given":"Kun-Lung","family":"Wu","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research, Hawthorne, NY"}]},{"given":"Rares","family":"Vernica","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Laboratories, Palo Alto, CA"}]}],"member":"320","published-online":{"date-parts":[[2012,2,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453960"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_3_1","unstructured":"Hadoop. http:\/\/hadoop.apache.org.  Hadoop. http:\/\/hadoop.apache.org."},{"key":"e_1_2_1_4_1","volume-title":"The Art of Computer Programming","author":"Knuth D.","year":"1998","unstructured":"D. Knuth . The Art of Computer Programming . Addison-Wesley , 1998 . D. Knuth. The Art of Computer Programming. Addison-Wesley, 1998."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920906"},{"key":"e_1_2_1_6_1","volume-title":"Scheduling: Theory, Algorithms and Systems","author":"Pinedo M.","year":"1995","unstructured":"M. Pinedo . Scheduling: Theory, Algorithms and Systems . Prentice Hall , 1995 . M. Pinedo. Scheduling: Theory, Algorithms and Systems. Prentice Hall, 1995."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2023718.2023720"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.956097"},{"key":"e_1_2_1_10_1","unstructured":"M. Zaharia. Hadoop fair scheduler design document http:\/\/svn.apache.org\/repos\/asf\/hadoop\/mapreduce\/trunk\/src\/contrib\/fairscheduler\/designdoc\/fairschedulerdesigndoc.pdf.  M. Zaharia. Hadoop fair scheduler design document http:\/\/svn.apache.org\/repos\/asf\/hadoop\/mapreduce\/trunk\/src\/contrib\/fairscheduler\/designdoc\/fairschedulerdesigndoc.pdf."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755940"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of VLDB","author":"Zukowski M.","year":"2007","unstructured":"M. Zukowski , S. H\u00e9man , N. Nes , and P. Boncz . Cooperative scans: dynamic bandwidth sharing in a dbms . In Proceedings of VLDB , 2007 . M. Zukowski, S. H\u00e9man, N. Nes, and P. Boncz. Cooperative scans: dynamic bandwidth sharing in a dbms. In Proceedings of VLDB, 2007."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2146382.2146388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2146382.2146388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:02Z","timestamp":1750243922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2146382.2146388"}},"subtitle":["a scheduling optimizer for MapReduce workloads with shared scans"],"short-title":[],"issued":{"date-parts":[[2012,2,16]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2,16]]}},"alternative-id":["10.1145\/2146382.2146388"],"URL":"https:\/\/doi.org\/10.1145\/2146382.2146388","relation":{},"ISSN":["0163-5980"],"issn-type":[{"type":"print","value":"0163-5980"}],"subject":[],"published":{"date-parts":[[2012,2,16]]},"assertion":[{"value":"2012-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}