Pith. sign in

REVIEW 1 cited by

Graph Neural Network-Based Collaborative Perception for Adaptive Scheduling in Distributed Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2505.16248 v1 pith:4RHE3DSI submitted 2025-05-22 cs.LG

Graph Neural Network-Based Collaborative Perception for Adaptive Scheduling in Distributed Systems

classification cs.LG
keywords perceptiondynamicgraphmethodschedulingsystemcollaborativedistributed
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper addresses the limitations of multi-node perception and delayed scheduling response in distributed systems by proposing a GNN-based multi-node collaborative perception mechanism. The system is modeled as a graph structure. Message-passing and state-update modules are introduced. A multi-layer graph neural network is constructed to enable efficient information aggregation and dynamic state inference among nodes. In addition, a perception representation method is designed by fusing local states with global features. This improves each node's ability to perceive the overall system status. The proposed method is evaluated within a customized experimental framework. A dataset featuring heterogeneous task loads and dynamic communication topologies is used. Performance is measured in terms of task completion rate, average latency, load balancing, and transmission efficiency. Experimental results show that the proposed method outperforms mainstream algorithms under various conditions, including limited bandwidth and dynamic structural changes. It demonstrates superior perception capabilities and cooperative scheduling performance. The model achieves rapid convergence and efficient responses to complex system states.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Topology-Aware Graph Reinforcement Learning for Dynamic Routing in Cloud Networks

    cs.LG 2025-09 reject novelty 3.0

    A graph RL router with structure-aware state encoding and policy-driven edge rewiring reports improved throughput and latency on GEANT, based on single-run table comparisons.