{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:49Z","timestamp":1763468089661,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["259295"],"award-info":[{"award-number":["259295"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004385","name":"Universiteit Gent","doi-asserted-by":"publisher","award":["01J14407 and 01Z04109"],"award-info":[{"award-number":["01J14407 and 01Z04109"]}],"id":[{"id":"10.13039\/501100004385","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FWO","award":["G.0255.08, and G.0179.10"],"award-info":[{"award-number":["G.0255.08, and G.0179.10"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p>Symbiotic job scheduling improves simultaneous multithreading (SMT) processor performance by coscheduling jobs that have \u201ccompatible\u201d demands on the processor's shared resources. Existing approaches however require a sampling phase, evaluate a limited number of possible coschedules, use heuristics to gauge symbiosis, are rigid in their optimization target, and do not preserve system-level priorities\/shares.<\/jats:p>\n          <jats:p>This article proposes probabilistic job symbiosis modeling, which predicts whether jobs will create positive or negative symbiosis when coscheduled without requiring the coschedule to be evaluated. The model, which uses per-thread cycle stacks computed through a previously proposed cycle accounting architecture, is simple enough to be used in system software. Probabilistic job symbiosis modeling provides six key innovations over prior work in symbiotic job scheduling: (i) it does not require a sampling phase, (ii) it readjusts the job coschedule continuously, (iii) it evaluates a large number of possible coschedules at very low overhead, (iv) it is not driven by heuristics, (v) it can optimize a performance target of interest (e.g., system throughput or job turnaround time), and (vi) it preserves system-level priorities\/shares. These innovations make symbiotic job scheduling both practical and effective.<\/jats:p>\n          <jats:p>Our experimental evaluation, which assumes a realistic scenario in which jobs come and go, reports an average 16% (and up to 35%) reduction in job turnaround time compared to the previously proposed SOS (sample, optimize, symbios) approach for a two-thread SMT processor, and an average 19% (and up to 45%) reduction in job turnaround time for a four-thread SMT processor.<\/jats:p>","DOI":"10.1145\/2207222.2207223","type":"journal-article","created":{"date-parts":[[2012,6,15]],"date-time":"2012-06-15T15:31:37Z","timestamp":1339774297000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic modeling for job symbiosis scheduling on SMT processors"],"prefix":"10.1145","volume":"9","author":[{"given":"Stijn","family":"Eyerman","sequence":"first","affiliation":[{"name":"Ghent University, Belgium"}]},{"given":"Lieven","family":"Eeckhout","sequence":"additional","affiliation":[{"name":"Ghent University, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2012,6,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.8"},{"volume-title":"Proceedings of the USENIX Annual Technical Conference. 103--106","author":"Bulpin J. R.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.108"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2004.17"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.37"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2005.27"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.25"},{"key":"e_1_2_1_8_1","unstructured":"Cota-Robles E. 2003. Priority based simultaneous multi-threading. United States Patent No. 6 658 447 B2.  Cota-Robles E. 2003. Priority based simultaneous multi-threading. United States Patent No. 6 658 447 B2."},{"volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium.","author":"El-Moursy A.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2007.346201"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2008.44"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508260"},{"volume-title":"Proceedings of the Workshop on the Interaction between Operating Systems and Computer Architecture, in conjunction with ISCA.","author":"Fedorova A.","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275937.1275939"},{"volume-title":"Servers: Architecture and Performance Considerations. IBM.","year":"2005","author":"Gibbs B.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/280756.280894"},{"volume-title":"Proceedings of the 23rd IEEE International Real-Time Systems Symposium. 134--145","author":"Jain R.","key":"e_1_2_1_17_1"},{"volume-title":"Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software. 164--171","author":"Luo K.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","unstructured":"Parekh S. Eggers S. Levy H. and Lo J. 2000. Thread-sensitive scheduling for SMT processors. Tech. rep. University of Washington.  Parekh S. Eggers S. Levy H. and Lo J. 2000. Thread-sensitive scheduling for SMT processors. Tech. rep. University of Washington."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.49"},{"volume-title":"Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques. 15--26","author":"Raasch S. E.","key":"e_1_2_1_21_1"},{"volume-title":"Proceedings of the 14th International Symposium on High-Performance Computer Architecture. 149--158","author":"Ramirez T.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025127.1025997"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/605397.605403"},{"volume-title":"Proceedings of theWorkshop on Multi-Threaded Execution, Architecture and Compilers.","author":"Snavely A.","key":"e_1_2_1_25_1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379244"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/511334.511343"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273004"},{"volume-title":"Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. 26--34","author":"Tuck N.","key":"e_1_2_1_29_1"},{"volume-title":"Proceedings of the 22nd Annual Computer Measurement Group Conference.","year":"1996","author":"Tullsen D.","key":"e_1_2_1_30_1"},{"volume-title":"Proceedings of the 34th Annual IEEE\/ACM International Symposium on Microarchitecture. 318--327","author":"Tullsen D. M.","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/232973.232993"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/223982.224449"},{"key":"e_1_2_1_34_1","unstructured":"VMware 2004. HyperThreading Support in VMware ESX Server 2.1. VMware.  VMware 2004. HyperThreading Support in VMware ESX Server 2.1. VMware."}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2207222.2207223","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2207222.2207223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:55Z","timestamp":1750238455000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2207222.2207223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1145\/2207222.2207223"],"URL":"https:\/\/doi.org\/10.1145\/2207222.2207223","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2012,6]]},"assertion":[{"value":"2011-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}