{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:52:02Z","timestamp":1725558722342},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540203599"},{"type":"electronic","value":"9783540397076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39707-6_12","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T19:34:42Z","timestamp":1277840082000},"page":"160-173","source":"Crossref","is-referenced-by-count":1,"title":["Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing"],"prefix":"10.1007","author":[{"given":"Lars","family":"Lundberg","sequence":"first","affiliation":[]},{"given":"Magnus","family":"Broberg","sequence":"additional","affiliation":[]},{"given":"Kamilla","family":"Klonowska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Heidelberg (1996) ISBN 3-540-61496-6"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Broberg, M., Lundberg, L., Grahn, H.: Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads. In: Proc. of the 13th International Parallel Processing Symposium, pp. 407-413 (1999)","DOI":"10.1109\/IPPS.1999.760508"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Broberg, M., Lundberg, L., Grahn, H.: VPPB - A Visualization and Performance Prediction Tool for Multithreaded Solaris Programs. In: Proceedings of the 12th International Parallel Processing Symposium, pp. 770-776 (1998)","DOI":"10.1109\/IPPS.1998.670014"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bokhari, S.H.: Partitioning Problems in Parallel, Pipelined, and Distributed Computing. IEEE Transactions on Computers\u00a037(1) (1988)","DOI":"10.1109\/12.75137"},{"key":"12_CR5","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W. H. Freeman and Company, New York (1979)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Hagersten, E., Koster, M.: WildFire: A Scalable Path for SMPs. In: Proc. of the Fifth International Symposium on High Performance Computer Architecture, pp. 172-181 (1999)","DOI":"10.1109\/HPCA.1999.744361"},{"key":"12_CR7","volume-title":"Programming with threads","author":"S. Kleiman","year":"1996","unstructured":"Kleiman, S., Shah, D., Smaalders, B.: Programming with threads. Prentice Hall, Englewood Cliffs (1996)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Laudon, J., Lenoski, D.: The SGI Origin: A ccNUMA Highly Scalable Server. In: Proc. of the 24th Annual International Symposium on Computer Architecture (ISCA), pp. 241- 251 (1997)","DOI":"10.1145\/264107.264206"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/S0097539792240571","volume":"24","author":"H. Lennerstad","year":"1995","unstructured":"Lennerstad, H., Lundberg, L.: An optimal Execution Time Estimate of Static versus Dynamic Allocation in Multiprocessor Systems. SIAM Journal of Computing\u00a024(4), 751\u2013764 (1995)","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.1137\/S0097539799294398","volume":"29","author":"H. Lennerstad","year":"2000","unstructured":"Lennerstad, H., Lundberg, L.: Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems. SIAM Journal of Computing\u00a029(6), 1816\u20131838 (2000)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1137\/S0097539798349164","volume":"30","author":"H. Lennerstad","year":"2000","unstructured":"Lennerstad, H., Lundberg, L.: Optimal Worst Case Formulas Comparing Cache Memory Associativity. SIAM Journal of Computing\u00a030(3), 872\u2013905 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Lovett, T., Clapp, R.: STiNG: A cc-NUMA Computer System for the Commercial Marketplace. In: Proc. of the 23rd Annual International Symposium on Computer Architecture (ISCA), pp. 308-317 (1996)","DOI":"10.1145\/232973.233006"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/71.667896","volume":"9","author":"L. Lundberg","year":"1998","unstructured":"Lundberg, L., Lennerstad, H.: Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors. IEEE Transactions on Parallel and Distributed Systems\u00a09(4), 346\u2013358 (1998)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Lundberg, L., Lennerstad, H.: An Optimal Upper Bound on the Minimal Completion Time in Distributed Supercomputing. In: Proc. of the 1994 ACM International Conference on Supercomputing, pp. 196-203 (1994)","DOI":"10.1145\/181181.181339"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39707-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:38:57Z","timestamp":1552628337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39707-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540203599","9783540397076"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39707-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}