Task assignment based on prioritising traffic flows

DOI10.1007/11516798_30MaRDI QIDQ5713691zbMATH OpenOpenAlexFDO

Authors James A. Broberg, Zahir Tari, P. Zeephongsekul

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b138689

zbMATH Keywords

heavy-tailed workloadsload balancingload sharingscheduling policiessupercomputingtask assignment

Mathematics Subject Classification ID

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

Recommendations

• Task assignment with unknown duration
• scientific article; zbMATH DE number 1911107
• Optimal allocation of servers and processing time in a load balancing system
• Task assignment in multiple server farms using preemptive migration and flow control
• Optimizing Routing and Backlogs for Job Flows in a Distributed Computing Environment

Cited in

(2)

• Mathematical modeling for further improving task scheduling on big data systems
• Task assignment in multiple server farms using preemptive migration and flow control

Describes a project that uses

Uses Software

• EquiLoad

This page was built for publication: Task assignment based on prioritising traffic flows

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