公开(公告)号：US20090150712A1

公开(公告)日：2009-06-11

申请号：US12126487

申请日：2008-05-23

Applicant: Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

Inventor： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

IPC: G06F11/00

CPC classification number: G06F11/20

Abstract: 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. A solution template library is generated for mapping the application to each of a plurality of candidate replication technology solutions. The template library is used to select a DR plan in the form of a replication technology solution for the application.

Abstract translation: 基于针对应用的多个DR需求来制定综合灾难恢复（DR）计划，所述DR要求通过接收标识要为其制定所述计划的一个或多个实体类型的第一组输入，诸如企业，一个或多个站点 的应用程序，或应用程序的特定数据类型。 识别表示应用程序的数据子集的至少一个数据容器。 接收第二组输入，确定要制定该计划的至少一种灾害类型。 接收到第三组输入，将应用程序的DR要求标识为要应用于灾难类型的DR服务质量（QoS）类别。 生成指定作为代表复制技术解决方案的一个或多个QoS参数的相应组的函数的一个或多个相应DR QoS参数的组合模型。 复制技术解决方案包含多个存储堆栈级别。 生成解决方案模板库，用于将应用程序映射到多个候选复制技术解决方案中的每一个。 模板库用于以应用程序的复制技术解决方案的形式选择DR计划。

公开(公告)号：US20080016310A1

公开(公告)日：2008-01-17

申请号：US11776578

申请日：2007-07-12

Applicant: Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

Inventor： Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

IPC: G06F12/00

CPC classification number: G06F3/0632 ,  G06F3/0611 ,  G06F3/067 ,  G06Q10/06 ,  G06Q30/02

Abstract: 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.

Abstract translation: 提供了用于调度存储输入和/或输出（I / O）请求的方法，装置和计算机程序。 一种用于调度存储访问请求的方法确定了一个请求处理序列，该请求处理序列被计算为使处理多个请求可实现的基于SLA的收入最大化。 存储控制器包括执行基于收益的调度功能以确定收益最大化处理序列的调度器，然后将存储访问请求分配给与所确定的序列相对应的队列中的位置。 在在线模式中，调度器可以适应附加的接收到的请求，评估附加请求的收入功能并且如果需要则修改调度。 该方法可以包括分析请求流以预测在不久的将来可能被接收的请求，并且在确定处理调度时考虑预测的请求。

公开(公告)号：US20070067140A1

公开(公告)日：2007-03-22

申请号：US11228957

申请日：2005-09-16

Applicant: Rohit Jain ,  John Richards

Inventor： Rohit Jain ,  John Richards

IPC: G01B11/02

CPC classification number: G01Q10/06 ,  G01Q30/04 ,  G03F7/70625

Abstract: 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.

Abstract translation: 用于测量样品表面特征的基于SPM的测量技术将曲线拟合成由于表面特征的SPM扫描而获得的特征边缘点族。 如果两个曲线拟合在感兴趣特征的相对边缘上，则可以确定这些曲线之间的最大或最小距离以确定感兴趣的尺寸，例如最大通孔宽度，最小线宽等。扫描优选为 在Y方向上的相对低分辨率的扫描通常具有通过感兴趣特征的8-12扫描轮廓的低分辨率，其大约是现有技术通常使用的一半。 低分辨率扫描可以相对快速地进行并具有很高的重复性。 重复性也高于现有技术，重复性水平对Y方向的分辨率相对不敏感。 与高分辨率扫描相比，使用低分辨率扫描也显着降低了尖端磨损并提高了吞吐量。

公开(公告)号：US20060112389A1

公开(公告)日：2006-05-25

申请号：US10995598

申请日：2004-11-22

Applicant: Mandis Beigi ,  Murthy Devarakonda ,  Marc Kaplan ,  Rohit Jain ,  James Rubas ,  Upendra Sharma ,  Akshat Verma

Inventor： Mandis Beigi ,  Murthy Devarakonda ,  Marc Kaplan ,  Rohit Jain ,  James Rubas ,  Upendra Sharma ,  Akshat Verma

IPC: G06F9/46

CPC classification number: G06F9/52

Abstract: 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.

Abstract translation: 用于计算机系统的策略被转换成多个子策略，至少一个同步步骤和最终动作。 子策略分配给计算机系统中的相应子组件。 评估子策略，其中每个子组件评估其对应的一个或多个子策略，因为其他子组件评估其对应的一个或多个子策略。 通过使用至少一个同步步骤来同步子策略。 响应于子策略的同步来执行最后的动作。 计算机系统可以是单数或分布式的。

公开(公告)号：US20060036896A1

公开(公告)日：2006-02-16

申请号：US11203489

申请日：2005-08-12

Applicant: Rod Gamache ,  Michael Massa ,  Sunita Shrivastava ,  Gor Nishanov ,  David Lomet ,  Philip Bernstein ,  Rohit Jain

Inventor： Rod Gamache ,  Michael Massa ,  Sunita Shrivastava ,  Gor Nishanov ,  David Lomet ,  Philip Bernstein ,  Rohit Jain

IPC: G06F11/00

CPC classification number: G06F11/182 ,  G06F11/1425 ,  G06F11/1482 ,  G06F11/1662 ,  G06F11/181 ,  G06F11/2023 ,  G06F11/2035

Abstract: 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, independent from the nodes, 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.

公开(公告)号：US09407686B2

公开(公告)日：2016-08-02

申请号：US12395083

申请日：2009-02-27

Applicant: Christopher Runstedler ,  Rohit Jain ,  Michael Hardy

Inventor： Christopher Runstedler ,  Rohit Jain ,  Michael Hardy

IPC: G06F15/16 ,  H04L29/08 ,  H04W4/08 ,  H04W8/18 ,  H04W12/06

CPC classification number: H04L67/06 ,  H04L67/325 ,  H04W4/08 ,  H04W8/186 ,  H04W12/06

Abstract: Apparatus and methods to engage in a transfer of informational content between a first mobile electronic device and a second mobile electronic device using directed transmission between a first server and a second server. Additional apparatus, systems, and methods are disclosed.

Abstract translation: 使用在第一服务器和第二服务器之间的有向传输，在第一移动电子设备和第二移动电子设备之间进行信息内容传送的设备和方法。 公开了附加装置，系统和方法。

公开(公告)号：US20130085953A1

公开(公告)日：2013-04-04

申请号：US13252188

申请日：2011-10-03

Applicant: Saurabh Bhola ,  Mark Crosbie ,  Gary Denner ,  Daniel C. Gurney ,  Rohit Jain

Inventor： Saurabh Bhola ,  Mark Crosbie ,  Gary Denner ,  Daniel C. Gurney ,  Rohit Jain

IPC: G06Q99/00

CPC classification number: G06Q50/01 ,  H04L63/1433

Abstract: An approach is provided in which a risk assessment is performed that accesses the risk to a user of an information handling system due to the user's link to a social network contact. Risky action values is received with the values corresponding to the social network contact. A risk level is calculated with the risk level corresponding to one or more of the risky action values. A preventative security action is then performed based on the calculated risk level. In another embodiment, an approach is provided in which the potential risks posed by a user are transmitted to the user's social network contacts. In this approach, potentially risky actions that are performed by the user are detected. Risky action values are identified that correspond to the detected potentially risky actions. The risky action values are then transmitted to the user's social network contacts over a computer network.

Abstract translation: 提供了一种方法，其中由于用户链接到社交网络联系人而进行信息处理系统的用户访问风险的风险评估。 接收到与社交网络联系人对应的值的危险动作值。 风险水平是根据与一个或多个风险行动值相对应的风险水平计算的。 然后根据计算的风险级别执行预防性安全措施。 在另一个实施例中，提供了一种方法，其中由用户构成的潜在风险被传送到用户的社交网络联系人。 在这种方法中，检测到由用户执行的潜在风险的动作。 确定与检测到的潜在风险行为相对应的危险行动值。 然后将风险动作值通过计算机网络传输到用户的社交网络联系人。

公开(公告)号：US08307191B1

公开(公告)日：2012-11-06

申请号：US12118600

申请日：2008-05-09

Applicant: Rohit Jain

Inventor： Rohit Jain

IPC: G06F12/00

CPC classification number: G06F12/1036 ,  G06F12/1009 ,  G06F12/109 ,  G06F2212/151

Abstract: The invention relates to page fault handling in a virtualized computer system in which at least one guest page table maps virtual addresses to guest physical addresses, some of which are backed by machine addresses, and wherein at least one shadow page table and at least one translation look-aside buffer map the virtual addresses to the corresponding machine addresses. Indicators are maintained in entries of at least one shadow page table, wherein each indicator denotes a state of its associated entry from a group of states consisting of: a first state and a second state. An enhanced virtualization layer processes hardware page faults. States of shadow page table entries corresponding to hardware page faults are determined. Responsive to a shadow page table entry corresponding to a hardware page fault being in the first state, that page fault is delivered to a guest operating system for processing without activating a virtualization software component. On the other hand, responsive to a shadow page table entry corresponding to a hardware page fault being in the second state, that page fault is delivered to a virtualization software component for processing.

Abstract translation: 本发明涉及虚拟化计算机系统中的页面故障处理，其中至少一个访客页表将虚拟地址映射到客体物理地址，其中一些客户物理地址由机器地址支持，并且其中至少一个影子页表和至少一个平移 后备缓冲区将虚拟地址映射到相应的机器地址。 指标被保持在至少一个阴影页表的条目中，其中每个指示符表示由一组状态组成的其相关联的条目的状态：第一状态和第二状态。 增强的虚拟化层处理硬件页面错误。 确定与硬件页面故障相对应的影子页表项的状态。 响应于与处于第一状态的硬件页面错误相对应的影子页面表项，该页面错误被传递到客户操作系统以进行处理而不激活虚拟化软件组件。 另一方面，响应于与处于第二状态的硬件页面故障相对应的影子页表项，该页面错误被传送到虚拟化软件组件以进行处理。

公开(公告)号：US20120266159A1

公开(公告)日：2012-10-18

申请号：US13421124

申请日：2012-03-15

Applicant: Pankaj Risbood ,  Parag Kacharulal Sarda ,  Rahul S. Kulkarni ,  Rohit Jain ,  Vittaldas Sachin Shenoy ,  Vivek Sahasranaman

Inventor： Pankaj Risbood ,  Parag Kacharulal Sarda ,  Rahul S. Kulkarni ,  Rohit Jain ,  Vittaldas Sachin Shenoy ,  Vivek Sahasranaman

IPC: G06F9/445

CPC classification number: G06F8/60 ,  G06F9/44505 ,  G06F9/4492 ,  G06F9/45558 ,  G06F9/5072 ,  G06F2213/0038 ,  H04L41/0266 ,  H04L41/145 ,  H04L41/5012

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selection of ranked configurations. In one aspect, a method includes providing a plurality of class definitions for selection, each class definition modeling a respective data or functional component of a cloud-based environment using a group of configurable class parameters, each class definition supporting instantiation and inheritance of the class definition in a configuration specification for a cloud-based deployment; deriving respective performance metrics associated with each of the plurality of class definitions based on aggregated performance of multiple cloud-based deployments, wherein the multiple cloud-based deployments had been carried out according to respective configuration specifications that require instantiation of the class definition or a new class definition derived from the class definition; and utilizing the respective performance metrics associated with each of the plurality of class definitions in ranking the plurality of class definitions.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于选择排名的配置。 一方面，一种方法包括提供用于选择的多个类定义，每个类定义使用一组可配置的类参数来建模基于云的环境的相应数据或功能组件，每个类定义支持该类的实例化和继承 在基于云的部署的配置规范中定义; 基于多个基于云的部署的聚合性能导出与所述多个类定义中的每一个相关联的相应性能度量，其中所述多个基于云的部署已经根据需要实例化所述类定义的相应配置规范或新的 类定义派生自类定义; 以及在对所述多个类定义进行排序时，利用与所述多个类定义中的每一个相关联的各个性能度量。

公开(公告)号：US08261295B1

公开(公告)日：2012-09-04

申请号：US13247830

申请日：2011-09-28

Applicant: Pankaj Risbood ,  Parag Kacharulal Sarda ,  Rahul S. Kulkarni ,  Rohit Jain ,  Vittaldas Sachin Shenoy ,  Vivek Sahasranaman

Inventor： Pankaj Risbood ,  Parag Kacharulal Sarda ,  Rahul S. Kulkarni ,  Rohit Jain ,  Vittaldas Sachin Shenoy ,  Vivek Sahasranaman

IPC: G06F3/00 ,  G06F9/44 ,  G06F9/46 ,  G06F13/00

CPC classification number: G06F8/60 ,  G06F9/44505 ,  G06F9/4492 ,  G06F9/45558 ,  G06F9/5072 ,  G06F2213/0038 ,  H04L41/0266 ,  H04L41/145 ,  H04L41/5012

Abstract: A high-level object-oriented specification language allows configurable components of a cloud-based deployment to be modeled by a class definition that includes a group of configurable class parameters. The object-oriented specification language supports extension of an existing base class definition to create new class definitions, and supports inheritance of class parameters from the existing base class definition by the new class definitions. A cloud-based deployment can be customized based on class definitions used in configuring one or more generic deployments, such as by modifying class parameter values of the class definitions, varying interrelationships between the classes, and supplementing existing class parameters with new class parameters. The high-level object-oriented specification language supports class definitions that model hardware and virtual resources as well as software roles and service roles served by software applications and services in a cloud-based deployment. Syntax for specifying dependency and connectivity between classes is also provided.

Abstract translation: 高级面向对象规范语言允许基于云的部署的可配置组件由包含一组可配置类参数的类定义建模。 面向对象的规范语言支持对现有基类定义的扩展，以创建新的类定义，并支持通过新类定义从现有基类定义继承类参数。 基于云的部署可以基于用于配置一个或多个通用部署中的类定义来定制，例如通过修改类定义的类参数值，改变类之间的相互关系，以及使用新的类参数来补充现有的类参数。 高级面向对象规范语言支持类定义，可以在基于云的部署中对硬件和虚拟资源以及软件应用程序和服务所服务的软件角色和服务角色进行建模。 还提供了用于指定类之间的依赖关系和连接性的语法。