Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture

DOI10.1007/3-540-61576-8_94zbMATH Open1543.68064MaRDI QIDQ6567694FDOQ6567694

Authors: Håkan Lennerstad, Lars Lundberg 

Publication date: 5 July 2024

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Bounds on Multiprocessing Timing Anomalies
• An Application of Bin-Packing to Multiprocessor Scheduling
• Tighter Bounds for the Multifit Processor Scheduling Algorithm

This page was built for publication: Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture

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