AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION
From MaRDI portal
Publication:4820007
DOI10.1080/10637199408962526zbMath1049.68545OpenAlexW2077073639MaRDI QIDQ4820007
No author found.
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Optimization by Simulated Annealing
- NP-complete scheduling problems
- Two-stage \(m\)-way graph partitioning
- Optimal scheduling for two-processor systems
- Allocating programs containing branches and loops within a multiple processor system
- An Efficient Heuristic Procedure for Partitioning Graphs
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms