Search papers, labs, and topics across Lattice.
This paper addresses the challenge of resource allocation in MapReduce-based collaborative computing across heterogeneous wireless devices that rely on renewable energy. The authors formulate a throughput maximization problem that optimally allocates computing load, phase time, transmit power, and energy consumption while considering constraints related to battery evolution, CPU frequency, and latency. Their proposed DDPG-CVX algorithm effectively combines Deep Deterministic Policy Gradient with convex programming, resulting in a significant throughput improvement of 1.25 to 32.36 times compared to existing benchmarks.
Achieving up to 32 times greater throughput in energy-harvesting wireless computing by optimizing resource allocation in real-time.
This paper studies resource allocation for MapReduce-based collaborative computing over heterogeneous wireless devices powered by renewable energy harvesting. We formulate a long-run average throughput maximization problem that jointly optimizes computing load, phase time allocations, transmit power, and per-device energy consumption, subject to battery evolution, CPU frequency, and latency constraints. To solve this problem online without prior knowledge of channel states or energy arrivals, we propose a DDPG-CVX algorithm that couples Deep Deterministic Policy Gradient (DDPG) with convex programming. DDPG determines the per-slot energy budget for each device from observed battery and channel states; the remaining resource allocation variables are then resolved to global optimality by an embedded convex solver. This two-phase decomposition reduces the action-space dimensionality of DDPG while preserving per-slot solution quality. Simulations show that DDPG-CVX achieves 1.25$\times$$\sim$32.36$\times$ the throughput of representative benchmarks.
