{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:27:57Z","timestamp":1743139677107,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030598532"},{"type":"electronic","value":"9783030598549"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59854-9_18","type":"book-chapter","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T23:02:42Z","timestamp":1604358162000},"page":"239-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Entropy Measurement of Concurrent Disorder"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9852-2581","authenticated-orcid":false,"given":"Victor","family":"Cook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8070-7633","authenticated-orcid":false,"given":"Christina","family":"Peterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8334-8237","authenticated-orcid":false,"given":"Zachary","family":"Painter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0569-3403","authenticated-orcid":false,"given":"Damian","family":"Dechev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,3]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17653-1_29","volume-title":"Principles of Distributed Systems","author":"Y Afek","year":"2010","unstructured":"Afek, Y., Korland, G., Yanovsky, E.: Quasi-linearizability: relaxed consistency for improved concurrency. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 395\u2013410. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17653-1_29"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bender, J., Lesani, M., Palsberg, J.: Declarative fence insertion. In: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp. 367\u2013385. ACM (2015)","DOI":"10.1145\/2858965.2814318"},{"key":"18_CR3","unstructured":"Bianchi, A., Caivano, D., Lanubile, F., Visaggio, G.: Evaluating software degradation through entropy. In: Proceedings Seventh International Software Metrics Symposium, pp. 210\u2013219. IEEE (2001)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Boehm, H.J., Adve, S.V.: Foundations of the c++ concurrency memory model. In: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 68\u201378. ACM (2008)","DOI":"10.1145\/1379022.1375591"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Canfora, G., Cerulo, L., Di Penta, M., Pacilio, F.: An exploratory study of factors influencing change entropy. In: 2010 IEEE 18th International Conference on Program Comprehension, pp. 134\u2013143. IEEE (2010)","DOI":"10.1109\/ICPC.2010.32"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chockler, H., Farchi, E., Godlin, B., Novikov, S.: Cross-entropy based testing. In: Formal Methods in Computer Aided Design (FMCAD 2007), pp. 101\u2013108. IEEE (2007)","DOI":"10.1109\/FAMCAD.2007.19"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-00593-0_14","volume-title":"Fundamental Approaches to Software Engineering","author":"H Chockler","year":"2009","unstructured":"Chockler, H., Farchi, E., Godlin, B., Novikov, S.: Cross-entropy-based replay of concurrent programs. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, pp. 201\u2013215. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00593-0_14"},{"key":"18_CR8","unstructured":"Cook, V., Peterson, C., Painter, Z., Dechev, D.: Quantifiability: concurrent correctness from first principles. arXiv preprint arXiv:1905.06421 (2019)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: Revisiting the combining synchronization technique. In: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 257\u2013266. ACM (2012)","DOI":"10.1145\/2370036.2145849"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 50\u201359 (2004)","DOI":"10.1145\/1011767.1011776"},{"key":"18_CR11","unstructured":"Fraser, K.: Practical lock-freedom. Technical report, University of Cambridge, Computer Laboratory (2004)"},{"key":"18_CR12","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016). http:\/\/www.deeplearningbook.org"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Gramoli, V.: More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms. In: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2015), pp. 1\u201310. ACM (2015)","DOI":"10.1145\/2688500.2688501"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Haas, A., et al.: Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. In: Proceedings of the ACM International Conference on Computing Frontiers, pp. 1\u20139 (2013)","DOI":"10.1145\/2482767.2482789"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Hassan, A.E.: Predicting faults using the complexity of code changes. In: Proceedings of the 31st International Conference on Software Engineering, pp. 78\u201388. IEEE Computer Society (2009)","DOI":"10.1109\/ICSE.2009.5070510"},{"key":"18_CR16","unstructured":"Hassan, A.E., Holt, R.C.: The chaos of software development. In: Sixth International Workshop on Principles of Software Evolution, 2003. Proceedings, pp. 84\u201394. IEEE (2003)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11795490_3","volume-title":"Principles of Distributed Systems","author":"S Heller","year":"2006","unstructured":"Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N., Shavit, N.: A lazy concurrent list-based set algorithm. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 3\u201316. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11795490_3"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 355\u2013364. ACM (2010)","DOI":"10.1145\/1810479.1810540"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 206\u2013215. ACM (2004)","DOI":"10.1145\/1007912.1007944"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Kirsch, C.M., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming languages (POPL 2013), pp. 317\u2013328. ACM (2013)","DOI":"10.1145\/2480359.2429109"},{"key":"18_CR21","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2012","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, Burlington (2012)"},{"issue":"3","key":"18_CR22","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. (TOPLAS) 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Kapur, J.N., Kesavan, H.K.: Entropy optimization principles and their applications. In: Singh, V.P., Fiorentino, M. (eds.) Entropy and Energy Dissipation in Water Resources. Water Science and Technology Library, vol. 9, pp. 3\u201320. Springer, Dordrecht (1992). https:\/\/doi.org\/10.1007\/978-94-011-2430-0_1","DOI":"10.1007\/978-94-011-2430-0_1"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-39958-9_18","volume-title":"Parallel Computing Technologies","author":"Christoph M Kirsch","year":"2013","unstructured":"Kirsch, Christoph M., Lippautz, Michael, Payer, Hannes: Fast and scalable, lock-free k-FIFO queues. In: Malyshkin, Victor (ed.) PaCT 2013. LNCS, vol. 7979, pp. 208\u2013223. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39958-9_18"},{"key":"18_CR25","unstructured":"Knuth, D.E.: The Art of Computer Programming: Volume 3: Sorting and Searching. Addison-Wesley Professional, Boston (1998)"},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/03081078608934927","volume":"12","author":"U Kumar","year":"1986","unstructured":"Kumar, U., Kumar, V., Kapur, J.N.: Normalized measures of entropy. Int. J. Gener. Syst. 12(1), 55\u201369 (1986)","journal-title":"Int. J. Gener. Syst."},{"issue":"9","key":"18_CR27","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess program. IEEE Trans. Comput. 28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"18_CR28","first-page":"267","volume":"600","author":"MM Michael","year":"1995","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical Non-Blocking and blocking concurrent queue algorithms. Tech. Rep. 600, 267\u2013275 (1995)","journal-title":"Tech. Rep."},{"issue":"8","key":"18_CR29","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2517327.2442527","volume":"48","author":"A Morrison","year":"2013","unstructured":"Morrison, A., Afek, Y.: Fast concurrent queues for x86 processors. ACM SIGPLAN Not. 48(8), 103\u2013112 (2013). https:\/\/doi.org\/10.1145\/2517327.2442527","journal-title":"ACM SIGPLAN Not."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Ou, P., Demsky, B.: Checking concurrent data structures under the c\/c++11 memory model. In: Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2017), January 2017","DOI":"10.1145\/3018743.3018749"},{"issue":"1","key":"18_CR31","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0377-2217(96)00385-2","volume":"99","author":"RY Rubinstein","year":"1997","unstructured":"Rubinstein, R.Y.: Optimization of computer simulation models with rare events. Eur. J. Oper. Res. 99(1), 89\u2013112 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR32","unstructured":"Rubinstein, R.Y., Kroese, D.P.: The Cross-entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer, Heidelberg (2013)"},{"issue":"3","key":"18_CR33","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Singh, V., Chaturvedi, K.: Entropy based bug prediction using support vector regression. In: 2012 12th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 746\u2013751. IEEE (2012)","DOI":"10.1109\/ISDA.2012.6416630"},{"key":"18_CR35","unstructured":"Treiber, R.K.: Systems programming: coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986. San Jose, CA (1986)"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Wimmer, M., Gruber, J., Tr\u00e4ff, J.L., Tsigas, P.: The lock-free k-LSM relaxed priority queue. In: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2015), vol. 50, no. 8, pp. 277\u2013278 (2015)","DOI":"10.1145\/2858788.2688547"},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Yang, C., Mellor-Crummey, J.: A wait-free queue as fast as fetch-and-add. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP 2016, pp. 1\u201313. ACM Press, New York (2016)","DOI":"10.1145\/3016078.2851168"},{"issue":"3","key":"18_CR38","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/TPDS.2015.2419651","volume":"27","author":"D Zhang","year":"2015","unstructured":"Zhang, D., Dechev, D.: A lock-free priority queue design based on multi-dimensional linked lists. IEEE Trans. Parallel Distrib. Syst. 27(3), 613\u2013626 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"14","key":"18_CR39","doi-asserted-by":"publisher","first-page":"2854","DOI":"10.1016\/j.physa.2009.03.042","volume":"388","author":"L Zunino","year":"2009","unstructured":"Zunino, L., Zanin, M., Tabak, B.M., P\u00e9rez, D.G., Rosso, O.A.: Forbidden patterns, permutation entropy and stock market inefficiency. Physica A 388(14), 2854\u20132864 (2009)","journal-title":"Physica A"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59854-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,17]],"date-time":"2020-12-17T16:16:48Z","timestamp":1608221808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59854-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030598532","9783030598549"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59854-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.qest.org\/qest2020\/","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":"42","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":"12","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":"7","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":"29% - 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,10","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,06","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)"}}]}}