Benefits of speedup knowledge in memory-constrained multiprocessor scheduling

DOI10.1016/0166-5316(96)00025-9MaRDI QIDQ3122417zbMATH OpenOpenAlexFDO

Authors Eric W. Parsons, K. C. Sevcik

Publication date 27 February 1997

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(96)00025-9

zbMATH Keywords

MemoryMultiprocessorResource allocationScheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Approximation algorithms for scheduling on multi-core processor with shared speedup resources
• Nearly on-line scheduling of multiprocessor systems with memories
• Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
• scientific article; zbMATH DE number 2080862
• Memory-constrained task scheduling on a network of dual processors

Cited in

(1)

• scientific article; zbMATH DE number 2080862 (Why is no real title available?)

This page was built for publication: Benefits of speedup knowledge in memory-constrained multiprocessor scheduling

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