{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:14:27Z","timestamp":1753438467870,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030293994"},{"type":"electronic","value":"9783030294007"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_11","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"142-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Toggle: Contention-Aware Task Scheduler for Concurrent Hierarchical Operations"],"prefix":"10.1007","author":[{"given":"Saurabh","family":"Kalikar","sequence":"first","affiliation":[]},{"given":"Rupesh","family":"Nasre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/2400682.2400703","volume":"9","author":"Y Cui","year":"2013","unstructured":"Cui, Y., Wang, Y., Chen, Y., Shi, Y.: Lock-contention-aware scheduler: a scalable and energy-efficient method for addressing scalability collapse on multicore systems. ACM Trans. Archit. Code Optim. 9(4), 44:1\u201344:25 (2013). https:\/\/doi.org\/10.1145\/2400682.2400703","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-319-96983-1_39","volume-title":"Euro-Par 2018: Parallel Processing","author":"K Ganesh","year":"2018","unstructured":"Ganesh, K., Kalikar, S., Nasre, R.: Multi-granularity locking in hierarchies with synergistic hierarchical and fine-grained locks. In: Aldinucci, M., Padovani, L., Torquati, M. (eds.) Euro-Par 2018. LNCS, vol. 11014, pp. 546\u2013559. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96983-1_39"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Gray, J.N., Lorie, R.A., Putzolu, G.R.: Granularity of locks in a shared data base. In: VLDB. pp. 428\u2013451. ACM, New York (1975)","DOI":"10.1145\/1282480.1282513"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Guerraoui, R., Kapalka, M., Vitek, J.: STMBench7: a benchmark for software transactional memory. In: Proceedings of the 2Nd ACM SIGOPS\/EuroSys European Conference on Computer Systems 2007, pp. 315\u2013324. EuroSys 2007, ACM, New York (2007). https:\/\/doi.org\/10.1145\/1272996.1273029","DOI":"10.1145\/1272996.1273029"},{"key":"11_CR5","unstructured":"Zhao, H., Sakellariou, R.: Scheduling multiple dags onto heterogeneous systems. In: Proceedings 20th IEEE International Parallel Distributed Processing Symposium, p. 14. April 2006"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Kalikar, S., Nasre, R.: Domlock: a new multi-granularity locking technique for hierarchies. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 23:1\u201323:12. PPoPP 2016, ACM, New York (2016). https:\/\/doi.org\/10.1145\/2851141.2851164","DOI":"10.1145\/2851141.2851164"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3127584","volume":"4","author":"S Kalikar","year":"2017","unstructured":"Kalikar, S., Nasre, R.: DomLock: a new multi-granularity locking technique for hierarchies. ACM Trans. Parallel Comput. 4(2), 7:1\u20137:29 (2017)","journal-title":"ACM Trans. Parallel Comput."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Kalikar, S., Nasre, R.: NumLock: towards optimal multi-granularity locking in hierarchies. In: Proceedings of the 47th International Conference on Parallel Processing, pp. 75:1\u201375:10. ICPP 2018, ACM, New York (2018). https:\/\/doi.org\/10.1145\/3225058.3225141","DOI":"10.1145\/3225058.3225141"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.14778\/1687627.1687658","volume":"2","author":"D Lomet","year":"2009","unstructured":"Lomet, D., Mokbel, M.F.: Locking key ranges with unbundled transaction services. Proc. VLDB Endow. 2(1), 265\u2013276 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"11_CR10","unstructured":"Lomet, D.B.: Key range locking strategies for improved concurrency. In: Proceedings of the 19th International Conference on Very Large Data Bases, pp. 655\u2013664. VLDB 1993, Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"key":"11_CR11","unstructured":"MSDN: Sql server 2016 database engine (2015). https:\/\/msdn.microsoft.com\/en-us\/library\/ms187875.aspx"},{"key":"11_CR12","unstructured":"Oracle: Oracle database 10g r2 (2015). http:\/\/docs.oracle.com\/cd\/B19306_01\/index.htm"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-09873-9_13","volume-title":"Euro-Par 2014 Parallel Processing","author":"H Rito","year":"2014","unstructured":"Rito, H., Cachopo, J.: ProPS: a progressively pessimistic scheduler for software transactional memory. In: Silva, F., Dutra, I., Santos Costa, V. (eds.) Euro-Par 2014. LNCS, vol. 8632, pp. 150\u2013161. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09873-9_13"},{"key":"11_CR14","unstructured":"Sybase: Adaptive server enterprise: Performance tuning and locking (2003). http:\/\/infocenter.sybase.com\/help\/topic\/com.sybase.help.ase_12.5.1\/title.htm"},{"key":"11_CR15","unstructured":"Treebank: Xml data repository (2002). http:\/\/aiweb.cs.washington.edu\/research\/projects\/xmltk\/xmldata\/www\/repository.html"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:03:24Z","timestamp":1691885004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}