Pith. sign in

REVIEW 7 cited by

Reinforcement Learning for Adaptive Resource Scheduling in Complex System Environments

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 2411.05346 v1 pith:D3DQF2BU submitted 2024-11-08 cs.LG cs.DC

classification cs.LGcs.DC
keywords schedulingcomputingresourcesystemadaptivedynamicenvironmentslearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This study presents a novel computer system performance optimization and adaptive workload management scheduling algorithm based on Q-learning. In modern computing environments, characterized by increasing data volumes, task complexity, and dynamic workloads, traditional static scheduling methods such as Round-Robin and Priority Scheduling fail to meet the demands of efficient resource allocation and real-time adaptability. By contrast, Q-learning, a reinforcement learning algorithm, continuously learns from system state changes, enabling dynamic scheduling and resource optimization. Through extensive experiments, the superiority of the proposed approach is demonstrated in both task completion time and resource utilization, outperforming traditional and dynamic resource allocation (DRA) algorithms. These findings are critical as they highlight the potential of intelligent scheduling algorithms based on reinforcement learning to address the growing complexity and unpredictability of computing environments. This research provides a foundation for the integration of AI-driven adaptive scheduling in future large-scale systems, offering a scalable, intelligent solution to enhance system performance, reduce operating costs, and support sustainable energy consumption. The broad applicability of this approach makes it a promising candidate for next-generation computing frameworks, such as edge computing, cloud computing, and the Internet of Things.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 7 Pith papers

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

  1. Leveraging Generative Adversarial Networks for Addressing Data Imbalance in Financial Market Supervision

    q-fin.CP 2024-12 reject novelty 2.0 of 10

    A standard GAN is used to balance a financial dataset, and the paper reports small accuracy improvements over traditional sampling methods, though without sufficient experimental support.

  2. An Automated Data Mining Framework Using Autoencoders for Feature Extraction and Dimensionality Reduction

    cs.LG 2024-12 reject novelty 2.0 of 10

    An autoencoder is compared with five dimensionality reduction methods on one UCI dataset and reported to have the best reconstruction error, without error bars or released code.

  3. Enhancing Few-Shot Learning with Integrated Data and GAN Model Approaches

    cs.LG 2024-11 reject novelty 2.0 of 10

    MhERGAN couples MCMC-corrected GAN ensembles with MHLoss fine-tuning for few-shot learning, but the reported gains are small and under-validated.

  4. Optimizing Gesture Recognition for Seamless UI Interaction Using Convolutional Neural Networks

    cs.HC 2024-11 reject novelty 2.0 of 10

    A routine CNN benchmark for 14 hand gestures reports AUC 0.83 and recall 0.85 for an undescribed Ours model, with no error bars or code.

  5. Graph Neural Network-Based Entity Extraction and Relationship Reasoning in Complex Knowledge Graphs

    cs.CL 2024-11 reject novelty 2.0 of 10

    A graph neural network with a bilinear decoder and contrastive loss is reported to beat six baselines on Freebase entity extraction and relation reasoning, but missing experimental details make the result unverifiable.

  6. A Combined Encoder and Transformer Approach for Coherent and High-Quality Text Generation

    cs.CL 2024-11 reject novelty 2.0 of 10

    A proposed BERT-plus-GPT-4 hybrid is claimed to beat GPT-3, T5, BART, Transformer-XL, and CTRL on perplexity and BLEU, but the experiments are not reproducible.

  7. Leveraging Semi-Supervised Learning to Enhance Data Mining for Image Classification under Limited Labeled Data

    cs.CV 2024-11 reject novelty 1.0 of 10

    A self-training CNN on 10,000 labeled CIFAR-10 images reaches 0.897 accuracy, but missing implementation details and baseline comparisons make the result unverifiable.

Pith tools