{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T01:31:05Z","timestamp":1794360665770,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540898931","type":"print"},{"value":"9783540898948","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89894-8_10","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T10:22:24Z","timestamp":1229422944000},"page":"73-86","source":"Crossref","is-referenced-by-count":2,"title":["Construction and Evaluation of Coordinated Performance Skeletons"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaspal","family":"Subhlok","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Toomula, A., Subhlok, J.: Replicating memory behavior for performance prediction. In: Proceedings of LCR 2004: The 7th Workshop on Languages, Compilers, and Run-time Support for Scalable Systems, Houston, TX, October 2004. The ACM Digital Library (2004)","DOI":"10.1145\/1066650.1066666"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Sodhi, S., Subhlok, J.: Automatic construction and evaluation of performance skeletons. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005), Denver, CO (April 2005)","DOI":"10.1109\/IPDPS.2005.117"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Sodhi, S., Xu, Q., Subhlok, J.: Performance prediction with skeletons. Cluster Computing: The Journal of Networks, Software Tools and Applications\u00a011(2) (June 2008)","DOI":"10.1007\/s10586-007-0039-2"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Casanova, H., Obertelli, G., Berman, F., Wolski, R.: The AppLeS Parameter Sweep Template: User-level middleware for the grid. In: Supercomputing 2000, pp. 75\u201376 (2000)","DOI":"10.1109\/SC.2000.10061"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Raman, R., Livny, M., Solomon, M.: Matchmaking: Distributed resource management for high throughput computing. In: 7th IEEE International Symposium on High Performance Distributed Computing (July 1998)","DOI":"10.1109\/HPDC.1998.709966"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Snavely, A., Carrington, L., Wolter, N.: A framework for performance modeling and prediction. In: Proceedings of Supercomputing 2002 (2002)","DOI":"10.1109\/SC.2002.10004"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Huband, S., McDonald, C.: A preliminary topological debugger for MPI programs. In: 1st International Symposium on Cluster Computing and the Grid (CCGRID 2001) (2001)","DOI":"10.1109\/CCGRID.2001.923222"},{"key":"10_CR8","unstructured":"Badia, R., Labarta, J., Gimenez, J., Escale, F.: DIMEMAS: Predicting MPI applications behavior in Grid environments. In: Workshop on Grid Applications and Programming Tools (GGF8) (2003)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Noeth, M., Mueller, F., Schulz, M., de Supinskii, B.: Scalable compression and replay of communication traces in massively parallel environments. In: 21th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2007), Long Beach, CA (April 2007)","DOI":"10.1109\/IPDPS.2007.370261"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Ratn, P., Mueller, F., de Supinski, B., Schulz, M.: Preserving time in large-scale communication traces. In: 22nd ACM International Conference on Supercomputing, June 2008, pp. 46\u201355 (2008)","DOI":"10.1145\/1375527.1375537"},{"key":"10_CR11","unstructured":"Kerbyson, D., Barker, K.: Automatic identification of application communication patterns via templates. In: 18th International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV (September 2005)"},{"key":"10_CR12","unstructured":"Tabe, T., Stout, Q.: The use of the MPI communication library in the NAS Parallel Benchmark. Technical Report CSE-TR-386-99, Department of Computer Science, University of Michigan (November 1999)"},{"key":"10_CR13","first-page":"1038","volume-title":"Proc. of the 10th ICIAP","author":"L.P. Cordella","year":"1999","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Performance evaluation of the VF graph matching algorithm. In: Proc. of the 10th ICIAP, vol.\u00a02, pp. 1038\u20131041. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Xu, Q., Prithivathi, R., Subhlok, J., Zheng, R.: Logicalization of MPI communication traces. Technical Report UH-CS-08-07, University of Houston (May 2008)","DOI":"10.1109\/IISWC.2009.5306796"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Nevill-Manning, C., Witten, I., Maulsby, D.: Compression by induction of hierarchical grammars. In: Data Compression Conference, Snowbird, UT, pp. 244\u2013253 (1994)","DOI":"10.1109\/DCC.1994.305932"},{"key":"10_CR17","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Sequitur, http:\/\/SEQUITUR.info"},{"issue":"5","key":"10_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett.\u00a012(5), 244\u2013250 (1981)","journal-title":"Inf. Process. Lett."},{"key":"10_CR19","unstructured":"Xu, Q., Subhlok, J.: Efficient discovery of loop nests in communication traces of parallel programs. Technical Report UH-CS-08-08, University of Houston (May 2008)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing - HiPC 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89894-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T05:43:02Z","timestamp":1557985382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89894-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540898931","9783540898948"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89894-8_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-89894-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}