{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T13:59:27Z","timestamp":1773669567324,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725206","type":"print"},{"value":"9783540725213","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72521-3_18","type":"book-chapter","created":{"date-parts":[[2007,6,10]],"date-time":"2007-06-10T16:53:29Z","timestamp":1181494409000},"page":"235-250","source":"Crossref","is-referenced-by-count":70,"title":["UTS: An Unbalanced Tree Search Benchmark"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Olivier","sequence":"first","affiliation":[]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[]},{"given":"Jinze","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Prins","sequence":"additional","affiliation":[]},{"given":"James","family":"Dinan","sequence":"additional","affiliation":[]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[]},{"given":"Chau-Wen","family":"Tseng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T. Harris","year":"1963","unstructured":"Harris, T.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Eastlake, D., Jones, P.: US secure hash algorithm 1 (SHA-1). Internet Engineering Task Force, RFC 3174 (Sept. 2001), Available at http:\/\/www.rfc-editor.org\/rfc\/rfc3174.txt","DOI":"10.17487\/rfc3174"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/1081870.1081893","volume-title":"Proc. 11th ACM SIGKDD Int\u2019l Conf. Know. Disc. Data Mining (KDD \u201905)","author":"J. Leskovec","year":"2005","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proc. 11th ACM SIGKDD Int\u2019l Conf. Know. Disc. Data Mining (KDD \u201905), pp. 177\u2013187. ACM Press, New York (2005)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Blumofe, R., Leiserson, C.: Scheduling multithreaded computations by work stealing. In: Proc. 35th Ann. Symp. Found. Comp. Sci., Nov., pp. 356\u2013368 (1994)","DOI":"10.1109\/SFCS.1994.365680"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1006\/jpdc.1994.1070","volume":"22","author":"V. Kumar","year":"1994","unstructured":"Kumar, V., Grama, A.Y., Vempaty, N.R.: Scalable load balancing techniques for parallel computers. J. Par. Dist. Comp.\u00a022(1), 60\u201379 (1994)","journal-title":"J. Par. Dist. Comp."},{"issue":"6","key":"18_CR6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/BF01389001","volume":"16","author":"V. Kumar","year":"1987","unstructured":"Kumar, V., Rao, V.N.: Parallel depth first search. part II. analysis. Int\u2019l J. Par. Prog.\u00a016(6), 501\u2013519 (1987)","journal-title":"Int\u2019l J. Par. Prog."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"UPC Consortium. UPC language specifications, v1.2. Lawrence Berkeley National Lab, Tech. Rep. LBNL-59208 (2005)","DOI":"10.2172\/862127"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Randall, K.H.: The implementation of the Cilk-5 multithreaded language. In: Proc. 1998 SIGPLAN Conf. Prog. Lang. Design Impl (PLDI \u201998), pp. 212\u2013223 (1998)","DOI":"10.1145\/277650.277725"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Marowka, A.: Analytic comparison of two advanced c language-based parallel programming models. In: Proc. Third Int\u2019l Symp. Par. and Dist. Comp.\/Int\u2019l Workshop Algorithms, Models and Tools for Par. Comp. Hetero. Nets (ISPDC\/HeteroPar\u201904), pp. 284\u2013291 (2004)","DOI":"10.1109\/ISPDC.2004.11"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1122971.1122987","volume-title":"Proc. 11th ACM SIGPLAN Symp. Princ. Pract. Par. Prog. (PPoPP \u201906)","author":"J. Marathe","year":"2006","unstructured":"Marathe, J., Mueller, F.: Hardware profile-guided automatic page placement for ccnuma systems. In: Proc. 11th ACM SIGPLAN Symp. Princ. Pract. Par. Prog (PPoPP \u201906), pp. 90\u201399. ACM Press, New York (2006)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-540-24644-2_13","volume-title":"Languages and Compilers for Parallel Computing","author":"K. Berlin","year":"2004","unstructured":"Berlin, K., et al.: Evaluating the impact of programming language features on the performance of parallel applications on cluster architectures. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol.\u00a02958, pp. 194\u2013208. Springer, Heidelberg (2004)"},{"key":"18_CR12","unstructured":"European Center for Parallelism. PARAVER (2006), Available at http:\/\/www.cepba.upc.edu\/paraver\/"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Chen, W., Iancu, C., Yelick, K.A.: Communication optimizations for fine-grained UPC applications. In: Proc. Int\u2019l Conf. Par. Arch. Compilation Tech. (PACT 2005) pp. 267\u2013278 (2005)","DOI":"10.1109\/PACT.2005.13"},{"key":"18_CR14","unstructured":"Prins, J., et al.: UPC implementation of an unbalanced tree search benchmark. Univ. North Carolina at Chapel Hill, Tech. Rep. TR03-034 (Oct. 2003)"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72521-3_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:57:08Z","timestamp":1737089828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72521-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725206","9783540725213"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72521-3_18","relation":{},"subject":[]}}