From Batch to Stream: Automatic Generation of Online Algorithms

被引:0
作者
Wang, Ziteng [1 ]
Pailoor, Shankara [1 ]
Prakash, Aaryan [1 ]
Wang, Yuepeng [2 ]
Dillig, Isil [1 ]
机构
[1] Univ Texas Austin, Austin, TX 78712 USA
[2] Simon Fraser Univ, Burnaby, BC, Canada
来源
PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL | 2024年 / 8卷 / PLDI期
基金
美国国家科学基金会; 加拿大自然科学与工程研究理事会;
关键词
Program Synthesis; Online Algorithms; Incremental Computation; Stream Processing; LIBRARY;
D O I
10.1145/3656418
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Online streaming algorithms, tailored for continuous data processing, offer substantial benefits but are often more intricate to design than their offline counterparts. This paper introduces a novel approach for automatically synthesizing online streaming algorithms from their offline versions. In particular, we propose a novel methodology, based on the notion of relational function signature (RFS), for deriving an online algorithm given its offline version. Then, we propose a concrete synthesis algorithm that is an instantiation of the proposed methodology. Our algorithm uses the RFS to decompose the synthesis problem into a set of independent subtasks and uses a combination of symbolic reasoning and search to solve each subproblem. We implement the proposed technique in a new tool called Opera and evaluate it on over 50 tasks spanning two domains: statistical computations and online auctions. Our results show that Opera can automatically derive the online version of the original algorithm for 98% of the tasks. Our experiments also demonstrate that Opera significantly outperforms alternative approaches, including adaptations of SyGuS solvers to this problem as well as two of Opera's own ablations.
引用
收藏
页数:26
相关论文
共 50 条
[41]   Efficient Online Linear Optimization with Approximation Algorithms [J].
Garber, Dan .
MATHEMATICS OF OPERATIONS RESEARCH, 2021, 46 (01) :204-220
[42]   Online Algorithms for Matching Platforms with Multichannel Traffic [J].
Manshadi, Vahideh ;
Rodilitz, Scott ;
Saban, Daniela ;
Suresh, Akshaya .
MANAGEMENT SCIENCE, 2024,
[43]   Optimal online algorithms for minimax resource scheduling [J].
Hunsaker, B ;
Kleywegt, AJ ;
Savelsbergh, MWP ;
Tovey, CA .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (04) :555-590
[44]   Comparing online algorithms for bin packing problems [J].
Leah Epstein ;
Lene M. Favrholdt ;
Jens S. Kohrt .
Journal of Scheduling, 2012, 15 :13-21
[45]   Optimal online algorithms for multidimensional packing problems [J].
Epstein, L ;
Van Stee, R .
SIAM JOURNAL ON COMPUTING, 2005, 35 (02) :431-448
[46]   Online Algorithms of Task Allocation in Spatial Crowdsourcing [J].
Sun, Yong ;
Wang, Jun ;
Tan, Wenan .
12TH CHINESE CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK AND SOCIAL COMPUTING (CHINESECSCW 2017), 2017, :205-208
[47]   Relaxing the Irrevocability Requirement for Online Graph Algorithms [J].
Boyar, Joan ;
Favrholdt, Lene M. ;
Kotrbcik, Michal ;
Larsen, Kim S. .
ALGORITHMICA, 2022, 84 (07) :1916-1951
[48]   Entropy-Based Bounds for Online Algorithms [J].
Pandurangan, Gopal ;
Upfal, Eli .
ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (01)
[49]   Competitive Analysis of Algorithms for an Online Distribution Problem [J].
Barba, Alessandro ;
Bertazzi, Luca ;
Golden, Bruce L. .
ALGORITHMS, 2024, 17 (06)
[50]   Quantum Online Streaming Algorithms with Logarithmic Memory [J].
Khadiev, Kamil ;
Khadieva, Aliya .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2021, 60 (02) :608-616