{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:35Z","timestamp":1725664295891},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603214"},{"type":"electronic","value":"9783540449157"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60321-2_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:18:49Z","timestamp":1330262329000},"page":"59-73","source":"Crossref","is-referenced-by-count":0,"title":["Fast execution of irregularly structured programs with low communication frequency on the hypercube"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Auletta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Negro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vittorio","family":"Scarano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"4_CR1","volume-title":"Technical Report","author":"H. Alt","year":"1986","unstructured":"H. Alt, T. Hagerup, K. Melhorn, F.P. Preparata, \u201cSimulation of idealized parallel computers on more realistic ones\u201d, Technical Report, University of Saarbrucken (Germany), 1986."},{"key":"4_CR2","volume-title":"Tech. Rep. 6\/95 of Dipartimento di Informatica ed Applicazioni","author":"V. Auletta","year":"1995","unstructured":"V. Auletta, A. Negro, V. Scarano, \u201cFast Execution of Irregularly Structured Programs with Low Communication Frequency on the Hypercube\u201d, Tech. Rep. 6\/95 of Dipartimento di Informatica ed Applicazioni, Universit\u00e1 di Salerno, Italy (also submitted for publication to Theoretical Computer Science, 1995)."},{"key":"4_CR3","unstructured":"V. Auletta, A. Negro, V. Scarano, \u201cEfficient Token Clustering on Hypercubes\u201d, Tech. Rep. 5\/95 of Dipartimento di Informatica ed Applicazioni, Universit\u00e1 di Salerno, Italy."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"B. Bollobas, \u201cGraph Theory. An Introductory Course\u201d, Springer-Verlag, 1979.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"4_CR5","unstructured":"B. Bollobas, \u201cRandom Graphs\u201d, Academic Press, 1985."},{"key":"4_CR6","unstructured":"A. Gerasoulis, T. Yang, \u201cDominant Sequence Clustering Heuristic Algorithm for Multiprocessors\u201d, Report, 1990."},{"key":"4_CR7","unstructured":"A. Gerasoulis, S.Venugopal, \u201cLinear Clusteering of Linear Algebra Task Graphs for Local Memory Systems\u201d, Report, 1990."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"A. Gerasoulis, S. Venugopal, T. Yang, \u201cClustering Task Graphs for Message Passing Architectures\u201d, Proc. of 1990 International Conf. on Supercomputing, acm sigarch Computer Architecture News, pp.447\u2013456, 1990.","DOI":"10.1145\/77726.255188"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, D. Krizanc, S. Rao, \u201cUniversal Emulations with Sublogarithmic Slowdown\u201d, Proc. of 34th IEEE Annual Symp. on Foundations of Computer Science, 1993.","DOI":"10.1109\/SFCS.1993.366853"},{"key":"4_CR10","volume-title":"TR-88-01","author":"S.J. Kim","year":"1988","unstructured":"S.J. Kim, \u201cA General Approach to Multiprocessor Scheduling\u201d, TR-88-01, Dept. Computer Science, Univ. of Texas at Austin, 1988."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"R.M. Karp, V. Ramachandran, \u201cParallel Algorithms for Shared-Memory Machines\u201d, Chapter 17 in Handbook of Theoretical Computer Science: Algorithms and Complexity, vol.1, J. Van Leuween ed., Elsevier Publisher, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, \u201cIntroduction to Parallel Algorithms and Architectures\u201d, vol. 1, M.Kauffman Publ. 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, B. Maggs, S. Rao, \u201cUniversal Packet Routing Algorithms\u201d, Proc. of 29th IEEE Annual Symp. on Foundations of Computer Science, 1988.","DOI":"10.21236\/ADA204273"},{"key":"4_CR14","first-page":"257","volume":"7","author":"B. Monien","year":"1990","unstructured":"B. Monien, H. Sudborough, \u201cEmbedding one Interconnection network in Another\u201d, Computing Supp., 7, 1990, pp.257\u2013282.","journal-title":"Computing Supp."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"A. Ranade, \u201cHow to emulate Shared Memory\u201d, Proc. of 28th IEEE Annual Symp. on Foundations of Computer Science, 1987, pp. 185\u2013194.","DOI":"10.1109\/SFCS.1987.32"}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60321-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:17Z","timestamp":1605628697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60321-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603214","9783540449157"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60321-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}