# Costless: Optimizing Cost of Serverless Computing through Function Fusion and Placement

@article{Elgamal2018CostlessOC,
title={Costless: Optimizing Cost of Serverless Computing through Function Fusion and Placement},
author={Tarek Elgamal and Atul Sandur and Klara Nahrstedt and Gul A. Agha},
journal={2018 IEEE/ACM Symposium on Edge Computing (SEC)},
year={2018},
pages={300-312}
}
• Published 1 October 2018
• Computer Science
• 2018 IEEE/ACM Symposium on Edge Computing (SEC)
Serverless computing has recently experienced significant adoption by several applications, especially Internet of Things (IoT) applications. In serverless computing, rather than deploying and managing dedicated virtual machines, users are able to deploy individual functions, and pay only for the time that their code is actually executing. However, since serverless platforms are relatively new, they have a completely different pricing model that depends on the memory, duration, and the number…

## Figures and Tables from this paper

Skedulix: Hybrid Cloud Scheduling for Cost-Efficient Execution of Serverless Applications
• Computer Science
2020 IEEE 13th International Conference on Cloud Computing (CLOUD)
• 2020
A greedy algorithm that dynamically determines both the order and placement of each function execution using predictive models of function execution time and network latencies is proposed for scheduling multifunction serverless applications over a hybrid public-private cloud.
Sizeless: predicting the optimal size of serverless functions
• Computer Science
Middleware
• 2021
This paper introduces an approach to predict the optimal resource size of a serverless function using monitoring data from a single resource size, which enables cloud providers to implement resource sizing on a platform level and automate the last resource management task associated with serverless functions.
Exploring the cost and performance benefits of AWS step functions using a data processing pipeline
• Computer Science
UCC
• 2021
This work extensively evaluate the state-of-the-art function orchestrator AWS Step Functions (ASF) with respect to its performance and cost and conducts a series of experiments using a serverless data processing pipeline application developed as both ASF Standard and Express workflows.
Performance Optimization for Edge-Cloud Serverless Platforms via Dynamic Task Placement
• Computer Science
2020 20th IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGRID)
• 2020
A framework for performance optimization in serverless edge-cloud platforms using dynamic task placement for smart edge devices that need to perform processing tasks on input data in real to near-real time is presented.
LIBRA: An Economical Hybrid Approach for Cloud Applications with Strict SLAs
• Computer Science
2021 IEEE International Conference on Cloud Engineering (IC2E)
• 2021
The results show that LIBRA outperforms other resource-provisioning policies, including a recent hybrid approach - LIBRA achieves more than 85% reduction in SLA violations and up to 53% cost savings.
SLAM: SLO-Aware Memory Optimization for Serverless Applications
• Computer Science
• 2022
This work designed a tool called SLAM, which uses distributed tracing to detect the relationship among the FaaS functions within a serverless application, and determines the optimal memory conﬁguration for the given serverless applications based on the minimum cost or minimum execution time.
Harnessing the Potential of Function-Reuse in Multimedia Cloud Systems
• Computer Science
IEEE Transactions on Parallel and Distributed Systems
• 2021
This work proposes a mechanism to identify various types of “mergeable” tasks and aggregate them to improve the QoS and mitigate the incurred cost, and develops novel approaches to determine when and how to perform task aggregation.
Sequoia: enabling quality-of-service in serverless computing
• Computer Science
SoCC
• 2020
Results with controlled and realistic workloads show Sequoia seamlessly adapts to policies, eliminates mid-chain drops, reduces queuing times by up to 6.4X, enforces tight chain-level fairness, and improves run-time performance up to 25X.
Spock: Exploiting Serverless Functions for SLO and Cost Aware Resource Procurement in Public Cloud
• Computer Science
2019 IEEE 12th International Conference on Cloud Computing (CLOUD)
• 2019
Spock is proposed, a new scalable and elastic control system that exploits both VMs and serverless functions to reduce cost and ensure SLO for elastic web services and yields significant cost savings.
Survey on Placement Methods in the Edge and Beyond
• Computer Science
IEEE Communications Surveys & Tutorials
• 2021
This survey provides a comprehensive summary and a structured taxonomy of the vast research on placement of computational entities in emerging edge infrastructures and reveals some important research gaps in the current literature.

## References

SHOWING 1-10 OF 22 REFERENCES
A Cost-Aware Elasticity Provisioning System for the Cloud
• Computer Science
2011 31st International Conference on Distributed Computing Systems
• 2011
In this paper we present Kingfisher, a {\em cost-aware} system that provides efficient support for elasticity in the cloud by (i) leveraging multiple mechanisms to reduce the time to transition to
Auto-scaling to minimize cost and meet application deadlines in cloud workflows
• Computer Science
2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
• 2011
This paper presents an approach whereby the basic computing elements are virtual machines (VMs) of various sizes/costs, jobs are specified as workflows, users specify performance requirements by assigning (soft) deadlines to jobs, and the goal is to ensure all jobs are finished within their deadlines at minimum financial cost.
EC2 Performance Analysis for Resource Provisioning of Service-Oriented Applications
• Computer Science
ICSOC/ServiceWave Workshops
• 2009
It is demonstrated that the performance of virtual instances in Amazon EC2 is relatively stable over time with fluctuations of mean response time within at most 8% of the longterm average.
Hermes: Latency optimal task assignment for resource-constrained mobile computing
• Computer Science
2015 IEEE Conference on Computer Communications (INFOCOM)
• 2015
Her Hermes, a novel fully polynomial time problem approximation scheme (FPTAS) algorithm, is proposed to solve the problem to minimize the latency while meeting prescribed resource utilization constraints.
Distributed Scheduling of Event Analytics across Edge and Cloud
• Computer Science
ACM Trans. Cyber Phys. Syst.
• 2018
This study proposes a Genetic Algorithm (GA) meta-heuristic to solve the optimization problem for energy-aware placement of CEP queries, composed as an analytics dataflow, across a collection of edge and Cloud resources, with the goal of minimizing the end-to-end latency for the dataflow.
Risk Aware Resource Allocation for Clouds
A novel approach that utilizes financial option theory to simultaneously mitigate risk and minimize cost for cloud users is proposed and a novel on-line policy using American options that outperforms base-line spot policies in terms of price variance reduction against high risk factors is proposed.
The Case for VM-Based Cloudlets in Mobile Computing
• Computer Science
IEEE Pervasive Computing
• 2009
The results from a proof-of-concept prototype suggest that VM technology can indeed help meet the need for rapid customization of infrastructure for diverse applications, and this article discusses the technical obstacles to these transformations and proposes a new architecture for overcoming them.
Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
• Computer Science
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
• 2008
Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data are generated by a large number
Fibonacci heaps and their uses in improved network optimization algorithms
• Physics
JACM
• 1987
Using F-heaps, a new data structure for implementing heaps that extends the binomial queues proposed by Vuillemin and studied further by Brown, the improved bound for minimum spanning trees is the most striking.
Characterizing and profiling scientific workflows
• Computer Science
Future Gener. Comput. Syst.
• 2013