{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:19:42Z","timestamp":1783160382753,"version":"3.54.6"},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:00:00Z","timestamp":1778716800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2131538"],"award-info":[{"award-number":["CNS-2131538"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116046","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T17:59:22Z","timestamp":1779299962000},"page":"116046","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A poly-log approximation for transaction scheduling in fog-cloud computing and beyond"],"prefix":"10.1016","volume":"1080","author":[{"given":"Ramesh","family":"Adhikari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavan","family":"Poudel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116046_bib0001","series-title":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","first-page":"21","article-title":"A poly-log approximation for transaction scheduling in fog-cloud computing and beyond","author":"Adhikari","year":"2025"},{"issue":"1","key":"10.1016\/j.tcs.2026.116046_bib0002","first-page":"1","article-title":"Transaction scheduling: from conflicts to runtime conflicts","volume":"1","author":"Cao","year":"2023","journal-title":"Proc. ACM Manag. Data"},{"issue":"1","key":"10.1016\/j.tcs.2026.116046_bib0003","doi-asserted-by":"crossref","first-page":"121","DOI":"10.23919\/JCN.2022.000058","article-title":"DISCO: Distributed computation offloading framework for fog computing networks","volume":"25","author":"Tran-Dang","year":"2023","journal-title":"J. Commun. Netw."},{"issue":"6","key":"10.1016\/j.tcs.2026.116046_bib0004","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.14778\/3583140.3583153","article-title":"Efficient distributed transaction processing in heterogeneous networks","volume":"16","author":"Zhang","year":"2023","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"10.1016\/j.tcs.2026.116046_bib0005","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/j.jpdc.2010.02.006","article-title":"Adaptive locks: combining transactions and locks for efficient concurrency","volume":"70","author":"Usui","year":"2010","journal-title":"J. Parall. Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116046_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114184","article-title":"Flexible scheduling of transactional memory on trees","volume":"978","author":"Busch","year":"2023","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116046_bib0007","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00446-021-00410-w","article-title":"Dynamic scheduling in distributed transactional memory","volume":"35","author":"Busch","year":"2022","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116046_bib0008","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00446-007-0037-x","article-title":"Distributed transactional memory for metric-space networks","volume":"20","author":"Herlihy","year":"2007","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116046_bib0009","series-title":"ECOOP 2002 \u2014 Object-Oriented Programming","first-page":"178","article-title":"J-Orchestra: automatic Java application partitioning","author":"Tilevich","year":"2002"},{"key":"10.1016\/j.tcs.2026.116046_bib0010","series-title":"Jini Specification","author":"Arnold","year":"1999"},{"key":"10.1016\/j.tcs.2026.116046_bib0011","series-title":"Stabilization, Safety, and Security of Distributed Systems","first-page":"238","article-title":"Snake: control flow distributed software transactional memory","author":"Saad","year":"2011"},{"issue":"5","key":"10.1016\/j.tcs.2026.116046_bib0012","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/TC.2011.64","article-title":"An oblivious spanning tree for single-sink buy-at-bulk in low doubling-dimension graphs","volume":"61","author":"Srinivasagopalan","year":"2011","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.tcs.2026.116046_bib0013","series-title":"26th IEEE International Conference on Distributed Computing Systems (ICDCS\u201906)","first-page":"75","article-title":"Routing in networks with low doubling dimension","author":"Abraham","year":"2006"},{"key":"10.1016\/j.tcs.2026.116046_bib0014","series-title":"2009 International Conference on Information Processing in Sensor Networks","first-page":"97","article-title":"Distributed resource management and matching in sensor networks","author":"Gao","year":"2009"},{"key":"10.1016\/j.tcs.2026.116046_bib0015","series-title":"International Conference on Principles of Distributed Systems","first-page":"157","article-title":"Distributed spanner construction in doubling metric spaces","author":"Damian","year":"2006"},{"key":"10.1016\/j.tcs.2026.116046_bib0016","series-title":"31st International Symposium on Algorithms and Computation (ISAAC 2020)","first-page":"1","article-title":"Compact routing in unit disk graphs","author":"Mulzer","year":"2020"},{"issue":"5","key":"10.1016\/j.tcs.2026.116046_bib0017","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s00446-021-00401-x","article-title":"Low-congestion shortcut and graph parameters","volume":"34","author":"Kitamura","year":"2021","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116046_bib0018","series-title":"Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing","first-page":"60","article-title":"On the locality of bounded growth","author":"Kuhn","year":"2005"},{"key":"10.1016\/j.tcs.2026.116046_bib0019","series-title":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","first-page":"151","article-title":"Brief announcement: universal data aggregation trees for sensor networks in low doubling metrics","author":"Srinivasagopalan","year":"2009"},{"issue":"5","key":"10.1016\/j.tcs.2026.116046_bib0020","doi-asserted-by":"crossref","first-page":"469","DOI":"10.14778\/3055540.3055541","article-title":"Mapreduce and streaming algorithms for diversity maximization in metric spaces of bounded doubling dimension","volume":"10","author":"Ceccarello","year":"2017","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"10.1016\/j.tcs.2026.116046_bib0021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3582500","article-title":"Approximation schemes for capacitated vehicle routing on graphs of bounded treewidth, bounded doubling, or highway dimension","volume":"19","author":"Jayaprakash","year":"2023","journal-title":"ACM Trans. Algorith."},{"issue":"4","key":"10.1016\/j.tcs.2026.116046_bib0022","first-page":"1","article-title":"On hierarchical routing in doubling metrics","volume":"12","author":"Chan","year":"2016","journal-title":"ACM Trans. Algorith."},{"key":"10.1016\/j.tcs.2026.116046_bib0023","series-title":"Proceedings of the Twenty-seventh ACM Symposium on Principles of Distributed Computing","first-page":"417","article-title":"Dynamic routing and location services in metrics of low doubling dimension","author":"Konjevod","year":"2008"},{"key":"10.1016\/j.tcs.2026.116046_bib0024","series-title":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing","first-page":"207","article-title":"Impossibility results for distributed transactional memory","author":"Busch","year":"2015"},{"key":"10.1016\/j.tcs.2026.116046_bib0025","series-title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","first-page":"173","article-title":"Fast scheduling in distributed transactional memory","author":"Busch","year":"2017"},{"issue":"5","key":"10.1016\/j.tcs.2026.116046_bib0026","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00446-014-0214-7","article-title":"Distributed transactional memory for general networks","volume":"27","author":"Sharma","year":"2014","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116046_bib0027","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.jpdc.2015.02.002","article-title":"A load balanced directory for distributed shared memory objects","volume":"78","author":"Sharma","year":"2015","journal-title":"J. Parall. Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116046_bib0028","series-title":"Distributed Computing","first-page":"324","article-title":"Distributed transactional memory for metric-space networks","author":"Herlihy","year":"2005"},{"key":"10.1016\/j.tcs.2026.116046_bib0029","series-title":"Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing","first-page":"386","article-title":"Universal approximations for TSP, steiner tree, and set cover","author":"Jia","year":"2005"},{"key":"10.1016\/j.tcs.2026.116046_bib0030","series-title":"ISCA","first-page":"289","article-title":"Transactional memory: architectural support for lock-free data structures","author":"Herlihy","year":"1993"},{"key":"10.1016\/j.tcs.2026.116046_bib0031","series-title":"Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing","first-page":"204","article-title":"Software transactional memory","author":"Shavit","year":"1995"},{"issue":"7","key":"10.1016\/j.tcs.2026.116046_bib0032","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3544836","article-title":"Scheduling IoT applications in edge and fog computing environments: a taxonomy and future directions","volume":"55","author":"Goudarzi","year":"2022","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.tcs.2026.116046_bib0033","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12243-016-0527-6","article-title":"Scheduling internet of things applications in cloud computing","volume":"72","author":"Narman","year":"2017","journal-title":"Ann. Telecommun."},{"key":"10.1016\/j.tcs.2026.116046_bib0034","doi-asserted-by":"crossref","unstructured":"T.S. Nikoui, A. Balador, A.m. Rahmani, Z. Bakhshi, Cost-aware task scheduling in fog-cloud environment, 2020 CSI\/CPSSI International Symposium on Real-Time and Embedded Systems and Technologies (RTEST) (2020) 1\u20138.","DOI":"10.1109\/RTEST49666.2020.9140118"},{"issue":"1","key":"10.1016\/j.tcs.2026.116046_bib0035","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10922-023-09774-9","article-title":"Genetic-based algorithm for task scheduling in fog\u2013cloud environment","volume":"32","author":"Khiat","year":"2024","journal-title":"J. Netw. Syst. Manag."},{"key":"10.1016\/j.tcs.2026.116046_bib0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.simpat.2022.102687","article-title":"Multi-objective fuzzy approach to scheduling and offloading workflow tasks in fog\u2013cloud computing","volume":"123","author":"Mokni","year":"2023","journal-title":"Simul. Model. Pract. Theory"},{"issue":"5","key":"10.1016\/j.tcs.2026.116046_bib0037","doi-asserted-by":"crossref","first-page":"2445","DOI":"10.3390\/s23052445","article-title":"Eeoa: cost and energy efficient task scheduling in a cloud-fog framework","volume":"23","author":"Kumar","year":"2023","journal-title":"Sensors"},{"issue":"1","key":"10.1016\/j.tcs.2026.116046_bib0038","first-page":"42","article-title":"Providing a cloud broker-based approach to improve the energy consumption and achieve a green cloud computing","volume":"138","author":"Nikoui","year":"2016","journal-title":"Int. J. Comput. Appl."},{"issue":"5","key":"10.1016\/j.tcs.2026.116046_bib0039","doi-asserted-by":"crossref","first-page":"2824","DOI":"10.1109\/TSC.2021.3079110","article-title":"Hierarchical scheduling mechanisms in multi-level fog computing","volume":"15","author":"Peixoto","year":"2021","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2026.116046_bib0040","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","article-title":"Primal\u2013dual algorithms for connected facility location problems","volume":"40","author":"Swamy","year":"2004","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116046_bib0041","series-title":"7th Conference on the Engineering of Computer Based Systems","first-page":"1","article-title":"Scheduling problems in distributed transactional memory","author":"Busch","year":"2021"},{"key":"10.1016\/j.tcs.2026.116046_bib0042","series-title":"International Conference on Algorithms and Complexity","first-page":"172","article-title":"Stable scheduling in transactional memory","author":"Busch","year":"2023"},{"key":"10.1016\/j.tcs.2026.116046_bib0043","series-title":"Symposium on Self-Stabilizing Systems","first-page":"347","article-title":"On transactional scheduling in distributed transactional memory systems","author":"Kim","year":"2010"},{"key":"10.1016\/j.tcs.2026.116046_bib0044","series-title":"Distributed Computing and Intelligent Technology","first-page":"67","article-title":"Ordered scheduling in control-flow distributed transactional memory","author":"Poudel","year":"2023"},{"key":"10.1016\/j.tcs.2026.116046_bib0045","series-title":"PPoPP","first-page":"247","article-title":"Software transactional memory for large scale clusters","author":"Bocchino","year":"2008"},{"key":"10.1016\/j.tcs.2026.116046_bib0046","series-title":"DISC","first-page":"121","article-title":"Exploiting locality in lease-based replicated transactional memory via task migration","author":"Hendler","year":"2013"},{"key":"10.1016\/j.tcs.2026.116046_bib0047","series-title":"International Colloquium on Structural Information and Communication Complexity","first-page":"112","article-title":"Lockless blockchain sharding with multiversion control","author":"Adhikari","year":"2023"},{"key":"10.1016\/j.tcs.2026.116046_bib0048","series-title":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","first-page":"451","article-title":"Stable blockchain sharding under adversarial transaction generation","author":"Adhikari","year":"2024"},{"issue":"1","key":"10.1016\/j.tcs.2026.116046_bib0049","doi-asserted-by":"crossref","DOI":"10.1145\/3365005","article-title":"A time- and message-optimal distributed algorithm for minimum spanning trees","volume":"16","author":"Pandurangan","year":"2019","journal-title":"ACM Trans. Algorith."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002963?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002963?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T10:00:35Z","timestamp":1783159235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":49,"alternative-id":["S0304397526002963"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116046","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A poly-log approximation for transaction scheduling in fog-cloud computing and beyond","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116046","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116046"}}