公开(公告)号：US09229890B2

公开(公告)日：2016-01-05

申请号：US13457497

申请日：2012-04-27

Applicant: Sandeep Jain ,  Prakash Chandra Tiwary

Inventor： Sandeep Jain ,  Prakash Chandra Tiwary

IPC: G06F17/30 ,  G06F13/22

CPC classification number: G06F13/22 ,  G06F11/2082 ,  G06F17/30008 ,  G06F17/30575

Abstract: The embodiments herein provide a system and a method for integrating a data from a source to a destination. The method comprises generating a global-id, setting an event-id corresponding to an entity id in the global id, polling a data from a source, sorting changes of a source system based on a time of update and an entity id, creating and comparing an old as of state value and a new as of state value for each field for each update in the entity in the source and destination to detect a conflict on an entity, sending a time of update in the entity and a revision id of a change to the destination, comparing the global id with an event id for each entity at the destination to detect a presence of an entity in the destination and processing an entity at the destination based an event id.

Abstract translation: 这里的实施例提供了用于将来自源到目的地的数据进行集成的系统和方法。 该方法包括生成global-id，设置与全局id中的实体id相对应的事件id，轮询来自源的数据，根据更新时间和实体id对源系统的改变进行排序，创建和 将来自源和目的地中的实体中的每个更新的每个字段的状态值和状态值的新的状态值进行比较以检测实体上的冲突，在实体中发送更新时间和修改ID 将目的地的每个实体的全局id与事件ID进行比较，以检测目的地中的实体的存在并根据事件ID处理目的地的实体。

公开(公告)号：US20130117229A1

公开(公告)日：2013-05-09

申请号：US13457497

申请日：2012-04-27

Applicant: Sandeep Jain ,  Prakash Chandra Tiwary

Inventor： Sandeep Jain ,  Prakash Chandra Tiwary

IPC: G06F17/30

CPC classification number: G06F13/22 ,  G06F11/2082 ,  G06F17/30008 ,  G06F17/30575

Abstract: The embodiments herein provide a system and a method for integrating a data from a source to a destination. The method comprises generating a global-id, setting an event-id corresponding to an entity id in the global id, polling a data from a source, sorting changes of a source system based on a time of update and an entity id, creating and comparing an old as of state value and a new as of state value for each field for each update in the entity in the source and destination to detect a conflict on an entity, sending a time of update in the entity and a revision id of a change to the destination, comparing the global id with an event id for each entity at the destination to detect a presence of an entity in the destination and processing an entity at the destination based an event id.

Abstract translation: 这里的实施例提供了用于将来自源到目的地的数据进行集成的系统和方法。 该方法包括生成global-id，设置与全局id中的实体id相对应的事件id，轮询来自源的数据，根据更新时间和实体id对源系统的改变进行排序，创建和 将来自源和目的地中的实体中的每个更新的每个字段的状态值和状态值的新的状态值进行比较以检测实体上的冲突，在实体中发送更新时间和修改ID 将目的地的每个实体的全局id与事件ID进行比较，以检测目的地中的实体的存在并根据事件ID处理目的地的实体。

公开(公告)号：US09489325B2

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

申请号：US13457492

申请日：2012-04-27

Applicant: Sandeep Jain ,  Prakash Chandra Tiwary

Inventor： Sandeep Jain ,  Prakash Chandra Tiwary

IPC: G06F11/00 ,  G06F13/22 ,  G06F17/30 ,  G06F11/20

CPC classification number: G06F13/22 ,  G06F11/2082 ,  G06F17/30008 ,  G06F17/30575

Abstract: The embodiments herein provide a method and system for polling and processing data. The method comprises computing a maximum time from a source after a last update time, waiting for a preset time to ensure that all transactions with respect to a change in a data is completed, querying for a plurality of changes after an elapse of the preset waiting time since the last update time and up to the maximum time, generating a time window, collecting a list of changes occurred within the generated time window, sending the collected list of changes for processing; and updating the processed data at the destination. The time window comprises a time interval between the last update time and the maximum time.

Abstract translation: 本文的实施例提供了一种用于轮询和处理数据的方法和系统。 该方法包括计算在最后更新时间之后的来自源的最大时间，等待预设时间以确保关于数据改变的所有事务完成，在经过预设等待之后查询多个改变 生成时间窗口，收集在生成的时间窗口内发生的更改列表，发送收集的更改列表进行处理; 并更新目的地处理的数据。 时间窗口包括最后更新时间和最大时间之间的时间间隔。

公开(公告)号：US08938421B2

公开(公告)日：2015-01-20

申请号：US13457501

申请日：2012-04-27

Applicant: Sandeep Jain ,  Prakash Chandra Tiwary

Inventor： Sandeep Jain ,  Prakash Chandra Tiwary

IPC: G06F17/30 ,  G06F13/22

CPC classification number: G06F13/22 ,  G06F11/2082 ,  G06F17/30008 ,  G06F17/30575

Abstract: A computer implemented system and method for synchronizing a plurality of changes from a source computing device to a destination computing device, have been disclosed. The method involves, determining an initial polling time and a last polled time, checking for an elapse of a preset polling interval from a maximum poll time, polling a source for fetching data after an elapse of a polling interval from the maximum poll time, selecting a plurality of changes from the source computing device, processing the fetched data, writing the processed data at a destination computing device and reporting a status of a synchronization process.

Abstract translation: 已经公开了用于将来自源计算设备的多个变化同步到目的地计算设备的计算机实现的系统和方法。 该方法包括：确定初始轮询时间和最后轮询时间，从最大轮询时间检查预设轮询间隔的经过，轮询在从最大轮询时间经过轮询间隔之后获取数据的源，选择 来自源计算设备的多个改变，处理获取的数据，在目的地计算设备处写入处理的数据并报告同步过程的状态。

公开(公告)号：US20130117226A1

公开(公告)日：2013-05-09

申请号：US13457501

申请日：2012-04-27

Applicant: Sandeep Jain ,  Prakash Chandra Tiwary

Inventor： Sandeep Jain ,  Prakash Chandra Tiwary

IPC: G06F17/30

CPC classification number: G06F13/22 ,  G06F11/2082 ,  G06F17/30008 ,  G06F17/30575

Abstract: The embodiments herein provide a system and a method for synchronizing a plurality of changes from a source to a destination. The method comprises the steps of starting with an initial polling time, checking for an elapse of a polling interval from a last polled time, polling a source for fetching a data after an elapse of a polling interval from a last polled time, selecting a plurality of changes from the source made by a user, processing the data fetched at the last polling time in a single thread, writing the processed data at a destination and reporting a status of a synchronization process. The initial polling time is a time from which a synchronization of changes in a data is initiated. The method uses both an even t based trigger and a scheduler based trigger

Abstract translation: 本文的实施例提供了一种用于使从源到目的地的多个变化同步的系统和方法。 该方法包括以下步骤：从初始轮询时间开始，从最后轮询时间检查轮询间隔的经过，轮询用于在从最后轮询时间经过轮询间隔之后获取数据的源，选择多个 从用户做出的来源的更改，处理在单个线程中在最后轮询时间获取的数据，将处理的数据写入目的地并且报告同步过程的状态。 初始轮询时间是数据发生同步改变的时间。 该方法使用基于偶数触发的触发和基于调度器的触发

公开(公告)号：US20130117482A1

公开(公告)日：2013-05-09

申请号：US13457492

申请日：2012-04-27

Applicant: Sandeep Jain ,  Prakash Chandra Tiwary

Inventor： Sandeep Jain ,  Prakash Chandra Tiwary

IPC: G06F13/22

CPC classification number: G06F13/22 ,  G06F11/2082 ,  G06F17/30008 ,  G06F17/30575

Abstract: The embodiments herein provide a method and system for polling and processing data. The method comprises computing a maximum time from a source after a last update time, waiting for a preset time to ensure that all transactions with respect to a change in a data is completed, querying for a plurality of changes after an elapse of the preset waiting time since the last update time and up to the maximum time, generating a time window, collecting a list of changes occurred within the generated time window, sending the collected list of changes for processing; and updating the processed data at the destination. The time window comprises a time interval between the last update time and the maximum time.

Abstract translation: 本文的实施例提供了一种用于轮询和处理数据的方法和系统。 该方法包括计算在最后更新时间之后的来自源的最大时间，等待预设时间以确保关于数据改变的所有事务完成，在经过预设等待之后查询多个改变 生成时间窗口，收集在生成的时间窗口内发生的更改列表，发送收集的更改列表进行处理; 并更新目的地处理的数据。 时间窗口包括最后更新时间和最大时间之间的时间间隔。

公开(公告)号：US09053035B1

公开(公告)日：2015-06-09

申请号：US14088446

申请日：2013-11-25

Applicant: Ashish Mathur ,  Sandeep Jain

Inventor： Ashish Mathur ,  Sandeep Jain

IPC: G06F12/02 ,  G06F12/08

CPC classification number: G06F9/3004 ,  G06F8/45 ,  G06F8/52 ,  G06F9/45558

Abstract: A multi-threaded binary translation system performs atomic operations by a thread, such operations include processing a load linked instruction and a store conditional instruction. The store conditional instruction updates data stored in a shared memory address only when at least three conditions are satisfied. The conditions are: a copy of a load linked shared memory address of the load linked instruction is the same as the store conditional shared memory address, a reservation flag indicates that the thread has a valid reservation, and the copy of data stored by the load linked instruction is the same as data stored in the store conditional shared memory address.

Abstract translation: 多线程二进制翻译系统通过线程执行原子操作，这样的操作包括处理加载链接指令和存储条件指令。 存储条件指令仅在满足至少三个条件时更新存储在共享存储器地址中的数据。 条件是：负载链接指令的负载链接共享存储器地址的副本与存储条件共享存储器地址相同，保留标志指示线程具有有效预留，以及负载存储的数据副本 链接指令与存储在存储条件共享存储器地址中的数据相同。

公开(公告)号：US20150149725A1

公开(公告)日：2015-05-28

申请号：US14088446

申请日：2013-11-25

Applicant: Ashish Mathur ,  Sandeep Jain

Inventor： Ashish Mathur ,  Sandeep Jain

IPC: G06F12/08

CPC classification number: G06F9/3004 ,  G06F8/45 ,  G06F8/52 ,  G06F9/45558

Abstract: A multi-threaded binary translation system performs atomic operations by a thread, such operations include processing a load linked instruction and a store conditional instruction. The store conditional instruction updates data stored in a shared memory address only when at least three conditions are satisfied. The conditions are: a copy of a load linked shared memory address of the load linked instruction is the same as the store conditional shared memory address, a reservation flag indicates that the thread has a valid reservation, and the copy of data stored by the load linked instruction is the same as data stored in the store conditional shared memory address.

Abstract translation: 多线程二进制翻译系统通过线程执行原子操作，这样的操作包括处理加载链接指令和存储条件指令。 存储条件指令仅在满足至少三个条件时更新存储在共享存储器地址中的数据。 条件是：负载链接指令的负载链接共享存储器地址的副本与存储条件共享存储器地址相同，保留标志指示线程具有有效预留，以及负载存储的数据副本 链接指令与存储在存储条件共享存储器地址中的数据相同。

公开(公告)号：US20150121127A1

公开(公告)日：2015-04-30

申请号：US14067920

申请日：2013-10-30

Applicant: Sandeep Jain

Inventor： Sandeep Jain

IPC: G06F11/14

CPC classification number: G06F11/1402 ,  G06F11/3636 ,  G06F12/0802 ,  G06F12/0875

Abstract: A functional simulator with watchpoint support includes a CPU having a first-level DMI cache, a watchpoint manager having a second-level DMI cache, an interconnect module, and a memory controller. The simulator is operated by a front-end tool. Watchpoints corresponding to a predetermined memory addresses are set by the front-end tool and stored as a watchpoint address list in the watchpoint manager. When a memory access request is received by the first-level DMI cache, after a failure to complete the memory access request, the CPU transmits the request to the watchpoint manager. The watchpoint manager searches for a memory address associated with the memory access request in the watchpoint address list. If a match is found, the watchpoint manager generates a watchpoint hit signal and notifies the front-end tool.

Abstract translation: 具有观察点支持的功能模拟器包括具有第一级DMI缓存的CPU，具有二级DMI高速缓存的观察点管理器，互连模块和存储器控制器。 模拟器由前端工具操作。 与预定存储器地址相对应的观察点由前端工具设置，并作为观察点地址列表存储在观察点管理器中。 当第一级DMI缓存接收到存储器访问请求时，在完成存储器访问请求失败之后，CPU将该请求发送给观察点管理器。 观察点管理器在观察点地址列表中搜索与存储器访问请求相关联的存储器地址。 如果找到匹配，则观察点管理器生成观察点命中信号并通知前端工具。

公开(公告)号：US07809827B1

公开(公告)日：2010-10-05

申请号：US11516878

申请日：2006-09-07

Applicant: Manoj Apte ,  Sandeep Jain ,  Fritz Budiyanto ,  Senthil Kumar Duraiswamy ,  Saravanan Deenadayalan ,  Yulianto Kokasih Ko

Inventor： Manoj Apte ,  Sandeep Jain ,  Fritz Budiyanto ,  Senthil Kumar Duraiswamy ,  Saravanan Deenadayalan ,  Yulianto Kokasih Ko

IPC: G06F15/173

CPC classification number: H04L43/028 ,  H04L45/10 ,  H04L45/38

Abstract: A network device comprises a service card (e.g., a lawful intercept (LI) service card) executing a communication protocol to receive, from one or more sources (e.g., law enforcement agents), intercept information specifying at least one destination and criteria for matching one or more packet flows. The network device further includes a network interface card to receive a packet from a network, and a control unit to provide the packet from the interface card to the LI service card. The LI service card executes a flow match detection module that, when the packet matches the criteria of the intercept information, forwards the packet to the destination specified by the intercept information. The network device may provide real-time intercept and relaying of specified network-based communications. Moreover, the techniques described herein allow LEAs to tap packet flows with little delay after specifying intercept information, e.g., within 50 milliseconds, even under high-volume networks.

Abstract translation: 网络设备包括执行通信协议的服务卡（例如合法拦截（LI）服务卡），以从一个或多个来源（例如执法人员）接收指定至少一个目的地的拦截信息和用于匹配的标准 一个或多个分组流。 网络设备还包括从网络接收分组的网络接口卡，以及将接口卡向L1服务卡提供分组的控制单元。 LI服务卡执行流匹配检测模块，当分组符合拦截信息的标准时，将分组转发到由拦截信息指定的目的地。 网络设备可以提供指定的基于网络的通信的实时拦截和中继。 此外，即使在高容量网络下，本文所描述的技术允许LEA在指定拦截信息（例如，在50毫秒内）之后稍微延迟地敲击分组流。