APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
From MaRDI portal
Publication:3065615
Recommendations
Cites work
- An approximation algorithm for the generalized assignment problem
- Approximate algorithms for some generalized knapsack problems
- Approximation algorithms for NP-hard problems.
- Deterministic and nondeterministic flowchart interpretations
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Cited in
(10)- scientific article; zbMATH DE number 1863336 (Why is no real title available?)
- Application placement and backup service in computer clustering in software as a service (SaaS) networks
- System support for web hosting services on server clusters
- Algorithmic background of the host recommendation in the adaptive distributed multimedia server
- Experimental and Efficient Algorithms
- Coupled and \(k\)-sided placements: generalizing generalized assignment
- A tabu search algorithm for application placement in computer clustering
- Scheduling method of data-intensive applications in cloud computing environments
- Resource allocation algorithms for virtualized service hosting platforms
- Robustly assigning unstable items
This page was built for publication: APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065615)