Smart SMART Bounds for Weighted Response Time Scheduling

DOI10.1137/S0097539795286831zbMATH Open0914.68094WikidataQ130471516 ScholiaQ130471516MaRDI QIDQ4210145FDOQ4210145

Authors: Uwe Schwiegelshohn, Walter Ludwig, Joel Wolf, John J. Turek, Philip S. Yu 

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Recommendations

• Efficient algorithms for average completion time scheduling
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Load balancing for response time
• Load Balancing for Response Time
• scientific article; zbMATH DE number 3867043

zbMATH Keywords

parallel computingschedulingapproximate algorithms

Mathematics Subject Classification ID

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

Cited In (10)

• Scheduling in the dark
• Minimizing total completion time in multiprocessor job systems with energy constraint
• Resource constrained scheduling on multiple machines
• Frameworks for adaptable scheduling algorithms
• Improved upper bounds for online malleable job scheduling
• Fairness in parallel job scheduling
• Multiresource malleable task scheduling to minimize response time
• Malleable scheduling for flows of jobs and applications to MapReduce
• Title not available (Why is that?)
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework

This page was built for publication: Smart SMART Bounds for Weighted Response Time Scheduling

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