{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:26Z","timestamp":1750308986704,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T00:00:00Z","timestamp":1182729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,25]]},"DOI":"10.1145\/1272457.1272462","type":"proceedings-article","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T19:21:05Z","timestamp":1190748065000},"page":"31-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Parallel XML processing by work stealing"],"prefix":"10.1145","author":[{"given":"Wei","family":"Lu","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Gannon","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277678"},{"key":"e_1_3_2_1_2_1","volume-title":"Hoard: A scalable memory allocator for multithreaded applications. Technical report","author":"Berger E.","year":"2000","unstructured":"E. Berger , K. McKinley , R. Blumofe , and P. Wilson . Hoard: A scalable memory allocator for multithreaded applications. Technical report , University of Texas at Austin , Austin, TX, USA , 2000 . E. Berger, K. McKinley, R. Blumofe, and P. Wilson. Hoard: A scalable memory allocator for multithreaded applications. Technical report, University of Texas at Austin, Austin, TX, USA, 2000."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209958"},{"key":"e_1_3_2_1_4_1","first-page":"246","volume-title":"HPDC '02: Proceedings of the 11 th IEEE International Symposium on High Performance Distributed Computing HPDC--11 20002 (HPDC'02)","author":"Chiu K.","unstructured":"K. Chiu , M. Govindaraju , and R. Bramley . Investigating the limits of soap performance for scientific computing . In HPDC '02: Proceedings of the 11 th IEEE International Symposium on High Performance Distributed Computing HPDC--11 20002 (HPDC'02) , page 246 . IEEE Computer Society, 2002. K. Chiu, M. Govindaraju, and R. Bramley. Investigating the limits of soap performance for scientific computing. In HPDC '02: Proceedings of the 11 th IEEE International Symposium on High Performance Distributed Computing HPDC--11 20002 (HPDC'02), page 246. IEEE Computer Society, 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"The First International Workshop on High Performance XML Processing","author":"Chiu K.","year":"2004","unstructured":"K. Chiu and W. Lu . A compiler-based approach to schema-specific xml parsing . In The First International Workshop on High Performance XML Processing , 2004 . K. Chiu and W. Lu. A compiler-based approach to schema-specific xml parsing. In The First International Workshop on High Performance XML Processing, 2004."},{"key":"e_1_3_2_1_6_1","volume-title":"Usenix Java Virtual Machine Research and Technology Symposium (JVM '01)","author":"Flood C.","year":"2001","unstructured":"C. Flood , D. Detlefs , N. Shavit , and C. Zhang . Parallel garbage collection for shared memory multiprocessors . In Usenix Java Virtual Machine Research and Technology Symposium (JVM '01) , Monterey, CA , 2001 . C. Flood, D. Detlefs, N. Shavit, and C. Zhang. Parallel garbage collection for shared memory multiprocessors. In Usenix Java Virtual Machine Research and Technology Symposium (JVM '01), Monterey, CA, 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/99163.99170"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.755612"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1070"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016566031114"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2005.1520966"},{"key":"e_1_3_2_1_12_1","series-title":"DIMACS Series in Discrete Mathem","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1090\/dimacs\/022\/13","volume-title":"Parallel Processing of Discrete Optimization Problems","author":"Reinefeld A.","year":"1995","unstructured":"A. Reinefeld . Scalability of massively parallel depth-first search . In Parallel Processing of Discrete Optimization Problems , volume 22 of DIMACS Series in Discrete Mathem . and Theor. Comp , pages 305 -- 322 , 1995 . A. Reinefeld. Scalability of massively parallel depth-first search. In Parallel Processing of Discrete Optimization Problems, volume 22 of DIMACS Series in Discrete Mathem. and Theor. Comp, pages 305--322, 1995."},{"key":"e_1_3_2_1_13_1","volume-title":"CLR via C#. Microsoft","author":"Richter J.","year":"2006","unstructured":"J. Richter . CLR via C#. Microsoft , 2006 . J. Richter. CLR via C#. Microsoft, 2006."},{"key":"e_1_3_2_1_14_1","unstructured":"J.L. Sussman E.E. Abola N.O. Manning and J. Prilusky. The protein data bank: Current status and future challenges.  J.L. Sussman E.E. Abola N.O. Manning and J. Prilusky. The protein data bank: Current status and future challenges."},{"key":"e_1_3_2_1_15_1","first-page":"30","author":"Sutter H.","year":"2005","unstructured":"H. Sutter . The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's Journal , 30 , 2005 . H. Sutter. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's Journal, 30, 2005.","journal-title":"Dr. Dobb's Journal"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the International Symposium on Web Services(ISWS)","author":"van Engelen R.","year":"2004","unstructured":"R. van Engelen . Constructing finite state automata for high performance xml web services . In Proceedings of the International Symposium on Web Services(ISWS) , 2004 . R. van Engelen. Constructing finite state automata for high performance xml web services. In Proceedings of the International Symposium on Web Services(ISWS), 2004."},{"volume-title":"W3C. Document object model (dom) level 1 specification","year":"2000","key":"e_1_3_2_1_17_1","unstructured":"W3C. Document object model (dom) level 1 specification ( second edition). http:\/\/www.w3.org\/TR\/ 2000 \/WD-DOM-Level-1-20000929\/, 2000. W3C. Document object model (dom) level 1 specification (second edition). http:\/\/www.w3.org\/TR\/2000\/WD-DOM-Level-1-20000929\/, 2000."},{"volume-title":"W3C. Xml information set","year":"2003","key":"e_1_3_2_1_18_1","unstructured":"W3C. Xml information set ( second edition). http:\/\/www.w3.org\/TR\/xml-infoset\/, 2003 . W3C. Xml information set (second edition). http:\/\/www.w3.org\/TR\/xml-infoset\/, 2003."},{"key":"e_1_3_2_1_19_1","volume-title":"The 18th International Conference of Data Engineering","author":"Diao Y.","year":"2002","unstructured":"Y. Diao , P. Fischer , and M.J. Franklin . Yfilter: Efficient and scalable of xml document . In The 18th International Conference of Data Engineering , San Jose , 2002 . Y. Diao, P. Fischer, and M.J. Franklin. Yfilter: Efficient and scalable of xml document. In The 18th International Conference of Data Engineering, San Jose, 2002."}],"event":{"name":"HPDC07: International Symposium on High Performance Distributed Computing","sponsor":["ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Monterey California USA","acronym":"HPDC07"},"container-title":["Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, issues, and approaches"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1272457.1272462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1272457.1272462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:11Z","timestamp":1750282871000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1272457.1272462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,25]]},"references-count":19,"alternative-id":["10.1145\/1272457.1272462","10.1145\/1272457"],"URL":"https:\/\/doi.org\/10.1145\/1272457.1272462","relation":{},"subject":[],"published":{"date-parts":[[2007,6,25]]},"assertion":[{"value":"2007-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}