Patents by Inventor Rohit Jain
Rohit Jain has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7774469Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.Type: GrantFiled: September 12, 2005Date of Patent: August 10, 2010Inventors: Michael T. Massa, David A. Dion, Rajsekhar Das, Rushabh Doshi, David B. Lomet, Gor V. Nishanov, Philip A. Bernstein, Rod N. Gamache, Rohit Jain, Sunita V. Shrivastava
-
Patent number: 7761420Abstract: A method and system for method for replicating object consisting of creating a group of objects at a first location; transmitting the group of objects from a first location to a second location over a network coupling the first location to the second location, such that the number of transmissions is minimized receiving the group of objects at the second location; and storing the group of objects at the second location. The objects are preferably data objects and are collated into group based on a probability score is computed for each data object centered on an access pattern. Advantages include minimizing the number of transmission of the group of objects thereby reducing network traffic and failure of operation during replication of the objects.Type: GrantFiled: October 16, 2007Date of Patent: July 20, 2010Assignee: International Business Machines CorporationInventors: Upendra Sharma, Tapan Kumar Nayak, Rohit Jain
-
Patent number: 7747475Abstract: This disclosure pertains to techniques for intelligent selection of a currency preference for a user and conversion of monetary values to the preferred currency for transactions entered into by the user. The conversion is performed using a firm exchange rate that is derived from a market exchange rate, but guaranteed for a period of time during which the transaction is anticipated to be completed.Type: GrantFiled: September 5, 2008Date of Patent: June 29, 2010Assignee: Amazon Technologies, Inc.Inventors: Mary Kay Bowman, Eileen Tracey Quenin, Thomas L. Kovarik, Srinivas K. Rao, Rohit Jain, Nitesh Goyal
-
Patent number: 7725441Abstract: Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels.Type: GrantFiled: December 10, 2007Date of Patent: May 25, 2010Assignee: International Business Machines CorporationInventors: Srinivasan Balasubramanian, Tushar Mohan, Roberto C. Pineiro, Rohit Jain, Ramani R. Routray, Gauri Shah, Akshat Verma, Kaladhar Voruganti
-
Publication number: 20100076807Abstract: A method and apparatus for controlling an electronic device is provided, the electronic device having a processing unit interconnecting a memory and a display module, the processing unit configured to control the display module. The method comprises receiving, at the processing unit, first data representative of a meeting request. The method further comprises retrieving, at the processing unit, second data representative of an existing schedule, from the memory. The method further comprises generating at the processing unit a proposed schedule by merging the first data with the second data. The method further comprises, via the processing unit, controlling the display module to generate a representation of the proposed schedule on the display module.Type: ApplicationFiled: September 22, 2008Publication date: March 25, 2010Applicant: Research in Motion LimitedInventors: Matthew BELLS, Rohit Jain
-
Patent number: 7578176Abstract: A scanning probe microscope's probe tip dimensions as they exist or existed for a certain data or measurement are inferred based on probe activity taking place since a probe characterization procedure was performed. The inferred probe tip dimensions can be used to correct nanoscale measurements taken by the probe to account for changes in the probe's geometry such as wear.Type: GrantFiled: December 22, 2006Date of Patent: August 25, 2009Assignee: Veeco Metrology, Inc.Inventors: Tianming Bao, Hao-Chih Liu, Gregory A. Dahlen, Rohit Jain
-
Patent number: 7565484Abstract: Provided are methods, apparatus arid computer programs for scheduling storage input and/or output (I/O) requests. A method for scheduling storage access requests determines a request processing sequence calculated to maximize SLA-based revenues achievable from processing a number of requests. A storage controller includes a scheduler which implements a revenue-based scheduling function to determine a revenue-maximizing processing sequence, and then assigns storage access requests to locations in a queue corresponding to the determined sequence. In an on-line mode, the scheduler can adapt to additional received requests, evaluating the revenue function for the additional requests and modifying the schedule if required. The method may include analyzing a request stream to predict requests that are likely to be received in the near future, and taking account of the predicted requests when determining a processing schedule.Type: GrantFiled: July 12, 2007Date of Patent: July 21, 2009Assignee: International Business Machines CorporationInventors: Sugata Ghosal, Rohit Jain, Akshat Verma
-
Publication number: 20090150456Abstract: Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels.Type: ApplicationFiled: December 10, 2007Publication date: June 11, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Srinivasan Balasubramanian, Tushar Mohan, Roberto C. Pineiro, Rohit Jain, Ramani R. Routray, Gauri Shah, Akshat Verma, Kaladhar Voruganti
-
Publication number: 20090150712Abstract: Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels.Type: ApplicationFiled: May 23, 2008Publication date: June 11, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Srinivasan Balasubramanian, Tushar Mohan, Roberto C. Pineiro, Rohit Jain, Ramani R. Routray, Gauri Shah, Akshat Verma, Kaladhar Voruganti
-
Publication number: 20090100112Abstract: A method and system for method for replicating object consisting of creating a group of objects at a first location; transmitting the group of objects from a first location to a second location over a network coupling the first location to the second location, such that the number of transmissions is minimized receiving the group of objects at the second location; and storing the group of objects at the second location. The objects are preferably data objects and are collated into group based on a probability score is computed for each data object centered on an access pattern. Advantages include minimizing the number of transmission of the group of objects thereby reducing network traffic and failure of operation during replication of the objects.Type: ApplicationFiled: October 16, 2007Publication date: April 16, 2009Inventors: Upendra Sharma, Tapan Kumar Nayak, Rohit Jain
-
Patent number: 7429732Abstract: The preferred embodiments are directed to a method and apparatus of operating a scanning probe microscope (SPM) to perform sample measurements using a survey scan that is less than five lines, and more preferably two lines, to accurately locate a field of features of a sample. This is accomplished by selecting a step distance between adjacent lines of the survey scan that does not equal the pitch of the features in a direction orthogonal to the direction the survey scan traverses, i.e., does not equal the pitch of the features in the scan direction, XPO. The aspect ratio of the scans can also be modified to further improve sample throughput.Type: GrantFiled: September 30, 2005Date of Patent: September 30, 2008Assignee: Veeco Instruments Inc.Inventors: David A. Kneeburg, Rohit Jain, Jason R. Osborne, Wei Yao, Matthew T. Klonowski, Ingo Schmitz
-
Patent number: 7421370Abstract: A scanning probe microscope (SPM) based measuring technique for measuring surface features of a sample fits a curve to a family of feature edge points acquired as a result of an SPM scan of the surface feature. If two curves are fit on opposed edges of the feature of interest, the maximum or minimum distance between those curves can be determined to ascertain a dimension of interest such as a maximum via width, a minimum line width, etc. The scan is preferably a relatively low-resolution scan in the Y direction, typically having 8-12 scan profiles passing through the feature of interest low-resolution, which is about half that typically used by prior techniques. The low-resolution scan can be performed relatively rapidly and with high repeatability. Repeatability is also higher than with prior techniques, and the level of repeatability is relatively insensitive to the resolution in the Y direction.Type: GrantFiled: September 16, 2005Date of Patent: September 2, 2008Assignee: Veeco Instruments Inc.Inventors: Rohit Jain, John Richards
-
Publication number: 20080154521Abstract: A scanning probe microscope's probe tip dimensions as they exist or existed for a certain data or measurement are inferred based on probe activity taking place since a probe characterization procedure was performed. The inferred probe tip dimensions can be used to correct nanoscale measurements taken by the probe to account for changes in the probe's geometry such as wear.Type: ApplicationFiled: December 22, 2006Publication date: June 26, 2008Inventors: Tianming Bao, Hao-Chih Liu, Gregory A. Dahlen, Rohit Jain
-
Publication number: 20080016310Abstract: Provided are methods, apparatus arid computer programs for scheduling storage input and/or output (I/O) requests. A method for scheduling storage access requests determines a request processing sequence calculated to maximize SLA-based revenues achievable from processing a number of requests. A storage controller includes a scheduler which implements a revenue-based scheduling function to determine a revenue-maximizing processing sequence, and then assigns storage access requests to locations in a queue corresponding to the determined sequence. In an on-line mode, the scheduler can adapt to additional received requests, evaluating the revenue function for the additional requests and modifying the schedule if required. The method may include analysing a request stream to predict requests that are likely to be received in the near future, and taking account of the predicted requests when determining a processing schedule.Type: ApplicationFiled: July 12, 2007Publication date: January 17, 2008Inventors: Sugata Ghosal, Rohit Jain, Akshat Verma
-
Patent number: 7277984Abstract: Provided are methods, apparatus and computer programs for scheduling storage input and/or output (I/O) requests. A method for scheduling storage access requests determines a request processing sequence calculated to maximize SLA-based revenues achievable from processing a number of requests. A storage controller includes a scheduler which implements a revenue-based scheduling function to determine a revenue-maximizing processing sequence, and then assigns storage access requests to locations in a queue corresponding to the determined sequence. In an on-line mode, the scheduler can adapt to additional received requests, evaluating the revenue function for the additional requests and modifying the schedule if required. The method may include analysing a request stream to predict requests that are likely to be received in the near future, and taking account of the predicted requests when determining a processing schedule.Type: GrantFiled: June 23, 2004Date of Patent: October 2, 2007Assignee: International Business Machines CorporationInventors: Sugata Ghosal, Rohit Jain, Akshat Verma
-
Publication number: 20070156480Abstract: Methods and systems are provided for coordinating a project-commitment process for an organization. An interface is provided to a computational system for coordinating communications among personnel of the organization. A request is received from a customer or an agent of the customer at the organization. The request includes specification of project parameters for a project. A series of communications within the organization are coordinated using the computational system to evaluate a capacity of the organization to implement the project in accordance with the project parameters. From the evaluated capacity, it is determined whether the organization may commit to performing the project on behalf of the customer.Type: ApplicationFiled: November 14, 2005Publication date: July 5, 2007Applicant: Metavante CorporationInventors: Rohit Jain, Michael Hamel, Thomas Sullivan
-
Publication number: 20070075243Abstract: The preferred embodiments are directed to a method and apparatus of operating a scanning probe microscope (SPM) to perform sample measurements using a survey scan that is less than five lines, and more preferably two lines, to accurately locate a field of features of a sample. This is accomplished by selecting a step distance between adjacent lines of the survey scan that does not equal the pitch of the features in a direction orthogonal to the direction the survey scan traverses, i.e., does not equal the pitch of the features in the scan direction, XPO. The aspect ratio of the scans can also be modified to further improve sample throughput.Type: ApplicationFiled: September 30, 2005Publication date: April 5, 2007Inventors: David Kneeburg, Rohit Jain, Jason Osborne, Wei Yao, Matthew Klonowski, Ingo Schmitz
-
Publication number: 20070067140Abstract: An SPM based measuring technique for measuring surface features of a sample fits a curve to a family of feature edge points acquired as a result of an SPM scan of the surface feature. If two curves are fit on opposed edges of the feature of interest, the maximum or minimum distance between those curves can be determined to ascertain a dimension of interest such as a maximum via width, a minimum line width, etc. The scan is preferably a relatively low-resolution scan in the Y direction, typically having 8-12 scan profiles passing through the feature of interest low-resolution, which is about half that typically used by prior techniques. The low-resolution scan can be performed relatively rapidly and with high repeatability. Repeatability is also higher than with prior techniques, and the level of repeatability is relatively insensitive to the resolution in the Y direction. Using a low-resolution scan also significantly reduces tip wear and increases throughput when compared to high-resolution scans.Type: ApplicationFiled: September 16, 2005Publication date: March 22, 2007Inventors: Rohit Jain, John Richards
-
Publication number: 20060129771Abstract: A method for performing a data migration task on an on-line data storage system comprises computing a migration utility, which is a function of the expected time taken to complete the data migration task and generating migration requests for performing the data migration task, where the data migration task is divided into sub-tasks and a migration request is generated for each sub-task. Next determining a migration deadline for performing the data migration; assigning reward values to customer storage requests; assigning reward values to the migration requests.Type: ApplicationFiled: December 14, 2004Publication date: June 15, 2006Applicant: International Business Machines CorporationInventors: Koustuv Dasgupta, Rohit Jain, Upendra Sharma, Akshat Verma
-
Publication number: 20060112389Abstract: A policy for a computer system is transformed into a plurality of sub-policies, at least one synchronization step, and a final action. The sub-policies are distributed to corresponding sub-components in the computer system. The sub-policies are evaluated, wherein each sub-component evaluates its corresponding one or more sub-policies as other sub-components evaluate their corresponding one or more sub-policies. The sub-policies are synchronized by using the at least one synchronization step. The final action is performed in response to synchronizing the sub-policies. The computer system can be singular or distributed.Type: ApplicationFiled: November 22, 2004Publication date: May 25, 2006Inventors: Mandis Beigi, Murthy Devarakonda, Marc Kaplan, Rohit Jain, James Rubas, Upendra Sharma, Akshat Verma