Core allocation to minimize total flow time in a multicore system in the presence of a processing time constraint

DOI10.1007/S11134-024-09923-0MaRDI QIDQ6669142FDOQ6669142

Authors: Rein Vesilo 

Publication date: 22 January 2025

Published in: Queueing Systems (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 6861895
• Efficient scientific workflow scheduling for deadline-constrained parallel tasks in cloud computing environments
• Power and performance management for parallel computations in clouds and data centers
• Scheduling multiple two-stage flowshops with a deadline
• Co-scheduling algorithms for high-throughput workload execution

zbMATH Keywords

optimizationmulticoreflow timedata centerspeedup function

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Nonlinear programming (90C30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Unifying Conservation Law for Single-Server Queues
• Open problems in queueing theory inspired by datacenter computing
• Scheduling and Control of Queueing Networks
• Scheduling. Theory, algorithms, and systems

This page was built for publication: Core allocation to minimize total flow time in a multicore system in the presence of a processing time constraint

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