Anupama Mampage

dblp:293/8457 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2025
0000-0002-8155-3584ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 first-author · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
job scheduling
0.912025
Deep Reinforcement Learning for Scheduling Applications in Serverless and Serverful Hybrid Computing Environments · IEEE Trans. Serv. Comput. 2025
Cloud and datacenter computing
resource management
0.912025
Deep Reinforcement Learning for Scheduling Applications in Serverless and Serverful Hybrid Computing Environments · IEEE Trans. Serv. Comput. 2025
Cloud and datacenter computing
serverless computing
0.912025
Deep Reinforcement Learning for Scheduling Applications in Serverless and Serverful Hybrid Computing Environments · IEEE Trans. Serv. Comput. 2025
Machine learning › Reinforcement learning
deep reinforcement learning
0.312025
Deep Reinforcement Learning for Scheduling Applications in Serverless and Serverful Hybrid Computing Environments · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

proximal policy optimization · 1.7actor-critic · 1.7
YearPublicationVenuePosition
2025 A deep reinforcement learning based algorithm for time and cost optimized scaling of serverless applications
Anupama Mampage, Shanika Karunasekera, Rajkumar Buyya
Future Gener. Comput. Syst.1
2025 Deep Reinforcement Learning for Scheduling Applications in Serverless and Serverful Hybrid Computing Environments
abstract
Serverless computing has gained popularity as a novel cloud execution model for applications in recent times. Businesses constantly try to leverage this new paradigm to add value to their revenue streams. The serverless eco-system accommodates many application domains successfully. However, its inherent properties such as cold start delays and relatively high per unit charges appear as a shortcoming for certain application workloads, when compared to a traditional Virtual Machine (VM) based execution scenario. A few research works exist, that study how serverless computing could be used to mitigate the challenges in a VM based cluster environment, for certain applications. In contrast, this work proposes a generalized framework for determining which workloads are best able to reap benefits of a serverless computing environment. In essence, we present a potential hybrid scheduling solution for exploiting the benefits of both a serverless and a VM based serverful computing environment. Our proposed framework leverages the actor-critic based deep reinforcement learning architecture coupled with the proximal policy optimization technique, in determining the best scheduling decision for workload executions. Extensive experiments conducted demonstrate the effectiveness of such a solution, in terms of user cost and application performance, with improvements of up to 44% and 11% respectively.
Anupama Mampage, Shanika Karunasekera, Rajkumar Buyya
IEEE Trans. Serv. Comput.1
2023 Deep reinforcement learning for application scheduling in resource-constrained, multi-tenant serverless computing environments
Anupama Mampage, Shanika Karunasekera, Rajkumar Buyya
Future Gener. Comput. Syst.1
2021 Deadline-aware Dynamic Resource Management in Serverless Computing Environments
abstract
Serverless computing enables rapid application development and deployment by composing loosely coupled microservices at a scale. This emerging paradigm greatly unburdens the users of cloud environments, from the need to provision and manage the underlying cloud resources. With this shift in responsibility, the cloud provider faces the challenge of providing acceptable performance to the user without compromising on reliability, while having minimal knowledge of the application requirements. Sub-optimal resource allocations, specifically the CPU resources, could result in the violation of performance requirements of applications. Further, the fine-grained serverless billing model only charges for resource usage in terms of function execution time. At the same time, the provider has to maintain the underlying infrastructure in always-on mode to facilitate asynchronous function calls. Thus, achieving optimum utilization of cloud resources without compromising on application requirements is of high importance to the provider. Most of the current works only focus on minimizing function execution times caused by delays in infrastructure set up and reducing resource costs for the end-user. However, in this paper, we focus on both the provider and user's perspective and propose a function placement policy and a dynamic resource management policy for applications deployed in serverless computing environments. The policies minimize the resource consumption cost for the service provider while meeting the user's application requirement, i.e., deadline. The proposed solutions are sensitive to deadline and efficiently increase the resource utilization for the provider, while dynamically managing resources to improve function response times. We implement and evaluate our approach through simulation using ContainerCloudSim toolkit. The proposed function placement policy when compared with baseline scheduling techniques can reduce resource consumption by up to three times. The dynamic resource allocation policy when evaluated with a fixed resource allocation policy and a proportional CPU-shares policy shows improvements of up to 25% in meeting the required function deadlines.
Anupama Mampage, Shanika Karunasekera, Rajkumar Buyya
CCGRID1