{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:47:52Z","timestamp":1763466472379},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309369"},{"type":"electronic","value":"9783540324270"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602569_48","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T23:57:31Z","timestamp":1161129451000},"page":"465-476","source":"Crossref","is-referenced-by-count":96,"title":["Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors"],"prefix":"10.1007","author":[{"given":"David A.","family":"Bader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamesh","family":"Madduri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","unstructured":"DARPA Information Processing Technology Office: High productivity computing systems project (2004), \n                    \n                      http:\/\/www.darpa.mil\/ipto\/programs\/hpcs\/"},{"key":"48_CR2","unstructured":"Kepner, J., Koester, D.P.: et al.: HPCS Scalable Synthetic Compact Application (SSCA) Benchmarks (2004), \n                    \n                      http:\/\/www.highproductivity.org\/SSCABmks.htm"},{"key":"48_CR3","unstructured":"Kepner, J., Koester, D.P.: et al.: HPCS SSCA#2 Graph Analysis Benchmark Specifications v1.0 (2005)"},{"key":"48_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971811","volume-title":"LINPACK Users\u2019 Guide","author":"J. Dongarra","year":"1979","unstructured":"Dongarra, J., Bunch, J., Moler, C., Stewart, G.: LINPACK Users\u2019 Guide. SIAM, Philadelphia (1979)"},{"key":"48_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-36265-7_7","volume-title":"High Performance Computing - HiPC 2002","author":"D. Bader","year":"2002","unstructured":"Bader, D., Sreshta, S., Weisse-Bernstein, N.: Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs). In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol.\u00a02552, pp. 63\u201375. Springer, Heidelberg (2002)"},{"key":"48_CR6","unstructured":"Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In: Proc. Int\u2019l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)"},{"key":"48_CR7","unstructured":"Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In: Proc. Int\u2019l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)"},{"key":"48_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-48518-X_3","volume-title":"Algorithm Engineering and Experimentation","author":"D.R. Helman","year":"1999","unstructured":"Helman, D.R., J\u00e1J\u00e1, J.: Designing practical efficient algorithms for symmetric multiprocessors. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619, pp. 37\u201356. Springer, Heidelberg (1999)"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jpdc.2000.1678","volume":"61","author":"D.R. Helman","year":"2001","unstructured":"Helman, D.R., J\u00e1J\u00e1, J.: Prefix computations on symmetric multiprocessors. Journal of Parallel and Distributed Computing\u00a061, 265\u2013278 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. Technical report, Georgia Instutite of Technology (2005)","DOI":"10.1007\/11602569_48"},{"key":"48_CR11","unstructured":"Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. In: Proc. Int\u2019l Parallel and Distributed Processing Symp. (IPDPS 2002), Fort Lauderdale, FL (2002)"},{"key":"48_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal\u00a049, 291\u2013307 (1970)","journal-title":"The Bell System Technical Journal"},{"key":"48_CR13","unstructured":"Sangiovanni-Vincentelli, A., Chert, L., Chua, L.: A new tearing approach: Node tearing nodal analysis. In: Proc. IEEE Int\u2019l Symp. on Circ. and Syst., Phoenix, AZ, pp. 143\u2013147 (1975)"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Sangiovanni-Vincentelli, A., Chert, L., Chua, L.: An efficient heuristic cluster algorithm for tearing large-scale networks. IEEE Trans. Circuits and Systems, 709\u2013717 (1977)","DOI":"10.1109\/TCS.1977.1084298"},{"key":"48_CR15","volume-title":"Handbook of Combinatorial Optimization","author":"I. Bomze","year":"1999","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol.\u00a04. Kluwer Academic Publishers, Boston (1999)"},{"key":"48_CR16","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","year":"1996","unstructured":"Johnson, D., Trick, M. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11-13, 1993; DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. American Mathematical Society, Providence (1996)"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proc. Supercomputing 1995, San Diego, CA (1995)","DOI":"10.1145\/224170.224228"},{"key":"48_CR18","unstructured":"Karypis, G., Kumar, V.: MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices. Department of Computer Science, University of Minnesota. Version 4.0 edn. (1998)"},{"key":"48_CR19","unstructured":"Koester, D.P.: Parallel Block-Diagonal-Bordered Sparse Linear Solvers for Power Systems Applications. PhD thesis, Syracuse University, Syracuse, NY (1995)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2013 HiPC 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602569_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:51:12Z","timestamp":1558288272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602569_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309369","9783540324270"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11602569_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}