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

1. 发明授权

US06898642B2 Synchronous collaboration based on peer-to-peer communication 失效
标题翻译：基于对等通信的同步协作
公开(公告)号：US06898642B2
公开(公告)日：2005-05-24
申请号：US09836120
申请日：2001-04-17
申请人： Girish Bhimrao Chafle , Manish Gupta , Neeran Mohan Karnik , Pradeep Varma
发明人： Girish Bhimrao Chafle , Manish Gupta , Neeran Mohan Karnik , Pradeep Varma
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： H04L12/1827 , G06F17/30168 , G06F17/30206
摘要： A peer-to-peer protocol is based on the use of global timestamps and client priorities in serializing modifications to a shared workspace of real-time collaboration. The method caters to dynamic clients wherein a client can leave or join an ongoing collaboration session as long as there is always at least one client present/remaining in the collaboration session. The method can support multiple definitions of a modification, including partitioning-based definitions, wherein the method provides full support for locking of partitions, and a full treatment of inter-partition synchronization via a modification definition over multiple partitions. The method is capable of utilizing the many standard methods of creating a global, distributed, synchronized clock for the global timestamps utilized by it. The method is rollback-based for correcting tentative but incorrect serializations, and provides additional backup in terms of checkpoints for additional safety and for the support of lightweight, pervasive clients. The method includes many optimizations for efficiency, and includes a method of switching to and back from distributed server-based serialization for the periods when the network response is better suited to a distributed server than the peer-to-peer protocol.
摘要翻译：一个对等协议是基于使用全局时间戳和客户端优先级对串行化对实时协作的共享工作空间的修改。该方法适用于动态客户端，其中客户端可以离开或加入正在进行的协作会话，只要始终至少有一个客户端存在/保留在协作会话中。该方法可以支持修改的多个定义，包括基于分区的定义，其中该方法提供对分区的锁定的完全支持，以及通过多个分区的修改定义对分区间同步的全面处理。该方法能够利用为其所使用的全局时间戳创建全局，分布式同步时钟的许多标准方法。该方法是基于回滚的，用于纠正暂定但不正确的序列化，并且在检查点方面提供额外的备份，以获得更多的安全性，并支持轻量级，普及的客户端。该方法包括许多效率优化，并且包括在网络响应比对等协议更适合于分布式服务器的时期期间切换到基于分布式服务器的串行化的方法。

2. 发明授权

US07174379B2 Managing server resources for hosted applications 失效
标题翻译：管理托管应用程序的服务器资源
公开(公告)号：US07174379B2
公开(公告)日：2007-02-06
申请号：US09921868
申请日：2001-08-03
申请人： Vikas Agarwal , Girish Chafle , Neeran Mohan Karnik , Arun Kumar , Ashish Kundu , Johara Shahabuddin , Pradeep Varma
发明人： Vikas Agarwal , Girish Chafle , Neeran Mohan Karnik , Arun Kumar , Ashish Kundu , Johara Shahabuddin , Pradeep Varma
IPC分类号： G06F15/173 , G06F9/445
CPC分类号： G06F9/505 , G06F9/5055 , H04L67/20 , H04L67/22 , H04L69/329
摘要： In an ASP server farm, requests to use an application are directed to a particular executing instance of the application (or an appropriate component thereof) that is identified as being the least loaded of the available such instances of the application or its component. The number of such instances is dynamically increased or decreased in response to the number of requests for the application or components thereof. Requests may be directed (in accordance with the first aspect) or the instances adjusted (in accordance with a second aspect) on a per client-basis, in which instances of the application and/or components thereof are reserved for the use of a user or a particular group of users. Operation in this manner facilitates compliance with service agreements with respective users or groups of users.
摘要翻译：在ASP服务器场中，使用应用程序的请求被引导到应用程序的特定执行实例（或其适当的组件），该实例被标识为应用程序或其组件的可用这样的实例的最少加载。响应于应用程序的请求数量或其组件的数量，这种实例的数量被动态地增加或减少。请求可以针对每个客户端（根据第一方面）或被调整（根据第二方面）的实例，其中应用和/或其组件的实例被保留用于使用用户或特定的一组用户。以这种方式进行操作便于遵守与各个用户或用户组的服务协议。

3. 发明申请

US20130232476A1 AUTOMATIC PIPELINE PARALLELIZATION OF SEQUENTIAL CODE 有权
标题翻译：自动管道顺序代码的并行化
公开(公告)号：US20130232476A1
公开(公告)日：2013-09-05
申请号：US13409536
申请日：2012-03-01
申请人： Pradeep Varma , Manish Gupta , Monika Gupta , Naga Praveen Kumar Katta
发明人： Pradeep Varma , Manish Gupta , Monika Gupta , Naga Praveen Kumar Katta
IPC分类号： G06F9/45
CPC分类号： G06F8/443 , G06F8/45 , G06F8/452
摘要： A system and associated method for automatically pipeline parallelizing a nested loop in sequential code over a predefined number of threads. Pursuant to task dependencies of the nested loop, each subloop of the nested loop are allocated to a respective thread. Combinations of stage partitions executing the nested loop are configured for parallel execution of a subloop where permitted. For each combination of stage partitions, a respective bottleneck is calculated and a combination with a minimum bottleneck is selected for parallelization.
摘要翻译：一种系统和相关联的方法，用于在预定义数量的线程上自动流水线化序列码中的嵌套循环。根据嵌套循环的任务依赖关系，将嵌套循环的每个子循环分配给相应的线程。执行嵌套循环的分段分组的组合被配置为在允许的情况下并行执行子循环。对于级分段的每个组合，计算相应的瓶颈，并且选择具有最小瓶颈的组合用于并行化。

4. 发明授权

US08949809B2 Automatic pipeline parallelization of sequential code 有权
标题翻译：自动流水线并行化顺序码
公开(公告)号：US08949809B2
公开(公告)日：2015-02-03
申请号：US13409536
申请日：2012-03-01
申请人： Pradeep Varma , Manish Gupta , Monika Gupta , Naga Praveen Kumar Katta
发明人： Pradeep Varma , Manish Gupta , Monika Gupta , Naga Praveen Kumar Katta
IPC分类号： G06F9/45
CPC分类号： G06F8/443 , G06F8/45 , G06F8/452
摘要： A system and associated method for automatically pipeline parallelizing a nested loop in sequential code over a predefined number of threads. Pursuant to task dependencies of the nested loop, each subloop of the nested loop are allocated to a respective thread. Combinations of stage partitions executing the nested loop are configured for parallel execution of a subloop where permitted. For each combination of stage partitions, a respective bottleneck is calculated and a combination with a minimum bottleneck is selected for parallelization.
摘要翻译：一种系统和相关联的方法，用于在预定义数量的线程上自动流水线化序列码中的嵌套循环。根据嵌套循环的任务依赖关系，将嵌套循环的每个子循环分配给相应的线程。执行嵌套循环的分段分组的组合被配置为在允许的情况下并行执行子循环。对于级分段的每个组合，计算相应的瓶颈，并且选择具有最小瓶颈的组合用于并行化。

5. 发明授权

US09378138B2 Conservative garbage collection and access protection 有权
标题翻译：保守的垃圾收集和访问保护
公开(公告)号：US09378138B2
公开(公告)日：2016-06-28
申请号：US13172039
申请日：2011-06-29
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30 , G06F12/02 , G06F12/14
CPC分类号： G06F12/0253 , G06F3/0608 , G06F3/0652 , G06F3/0673 , G06F12/1416 , G06F2212/1044 , G06F2212/702
摘要： A method of memory management can include creating an initial root set of pointers for a program during execution of the program and performing a marking process by iteratively marking referred objects of each pointer of the root set and expanding the root set with filtered, encoded pointers. The method also can include identifying each non-live object for any marked object as red-marked and performing, using a processor, a re-marking process on the root set in which red-marked objects are excluded. Each object of the root set not marked can be designated as including a memory leak.
摘要翻译：存储器管理的方法可以包括在执行程序期间创建用于程序的指针的初始根集合，并且通过迭代地标记根集合的每个指针的引用对象并使用经过过滤的编码指针来扩展根集来执行标记处理。该方法还可以包括使用处理器识别任何标记对象的每个非活动对象，使用红色标记和执行，在根集合上排除重新标记对象的重新标记过程。没有标记的根设备的每个对象都可以被指定为包含内存泄漏。

6. 发明授权

US08140523B2 Decision based system for managing distributed resources and modeling the global optimization problem 失效
标题翻译：用于管理分布式资源和基于全局优化问题建模的基于决策的系统
公开(公告)号：US08140523B2
公开(公告)日：2012-03-20
申请号：US12247291
申请日：2008-10-08
申请人： Sameh A. Fakhouri , William F. Jerome , Krishna Kummamuru , Vijay K. Naik , John A. Pershing, Jr. , Ajay Raina , Pradeep Varma , Peter B. Badovinatz , Vijay Kumar
发明人： Sameh A. Fakhouri , William F. Jerome , Krishna Kummamuru , Vijay K. Naik , John A. Pershing, Jr. , Ajay Raina , Pradeep Varma , Peter B. Badovinatz , Vijay Kumar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06Q10/04 , G06Q10/06
摘要： A decision support system called Mounties that is designed for managing applications and resources using rule-based constraints in scalable mission-critical clustering environments. Mounties consists of four active service components: (1) a repository of resource proxy objects for modeling and manipulating the cluster configuration; (2) an event notification mechanism for monitoring and controlling interdependent and distributed resources; (3) a rule evaluation and decision processing mechanism; and (4) a global optimization service for providing decision making capabilities. The focus of this paper is on the design of the first three services that together connect and coordinate the distributed resources with the decision making component.
摘要翻译：一种称为Mounties的决策支持系统，其设计用于在可扩展的任务关键型集群环境中使用基于规则的约束来管理应用程序和资源。 Mounties由四个主动服务组件组成：（1）用于建模和操纵集群配置的资源代理对象的存储库; （2）监测和控制相互依赖和分配的资源的事件通知机制; （3）规则评估和决策处理机制; （4）提供决策能力的全球优化服务。本文的重点是设计前三个服务，将决策组件连接和协调分布式资源。

7. 发明申请

US20070226708A1 Source-to-source transformation for language dialects 失效
标题翻译：语言方言的源到源转换
公开(公告)号：US20070226708A1
公开(公告)日：2007-09-27
申请号：US11388353
申请日：2006-03-24
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： G06F9/45
CPC分类号： G06F8/51
摘要： An analysis and source-to-source transformation framework covers dialects of programming languages that lack formal definition for all individual dialects. Multiple instantiations of the same compiler front-end tools can be used with different settings to create distinct intermediate forms and maps. Intermediate forms and maps are used in an individual analysis and source-to-source transformation context, and performing the analysis and source-to-source transformation thereupon. A unified tool set is desirably provided, including standard compiler front-end tools and code transformation/generation tools, wherein source code edits are carried out in order to make the source code more amenable to translation to intermediate forms. The analysis results or intermediate forms created by individual tools are used by other tools as well as further analyzed to create a map of the regions of validity and invalidity of the intermediate forms, and tracking the source-code edits performed in order to obtain the same. Among other benefits, this provides a choice of the best tools combination for maximum code analysis coverage.
摘要翻译：分析和源到源转换框架涵盖了对所有个人方言缺乏正式定义的编程语言的方言。相同编译器前端工具的多个实例可以与不同的设置一起使用，以创建不同的中间格式和映射。中间形式和地图用于个人分析和源到源转换环境，并进行分析和源到源转换。期望提供统一的工具集，包括标准编译器前端工具和代码转换/生成工具，其中执行源代码编辑以便使源代码更适于翻译成中间形式。由各种工具创建的分析结果或中间形式由其他工具使用，并进一步分析以创建中间形式的有效性和无效区域的映射，并跟踪执行的源代码编辑以获得相同的。除了其他好处之外，这提供了最佳代码分析覆盖的最佳工具组合的选择。

8. 发明授权

US06462596B1 Reduced-transistor, double-edged-triggered, static flip flop 有权
标题翻译：减少晶体管，双边触发，静态触发器
公开(公告)号：US06462596B1
公开(公告)日：2002-10-08
申请号：US09599900
申请日：2000-06-23
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： H03K3356
CPC分类号： H03K3/356173 , H03K3/012 , H03K3/356156
摘要： A static, double-edge-triggered flip-flop has an upper data path and a lower data path connected between a data input node and an output terminal. The upper path includes a switch connected to a first data loop, and the lower path includes a switch connected to a second data loop. The first and second data loops share a forward path having a data-inverting circuit. In addition, each loop has a feedback path which contains only one element in the form of a switch. However, no data-inverting circuit is included in either of the feedback paths. Advantageously, all the elements of the flip-flop may be constructed using MOSFET transistors implemented according to any one of a variety of semiconductor technologies. In more than one particularly advantageous embodiments, the flip-flop is constructed using a total of twelve transistors. Through this simplified two-loop design, operational efficiency is improved, low metastability is achieved and costs of manufacture are lowered, all while maintaining low power requirements.
摘要翻译：静态双边沿触发器具有连接在数据输入节点和输出端之间的较高数据路径和较低数据路径。上部路径包括连接到第一数据环路的开关，并且下部路径包括连接到第二数据环路的开关。第一和第二数据环路共享具有数据反相电路的正向路径。另外，每个循环都有一个反馈路径，其中只包含一个开关形式的元件。然而，任一反馈路径中都不包括数据反相电路。有利地，触发器的所有元件可以使用根据各种半导体技术中的任一种实现的MOSFET晶体管来构造。在不止一个特别有利的实施例中，使用总共十二个晶体管来构造触发器。通过这种简化的双回路设计，提高了运行效率，实现了低亚稳态，降低了制造成本，同时保持了低功率要求。

9. 发明授权

US06334141B1 Distributed server for real-time collaboration 有权
标题翻译：分布式服务器进行实时协作
公开(公告)号：US06334141B1
公开(公告)日：2001-12-25
申请号：US09241991
申请日：1999-02-02
申请人： Pradeep Varma , Suresh Kumar
发明人： Pradeep Varma , Suresh Kumar
IPC分类号： G06F15163
CPC分类号： H04L47/10 , G06F2209/505 , H04L12/1813 , H04L47/125 , H04L67/10 , H04L67/38
摘要： A distributed server for real-time collaboration is substituted for a centralized server to address the problem of the development of unacceptable communication and computation bottlenecks resulting from the use of a one-software-process-based centralized server running somewhere on the available network. The substitute distributed server improves scaleability of real-time collaboration by being based on multiple, independently-communicating, asynchronous, independent (i.e., no shared memory, data, variables, etc.) software processes. The processes can be distributed to multiple machines throughout the network and run simultaneously in order to avoid the centralized server's bottlenecks. To be used, a distributed server requires a disjoint, fully covering partitioning of a work space, wherein it can handle partition hierarchies and groups comprehensively. The distributed server solution is general because of the ability of distributed servers to work with different definitions of a modification. The distributed server solution is extensible because of its simple and comprehensive treatment of inter-partition synchronization.
摘要翻译：用于实时协作的分布式服务器被替换为集中式服务器，以解决由于使用在可用网络上某处运行的基于单软件过程的集中式服务器而导致的不可接受的通信和计算瓶颈的开发问题。替代分布式服务器通过基于多个，独立通信，异步，独立（即，没有共享存储器，数据，变量等）软件处理来提高实时协作的可扩展性。这些进程可以分布到整个网络中的多台机器并同时运行，以避免集中式服务器的瓶颈。为了被使用，分布式服务器需要不相交，完全覆盖工作空间的分区，其中它可以全面地处理分区层次结构和组。分布式服务器解决方案是一般的，因为分布式服务器可以使用不同的修改定义。分布式服务器解决方案是可扩展的，因为它对分区间同步进行了简单而全面的处理。

10. 发明申请

US20170031815A1 Wand: Concurrent Boxing System For All Pointers With Or Without Garbage Collection 审中-公开
标题翻译：魔杖：所有指针的并发拳击系统或无垃圾收集
公开(公告)号：US20170031815A1
公开(公告)日：2017-02-02
申请号：US14928790
申请日：2015-10-30
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： G06F12/02 , G06F12/12 , G06F12/08
CPC分类号： G06F12/0253 , G06F12/023 , G06F12/0261 , G06F12/0269 , G06F12/0891 , G06F12/12 , G06F2212/1024 , G06F2212/1044 , G06F2212/1048 , G06F2212/60
摘要： Boxed pointers are disclosed, for all pointers, for safe and sequential or parallel use. Since a pointer box can be arbitrarily large, it supports any fat pointer encoding possible. The boxed pointers are managed out of the same heap or stack space as ordinary objects, providing scalability by a shared use of the entire program memory. The boxed pointers and objects are managed together by the same parallel, safe, memory management system including an optional precise, parallel garbage collector. To manage boxes independently of the garbage collector, explicit allocation and de-allocation means are provided including explicit killing of boxes using immediate or deferred frees. The entire system is constructed out of atomic registers as the sole shared memory primitive, avoiding all synchronization primitives and related expenses. Atomic pointer operations including pointer creation or deletion (malloc or free) are provided.
摘要翻译：对于所有指针，公开了用于安全和顺序或并行使用的盒装指针。由于指针盒可以任意大，它可以支持任何胖指针编码。盒装指针由与普通对象相同的堆或堆栈空间进行管理，通过共享使用整个程序存储器提供可扩展性。盒装指针和对象由同一个并行，安全的内存管理系统一起管理，包括可选的精确并行垃圾收集器。为了独立于垃圾收集器管理盒子，提供明确的分配和解除分配手段，包括使用立即或延迟释放来显式杀死盒子。整个系统由原子寄存器构建为唯一的共享存储器原语，避免所有同步原语和相关费用。提供包括指针创建或删除（malloc或free）的原子指针操作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式