mlsanityData to 14 Oct 2026

P-MOSS: Scheduling Main-Memory Indexes Over NUMA Servers Using Next Token Prediction

arXiv 2411.02933 ↗First posted 5 Nov 2024cs.DB cs.LG cs.PFcited by 0

Not on the map. Why?

Abstract (arXiv)

Ever since the Dennard scaling broke down in the early 2000s and the frequency of the CPUs stalled, vendors have started to increase the core count in each CPU chip at the expense of introducing heterogeneity, thus ushering the era of NUMA and Chiplet processors. Since then, the heterogeneity in the design space of hardware has only increased to the point that DBMS performance may vary significantly up to an order of magnitude in modern servers. An important factor that affects performance includes the location of the logical cores where the DBMS queries execute, and the location where the data resides. This paper introduces P-MOSS, a learned spatial scheduling framework that schedules query execution to specific logical cores, and co-locates data on the corresponding NUMA node. For cross-hardware and workload adaptability, P-MOSS leverages core principles from Large Language Models, such as Next Token prediction, Generative Pre-training, and Fine-tuning. In the spirit of hardware-software synergy, P-MOSS guides its scheduling decision solely based on the low-level hardware statistics collected from the hardware Performance Monitoring Unit with the aid of a Decision Transformer. Experimental evaluation is performed in the context of the B^+-Tree index. Performance results demonstrate that P-MOSS offers an improvement of up to 6× over traditional schedules in terms of query throughput.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 65 references that are in the map. First posted on arXiv 5 Nov 2024.

Builds on

13 of 65 references.

References · 13

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  4. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,920
  5. 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,809
  6. 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,546
  7. 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,293
  8. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
  9. 2021A Minimalist Approach to Offline Reinforcement Learningcited by 899
  10. 2024DeepSeek LLM: Scaling Open-Source Language Models with Longtermismcited by 642
  11. 2018Learning Scheduling Algorithms for Data Processing Clusterscited by 134
  12. 2023ChiPFormer: Transferable Chip Placement via Offline Decision Transformercited by 42
1 more
  1. 2019SOSD: A Benchmark for Learned Indexescited by 21

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026MAPS: Memory-Aware Predictive Scheduling Framework for Large Language Model Serving
  2. 2024Intelligent Router for LLM Workloads: Improving Performance Through Workload-Aware Load Balancing
  3. 2026Benchmarking Storage Systems for Machine Learning Workloads Using NIO Bench
  4. 2017Improving Spark Application Throughput Via Memory Aware Task Co-location: A Mixture of Experts Approach
  5. 2026Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale
  6. 2026BatchBench: Toward a Workload-Aware Benchmark for Autoscaling Policies in Big Data Batch Processing -- A Proposed Framework ↗
  7. 2025Rethinking Dynamic Networks and Heterogeneous Computing with Automatic Parallelization
  8. 2026SeqMoE: Toward Full-Load Performance via Predictive and Graph-Compatible MoE Offloading