scientific article; zbMATH DE number 553901

zbMATH Open0797.90041MaRDI QIDQ4288071FDOQ4288071

Authors: Hesham H. Ali, Hesham El-Rewini 

Publication date: 21 April 1994

Title of this publication is not available (Why is that?)

Recommendations

• Task allocation model for distributed systems
• scientific article; zbMATH DE number 3885290
• scientific article; zbMATH DE number 1161227
• Dynamic task allocation in distributed computing systems by heuristic algorithms
• scientific article; zbMATH DE number 553908

zbMATH Keywords

complete split graphNP-completetask allocation in distributed systemsweighted clique partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (4)

• Employee workload balancing by graph partitioning
• The chromaticity of complete split graphs
• The completion of a classification for maximal nonhamiltonian Burkard-Hammer graphs
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem

This page was built for publication:

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