Distributed order scheduling and its application to multi-core DRAM controllers

DOI10.1145/1400751.1400799MaRDI QIDQ2934359zbMATH OpenOpenAlexFDO

Authors Thomas Moscibroda, Onur Mutlu

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1400751.1400799

zbMATH Keywords

multi-coredistributed schedulingorder schedulingdistributed approximationDRAM memory controllers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Scheduling memory accesses through a shared bus
• Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
• Task scheduling with interprocessor communication delays
• Fast scheduling in distributed transactional memory
• Dynamic scheduling in distributed transactional memory

Cited in

(3)

• Reconciling fault-tolerant distributed computing and systems-on-chip
• A MILP approach to DRAM access worst-case analysis
• Fast primal-dual distributed algorithms for scheduling and matching problems

This page was built for publication: Distributed order scheduling and its application to multi-core DRAM controllers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934359)