Abstract: A system and method for managing data transfer operations includes at least one data server including data stored in a plurality of data fields, at least one transaction server operatively coupled to the at least one data server and configured to provide at least one customizable business rule and a customer relationship application, an information server operatively coupled to the at least one transaction server, and at least one workstation operatively coupled to the information server. The least one workstation includes local memory accessible to the customer relationship application and configured to provide web communication and presentation services to a user of the at least one workstation that are deployed on the information server. The at least one customizable business rule specifies a mapping between the plurality of data fields and the local memory, the mapping having been provided by the user interacting with the web communication and presentation services.

Abstract: An access data collector collects access assignment data characterizing active access assignment operations of a hypervisor in assigning host computing resources among virtual machines for use in execution of the virtual machines. Then, a capacity risk indicator calculator calculates a capacity risk indicator characterizing a capacity risk of the host computing resources with respect to meeting a prospective capacity demand of the virtual machines, based on the access assignment data.

Abstract: A generic discovery methodology collects data pertaining to components of a computer network using various discovery technologies. From the collected data, the methodology identifies, filters and analyzes information related to inter-component communications. Using the communication and application information, the methodology determines reliable relationships for those components having sufficient information available. To qualify more components, the methodology implements a decision service to generate hypothetical relationships between components that are known and components that are unqualified or unknown. The hypothetical relationships are presented to a user for selection, and each hypothetical relationship is preferably associated with an indication of its reliability.

Abstract: A container set manager may determine a plurality of container sets, each container set specifying a non-functional architectural concern associated with deployment of a service within at least one data center. A decision table manager may determine a decision table specifying relative priority levels of the container sets relative to one another with respect to the deployment. A placement engine may determine an instance of an application placement model (APM), based on the plurality of container sets and the decision table, determine an instance of a data center placement model (DPM) representing the at least one data center, and generate a placement plan for the deployment, based on the APM instance and the DPM instance.

Abstract: The method includes receiving, at a commercial app store system, an application including embedded customization code, publishing, by the commercial app store system, the application to a commercial app store, associating the application with a license to a private app store, the private app store being associated with the end-user computing device, installing the application on the end-user computing device, receiving an indication from the end-user computing device that the application has launched, and communicating customization data to the end-user computing device.

Abstract: Systems and methods implementing utility-maximized scheduling of time-sensitive tasks in a resource constrained-environment are described herein. Some embodiments include a method for utility-optimized scheduling of computer system tasks performed by a processor of a first computer system that includes determining a time window including a candidate schedule of a new task to be executed on a second computer system, identifying other tasks scheduled to be executed on the second computer system within said time window, and identifying candidate schedules that each specifies the execution times for at least one of the tasks (which include the new task and the other tasks). The method further includes calculating an overall utility for each candidate schedule based upon a task utility calculated for each of the tasks when scheduled according to each corresponding candidate schedule and queuing the new task for execution according to a preferred schedule with the highest overall utility.

Abstract: A view generator receives support text characterizing a support requirement for available information technology (IT) support, the support text being received in sentence form via a graphical user interface (GUI). A text analyzer performs natural language processing on the support text and thereby identifies at least one sentence part and at least one named entity within the support text. A support record generator relates each of the at least one sentence part and the at least one named entity to a support record type, and generates a support data record for the support requirement, including filling individual fields of the support data record using the at least one sentence part and the at least one named entity.

Abstract: A management system may include a reconciliation engine configured to reconcile a first instance of a resource object from a first data provider and a second instance of the resource object from a second data provider to obtain a reconciled resource object, and store the first instance, and second instance, and the reconciled resource object in datasets. The management system may include a context sensitive query engine configured to receive a context-sensitive query including context information identifying a source originally providing context sensitive data associated with a context-sensitive attribute, and retrieve the context sensitive data from one or more of the datasets based on the context information.

Abstract: A mainframe computing system hosts a plurality of logical partitions, each having a static entitlement of processing capacity. The mainframe computer system has a workload manager that schedules work requested by the logical partitions and tracks consumption of the processing capacity by the logical partitions, and a capping policy that is stored in non-transitory memory and which identifies a subset of the logical partitions. The mainframe computer system further includes a capping master that is configured to allocate dynamically varying entitlements of processing capacity to the subset of the logical partitions based on the high-importance work percentages of computing workloads running on the logical partitions to encourage completion of high-importance work over completion of low-importance work.

Abstract: An example system may include one or more collectors, an analyzer, and a presentation module. The one or more collectors receive a plurality of data streams that include operational data for a plurality of application nodes. The plurality of data streams are captured and provided by a plurality of meters deployed on at least one cloud computing platform to respectively meter the plurality application nodes. The analyzer processes the plurality of data streams to generate real-time performance data for an application associated with the plurality of application nodes. The presentation module streams the real-time performance data to at least one stakeholder of the application for display via a dashboard. The real-time performance data includes one or more performance metrics describing the performance of plurality of the application nodes of the application.

Abstract: A system includes a runbook manager configured to generate a runbook governing future server provisioning jobs, based on analyzed job history. The runbook manager includes a history analyzer configured to analyze a job history for a plurality of provisioning jobs performed to provision a plurality of servers, to thereby obtain the analyzed job history.

Abstract: Disclosed are systems and methods for model based provisioning of applications and servers (both physical and virtual) to execute provisioned applications in a reliable and repeatable manner. Several aspects of a complex application management including compliance, change tracking, monitoring, discovery, processing steps, CMDB integration are disclosed within a comprehensive hierarchy of definition templates forming a model. This model can then be used at provisioning time to instantiate a compliant instance of the provisioned application. This model can also be used at run-time for managing run-time aspects of the provisioned application. Additionally, the model based approach can help track applications even when or if applications drift from their intended design and policies for use.

Abstract: Processes and integrations include a method for managing a business process application development lifecycle. The method includes initiating, in a planning stage, requirements for an application based on adding new features to the application or a new application, implementing, in a development stage, a service process node (SPN) as a business process, and managing, in an operations stage, software code representing the application in a production environment. The SPN is configured to encapsulate at least one business service object and generate an interface configured to expose internal processes of the at least one business service object.

Abstract: A system and method for managing data transfer operations includes at least one data server including data stored in a plurality of data fields, at least one transaction server operatively coupled to the at least one data server and configured to provide at least one customizable business rule and a customer relationship application, an information server operatively coupled to the at least one transaction server, and at least one workstation operatively coupled to the information server. The least one workstation includes local memory accessible to the customer relationship application and configured to provide web communication and presentation services to a user of the at least one workstation that are deployed on the information server. The at least one customizable business rule specifies a mapping between the plurality of data fields and the local memory, the mapping having been provided by the user interacting with the web communication and presentation services.

Abstract: Overlay datasets provide an efficient, flexible and scalable mechanism to represent the logical replication of one or more prior defined datasets. Only changes made to an entity in an overlay dataset's underlying dataset are replicated into the overlay dataset (such changes do not affect the underlying dataset). Read operations directed to the overlay dataset will find entities in the overlay dataset if they exist and in the underlying dataset(s) if no overlay-specific entity exists. Accordingly, overlay datasets provide an efficient mechanism for making changes to an existing dataset without suffering the high processing time and storage overhead associated with prior art copying and versioning techniques. Overlay datasets also provide a natural mechanism to keep two or more datasets in synchronization because changes to a base or underlying dataset's entities are “visible” in its associated overlay dataset (unless the entity has been modified in the overlay dataset).

Abstract: A list folding process dynamically groups items of a list into logically related visual folds to reduce the number of items to be displayed in a window of a computer screen. The process determines attributes of the items to be displayed and dynamically groups items together into a special group called a visual fold based on the attributes. The rules for folding items based on attributes can be defined by a particular user so that each view of the items may be different among users. As the attributes of each item change, the display of the items and visual folds may be automatically adjusted to reflect the current proper grouping. The folding process therefore allows a user to view the maximum amount of information in available display area of a computer screen window.

Abstract: A cost estimator may estimate execution costs for execution of at least one query against a database, using at least one existing index, if any, and based on estimation criteria determined from analyzing the query execution. A candidate index provider may provide candidate indexes, based on the estimation criteria, and re-estimate the execution costs to obtain updated execution costs, using the candidate indexes. An index recommender may recommend a recommended index, based on the updated execution costs.

Abstract: A DBA may pre-generate database recovery jobs on a convenient schedule at a local site, then recover a database at a disaster recovery site. Archive log files for the database that are generated in the interim between recovery job generation and recovery job execution are automatically incorporated into the recovery job when it executes, extending the recovery point closer to the time of the disruption that triggered the need or desire for recovery.

Abstract: Disclosed is a method of managing computer resources in a dynamic computing environment. The method includes identifying available resources from an available pool based on an augmented model, the available pool including resources unallocated resources, allocating the identified available resources in accordance with the augmented model, identifying reserve resources from a reserve pool based on the augmented model, the reserve pool including resources not allocated and not configured, and upon determining the available pool includes a number of resources below a threshold, replenishing the available pool with the identified reserve resources.

Abstract: Techniques are described to allow the deprecation of classes in an object-oriented data model, such as a CDM for a CMDB. When a class is deprecated and replaced by another existing or new class, data associated with instances of the deprecated class and its replacement class may be provided to allow existing applications to continue to access data using the deprecated class without change until the deprecated class is finally deleted or the application is updated to use the replacement class. New applications written to use the object-oriented model after the deprecation may use the replacement class to access data instances created using the original data model.