AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION

DOI10.1080/10637199408962526zbMATH Open1049.68545OpenAlexW2077073639MaRDI QIDQ4820007FDOQ4820007

Author name not available (Why is that?)

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199408962526

Mathematics Subject Classification ID

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

Cites Work

• Optimization by Simulated Annealing
• An Efficient Heuristic Procedure for Partitioning Graphs
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Optimal scheduling for two-processor systems
• NP-complete scheduling problems
• Allocating programs containing branches and loops within a multiple processor system
• Two-stage \(m\)-way graph partitioning

This page was built for publication: AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION

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