The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Computational clouds have evolved to go beyond cost-effective on-demand hosting of IT resources and elasticity. The added features now include the ability to offer entire IT systems as a service that can quickly adapt to changing business environments. The new trend introduces challenges in datacenter resource management, including scalability, system-orientation, and optimization supporting both...
Today's virtualized resource management in datacenters is typically VM-centric, which has serious problems in scalability. We propose a shift from the traditional flat, fine-grained model towards a hierarchical, abstract model that facilitates decomposition of the complex resource allocation problem in a divide-and-conquer approach. In particular, this paper elaborates a pack-centric framework in...
In this paper, we introduce a pack-centric approach to data center resource management by abstracting a system as a pack of resources and considering the mapping of these packs onto physical data center resource groups, called swads. The assignment of packs/VMs to swads/PMs is formulated as an integer optimization problem that can capture constraints related to the available resources, data center...
We provide an improved bound for the expectation of the stationary delay under the maximum weight scheduling (MWS) policy in one-hop wireless networks. In the model, the interference of the links is characterized by an interference graph G=(V, E). For a vector μ ∊ R|V|+, let χf (G, μ) be the weighted fractional coloring number for the graph G under the weight vector μ. For an arrival rate vector λ...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.