Non-clairvoyant weighted flow time scheduling on different multi-processor models

DOI10.1007/S00224-013-9475-YzbMATH Open1328.68318DBLPjournals/mst/ZhuCL15OpenAlexW2149580315WikidataQ58062872 ScholiaQ58062872MaRDI QIDQ2344210FDOQ2344210

Authors: Jianqiao Zhu, Ho-Leung Chan, Tak-Wah Lam 

Publication date: 12 May 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9475-y

Recommendations

• Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
• Non-clairvoyant scheduling for weighted flow time
• Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
• Non-clairvoyant Speed Scaling for Weighted Flow Time
• scientific article; zbMATH DE number 2079378

zbMATH Keywords

online algorithmscompetitive analysismultiprocessor schedulingweighted flow timenon-clairvoyant scheduling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Nonclairvoyant scheduling
• Speed is as powerful as clairvoyance
• The two-machine total completion time flow shop problem
• On-line scheduling of two-machine open shops where jobs arrive over time
• Non-clairvoyant Speed Scaling for Weighted Flow Time
• Scheduling in the dark
• Title not available (Why is that?)
• Tighter bounds on preemptive job shop scheduling with two machines
• Job shop scheduling with unit processing times
• Title not available (Why is that?)

Cited In (7)

• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
• Non-clairvoyant scheduling for weighted flow time
• Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
• Non-clairvoyant Speed Scaling for Weighted Flow Time
• Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models
• Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints

This page was built for publication: Non-clairvoyant weighted flow time scheduling on different multi-processor models

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