Benefits of speedup knowledge in memory-constrained multiprocessor scheduling

DOI10.1016/0166-5316(96)00025-9zbMATH Open0875.68117OpenAlexW2062577325MaRDI QIDQ3122417

K. C. Sevcik, Eric W. Parsons

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

MemoryResource allocationSchedulingMultiprocessor

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Memory-constrained task scheduling on a network of dual processors 👍 👎

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)