{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T17:55:19Z","timestamp":1794592519663,"version":"4.9.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA","license":[{"start":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T00:00:00Z","timestamp":1540339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100007297","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-4-1-0525,N00014-17-1-2996"],"award-info":[{"award-number":["N00014-4-1-0525,N00014-17-1-2996"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2018,10,24]]},"abstract":"<jats:p>\n            We describe a compiler strategy we call \u201c\n            <jats:italic>Software Multiplexing<\/jats:italic>\n            \u201d that achieves many benefits of both statically linked and dynamically linked libraries, and adds some additional advantages. Specifically, it achieves the code size benefits of dynamically linked libraries while eliminating the major disadvantages: unexpected failures due to missing dependences, slow startup times, reduced execution performance due to indirect references to globals, and the potential for security vulnerabilities. We design Software Multiplexing so that it works even in the common case where application build systems support only dynamic and not static linking; we have automatically built thousands of Linux software packages in this way. Software Multiplexing combines two ideas:\n            <jats:italic>Automatic Multicall<\/jats:italic>\n            , i.e., where multiple independent programs are automatically merged into a single executable, and\n            <jats:italic>Static Linking of Shared Libraries<\/jats:italic>\n            , which works by linking an IR-level version of application code and all its libraries, even if the libraries are normally compiled as shared,\n            <jats:italic>before<\/jats:italic>\n            native code generation. The benefits are achieved primarily through deduplication of libraries across the multiplexed programs, while using static linking, and secondly through more effective unused code elimination for statically linked shared libraries. Compared with equivalent dynamically linked programs, &lt;span&gt;allmux-optimized programs start more quickly and even have slightly lower memory usage and total disk size. Compared with equivalent statically linked programs, &lt;span&gt;allmux-optimized programs are\n            <jats:italic>much<\/jats:italic>\n            smaller in both aggregate size and memory usage, and have similar startup times and execution performance. We have implemented Software Multiplexing in a tool called &lt;span&gt;allmux, part of the open-source ALLVM project. Example results show that when the LLVM Compiler Infrastructure is optimized using allmux, the resulting binaries and libraries are 18.3% smaller\n            <jats:italic>and<\/jats:italic>\n            30% faster than the default production version. For 74 other packages containing 2\u2013166 programs each, multiplexing each package into one static binary reduces the aggregate package size by 39% (geometric mean) compared with dynamic linking.\n          <\/jats:p>","DOI":"10.1145\/3276524","type":"journal-article","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T11:57:18Z","timestamp":1540382238000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Software multiplexing: share your libraries and statically link them too"],"prefix":"10.1145","volume":"2","author":[{"given":"Will","family":"Dietz","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vikram","family":"Adve","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Vikram Adve Will Dietz etal 2016. ALLVM Project. http:\/\/allvm.org  Vikram Adve Will Dietz et al. 2016. ALLVM Project. http:\/\/allvm.org"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694392"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1749608.1749612"},{"key":"e_1_2_2_4_1","unstructured":"Christian S Collberg John H Hartman Sridivya Babu and Sharath K Udupa. 2004. Slinky - Static Linking Reloaded. Retrieved 2018 from http:\/\/slinky.cs.arizona.edu\/  Christian S Collberg John H Hartman Sridivya Babu and Sharath K Udupa. 2004. Slinky - Static Linking Reloaded. Retrieved 2018 from http:\/\/slinky.cs.arizona.edu\/"},{"key":"e_1_2_2_5_1","volume-title":"USENIX Annual Technical Conference, General Track. 309\u2013322","author":"Collberg Christian S","year":"2005","unstructured":"Christian S Collberg , John H Hartman , Sridivya Babu , and Sharath K Udupa . 2005 . SLINKY: Static Linking Reloaded .. In USENIX Annual Technical Conference, General Track. 309\u2013322 . Christian S Collberg, John H Hartman, Sridivya Babu, and Sharath K Udupa. 2005. SLINKY: Static Linking Reloaded.. In USENIX Annual Technical Conference, General Track. 309\u2013322."},{"key":"e_1_2_2_6_1","unstructured":"CryoPID 2006. CryoPID. http:\/\/freecode.com\/projects\/cryopid\/ . Original homepage is no longer available.  CryoPID 2006. CryoPID. http:\/\/freecode.com\/projects\/cryopid\/ . Original homepage is no longer available."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/859670.859696"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086642.1086645"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/780732.780766"},{"key":"e_1_2_2_10_1","volume-title":"Slipstream: Automatic Interprocess Communication Optimization. In 2015 USENIX Annual Technical Conference (USENIX ATC 15)","author":"Dietz Will","year":"2015","unstructured":"Will Dietz , Joshua Cranmer , Nathan Dautenhahn , and Vikram Adve . 2015 . Slipstream: Automatic Interprocess Communication Optimization. In 2015 USENIX Annual Technical Conference (USENIX ATC 15) . USENIX Association, Santa Clara, CA, 431\u2013443. https:\/\/www.usenix.org\/conference\/atc15\/technical-session\/presentation\/dietz Will Dietz, Joshua Cranmer, Nathan Dautenhahn, and Vikram Adve. 2015. Slipstream: Automatic Interprocess Communication Optimization. In 2015 USENIX Annual Technical Conference (USENIX ATC 15). USENIX Association, Santa Clara, CA, 431\u2013443. https:\/\/www.usenix.org\/conference\/atc15\/technical-session\/presentation\/dietz"},{"key":"e_1_2_2_11_1","volume-title":"How To Write Shared Libraries. Retrieved","author":"Drepper Ulrich","year":"2017","unstructured":"Ulrich Drepper . 2011. How To Write Shared Libraries. Retrieved July 2017 from http:\/\/people.redhat.com\/drepper\/dsohowto. pdf Ulrich Drepper. 2011. How To Write Shared Libraries. Retrieved July 2017 from http:\/\/people.redhat.com\/drepper\/dsohowto. pdf"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597809.2597811"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2584066"},{"key":"e_1_2_2_14_1","volume-title":"Proceedings of the USENIX 1995 Technical Conference Proceedings (TCON\u201995)","author":"Ho W. Wilson","unstructured":"W. Wilson Ho , Wei-Chau Chang , and Lilian H. Leung . 1995. Optimizing the Performance of Dynamically-linked Programs . In Proceedings of the USENIX 1995 Technical Conference Proceedings (TCON\u201995) . USENIX Association, Berkeley, CA, USA, 19\u201319. http:\/\/dl.acm.org\/citation.cfm?id=1267411.1267430 W. Wilson Ho, Wei-Chau Chang, and Lilian H. Leung. 1995. Optimizing the Performance of Dynamically-linked Programs. In Proceedings of the USENIX 1995 Technical Conference Proceedings (TCON\u201995). USENIX Association, Berkeley, CA, USA, 19\u201319. http:\/\/dl.acm.org\/citation.cfm?id=1267411.1267430"},{"key":"e_1_2_2_15_1","unstructured":"Blanchette Jasmin. 2008. C++ GUI Programming with Qt4 2\/e. Pearson Education India.   Blanchette Jasmin. 2008. C++ GUI Programming with Qt4 2\/e. Pearson Education India."},{"key":"e_1_2_2_16_1","volume-title":"Technical Report. Technical report, Red Hat","author":"Jelinek Jakub","year":"2004","unstructured":"Jakub Jelinek . 2003. Prelink. Technical Report. Technical report, Red Hat , Inc ., 2004 . available at http:\/\/people. redhat. com\/jakub\/prelink. pdf. Jakub Jelinek. 2003. Prelink. Technical Report. Technical report, Red Hat, Inc., 2004. available at http:\/\/people. redhat. com\/jakub\/prelink. pdf."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1289927.1289961"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of the Linux Symposium. 19\u201328","author":"KSM","year":"2009","unstructured":"KSM 2009 . Increasing memory density by using KSM . In Proceedings of the Linux Symposium. 19\u201328 . KSM 2009. Increasing memory density by using KSM. In Proceedings of the Linux Symposium. 19\u201328."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_2_2_21_1","volume-title":"Linkers and Loaders","author":"Levine John R.","unstructured":"John R. Levine . 1999. Linkers and Loaders ( 1 st ed.). Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. John R. Levine. 1999. Linkers and Loaders (1st ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.","edition":"1"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2931037.2931047"},{"key":"e_1_2_2_23_1","unstructured":"MITRE Corporation. 2017. CVE-2017-7494. https:\/\/cve.mitre.org\/cgi-bin\/cvename.cgi?name=CVE-2017-7494  MITRE Corporation. 2017. CVE-2017-7494. https:\/\/cve.mitre.org\/cgi-bin\/cvename.cgi?name=CVE-2017-7494"},{"key":"e_1_2_2_24_1","volume-title":"Distroless Docker: Containerizing Apps, Not VMs.","author":"Moore Matthew","year":"2017","unstructured":"Matthew Moore . 2017 . Distroless Docker: Containerizing Apps, Not VMs. (2017). https:\/\/swampup2017.sched.com\/event\/ A6CW\/distroless-docker-containerizing-apps-not-vms SwampUP. Matthew Moore. 2017. Distroless Docker: Containerizing Apps, Not VMs. (2017). https:\/\/swampup2017.sched.com\/event\/ A6CW\/distroless-docker-containerizing-apps-not-vms SwampUP."},{"key":"e_1_2_2_25_1","first-page":"1361453","volume-title":"Proceedings of the USENIX","volume":"1","author":"Michael","year":"1993","unstructured":"Michael N. Nelson and Graham Hamilton. 1993. High Performance Dynamic Linking Through Caching . In Proceedings of the USENIX Summer 1993 Technical Conference - Volume 1 (Usenix-stc\u201993). USENIX Association, Berkeley, CA, USA, Article 17, 14 pages. http:\/\/dl.acm.org\/citation.cfm?id= 1361453 .1361470 Michael N. Nelson and Graham Hamilton. 1993. High Performance Dynamic Linking Through Caching. In Proceedings of the USENIX Summer 1993 Technical Conference - Volume 1 (Usenix-stc\u201993). USENIX Association, Berkeley, CA, USA, Article 17, 14 pages. http:\/\/dl.acm.org\/citation.cfm?id=1361453.1361470"},{"key":"e_1_2_2_26_1","volume-title":"Fast and Flexible Shared Libraries. In Proceedings of the","author":"Orr Douglas B.","year":"1993","unstructured":"Douglas B. Orr , Jay Lepreau , J. Bonn , and R. Mecklenburg . 1993 . Fast and Flexible Shared Libraries. In Proceedings of the Summer 1993 USENIX Conference, Cincinnati, OH, USA , June 21-25, 1993. 237\u2013252. Douglas B. Orr, Jay Lepreau, J. Bonn, and R. Mecklenburg. 1993. Fast and Flexible Shared Libraries. In Proceedings of the Summer 1993 USENIX Conference, Cincinnati, OH, USA, June 21-25, 1993. 237\u2013252."},{"key":"e_1_2_2_27_1","unstructured":"PSS 2016. Proportional set size. Retrieved 2018 from https:\/\/en.wikipedia.org\/wiki\/Proportional_set_size  PSS 2016. Proportional set size. Retrieved 2018 from https:\/\/en.wikipedia.org\/wiki\/Proportional_set_size"},{"key":"e_1_2_2_28_1","unstructured":"Valery Reznic. 2016. ELF STATIFIER MAIN PAGE. Retrieved 2018 from http:\/\/statifier.sourceforge.net\/  Valery Reznic. 2016. ELF STATIFIER MAIN PAGE. Retrieved 2018 from http:\/\/statifier.sourceforge.net\/"},{"key":"e_1_2_2_29_1","volume-title":"Ermine: Linux Portable Application Creator","author":"Reznic Valery","year":"2018","unstructured":"Valery Reznic . 2018 . Ermine: Linux Portable Application Creator . http:\/\/www.magicermine.com\/ . Valery Reznic. 2018. Ermine: Linux Portable Application Creator. http:\/\/www.magicermine.com\/ ."},{"key":"e_1_2_2_30_1","volume-title":"Re: Statically linking against a shared library. https:\/\/sourceware.org\/ml\/binutils\/2005-03\/msg00350. html Binutils mailing list.","author":"Schwab Andreas","year":"2005","unstructured":"Andreas Schwab . 2005 . Re: Statically linking against a shared library. https:\/\/sourceware.org\/ml\/binutils\/2005-03\/msg00350. html Binutils mailing list. Andreas Schwab. 2005. Re: Statically linking against a shared library. https:\/\/sourceware.org\/ml\/binutils\/2005-03\/msg00350. html Binutils mailing list."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/844128.844146"},{"key":"e_1_2_2_32_1","unstructured":"Hyungjo Yoon Changwoo Min and Young Ik Eom. 2014. Dynamic-prelink: An Enhanced Prelinking Mechanism without Modifying Shared Libraries. In Proceedings of the International Conference on Embedded Systems and Applications (ESA). The Steering Committee of The World Congress in Computer Science Computer Engineering and Applied Computing (WorldComp) 1.  Hyungjo Yoon Changwoo Min and Young Ik Eom. 2014. Dynamic-prelink: An Enhanced Prelinking Mechanism without Modifying Shared Libraries. In Proceedings of the International Conference on Embedded Systems and Applications (ESA). The Steering Committee of The World Congress in Computer Science Computer Engineering and Applied Computing (WorldComp) 1."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3276524","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3276524","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3276524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:39Z","timestamp":1750273419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3276524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,24]]},"references-count":31,"journal-issue":{"issue":"OOPSLA","published-print":{"date-parts":[[2018,10,24]]}},"alternative-id":["10.1145\/3276524"],"URL":"https:\/\/doi.org\/10.1145\/3276524","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,24]]},"assertion":[{"value":"2018-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}