Oracle International Corporation

Realization Technologies, Inc.

Sun Microsystems, Inc.

Ravi Shankar

Ajai Kapoor

Sanjeev K Gupta

Subramania Sudharsanan

Anthony H Hoang

Prakash Kumar Pati

Deepankar Narayanan

Biju Narayanan

Corvin Bazgan

Xiangting Yuan

David S Labuda

Keith M Brefczynski

Amira A Morcos

Ramasimha Rangaraju

Subramanian Muthu

Mohini Mohana Sahoo

David J Bell

Jibu Thomas Thomas

Qing Du

Chi Ken Yeung

Nagendra Krishnappa

Hsiaowen Eddie Mou

Aneesh Azhakesan Sujatha

Sharath Kumar Madenahatti Nanjaiah

Christudoss Irwin Tagore

Sridharan Chandrasekaran

Subbarao Nimmakayala

Sondhi

Hari Gopinathan Nair Indira Devi

Eva Kifri

Dave Altendorf

A system, method and computer readable medium for generating and maintaining a resource deployment map for a project over a communications network includes a database for storing the resource deployment map including a set of tasks, dependencies between tasks, a predefined period of time required for completing each task, a set of resources, and assignments of the set of resources to the tasks, a web server for receiving project change information including a modified set of resources, and time delays in the tasks, identifying integration points in the resource deployment map, wherein an integration point comprises tasks, assigning the modified set of resources to the tasks as follows: assign all resources necessary for a first integration point, assign all remaining resources necessary for a next integration point, repeat the previous step until all resources are assigned, and generating a revised resource deployment map based on the modified set of resources, and time delays.

System for generating and maintaining a resource deployment map over a communications network

A method of modeling a scenario for use with live data in a production database may include selecting the scenario. The live data can be stored in the production database on a first computing resource, and production scenarios can be stored and executed on the live data using the first computing resource. The method may also include identifying a subset of the live data that are affected by the scenario, copying the subset to a second computing resource to create modeling data, running the scenario on the modeling data using the second computing resource, causing a display device to provide an output comprising a result of the scenario on the modeling data, receiving an input indicating that the scenario is approved, and storing the scenario with the plurality of production scenarios for use on the first computing resource.

Efficiently modeling database scenarios for later use on live data

Techniques for cloning a computing environment while modifying components of the computing environment are disclosed. A cloning request specifies a modification to a source environment. A cloning engine determines one or more additional non-requested modifications to be made in a destination environment necessitated by the requested modification. A modified destination specification is generated including the requested modification and the one or more additional non-requested modifications. A destination stack is generated, and the destination environment is provisioned according to the destination stack.

Cloning a computing environment through node reconfiguration and with node modification

A system is presented to efficiently communication data between a sub-network and a third-party application system, such that the third-party application system is able to perform one or more functions based on data sourced from the sub-network. A process scheduler system is presented to provide multiple communication paths to populate a data store of the third-party application system.

Distributed communication and task handling to facilitate operations of application system

The present disclosure relates to exporting local applications to cloud systems and provisioning the exported application on the cloud systems. Additionally, templates can be generated for the provisioned application, and each template can be individually customized and deployed to a destination as an application environment with a defined topology. Rapidly and dynamically generating deployable templates of provisioned applications enables cloud-based distributed versioning of the applications.

Distributed versioning of applications using cloud-based systems

Some embodiments of the present invention provide systems and techniques for collecting task status information. During operation, the system can receive a status update for a task from a task manager through a GUI. Next, the system can determine whether the first status update for the task indicates that the task is delayed. If the status update indicates that the task is delayed, the system can request the task manager to indicate the help needed to resolve the task delay. Next, the system can receive a help needed descriptor from the task manager. Subsequently, the system can receive another status update for the task from the task manager, wherein the status update indicates that the help specified in the help needed descriptor is no longer required. Next, the system can determine an amount of delay associated with the help needed descriptor.

Post facto identification and prioritization of causes of buffer consumption

Some embodiments of the present invention provide systems and techniques for determining a start delay and an execution delay for a task. During operation, the system can receive a status update for the task which indicates that the task has started execution. Next, the system can receive a second status update for the task which indicates that the task has completed execution. The system can then determine the start delay for the task by: determining an actual start time using the first status update; and determining a difference between the actual start time and the task's suggested start time. Next, the system can determine the execution delay for the task by: determining an actual execution duration using the first status update and the second status update; and determining a difference between the actual execution duration and the task's planned execution duration.

A method on a computer for providing critical chain-based project management is disclosed. The method includes generating a list of sequential time periods for a project comprising a plurality of tasks and calculating a number of tasks for each time period. The method further includes generating a graphic that visually indicates the number of tasks for each time period and a priority of each task and providing the graphic to a user.

Facilitation of multi-project management using throughput measurement

A method on a computer for providing critical chain-based project management is disclosed. The method includes receiving at least one project plan for a project comprising a plurality of tasks and calculating a task priority for each of the plurality of tasks based on the at least one project plan. The method further includes receiving at least one sub-task for a first task of the plurality of tasks and assigning the at least one sub-task a task priority identical to the task priority of the first task. In one alternative, the method further includes receiving a new task priority for the first task, assigning the new task priority to the first task and assigning the new task priority to the at least one sub-task of the first task. The method may also include an interface to allow starting of sub-tasks only when the parent task is started.

Facilitation of multi-project management using task hierarchy

A method on a computer for providing critical chain-based project management across a plurality of projects is disclosed. The method includes generating a plurality of plans, each of the plurality of plans corresponding to one of the plurality of projects, wherein a project comprises at least one task. The method further includes generating buffers for each of the plurality of projects and reconciling project resources among the plurality of projects. The method further includes executing the plurality of project plans, including allowing a user to manage the buffers across the plurality of projects. The user is further provided with information associated with buffers for the plurality of projects, so as to evaluate the status of the plurality of projects. Additionally, the user is provided with task prioritization for any task of the plurality of projects, wherein task prioritization is calculated across the plurality of projects.

Facilitation of multi-project management using critical chain methodology

Methods and architectures for implementing a scalable multi-database event processing system are provided. In one embodiment, selected account data is aggregated for all subscribers (aggregated subscriber-specific data) and a copy included on each database. In one embodiment, selected data that is not subscriber specific and that may apply to many accounts ('global data') is also maintained and copied to each database. The global data preferably includes business data that is frequently required during operation of the system, such as pricing data. A transaction that requires business data and access to an account is processed using the copy of the business data that is on the database on which the account is located. In an embodiment, the aggregated subscriber-specific data is used in performing searches.

Scalable multi-database event processing system using universal subscriber-specific data and universal global data

Methods and architectures for implementing a fault tolerant real time event processing system are provided. The system includes at least one satellite and at least one primary data center. The system remains operational when the primary data center is unavailable to the satellite. The system includes business logic that is divided into logic that can be run effectively at a satellite, and logic that can be run at the main data center to result in effective decisions. When the network connection is impaired or the main data center is unavailable, the satellite can process an incoming event locally. The system includes procedures so that events processed at a satellite during a period of noncommunication with the primary data center will be entered into the primary data center records at a later point.

Distributed nonstop architecture for an event processing system

Logarithmic number system for performing calculations in a processor

Division unit in a processor using a piece-wise quadratic approximation technique

Floating point square root and reciprocal square root computation unit in a processor

Growing community of inventors

San Jose, CA, United States of America

Ravi Shankar