Algorithmic Aspects of Cloud Computing [[electronic resource] ] : Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers / / edited by Dan Alistarh, Alex Delis, George Pallis |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (X, 171 p. 60 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Application software Artificial intelligence—Data processing Computer networks Discrete Mathematics in Computer Science Computer and Information Systems Applications Data Science Computer Communication Networks |
ISBN | 3-319-74875-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- 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.
5 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. 2 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. |
Record Nr. | UNISA-996465496003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Aspects of Cloud Computing [[electronic resource] ] : Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers / / edited by Dan Alistarh, Alex Delis, George Pallis |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (X, 171 p. 60 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Application software Artificial intelligence—Data processing Computer networks Discrete Mathematics in Computer Science Computer and Information Systems Applications Data Science Computer Communication Networks |
ISBN | 3-319-74875-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- 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.
5 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. 2 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. |
Record Nr. | UNINA-9910349261303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Euro-Par 2023: Parallel Processing Workshops [[electronic resource] ] : Euro-Par 2023 International Workshops, Limassol, Cyprus, August 28 – September 1, 2023, Revised Selected Papers, Part I / / edited by Demetris Zeinalipour, Dora Blanco Heras, George Pallis, Herodotos Herodotou, Demetris Trihinas, Daniel Balouek, Patrick Diehl, Terry Cojean, Karl Fürlinger, Maja Hanne Kirkeby, Matteo Nardellli, Pierangelo Di Sanzo |
Autore | Zeinalipour Demetris |
Edizione | [1st ed. 2024.] |
Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
Descrizione fisica | 1 online resource (369 pages) |
Disciplina |
621.39
004.6 |
Altri autori (Persone) |
Blanco HerasDora
PallisGeorge HerodotouHerodotos TrihinasDemetris BalouekDaniel DiehlPatrick CojeanTerry FürlingerKarl KirkebyMaja Hanne |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer engineering
Computer networks Operating systems (Computers) Computer Engineering and Networks Operating Systems |
ISBN | 3-031-50684-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | International Workshop on Scalable Compute Continuum (WSCC) -- Compute Continuum: What Lies Ahead? -- An Algorithm for Tunable Memory Compression of Time-Based Windows for Stream Aggregates -- Latency-aware Placement of Stream Processing Operators -- Scalable and Efficient Architecture for Random Forest on FPGA-based Edge Computing -- MTCL: a Multi-Transport Communication Library -- Towards a Scalable Compute Continuum platform applied to electrical energy forecasting -- Evaluation of Adaptive Micro-batching Techniques for GPU-accelerated Stream Processing -- TDLPP Workshop Preface -- Sparse-aware CARM: Rooflining locality of sparse computations -- Enhancing Performance Monitoring in C/C++ Programs with EDPM: A Domain-Specific Language for Performance Monitoring -- Leveraging HPC Profiling & Tracing Tools to Understand the Performance of Particle-in-Cell Monte Carlo Simulations -- Performance Prediction for Sparse Matrix Vector Multiplication using Structure-dependent Features -- Analyzing One-Sided Communication Using Memory Access Diagrams -- Preface QuickPar23 -- A Framework for Performance Optimization of Internet of Things Applications -- Streaming IoT Data and the Quantum Edge: A Classic/Quantum Machine Learning Use Case -- Dynamic Adaptation of Urgent Applications in the Edge-to-Cloud Continuum -- HeteroPar 2023 Preface -- Leveraging MLIR for Loop Vectorization and GPU Porting of FFT Libraries -- Enabling Dynamic Selection of Implementation Variants in Component-Based Parallel Programming for Heterogeneous Systems -- MassiveClicks: A Massively-parallel Framework for Efficient Click Models Training -- Sparse matrix-vector product for the bmSparse matrix format in GPUs -- Power Estimation Models for Edge Computing Devices -- A performance analysis of leading many-core technologies for Cellular Automata execution -- An approach to performance portability through generic programming -- Boosting the Performance of Object Tracking with a Half-Precision Particle Filter on GPU -- Tall-and-Skinny QR Factorization for Clusters of GPUs using High-Performance Building Blocks -- Scheduling Fork-Joins to Heterogeneous Processors -- jPackFaaS: Profiling Java Serverless Functions Deployment Package Size in Federated FaaS -- ExaNBody : a HPC framework for N-Body applications. |
Record Nr. | UNINA-9910847580903321 |
Zeinalipour Demetris | ||
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Euro-Par 2023: Parallel Processing Workshops [[electronic resource] ] : Euro-Par 2023 International Workshops, Limassol, Cyprus, August 28 – September 1, 2023, Revised Selected Papers, Part II / / edited by Demetris Zeinalipour, Dora Blanco Heras, George Pallis, Herodotos Herodotou, Demetris Trihinas, Daniel Balouek, Patrick Diehl, Terry Cojean, Karl Fürlinger, Maja Hanne Kirkeby, Matteo Nardellli, Pierangelo Di Sanzo |
Autore | Zeinalipour Demetris |
Edizione | [1st ed. 2024.] |
Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
Descrizione fisica | 1 online resource (347 pages) |
Disciplina |
621.39
004.6 |
Altri autori (Persone) |
Blanco HerasDora
PallisGeorge HerodotouHerodotos TrihinasDemetris BalouekDaniel DiehlPatrick CojeanTerry FürlingerKarl KirkebyMaja Hanne |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer engineering
Computer networks Operating systems (Computers) Computer Engineering and Networks Operating Systems |
ISBN | 3-031-48803-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The 2nd International Workshop on Resource AWareness of Systems and Society (RAW 2023) -- Performance and energy aware training of a deep neural network in a multi-GPU environment with power capping -- GPPRMon: GPU Runtime Memory Performance and Power Monitoring Tool -- Towards Resource-Efficient DNN Deployment for Traffic Object Recognition: From Edge to Fog -- The Implementation of Battery Charging Strategy for IoT Nodes -- subMFL: Compatible subModel Generation for Federated Learning in Device Heterogeneous Environment -- Towards a Simulation as a Service Platform for the Cloud-to-Things Continuum -- Cormas: The Software for Participatory Modelling and its Application for Managing Natural Resources in Senegal -- Asynchronous Many-Task systems for Exascale (AMTE) -- Malleable APGAS Programs and their Support in Batch Job Schedulers -- Task-Level Checkpointing for Nested Fork-Join Programs using Work Stealing -- Making Uintah Performance Portable for Department of Energy Exascale Testbeds -- Benchmarking the Parallel 1D Heat Equation Solver in Chapel, Charm++, C++, HPX, Go, Julia, Python, Rust, Swift, and Java -- PECS 2023 - 2-page report -- Parallel auto-scheduling of counting queries in machine learning applications on HPC systems -- Energy Efficiency Impact of Processing in Memory: A Comprehensive Review of Workloads on the UPMEM Architecture -- Enhancing Supercomputer Performance with Malleable Job Scheduling Strategies -- A Performance Modelling-driven Approach to Hardware Resource Scaling -- Applications and Benefits of UPMEM commercial Massively parallel Processing-In-Memory (PIM) Platform (ABUMPIMP) Minisymposium -- Adaptive HPC Input/Output Systems -- Dynamic Allocations in a Hierarchical Parallel Context -- Designing A Sustainable Serverless Graph Processing Tool on the Computing Continuum -- Diorthotis: A Parallel Batch Evaluator for Programming Assignments -- Experiences and Lessons Learned from PHYSICS: A Framework for Cloud Development with FaaS -- Improved IoT Application Placement in Fog Computing through Postponement -- High-Performance Distributed Computing with Smartphones -- Blockchain-based Decentralized Authority for Complex Organizational Structures Management -- Transparent Remote OpenMP Offloading based on MPI -- DAPHNE Runtime: Harnessing Parallelism for Integrated Data Analysis Pipelines -- Exploring Factors Impacting Data Offloading Performance in Edge and Cloud Environments -- HEAppE Middleware: From desktop to HPC -- Towards Energy-Aware Machine Learning in Geo-Distributed IoT Settings -- OpenCUBE: Building an Open Source Cloud Blueprint with EPI Systems -- BDDC Preconditioning in the Microcard Project -- Online Job Failure Prediction in an HPC system -- Exploring Mapping Strategies for Co-allocated HPC Applications -- A polynomial-time algorithm for detecting potentially unbounded places in a Petri net-based concurrent system -- Data Assimilation with Ocean Models: A Case Study of Reduced Precision and Machine Learning in the Gulf of Mexico -- Massively parallel EEG algorithms for pre-exascale architectures -- Online Job Failure Prediction in an HPC System -- Transitioning to Smart Sustainable Cities Based on Cutting-Edge Technological Improvements -- Algorithm Selection of MPI Collectives Considering System Utilization -- Service Management in Dynamic Edge Environments -- Path Plan Optimisation for UAV Assisted Data Collection in Large Areas -- Efficiently Distributed Federated Learning. |
Record Nr. | UNINA-9910847587003321 |
Zeinalipour Demetris | ||
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Service-Oriented Computing - ICSOC 2011 Workshops [[electronic resource] ] : ICSOC 2011, International Workshops WESOA, NFPSLAM-SOC, and Satellite Events, Paphos, Cyprus, December 5-8, 2011. Revised Selected Papers / / edited by George Pallis, Mohamed Jmaiel, Anis Charfi, Sven Graupner, Yücel Karabulut, Sam Guinea, Florian Rosenberg, Michael Sheng, Cesare Pautasso, Sonia Ben Mokhtar |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XII, 334 p. 106 illus.) |
Disciplina | 004.6/54 |
Collana | Programming and Software Engineering |
Soggetto topico |
Application software
Software engineering Information technology Business—Data processing Information storage and retrieval Computer communication systems Information Systems Applications (incl. Internet) Software Engineering IT in Business Information Storage and Retrieval Computer Communication Networks Computer Appl. in Administrative Data Processing |
ISBN | 3-642-31875-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465496603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|