{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T19:40:01Z","timestamp":1737574801670,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665311"},{"type":"electronic","value":"9783540481690"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48169-9_21","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T05:36:33Z","timestamp":1194240993000},"page":"297-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Scheduling Algorithm for General Strict Multithreaded Computations"],"prefix":"10.1007","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"N. S. Arora, R. D. Blumofe and C. G. Plaxton, \u201cThread Scheduling for Multiprogrammed Multiprocessors,\u201d Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, June\u2013July 1998.","key":"21_CR1","DOI":"10.1145\/277651.277678"},{"doi-asserted-by":"crossref","unstructured":"G. E. Blelloch, P.B. Gibbons and Y. Matias, \u201cProvably efficient scheduling for languages with fine-grained parallelism,\u201d Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, California, pp.1\u201312, July 1995.","key":"21_CR2","DOI":"10.1145\/215399.215403"},{"doi-asserted-by":"crossref","unstructured":"G. E. Blelloch, P. B. Gibbons, Y. Matias and G. J. Narlikar, \u201cSpace-efficient scheduling of parallelism with synchronization variables,\u201d Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island, pp. 12\u201323, June 1997.","key":"21_CR3","DOI":"10.1145\/258492.258494"},{"unstructured":"R. D. Blumofe, \u201cExecuting Multithreaded Programs Efficiently,\u201d Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, September 1995.","key":"21_CR4"},{"doi-asserted-by":"crossref","unstructured":"R. D. Blumofe and C. E. Leiserson, \u201cScheduling Multithreaded Computations by Work Stealing,\u201d Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 356\u2013368, 1994.","key":"21_CR5","DOI":"10.1109\/SFCS.1994.365680"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/S0097539793259471","volume":"27","author":"R. D. Blumofe","year":"1998","unstructured":"R. D. Blumofe and C. E. Leiserson, \u201cSpace-Efficient Scheduling of Multithreaded Computation,\u201d SIAM Journal on Computing, Vol. 27,No. 1, pp. 202\u2013229, February 1998.","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"R. D. Blumofe and D. S. Park, \u201cScheduling large-scale parallel computations on networks of workstations,\u201d Proceedings of the 3rd International Symposium on High Performance Distributed Computing, pp. 96\u2013105, San Francisco, California, August 1994.","key":"21_CR7","DOI":"10.1109\/HPDC.1994.340255"},{"doi-asserted-by":"crossref","unstructured":"F. W. Burton, \u201cGuaranteeing good memory bounds for parallel programs,\u201d IEEE Transactions on Software Engineering, Vol. 22,No. 10, October 1996.","key":"21_CR8","DOI":"10.1109\/32.544353"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/12.2169","volume":"37","author":"F. W. Burton","year":"1988","unstructured":"F. W. Burton, \u201cStorage management in virtual tree machines,\u201d IEEE Transactions on Computers, Vol. 37,No. 3, pp. 321\u2013328, March 1988.","journal-title":"IEEE Transactions on Computers"},{"doi-asserted-by":"crossref","unstructured":"F. W. Burton and M. R. Sleep, \u201cExecuting functional programs on a virtual tree of processors,\u201d Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pp. 187\u2013194, Portsmouth, New Hampshire, October 1981.","key":"21_CR10","DOI":"10.1145\/800223.806778"},{"doi-asserted-by":"crossref","unstructured":"T. Decker, \u201cVirtual Data Space\u2013A Universal Load Balancing Scheme,\u201d Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, pp. 159\u2013166, 1997.","key":"21_CR11","DOI":"10.1007\/3-540-63138-0_15"},{"doi-asserted-by":"crossref","unstructured":"P. Fatourou and P. Spirakis, \u201cScheduling Algorithms for Strict Multithreaded Computations,\u201d Proceedings of the 10th Internbational Sumposium on Algorithms and Computation, pp. 407\u2013416, Osaka, Japan, 1996.","key":"21_CR12","DOI":"10.1007\/BFb0009517"},{"doi-asserted-by":"crossref","unstructured":"P. Fatourou and P. Spirakis, \u201cA New Scheduling Algorithms for General Strict Multithreaded Computations,\u201d http:\/\/students.ceid.upatras.gr\/~faturu\/public.htm , 1999.","key":"21_CR13","DOI":"10.1007\/3-540-48169-9_21"},{"unstructured":"W. Feller, An Introduction to Probability Theory and its Application, Second Edition, Vol. 1, John Wiley & Sons, Inc., 1957.","key":"21_CR14"},{"issue":"4","key":"21_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/4472.4478","volume":"7","author":"R. H. Halstead","year":"1985","unstructured":"R. H. Halstead, \u201cMultilisp: A language for concurrent symbolic computation,\u201d ACM Transactions on Programming Languages and Systems, Vol. 7,No. 4, pp. 501\u2013538, October 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/174130.174145","volume":"40","author":"R. M. Karp","year":"1993","unstructured":"R. M. Karp and Y. Zhang, \u201cRandomized parallel algorithms for backtrack search and branch-and-bound computation,\u201d Journal of the ACM, Vol. 40,No. 3, pp. 765\u2013789, July 1993.","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"P. Liu, W. Aielo and S. Bhatt, \u201cAn atomic model for message passing,\u201d Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA\u2019 93), pp. 154\u2013163, Velen, Germany, June 1993.","key":"21_CR17","DOI":"10.1145\/165231.165251"},{"doi-asserted-by":"crossref","unstructured":"L. Rudolph, M. Slivkin-Allalouf and E. Upfal, \u201cA simple load balancing scheme for task allocation in parallel machines,\u201d Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 237\u2013245, Hilton Head, California, July 1991.","key":"21_CR18","DOI":"10.1145\/113379.113401"},{"unstructured":"I. C. Wu and H. T. Kung, \u201cCommunication complexity for parallel divide-andconquer,\u201d Proc. of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS\u2019 91), pp. 151\u2013162, San Juan, Puerto Rico, October 1991.","key":"21_CR19"},{"key":"21_CR20","volume-title":"Parallel Algorithms for Combinatorial Search Problems","author":"Y. Zhang","year":"1989","unstructured":"Y. Zhang, Parallel Algorithms for Combinatorial Search Problems, PhD Thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Technical Report UCB\/CSD 89\/543, November 1989."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48169-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T03:00:13Z","timestamp":1737514813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48169-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665311","9783540481690"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48169-9_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 June 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}