International Business Machines Corporation

Richard D Prewitt, Jr

Marna Walle

Eitan D Farchi

Tarun Kumar

Michael E Gildein

Maxim I Sviridenko

Kevin McKenzie

Orna Raz-Pelleg

Tracy Jay Kimbrel

Sergey Novikov

Aharon Brodie

Debra Tomkowid

Embodiments of the present invention provide systems and methods for performing data analysis. Mapping analytics are applied on data which contains extensive information. Mapped building blocks are found by applying mapping analytics. These mapped building blocks help determine which functions are in use within a system. By determining which functions are in use within a system, a higher-level of functionality in use can also be determined.

Intelligent mapping of empirical data

Embodiments include method, systems and computer program products for identifying dependency relationships in a software product. Aspects include obtaining change history data for the software product and extracting a plurality of change elements from the change history data, each change element including an identifier of a code segment that was changed and a timestamp of the change. Aspects also include creating a dependency graph based on the plurality of change elements, wherein the dependency graph includes nodes that correspond to the code segments and edges that connect nodes that were both updated in a same logical grouping, calculating a weight for each of the edges based on probability that the nodes connected by the edge will be updated together, and outputting the dependency graph.

Identifying software dependency relationships

A system and method that provides an automated solution to obtaining quality scheduling for users of computing resources. The system, implemented in an enterprise software test center, collects information from test-shop personnel about test machine features and availability, test jobs, and tester preferences and constraints. The system reformulates this testing information as a system of constraints. An optimizing scheduling engine computes efficient schedules whereby all the jobs are feasibly scheduled while satisfying the users' time preferences to the greatest extent possible. The method and system achieves fairness: if all preferences can not be meet, it is attempted to evenly distribute violations of preferences across the users. The test scheduling is generated according to a first application of a greedy algorithm that finds an initial feasible assignment of jobs. The second is a local search algorithm that improves the initial greedy solution.

Scheduling heterogeneous partitioned resources with sharing constraints

Growing community of inventors

Centre Hall, PA, United States of America

Richard D Prewitt, Jr