{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:01:23Z","timestamp":1725901283239},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311246"},{"type":"electronic","value":"9783642311253"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31125-3_1","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T05:24:23Z","timestamp":1339997063000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Processor Allocation for Optimistic Parallelization of Irregular Programs"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Versaci","sequence":"first","affiliation":[]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1394441.1394443","volume":"26","author":"K. Agrawal","year":"2008","unstructured":"Agrawal, K., Leiserson, C.E., He, Y., Hsu, W.J.: Adaptive work-stealing with parallelism feedback. ACM Trans. Comput. Syst.\u00a026(3), 7:1\u20137:32 (2008), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/1394441.1394443","journal-title":"ACM Trans. Comput. Syst."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The probabilistic method. Wiley-Interscience (2000)","DOI":"10.1002\/0471722154"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-35767-X_13","volume-title":"Languages and Compilers for Parallel Computing","author":"P. An","year":"2003","unstructured":"An, P., Jula, A., Rus, S., Saunders, S., Smith, T.G., Tanase, G., Thomas, N., Amato, N.M., Rauchwerger, L.: Stapl: An Adaptive, Generic Parallel C++ Library. In: Dietz, H.G. (ed.) LCPC 2001. LNCS, vol.\u00a02624, pp. 193\u2013208. Springer, Heidelberg (2003)"},{"key":"1_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719642","volume-title":"ScaLAPACK Users\u2019 Guide","author":"L.S. Blackford","year":"1997","unstructured":"Blackford, L.S., Choi, J., Cleary, A., D\u2019Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK Users\u2019 Guide. Society for Industrial and Applied Mathematics, Philadelphia (1997)"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A. Braunstein","year":"2005","unstructured":"Braunstein, A., M\u00e9zard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms\u00a027(2), 201\u2013226 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1137\/1004037","volume":"4","author":"D. Freedman","year":"1962","unstructured":"Freedman, D., Shepp, L.: Problem 62-3, an unfriendly seating arrangement. SIAM Review\u00a04(2), 150 (1962), \n                    \n                      http:\/\/www.jstor.org\/stable\/2028372","journal-title":"SIAM Review"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/1006044","volume":"6","author":"H.D. Friedman","year":"1964","unstructured":"Friedman, H.D., Rothman, D., MacKenzie, J.K.: Problem 62-3. SIAM Review\u00a06(2), 180\u2013182 (1964), \n                    \n                      http:\/\/www.jstor.org\/stable\/2028090","journal-title":"SIAM Review"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/JPROC.2004.840301","volume":"93","author":"M. Frigo","year":"2005","unstructured":"Frigo, M., Johnson, S.G.: The design and implementation of FFTW3. Proceedings of the IEEE\u00a093(2), 216\u2013231 (2005); special issue on Program Generation, Optimization, and Platform Adaptation","journal-title":"Proceedings of the IEEE"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Randall, K.H.: The implementation of the Cilk-5 multithreaded language. In: PLDI, pp. 212\u2013223 (1998)","DOI":"10.1145\/277652.277725"},{"issue":"16","key":"1_CR11","doi-asserted-by":"publisher","first-page":"5120","DOI":"10.1016\/j.disc.2009.03.049","volume":"309","author":"K. Georgiou","year":"2009","unstructured":"Georgiou, K., Kranakis, E., Krizanc, D.: Random maximal independent sets and the unfriendly theater seating arrangement problem. Discrete Mathematics\u00a0309(16), 5120\u20135129 (2009), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/B6V00-4W55T4X-2\/2\/72d38a668c737e68edf497512e606e12","journal-title":"Discrete Mathematics"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L.J. Guibas","year":"1992","unstructured":"Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of delaunay and voronoi diagrams. Algorithmica\u00a07(4), 381\u2013413 (1992)","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02418571","volume":"30","author":"J. Jensen","year":"1906","unstructured":"Jensen, J.: Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes. Acta Mathematica\u00a030(1), 175\u2013193 (1906)","journal-title":"Acta Mathematica"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Kal\u00e9, L.V., Krishnan, S.: Charm++: A portable concurrent object oriented system based on C++. In: OOPSLA, pp. 91\u2013108 (1993)","DOI":"10.1145\/167962.165874"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Kulkarni, M., Burtscher, M., Cascaval, C., Pingali, K.: Lonestar: A suite of parallel irregular programs. In: ISPASS, pp. 65\u201376. IEEE (2009)","DOI":"10.1109\/ISPASS.2009.4919639"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kulkarni, M., Burtscher, M., Inkulu, R., Pingali, K., Cascaval, C.: How much parallelism is there in irregular applications? In: Reed, D.A., Sarkar, V. (eds.) PPOPP, pp. 3\u201314. ACM (2009)","DOI":"10.1145\/1504176.1504181"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-Lojo, M., Nguyen, D., Prountzos, D., Sui, X., Hassaan, M.A., Kulkarni, M., Burtscher, M., Pingali, K.: Structure-driven optimizations for amorphous data-parallel programs. In: Govindarajan, R., Padua, D.A., Hall, M.W. (eds.) PPOPP, pp. 3\u201314. ACM (2010)","DOI":"10.1145\/1837853.1693457"},{"key":"1_CR18","first-page":"12","volume-title":"Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011","author":"K. Pingali","year":"2011","unstructured":"Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M.A., Kaleem, R., Lee, T.H., Lenharth, A., Manevich, R., M\u00e9ndez-Lojo, M., Prountzos, D., Sui, X.: The tao of parallelism in algorithms. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, pp. 12\u201325. ACM, New York (2011), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/1993498.1993501"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/JPROC.2004.840306","volume":"93","author":"M. P\u00fcschel","year":"2005","unstructured":"P\u00fcschel, M., Moura, J., Johnson, J., Padua, D., Veloso, M., Singer, B., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., Chen, K., Johnson, R., Rizzolo, N.: Spiral: Code generation for dsp transforms. Proceedings of the IEEE\u00a093(2), 232\u2013275 (2005)","journal-title":"Proceedings of the IEEE"},{"key":"1_CR20","volume-title":"Intel threading building blocks","author":"J. Reinders","year":"2007","unstructured":"Reinders, J.: Intel threading building blocks. O\u2019Reilly & Associates, Inc., Sebastopol (2007)"},{"key":"1_CR21","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley (2005)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Tao, T.: Additive combinatorics. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511755149"},{"key":"1_CR23","first-page":"261","volume-title":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011","author":"F. Versaci","year":"2011","unstructured":"Versaci, F., Pingali, K.: Brief announcement: processor allocation for optimistic parallelization of irregular programs. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011, pp. 261\u2013262. ACM, New York (2011), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/1989493.1989533"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31125-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:46:13Z","timestamp":1620114373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31125-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311246","9783642311253"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31125-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}