LEADER 07543nam 22007695 450 001 996465496003316 005 20230222181231.0 010 $a3-319-74875-0 024 7 $a10.1007/978-3-319-74875-7 035 $a(CKB)4100000001794910 035 $a(DE-He213)978-3-319-74875-7 035 $a(MiAaPQ)EBC6281463 035 $a(MiAaPQ)EBC5591807 035 $a(Au-PeEL)EBL5591807 035 $a(OCoLC)1020793426 035 $a(PPN)223955477 035 $a(EXLCZ)994100000001794910 100 $a20180127d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithmic Aspects of Cloud Computing$b[electronic resource] $eThird International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers /$fedited by Dan Alistarh, Alex Delis, George Pallis 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (X, 171 p. 60 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10739 311 $a3-319-74874-2 327 $aIntro -- Preface -- Organization -- Contents -- Invited Paper -- Warehouse-Scale Computing in the Post-Moore Era -- 1 Heterogeneity in Platforms -- 2 Massive Data Analytics -- References -- Optimization for Cloud Services -- A Walk in the Clouds: Routing Through VNFs on Bidirected Networks -- 1 Introduction -- 1.1 Model -- 1.2 Contributions -- 1.3 Related Work -- 1.4 Paper Organization -- 2 The Unordered BWRP -- 2.1 An Introduction to (Unordered) Waypoint Routing -- 2.2 Hardness and Improved Approximation -- 3 Ordered BWRP -- 3.1 A Constant Number of Waypoints Is Feasible -- 3.2 Optimally Solving OBWRP Is NP-Hard -- 3.3 Optimality on the Cactus with Constant Capacity -- 4 Conclusion -- References -- Service Chain Placement in SDNs -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Results -- 2 Preliminaries -- 3 Hardness Results -- 4 Algorithms for Physical Directed Acyclic Graphs -- 4.1 Placing a Sub-chain in a Physical Node -- 4.2 Placing a Service Chain -- 4.3 Placing a Service Chain with a Latency Bound -- 4.4 FPTAS for General Costs -- 5 General Networks -- References -- Tight Approximability of the Server Allocation Problem for Real-Time Applications -- 1 Introduction -- 2 Approximation Algorithms -- 2.1 Case 1: Metric in SU -- 2.2 Case 2: Metric in S -- 3 Hardness of Approximation -- 4 Experiments -- 4.1 Acceleration of the Proposed Algorithms -- 4.2 Experiment 1: Following Kawabata et al. KCO16 -- 4.3 Experiment 2: With More Servers -- References -- Computing with Risk and Uncertainty -- Risk Aware Stochastic Placement of Cloud Services: The Case of Two Data Centers -- 1 Introduction -- 2 The Normal Two Bin Case -- 2.1 The Sorting Algorithm -- 2.2 The Correctness Proof -- 3 Other Cost Functions -- 4 Non-normal Distributions -- 4.1 The Berry-Esseen Theorem -- 4.2 Approximating General Independent Distributions with the Normal Distribution. 327 $a5 Simulation Results -- 5.1 Results for Synthetic Normally Distributed Data -- 5.2 Results for Real Data -- 6 Conclusions -- A Proving SP-MED Falls into Our Framework -- B Proving SP-MWOP Falls into Our Framework -- C Proving SP-MOP Falls into Our Framework -- D Error Induced by the Reduction to the Normal Distribution -- E Error Induced by Outputting an Integral Solution -- E.1 SP-MED -- E.2 SP-MWOP -- F Unbalancing Bin Capacities Is Always Better -- References -- Towards an Algebraic Cost Model for Graph Operators -- 1 Introduction -- 2 Related Work -- 3 Algebraic Framework -- 3.1 Data Model -- 3.2 Base Operators -- 3.3 Cost Model -- 4 Graph Operator Decomposition -- 4.1 Finding Cycles -- 4.2 Random Walk, Path, and Star-Path -- 4.3 Grid Query -- 5 Experiments -- 5.1 Experimental Setup -- 5.2 Results and Discussion -- 5.3 Including Label Information in the Cost Model -- 6 Conclusions -- A Appendix -- A.1 Random 4-Walk Benchmarks -- References -- Computing Probabilistic Queries in the Presence of Uncertainty via Probabilistic Automata -- 1 Introduction and Motivation -- 2 Related Work -- 3 Definitions and Notation -- 4 Using Probabilistic Automata to Answer Queries -- 4.1 Constructing Automata from Queries -- 4.2 The General Method -- 5 Conclusion and Future Work -- References -- Scaling and Cost Models in the Cloud -- Improving Rule-Based Elasticity Control by Adapting the Sensitivity of the Auto-Scaling Decision Timeframe -- 1 Introduction -- 2 Motivation -- 3 The AdaFrame Library -- 3.1 Adaptive Monitoring Estimation Model -- 3.2 Runtime Change Detection -- 4 Evaluation -- 4.1 Testbed 1: Scaling a NoSQL Document Store -- 4.2 Testbed 2: Scaling the Business Logic of a Web Service -- 5 Related Work -- 6 Conclusion -- References -- Risk Aware Stochastic Placement of Cloud Services: The Multiple Data Center Case -- 1 Introduction. 327 $a2 Problem Formulation -- 3 Summary of Our Results for Two Data Centers -- 4 Three Cost Functions -- 5 The Double Sorting Framework for More Than Two Data Centers -- 6 A Dynamic Programming Algorithm -- 7 The Moving Sticks (MVS) Algorithm for SP-MWOP -- 8 The Generalized Moving Sticks (GMVS) Algorithm -- 9 Conclusions -- A Simulation Results -- A.1 Results for Synthetic Normally Distributed Data -- References -- Automatic Scaling of Resources in a Storm Topology -- 1 Introduction -- 2 Preliminaries -- 3 Architecture -- 4 Experimental Evaluation -- 5 Related Work -- 6 Conclusions -- References -- Author Index. 330 $aThis book constitutes the thoroughly refereed post-conference proceedings of the Second International Workshop on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2017, held in Vienna, Austria, in September 2017. The 9 revised full papers were carefully reviewed and selected from 27 submissions.  The aim of the workshop is to present research activities and results on topics related to algorithmic, design, and development aspects of modern cloud-based systems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10739 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aApplication software 606 $aArtificial intelligence?Data processing 606 $aComputer networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer and Information Systems Applications 606 $aData Science 606 $aComputer Communication Networks 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aApplication software. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer and Information Systems Applications. 615 24$aData Science. 615 24$aComputer Communication Networks. 676 $a004 702 $aAlistarh$b Dan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDelis$b Alex$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPallis$b George$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465496003316 996 $aAlgorithmic Aspects of Cloud Computing$92554588 997 $aUNISA