PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 15, 2026Journal on Advances in Signal Processing0 citationsOpen Access

Joint optimization of resource allocation and tasks scheduling in RDMA-enabled edge computing networks

View Full Paper
YDYuchi DongYYYaqi YanChina Energy Engineering Corporation (China)YAYing An

Key Points

  • This research aims to minimize long-term energy consumption and maintain queue stability in RDMA-enabled edge computing networks.
  • Adopted a Lyapunov optimization framework to derive a sequence of deterministic subproblems.
  • Proposed low-complexity water-level balancing algorithm for task scheduling using convex relaxation and KKT analysis.
  • Developed an online algorithm that operates without prior knowledge of task arrival statistics.
  • The proposed algorithm reduced long-term energy consumption significantly while ensuring queue stability.
  • Simulation results showed effective performance under varying system conditions and heterogeneous task characteristics.

Abstract

Abstract Remote direct memory access (RDMA) enables ultra-low-latency and energy-efficient data transmission in edge computing networks, thereby facilitating coordinated task scheduling and resource allocation. This paper investigates an RDMA-enabled edge computing system with multiple edge servers coordinated by a central scheduler, where computation tasks arrive stochastically and are dynamically assigned. The objective is to minimize the long-term energy consumption while ensuring queue stability in the presence of heterogeneous task characteristics and varying system conditions. To tackle this long-term stochastic optimization problem with coupled task scheduling and resource allocation, a Lyapunov optimization framework is adopted to transform it into a sequence of per-slot deterministic subproblems. A closed-form optimal solution is derived for computation frequency, and a low-complexity water-level balancing algorithm for task scheduling is proposed based on convex relaxation and Karush–Kuhn–Tucker (KKT) analysis. The resulting online algorithm operates without requiring prior knowledge of task arrival statistics. Simulation results demonstrate that the proposed algorithm effectively reduces long-term energy consumption while maintaining queue stability.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Dong et al. (2026) studied this question.

synapsesocial.com/papers/6a06b8f8e7dec685947ab705https://doi.org/10.1186/s13634-026-01331-1
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Accurate and fast congestion feedback in MEC-enabled RDMA datacenters2024 · 4 citations
  2. 2Lyapunov-Guided Delay-Aware Energy Efficient Offloading in IIoT-MEC Systems2022 · 156 citations
  3. 3A Survey on Mobile Edge Computing: The Communication Perspective2017 · 5,675 citations
  4. 4ETC: Enhancing Transportation Computation With IRS-Enabled Wireless Powered MEC Systems2025 · 3 citations
  5. 5Joint Design of Receiving Filters and Complementary set of Sequences for ISAC With Sidelobe Level Suppression2024 · 5 citations