{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:17:45Z","timestamp":1740097065040,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319052144"},{"type":"electronic","value":"9783319052151"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05215-1_8","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T04:02:18Z","timestamp":1392868938000},"page":"105-119","source":"Crossref","is-referenced-by-count":2,"title":["Profiling Non-numeric OpenSHMEM Applications with the TAU Performance System"],"prefix":"10.1007","author":[{"given":"John","family":"Linford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tyler A.","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameer","family":"Shende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allen D.","family":"Malony","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1016\/j.jpdc.2006.06.001","volume":"66","author":"D.A. Bader","year":"2006","unstructured":"Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. J. Par. Distrib. Comp.\u00a066(11), 1366\u20131378 (2006), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.jpdc.2006.06.001","journal-title":"J. Par. Distrib. Comp."},{"issue":"14","key":"8_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1177\/109434200001400303","volume":"3","author":"S. Browne","year":"2000","unstructured":"Browne, S., Dongarra, J., Garner, N., Ho, G., Mucci, P.: A portable programming interface for performance evaluation on modern processors. International Journal of High Performance Computing Applications\u00a03(14), 189\u2013204 (2000)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"8_CR3","unstructured":"Chapman, B., Curtis, T., Pophale, S., Poole, S., Kuehn, J., Koelbel, C., Smith, L.: Introducing OpenSHMEM: SHMEM for the PGAS community. In: Proceedings of the Fourth Conference on Partitioned Global Address Space Programming Model, PGAS 2010, pp. 2:1\u20132:3. ACM, New York (2010), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/2020373.2020375"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11846802_43","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"M. Geimer","year":"2006","unstructured":"Geimer, M., Wolf, F., Wylie, B.J.N., Mohr, B.: Scalable parallel trace-based performance analysis. In: Mohr, B., Tr\u00e4ff, J.L., Worringen, J., Dongarra, J. (eds.) PVM\/MPI 2006. LNCS, vol.\u00a04192, pp. 303\u2013312. Springer, Heidelberg (2006)"},{"key":"8_CR5","unstructured":"Huck, K., Malony, A.: PerfExplorer: A performance data mining framework for large-scale parallel computing. In: Proceedings of the ACM\/IEEE Conference on Supercomputing, SC 2005 (2005)"},{"key":"8_CR6","unstructured":"Huck, K., Malony, A., Bell, R., Li, L., Morris, A.: PerfDMF: Design and implementation of a parallel performance data management framework. In: Proceedings of the International Conference on Parallel Processing. IEEE (2005)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Jose, J., Kandalla, K., Luo, M., Panda, D.: Supporting hybrid MPI and OpenSHMEM over InfiniBand: Design and performance evaluation. In: The 41st International Conference on Parallel Processing (ICPP), pp. 219\u2013228 (2012)","DOI":"10.1109\/ICPP.2012.55"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/11758525_71","volume-title":"Computational Science \u2013 ICCS 2006","author":"A. Kn\u00fcpfer","year":"2006","unstructured":"Kn\u00fcpfer, A., Brendel, R., Brunst, H., Mix, H., Nagel, W.E.: Introducing the open trace format (OTF). In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol.\u00a03992, pp. 526\u2013533. Springer, Heidelberg (2006)"},{"key":"8_CR9","unstructured":"Knupfer, A., Brunst, H., Nagel, W.: High performance event trace visualization. In: Proceedings of Parallel and Distributed Processing (PDP). IEEE (2005)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 (1956)","DOI":"10.2307\/2033241"},{"key":"8_CR11","unstructured":"Meuer, H., Strohmaier, E., Dongara, J., Simon, H.: TOP 500 Supercomputer Sites (2013), \n                    \n                      http:\/\/www.top500.org"},{"key":"8_CR12","unstructured":"Murphy, R.C., Wheeler, K.B., Barrett, B.W., Ang, J.A.: Introducing the Graph 500 (May 2010)"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C.H. Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science\u00a04(3), 237\u2013244 (1977)","journal-title":"Theoretical Computer Science"},{"key":"8_CR14","unstructured":"Pophale, S., Nanjegowda, R., Curtis, T., Chapman, B., Jin, H., Poole, S., Kuehn, J.: OpenSHMEM performance and potential: A NPB experimental study. In: The 6th Conference on Partitioned Global Address Space Programming Models, PGAS 2012 (2012)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1177\/1094342006064482","volume":"20","author":"S.S. Shende","year":"2006","unstructured":"Shende, S.S., Malony, A.D.: The TAU Parallel Performance System. Int. J. High Perform. Comput. Appl.\u00a020(2), 287\u2013311 (2006), \n                    \n                      http:\/\/dx.doi.org\/10.1177\/1094342006064482","journal-title":"Int. J. High Perform. Comput. Appl."}],"container-title":["Lecture Notes in Computer Science","OpenSHMEM and Related Technologies. Experiences, Implementations, and Tools"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05215-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T05:00:44Z","timestamp":1558846844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05215-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319052144","9783319052151"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05215-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}