International Business Machines Corporation

Canon Kabushiki Kaisha

Dell Software Inc.

Softek Storage Solutions Corporation

Heidi M Schoolcraft

Robert Gagnon

Guy Letourneau

John Dunning

Martin Pare

James Thomson

Steven Calde

Michael Kay

Nicholas Tabellion

Manish Kulkarni

William Tracy Fuller

Michael F Perka

Reece Joyner

Barry S Van Hooser

Moshe Broudo

Ray M Villeneuve

Gideon J Senderov

A system and methods for capacity planning of electronic systems storage are provided. Features include a non-invasive data discovery and collection mechanism, an adaptive grouping mechanism, a flexible analysis mechanism, predictive modeling and forecasting mechanisms, and a business metric and correlation mechanism. A discovery engine that ascertains the availability of collectable entities. A collection engine in turn gathers information from and about entities discovered by the discovery engine. A grouping module groups together entities according to parameters specified by the user. An analysis and forecasting module allows a user to create, modify and save forecast scenarios from which a model is generated by a modeling module. Correlations can be identified between specified key business metrics and historical data. Once a model has been created, a forecast is generated and can then be analyzed using Bold Freehand Extrapolation, time-series analysis, and business trend-based forecasting.

Storage capacity planning

A storage management system is provided. The storage management system may includes a data collector configured to receive storage management information for storage. The storage manager includes an agent configured to collect storage management information for a storage object and to communicate the storage management information to the data collector. The storage management system includes a user interface configured to display the storage management information for the storage objects.

Method and system for intelligent storage management

A streamlined technique for obtaining interpolated color output values from corresponding color input values based on color output values stored in a color look-up table, with tetrahedral interpolation being applied so as to dissect each cubic grid of the color look-up table into plural tetrahedrons. According to the invention, processing efficiency is increased by avoiding the use of conditional branches when making a determination as to which of the plural dissected tetrahedrons a particular color input value falls. Preferably, rather than making such a determination, weights for all possible tetrahedrons for one cube are stored in a temporary look-up table, and an index into the temporary look-up table is calculated based on the magnitude of component values for each color input value. The index is calculated in a block of code that does not include conditional branches that are conditioned on the relative magnitude of the component values of the color input value. Most preferably, the block of code calculates the index through use of arithmetic operations, such as subtractions, which throw off a condition code that can be used to build the index into the temporary look-up table of weights. Because conditional branches are avoided, processing of such tetrahedral interpolation is speeded, particularly for processors such as a Pentium&reg; processor that employ dual processor pipelines together with branch prediction.

Streamlined tetrahedral interpolation

Growing community of inventors

San Jose, CA, United States of America

Heidi M Schoolcraft