Jul 2026· 2026 7th International Conference on Smart Systems and Inventive Technology (ICSSIT)· pp. 1936-1942· 0 citations· 13 references
Abstract
Serverless computing is a powerful paradigm which enables fine-grained, Event-driven execution of lightweight functions by abstracting infrastructure management. In dynamic heterogeneous Kubernetes clusters, there is a need for Adaptive learning based effective function placement scheduler to solve critical challenge in minimizing latency and optimizing overall system performance. In this proposed framework, we integrate real-time node and function context derived directly from Kubernetes and Knative environment. It incorporates parameters such as CPU and memory availability, concurrency, execution time, and priority. With this a custom scheduler is developed by dynamically mapping incoming serverless workloads to suitable nodes based on learned reward mechanisms. Here it uses multi armed bandits algorithms for intelligent function placement in serverless platforms such as Knative deployed on Kubernetes cluster with Knative workloads and extensive experiments are conducted using approximately 300 dynamically generated Knative functions deployed on a Kubernetes cluster. Our system model using contextual features including cold start latency, warm start latency, request latency, CPU capacity, memory availability, throughput etc. Functions (or containers) are characterized by their resource demands and expected execution time. Our experimental results show that Decision Tree Bandits achieves slightly better performance than the default Kubernetes scheduler by achieving lower latency, higher throughput. These findings highlight the effectiveness of the DTB-based scheduling approach in enhancing responsiveness and efficiency in serverless Kubernetes environments.
A hybrid congestion-aware autoscaling framework for serverless platforms inspired by TCP slow-start and congestion control principles is proposed, which significantly improves latency performance, scalability, and resource efficiency in serverless environments.
Mohammad Tari, Mostafa Ghobayee-Arani, Jafar Pouramini· International Journal of Clo...· 0 citations
The use of containerized cloud platforms has now become inevitable for latency-sensitive applications; but resource contention between different workloads often creates the problem of noisy neighbors, which causes higher response latency and poor service quality. We present SCX_MUS (Scheduler Extensions for Multi-User Scheduling), a dynamic priority scheduling framework at the kernel level that enhances the CPU allocation to latency-sensitive containers running in Kubernetes environments. The proposed framework uses Linux sched_ext architecture along with the extension of eBPF to support dynamic cgroup-based scheduling through runtime awareness. A lightweight user space component continuously observes the workload of Kubernetes and adjusts the scheduling priorities of the containers without any need for recompiling the kernel or restarting containers. The experimental evaluation of the proposed framework was done with the help of Redis and stress-ng workloads in the same benchmarking condition compared to the native Linux Completely Fair Scheduler (CFS). The experimental results reveal a significant improvement in terms of latency reduction, enhanced throughput, efficient utilization of CPU resources, and stable performance of scheduling under resource contention.
T. Rajkumar, Nishanth D., Prabu M. et al.· Journal of Soft Computing Pa...· 0 citations
Adaptive CPU scheduling that responds to dynamic workload characteristics remains an open challenge for minimal operating systems. Traditional schedulers employ static parameters unsuitable for heterogeneous workloads, while recent machine learning approaches incur overhead inappropriate for resource-constrained environments. This paper presents Load-Aware Adaptive Scheduling (LAAS), a novel approach that integrates real-time system load classification with entropy-inspired process scoring to enable dynamic scheduling decisions. The core innovation—a load-dependent scoring formula where weight values adapt based on system load class—represents the first application of entropy principles to CPU process selection logic in a minimal kernel. LAAS achieves adaptation without machine learning runtime overhead (sub-0.5% CPU vs. 1% for ML-based approaches) and is suitable for minimal monolithic kernels (approximately 1,500 LOC total implementation). Experimental evaluation on synthetic workloads demonstrates 31% reduction in average waiting time, 28% reduction in context switches, and 18% improvement in CPU utilization compared to standard Round-Robin scheduling, while achieving a Jain fairness index of 0.94 in our test scenarios. These results indicate that load-aware, entropy-inspired adaptive scheduling is practically feasible in severely resource-constrained kernel environments.
Durgesh Kumar, Aviskha Talukdar, Nandani et al.· 2026 7th International Confe...· 0 citations
The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, resource contention, and timing jitter, making standard schedulers unsuitable for hard-deadline workloads. Moreover, most approaches focus on computational placement, while communication is abstracted or treated as a secondary cost term. As a result, bounded-latency routing and deterministic task execution are rarely co-optimized under a unified timing model. This paper addresses these gaps by utilizing a managed Time-Triggered Edge–Fog–Cloud (TTEFC) architecture that supports safety-critical workloads, orchestrates IEEE Time-Sensitive Networking (TSN) for local intra-domain communication, and uses IETF Deterministic Networking (DetNet) for routed inter-domain paths. On this infrastructure, a hierarchical genetic algorithm (HGA) is proposed to jointly schedule partition-to-execution-location allocation, partition execution order, inter-partition route selection, and negotiated per-partition time budgets that act as temporal boundaries for parallel partition-level optimizers. An adaptive slack reallocation operator redistributes unused temporal slack from over-satisfied partitions to budget-violating partitions, improving feasibility convergence. Experiments on synthetic DAG workloads with 100–500 tasks compare the proposed HGA against HEFT and round-robin baselines. These baselines are included as scoped external references to contextualize the end-to-end scheduling performance of the proposed method. Ablation results show that slack reallocation improves partition-budget feasibility, reaches feasible budget assignments earlier, and produces tighter budget–makespan alignment than feedback-free and static-budget variants. An automotive-characteristic DAG case study further evaluates the method on an application-oriented workload under the same timing and communication assumptions.
Omar Hekal, Josepaul Paulachan, Daniel Onwuchekwa et al.· Future Internet· 0 citations
CELLServe formalizes SLO-constrained joint resource provisioning as an optimization problem with a dedicated algorithm, and introduces an opportunistic instance merging strategy for decode phase functions to reclaim fragmented resources.
Zejian Wang, Nan Lin, Zinuo Cai et al.· ACM Transactions on Architec...· 0 citations
This paper presents a serverless platform-driven CPU load balancing framework that enables the control plane to directly influence CPU scheduling through a custom Linux scheduler built on SchedExt(SCX).