APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
From MaRDI portal
Publication:3065615
DOI10.1142/S012905410700511XzbMATH Open1202.68486OpenAlexW2080222368MaRDI QIDQ3065615FDOQ3065615
Authors: Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant Shenoy 
Publication date: 6 January 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905410700511x
Recommendations
Cites Work
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for NP-hard problems.
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Approximate algorithms for some generalized knapsack problems
- Deterministic and nondeterministic flowchart interpretations
Cited In (10)
- Resource allocation algorithms for virtualized service hosting platforms
- Title not available (Why is that?)
- System support for web hosting services on server clusters
- 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
- Robustly assigning unstable items
- Algorithmic background of the host recommendation in the adaptive distributed multimedia server
- Application placement and backup service in computer clustering in software as a service (SaaS) networks
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)
