{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:57Z","timestamp":1740099057290,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920399"},{"type":"electronic","value":"9783319920405"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92040-5_18","type":"book-chapter","created":{"date-parts":[[2018,5,28]],"date-time":"2018-05-28T07:55:05Z","timestamp":1527494105000},"page":"350-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Combining HTM with RCU to Speed Up Graph Coloring on Multicore Platforms"],"prefix":"10.1007","author":[{"given":"Christina","family":"Giannoula","sequence":"first","affiliation":[]},{"given":"Georgios","family":"Goumas","sequence":"additional","affiliation":[]},{"given":"Nectarios","family":"Koziris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10, 85\u201386 (1967)","journal-title":"Comput. J."},{"key":"18_CR2","unstructured":"Marx, D.: Graph coloring problems and their applications in scheduling. In: Proceedings of John Von Neumann PhD Students Conference, pp. 1\u20132 (2004)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"GJ Chaitin","year":"1981","unstructured":"Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via coloring. Comput. Lang. 6, 47\u201357 (1981)","journal-title":"Comput. Lang."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"TF Coleman","year":"1983","unstructured":"Coleman, T.F., Mor\u00e9, J.J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20, 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"18_CR5","unstructured":"Saad, Y.: Sparskit: a basic tool kit for sparse matrix computations (1994)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Kaler, T., Hasenplaugh, W., Schardl, T.B., Leiserson, C.E.: Executing dynamic data-graph computations deterministically using chromatic scheduling. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, pp. 154\u2013165 (2014)","DOI":"10.1145\/2612669.2612673"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2","volume":"12","author":"AH Gebremedhin","year":"2000","unstructured":"Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Pract. Exp. Concurr. 12, 1131\u20131146 (2000)","journal-title":"Pract. Exp. Concurr."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Feo, J., Gebremedhin, A.H., Halappanavar, M., Pothen, A.: Graph coloring algorithms for muti-core and massively multithreaded architectures. CoRR (2012)","DOI":"10.1016\/j.parco.2012.07.001"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11549468_29","volume-title":"Euro-Par 2005 Parallel Processing","author":"EG Boman","year":"2005","unstructured":"Boman, E.G., Bozda\u011f, D., Catalyurek, U., Gebremedhin, A.H., Manne, F.: A scalable parallel graph coloring algorithm for distributed memory computers. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 241\u2013251. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549468_29"},{"key":"18_CR11","unstructured":"McKenney, P.E., Slingwine, J.D.: Read-copy update: using execution history to solve concurrency problems (1998)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Yoo, R.M., Hughes, C.J., Lai, K., Rajwar, R.: Performance evaluation of Intel transactional synchronization extensions for high-performance computing. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2013 (2013)","DOI":"10.1145\/2503210.2503232"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/2508148.2485942","volume":"41","author":"HW Cain","year":"2013","unstructured":"Cain, H.W., Michael, M.M., Frey, B., May, C., Williams, D., Le, H.: Robust architectural support for transactional memory in the power architecture. SIGARCH Comput. Archit. News 41, 225\u2013236 (2013)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Arbel, M., Attiya, H.: Concurrent updates with RCU: search tree as an example. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC 2014 (2014)","DOI":"10.1145\/2611462.2611471"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Matveev, A., Shavit, N., Felber, P., Marlier, P.: Read-log-update: a lightweight synchronization mechanism for concurrent programming. In: Proceedings of the 25th Symposium on Operating Systems Principles, SOSP 2015 (2015)","DOI":"10.1145\/2815400.2815406"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Siakavaras, D., Nikas, K., Goumas, G.I., Koziris, N.: RCU-HTM: combining RCU with HTM to implement highly efficient concurrent binary search trees. In: 26th International Conference on Parallel Architectures and Compilation Techniques, PACT 2017 (2017)","DOI":"10.1109\/PACT.2017.17"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Deveci, M., Boman, E., Devine, K.D., Rajamanickam, S.: Parallel graph coloring for manycore architectures. In: IPDPS 2016 (2016)","DOI":"10.1109\/IPDPS.2016.54"},{"key":"18_CR18","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the Koblenz network collection (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"18_CR20","unstructured":"Demetrescu, C., Goldberg, A., Johnson,, D.: 9th DIMACS implementation challenge - shortest paths (2006). http:\/\/www.dis.uniroma1.it\/challenge9\/"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Brown, T., Kogan, A., Lev, Y., Luchangco, V.: Investigating the performance of hardware transactions on a multi-socket machine. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016 (2016)","DOI":"10.1145\/2935764.2935796"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-662-48096-0_32","volume-title":"Euro-Par 2015: Parallel Processing","author":"G Rokos","year":"2015","unstructured":"Rokos, G., Gorman, G., Kelly, P.H.J.: A fast and scalable graph coloring algorithm for multi-core and many-core architectures. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 414\u2013425. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48096-0_32"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"MT Jones","year":"1993","unstructured":"Jones, M.T., Plassmann, P.: A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14, 654\u2013669 (1993)","journal-title":"SIAM J. Sci. Comput."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Hasenplaugh, W., Kaler, T., Schardl, T.B., Leiserson, C.E.: Ordering heuristics for parallel graph coloring. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014 (2014)","DOI":"10.1145\/2612669.2612697"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Nikas, K., Anastopoulos, N., Goumas, G.I., Koziris, N.: Employing transactional memory and helper threads to speedup Dijkstra\u2019s algorithm. In: International Conference on Parallel Processing, ICPP 2009, pp. 388\u2013395 (2009)","DOI":"10.1109\/ICPP.2009.60"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Kang, S., Bader, D.A.: An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs. In: Proceedings of the 14th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP 2009 (2009)","DOI":"10.1145\/1594835.1504182"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Clements, A.T., Kaashoek, M.F., Zeldovich, N.: Scalable address spaces using RCU balanced trees. In: Proceedings of the Seventeenth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS XVII, pp. 199\u2013210 (2012)","DOI":"10.1145\/2150976.2150998"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92040-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T13:57:02Z","timestamp":1571407022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92040-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920399","9783319920405"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92040-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}