专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5870761A Parallel queue propagation 失效
标题翻译：并行队列传播
公开(公告)号：US5870761A
公开(公告)日：1999-02-09
申请号：US770573
申请日：1996-12-19
申请人： Alan Demers , James Stamos , Sandeep Jain , Brian Oki , Roger J. Bamford
发明人： Alan Demers , James Stamos , Sandeep Jain , Brian Oki , Roger J. Bamford
IPC分类号： G06F17/30
CPC分类号： G06F17/30581 , Y10S707/99931 , Y10S707/99932 , Y10S707/99937 , Y10S707/99938 , Y10S707/99942 , Y10S707/99952 , Y10S707/99953
摘要： A method and system are provided for duplicating at a destination site changes made to data at a source site. According to the method a plurality of streams are established between the source site and the destination site. The plurality of streams are used in parallel to propagate changes made at the source site to the destination site. A record of transactions that made changes that need to be propagated from the source site to the destination site is maintained at the source site. Before propagating changes made by a transaction to the destination site on a stream of the plurality of streams, the record of transactions is inspected to identify a set of transactions whose changes are not known to have been made permanent at the destination site. It is then determined whether the transaction could possibly depend on any transaction in the set of transactions. If the transaction could not possibly depend on any transaction in the set of transactions, then the changes made by the transaction are propagated to the destination site using one of the plurality of streams.
摘要翻译：提供了一种方法和系统，用于在目的地站点复制源站点上的数据。根据该方法，在源站点和目的站点之间建立多个流。多个流并行使用，以将源站点处的更改传播到目标站点。源站点上保留了需要从源站点传播到目标站点的更改事务记录。在将交易所做的改变传播到多个流的流之前的目的地站点之前，检查事务的记录以识别一组事务，其变化不知道已经在目的地站点被永久化。然后确定交易是否可能依赖于该组交易中的任何交易。如果事务不可能依赖于事务集合中的任何事务，则事务所做的更改使用多个流中的一个传播到目标站点。

2. 发明授权

US5870760A Dequeuing using queue batch numbers 失效
标题翻译：使用队列批号排队
公开(公告)号：US5870760A
公开(公告)日：1999-02-09
申请号：US769740
申请日：1996-12-19
申请人： Alan Demers , Sandeep Jain
发明人： Alan Demers , Sandeep Jain
IPC分类号： G06F17/30
CPC分类号： G06F17/30575 , G06F17/30348 , Y10S707/99952 , Y10S707/99953
摘要： A method and system are provided for processing records from a set of records, where records are repeatedly being added to the set of records, and where each record in the set of records has to be processed once for each of a plurality of entities. According to the method, each record that is added to the set of records is marked with a default batch value. For each entity of the plurality of entities, a batch of the records is processed by performing the steps of: reading a last batch value associated with the entity, processing the records in the set of records that are marked with batch values that are more recent than the last batch value associated with the entity, and updating the last batch value associated with the entity to a most recent batch value of the records processed for the entity. Between processing consecutive batches for an entity of the plurality of entities, the set of records are marked by performing the steps of: updating a batch counter value to reflect a more recent batch number; and marking all records in the set of records that have the default batch value with the batch counter value.
摘要翻译：提供了一种方法和系统，用于处理来自一组记录的记录，其中记录被重复地添加到记录集合中，并且记录集合中的每个记录必须对于多个实体中的每一个进行一次处理。根据该方法，添加到记录集中的每个记录都标有默认批次值。对于多个实体中的每个实体，通过执行以下步骤来处理一批记录：读取与该实体相关联的最后批次值，处理标记有较新近的批次值的记录集中的记录而不是与该实体相关联的最后一个批次值，并将与实体关联的最后一个批次值更新为为该实体处理的记录的最新批次值。在处理多个实体的实体的连续批次之间，通过执行以下步骤来标记该组记录：更新批计数器值以反映更新的批次号; 并将具有默认批次值的记录集中的所有记录标记为批计数器值。

3. 发明授权

US5781912A Recoverable data replication between source site and destination site without distributed transactions 失效
标题翻译：源站点和目标站点之间的可恢复数据复制，无需分布式事务
公开(公告)号：US5781912A
公开(公告)日：1998-07-14
申请号：US772003
申请日：1996-12-19
申请人： Alan Demers , Sandeep Jain
发明人： Alan Demers , Sandeep Jain
IPC分类号： G06F11/14 , G06F11/00 , G06F13/00
CPC分类号： G06F11/1474 , G06F11/1662 , G06F11/2094 , Y10S707/99953
摘要： A method and system are provided for recovering after a failure in a data replication environment. According to the method, a transaction is executed at a source site that makes changes that must be replicated at a destination site. The changes are made permanent at the source site. The changes are made permanent at the source site without the source site being informed as to whether the changes were successfully applied at the destination site. The changes are sent to the destination site. The changes are applied at the destination site. If the changes are successfully applied before the failure, then the changes are made permanent at the destination site and a record is added to a set of records at the destination site. The record indicates that the changes where made permanent at the destination site. After a failure, the set of records at the destination site are used to determine which changes must be sent from the source site to the destination site after the failure.
摘要翻译：提供了一种用于在数据复制环境中的故障之后进行恢复的方法和系统。根据该方法，在源站点执行事务，进行必须在目标站点复制的更改。更改在源站点永久保存。更改在源站点永久存在，而不会通知源站点是否在目标站点成功应用更改。更改将发送到目标站点。更改应用于目标站点。如果更改在故障之前成功应用，则更改将在目标站点永久保留，并将记录添加到目标站点上的一组记录。记录表明在目的地站点永久存在的变化。发生故障后，目标站点上的记录集用于确定在发生故障后哪些更改必须从源站点发送到目标站点。

4. 发明授权

US10836765B2 Process for the preparation of valacyclovir 有权
公开(公告)号：US10836765B2
公开(公告)日：2020-11-17
申请号：US16081944
申请日：2017-02-24
申请人： AUROBINDO PHARMA LTD , Sandeep Jain , Komel Ansari , Subramanyam Maddala , Sivakumaran Meenakshisundaram
发明人： Sandeep Jain , Komel Ansari , Subramanyam Maddala , Sivakumaran Meenakshisundaram
IPC分类号： C07D473/18 , B01J19/00
CPC分类号： C07D473/18 , B01J19/0093 , B01J2219/00033
摘要： The present invention relates to an improved process for the preparation of Valacyclovir or pharmaceutically acceptable salts thereof, which comprises reaction of amine-protected Valacyclovir or its salt with deprotecting agent in a continuous flow reactor.

5. 发明授权

US10505871B1 Future messaging maximizing contextual relevancy and minimizing information overload based distractions 有权
公开(公告)号：US10505871B1
公开(公告)日：2019-12-10
申请号：US15827172
申请日：2017-11-30
申请人： Sandeep Jain
发明人： Sandeep Jain
IPC分类号： H04L12/58
CPC分类号： H04L51/04 , H04L51/12 , H04L51/24 , H04L51/28
摘要： A messaging server with a future message storage space for future messages, each being a sender created message not yet delivered to a recipient that has an associated sender specified message delivery time. Recipient specific delivery block details are specified for a set of delivery blocks for future messages. The future messages are received processed and stored. Until the respective sender specified message delivery time a respective one of the set of senders is able to retract and edit a corresponding one of the future messages. Future messages are delivered at the delivery time consistent with the delivery blocks. After delivery the sender is unable to retract and edit a corresponding delivered message. Future messages do not alert a recipient of arrival until the sender established delivery time, which minimizes cognitive distractions and provides the sender with notice for anticipating a time of response, without overly distracting the recipient.

6. 发明授权

US09229890B2 Method and a system for integrating data from a source to a destination 有权
标题翻译：方法和用于将数据从源到目标集成的系统
公开(公告)号：US09229890B2
公开(公告)日：2016-01-05
申请号：US13457497
申请日：2012-04-27
申请人： Sandeep Jain , Prakash Chandra Tiwary
发明人： Sandeep Jain , Prakash Chandra Tiwary
IPC分类号： G06F17/30 , G06F13/22
CPC分类号： G06F13/22 , G06F11/2082 , G06F17/30008 , G06F17/30575
摘要： 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.
摘要翻译：这里的实施例提供了用于将来自源到目的地的数据进行集成的系统和方法。该方法包括生成global-id，设置与全局id中的实体id相对应的事件id，轮询来自源的数据，根据更新时间和实体id对源系统的改变进行排序，创建和将来自源和目的地中的实体中的每个更新的每个字段的状态值和状态值的新的状态值进行比较以检测实体上的冲突，在实体中发送更新时间和修改ID 将目的地的每个实体的全局id与事件ID进行比较，以检测目的地中的实体的存在并根据事件ID处理目的地的实体。

7. 发明授权

US09053035B1 Multi-threaded system for performing atomic binary translations 有权
标题翻译：用于执行原子二进制翻译的多线程系统
公开(公告)号：US09053035B1
公开(公告)日：2015-06-09
申请号：US14088446
申请日：2013-11-25
申请人： Ashish Mathur , Sandeep Jain
发明人： Ashish Mathur , Sandeep Jain
IPC分类号： G06F12/02 , G06F12/08
CPC分类号： G06F9/3004 , G06F8/45 , G06F8/52 , G06F9/45558
摘要： 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.
摘要翻译：多线程二进制翻译系统通过线程执行原子操作，这样的操作包括处理加载链接指令和存储条件指令。存储条件指令仅在满足至少三个条件时更新存储在共享存储器地址中的数据。条件是：负载链接指令的负载链接共享存储器地址的副本与存储条件共享存储器地址相同，保留标志指示线程具有有效预留，以及负载存储的数据副本链接指令与存储在存储条件共享存储器地址中的数据相同。

8. 发明申请

US20150149725A1 MULTI-THREADED SYSTEM FOR PERFORMING ATOMIC BINARY TRANSLATIONS 有权
标题翻译：用于执行原子二进制翻译的多线程系统
公开(公告)号：US20150149725A1
公开(公告)日：2015-05-28
申请号：US14088446
申请日：2013-11-25
申请人： Ashish Mathur , Sandeep Jain
发明人： Ashish Mathur , Sandeep Jain
IPC分类号： G06F12/08
CPC分类号： G06F9/3004 , G06F8/45 , G06F8/52 , G06F9/45558
摘要： 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.
摘要翻译：多线程二进制翻译系统通过线程执行原子操作，这样的操作包括处理加载链接指令和存储条件指令。存储条件指令仅在满足至少三个条件时更新存储在共享存储器地址中的数据。条件是：负载链接指令的负载链接共享存储器地址的副本与存储条件共享存储器地址相同，保留标志指示线程具有有效预留，以及负载存储的数据副本链接指令与存储在存储条件共享存储器地址中的数据相同。

9. 发明申请

US20150121127A1 WATCHPOINT SUPPORT SYSTEM FOR FUNCTIONAL SIMULATOR 有权
标题翻译：功能模拟器的观察支持系统
公开(公告)号：US20150121127A1
公开(公告)日：2015-04-30
申请号：US14067920
申请日：2013-10-30
申请人： Sandeep Jain
发明人： Sandeep Jain
IPC分类号： G06F11/14
CPC分类号： G06F11/1402 , G06F11/3636 , G06F12/0802 , G06F12/0875
摘要： 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.
摘要翻译：具有观察点支持的功能模拟器包括具有第一级DMI缓存的CPU，具有二级DMI高速缓存的观察点管理器，互连模块和存储器控制器。模拟器由前端工具操作。与预定存储器地址相对应的观察点由前端工具设置，并作为观察点地址列表存储在观察点管理器中。当第一级DMI缓存接收到存储器访问请求时，在完成存储器访问请求失败之后，CPU将该请求发送给观察点管理器。观察点管理器在观察点地址列表中搜索与存储器访问请求相关联的存储器地址。如果找到匹配，则观察点管理器生成观察点命中信号并通知前端工具。

10. 发明授权

US07809827B1 Network device having service card for lawful intercept and monitoring of packet flows 有权
标题翻译：网络设备具有合法拦截和监控分组流的业务卡
公开(公告)号：US07809827B1
公开(公告)日：2010-10-05
申请号：US11516878
申请日：2006-09-07
申请人： Manoj Apte , Sandeep Jain , Fritz Budiyanto , Senthil Kumar Duraiswamy , Saravanan Deenadayalan , Yulianto Kokasih Ko
发明人： Manoj Apte , Sandeep Jain , Fritz Budiyanto , Senthil Kumar Duraiswamy , Saravanan Deenadayalan , Yulianto Kokasih Ko
IPC分类号： G06F15/173
CPC分类号： H04L43/028 , H04L45/10 , H04L45/38
摘要： 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.
摘要翻译：网络设备包括执行通信协议的服务卡（例如合法拦截（LI）服务卡），以从一个或多个来源（例如执法人员）接收指定至少一个目的地的拦截信息和用于匹配的标准一个或多个分组流。网络设备还包括从网络接收分组的网络接口卡，以及将接口卡向L1服务卡提供分组的控制单元。 LI服务卡执行流匹配检测模块，当分组符合拦截信息的标准时，将分组转发到由拦截信息指定的目的地。网络设备可以提供指定的基于网络的通信的实时拦截和中继。此外，即使在高容量网络下，本文所描述的技术允许LEA在指定拦截信息（例如，在50毫秒内）之后稍微延迟地敲击分组流。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式