{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:18Z","timestamp":1761621138257},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_33","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"378-389","source":"Crossref","is-referenced-by-count":2,"title":["Joint Cache Partition and Job Assignment on Multi-core Processors"],"prefix":"10.1007","author":[{"given":"Avinatan","family":"Hassidim","sequence":"first","affiliation":[]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[]},{"given":"Omry","family":"Tuval","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Lin, J., Lu, Q., Ding, X., Zhang, Z., Zhang, X., Sadayappan, P.: Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems. In: HPCA, pp. 367\u2013378 (2008)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Molnos, A.M., Cotofana, S.D., Heijligers, M.J.M., van Eijndhoven, J.T.J.: Throughput optimization via cache partitioning for embedded multiprocessors. In: ICSAMOS, pp. 185\u2013192 (2006)","DOI":"10.1109\/ICSAMOS.2006.300826"},{"key":"33_CR3","unstructured":"Hassidim, A.: Cache replacement policies for multicore processors. In: ICS, pp. 501\u2013509 (2010)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ortiz, A., Salinger, A.: Paging for multi-core shared caches. In: ITCS, pp. 113\u2013127. ACM (2012)","DOI":"10.1145\/2090236.2090246"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s11241-011-9139-4","volume":"48","author":"T. Liu","year":"2012","unstructured":"Liu, T., Li, M., Xue, C.J.: Instruction cache locking for multi-task real-time embedded systems. Real-Time Systems\u00a048, 166\u2013197 (2012)","journal-title":"Real-Time Systems"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1016\/j.jpdc.2011.05.006","volume":"71","author":"T. Liu","year":"2011","unstructured":"Liu, T., Zhao, Y., Li, M., Xue, C.J.: Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC. J. Parallel Distrib. Comput.\u00a071, 1473\u20131483 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kaplan, H., Tuval, O.: Joint cache partition and job assignment on multi-core processors. CoRR abs\/1210.4053 (2012)","DOI":"10.1007\/978-3-642-40104-6_33"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program.\u00a046, 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput.\u00a017, 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"key":"33_CR10","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold graphs and related topics. Annals of Discrete Mathematics, vol.\u00a056. Elsevier (1995)"},{"key":"33_CR11","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Set-packing problems and threshold graphs. Technical Report CORR 73-21, Dep. of Combinatorics and Optimization, Waterloo, Ontario (1973)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:37:58Z","timestamp":1557931078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}