A poly-log approximation for transaction scheduling in fog-cloud computing and beyond

DOI10.1016/J.TCS.2026.116046MaRDI QIDQ7263468zbMATH OpenFDO

Authors Ramesh Adhikari, Costas Busch, Pavan Poudel

Publication date 12 June 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116046

zbMATH Keywords

communication costdistributed systemsdoubling dimension graphfog-cloud computingshared objecttransaction scheduling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A time- and message-optimal distributed algorithm for minimum spanning trees
• Adaptive locks: combining transactions and locks for efficient concurrency
• An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs
• Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
• Compact Routing in Unit Disk Graphs
• Distributed Computing
• Distributed transactional memory for general networks
• Distributed transactional memory for metric-space networks
• Dynamic scheduling in distributed transactional memory
• Flexible scheduling of transactional memory on trees
• scientific article; zbMATH DE number 2089384 (Why is no real title available?)
• Impossibility results for distributed transactional memory
• Lockless blockchain sharding with multiversion control
• Low-congestion shortcut and graph parameters
• On hierarchical routing in doubling metrics
• On the locality of bounded growth
• Primal-dual algorithms for connected facility location problems
• Software transactional memory
• Stable scheduling in transactional memory
• Universal approximations for TSP, Steiner tree, and set cover

This page was built for publication: A poly-log approximation for transaction scheduling in fog-cloud computing and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263468)