Abstract: A method of workload aware dynamic CPU processor core allocation includes the steps of predicting estimated individual workloads for each emulation in a set of emulations for each decision period of a set of decision periods over a predictive time span. The method includes using, by a Mixed Integer Programming (MIP) engine, the predicted estimated individual workloads for each emulation in the set of emulations, a set of constraints, and an optimization function, to determine sets of CPU processor cores to be allocated to each emulation during each decision period over the predictive time span. The method further includes dynamically allocating, by the host computer system, the sets of CPU processor cores to each emulation during each decision period over the predictive time span based on the output from the MIP engine.

Abstract: A method is used in managing data storage in virtual systems. A data storage system is queried through a universal framework module of the data storage system. The universal framework module includes a first set of interfaces associated with a format used by a virtual system to communicate with the data storage system. Information associated with the data storage is retrieved from a platform specific module of the data storage system. The platform specific module provides the information to the universal framework module. The platform specific module includes a second set of interfaces based on a type of the data storage system.

Abstract: Described are techniques for reporting requested information to a client. A bidirectional graph is stored in a cache. The bidirectional graph includes a first set of nodes and a second set of edges between pairs of nodes of the first set, each node of the first set representing an object in an object model of a server. Each edge of the second set between a pair of nodes of the first set represents an association between two objects corresponding to the pair of nodes. A request is received from the client. A response to the request is determined by traversing a portion of the bidirectional graph to extract first information, and filtering the first information in accordance with a usage context customized for the client.