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

21. 发明申请

US20060161892A1 Systems and methods for determining software package identity during a system build 失效
标题翻译：在系统构建期间确定软件包标识的系统和方法
公开(公告)号：US20060161892A1
公开(公告)日：2006-07-20
申请号：US11037686
申请日：2005-01-18
申请人： Ashok Anand , Philippe Charles , Amitkumar Paradkar , Donald Pazel , Beth Tibbitts , Pradeep Varma
发明人： Ashok Anand , Philippe Charles , Amitkumar Paradkar , Donald Pazel , Beth Tibbitts , Pradeep Varma
IPC分类号： G06F9/44
CPC分类号： G06F9/44 , G06F8/71
摘要： The provision of methods and apparatus to determine package identity for an application build. The idea is based on providing a mapping of package with affiliated attributes such as paths used for include or linking, along with reverse mappings. This mapping could be provided through any number of conventional environments such as program development environments or operating system registries: Tools would access this information through a programmatic interface, and use that information to identify packages affiliated with some information. For example, a symbol in a program would be defined in some file. That file would be in a path, which maps to the package identity. Thus, the symbol definition can be conceptually affiliated with a package.
摘要翻译：提供用于确定应用程序构建的程序包身份的方法和设备。这个想法是基于提供具有附属属性的包的映射，例如用于包含或链接的路径以及反向映射。可以通过任何数量的常规环境（如程序开发环境或操作系统注册表）来提供此映射：工具将通过编程接口访问此信息，并使用该信息来识别与某些信息相关的软件包。例如，程序中的符号将在某些文件中定义。该文件将在路径中，映射到包标识。因此，符号定义可以在概念上附属于一个包。

22. 发明授权

US06310500B1 Race removal or reduction in latches and loops using phase skew 有权
标题翻译：使用相位偏移消除或减少锁存器和回路
公开(公告)号：US06310500B1
公开(公告)日：2001-10-30
申请号：US09602206
申请日：2000-06-23
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： H03K3356
CPC分类号： G11C7/1087 , G11C7/1078 , H03K3/0375
摘要： A method for resolving race conflicts in a loop circuit having a forward path and a feedback path includes enabling and disabling the feedback path in accordance with a phase waveform. The phase waveform may be a system clock, in which case one of two approaches may be used to ensure that data from the feedback loop arrives later in time than data from an input signal line. During the first approach, only the rising edge of a clock signal used to control data flow in the feedback loop is delayed relative to the rising edge of a clock signal that controls data flow in the forward path. During the second approach, both the rising and falling edges of the clock signal are delayed. Through these approaches, the method of the present invention achieves improved performance in terms of power consumption, frequency response, area, and switching capacitance.
摘要翻译：一种用于解决具有正向路径和反馈路径的环路电路中的竞争冲突的方法包括根据相位波形启用和禁用反馈路径。相位波形可以是系统时钟，在这种情况下，可以使用两种方法之一来确保来自反馈回路的数据在时间上比来自输入信号线的数据晚。在第一种方法中，仅用于控制反馈环路中的数据流的时钟信号的上升沿相对于控制正向通路中的数据流的时钟信号的上升沿被延迟。在第二种方法中，时钟信号的上升沿和下降沿都被延迟。通过这些方法，本发明的方法在功耗，频率响应，面积和开关电容方面实现了改进的性能。

23. 发明授权

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.
摘要翻译：一种系统和相关联的方法，用于在预定义数量的线程上自动流水线化序列码中的嵌套循环。根据嵌套循环的任务依赖关系，将嵌套循环的每个子循环分配给相应的线程。执行嵌套循环的分段分组的组合被配置为在允许的情况下并行执行子循环。对于级分段的每个组合，计算相应的瓶颈，并且选择具有最小瓶颈的组合用于并行化。

24. 发明授权

US08015554B2 Source-to-source transformation for language dialects 失效
标题翻译：语言方言的源到源转换
公开(公告)号：US08015554B2
公开(公告)日：2011-09-06
申请号：US11388353
申请日：2006-03-24
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： G06F9/44
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.
摘要翻译：分析和源到源转换框架涵盖了对所有个别方言缺乏正式定义的编程语言的方言。相同编译器前端工具的多个实例可以与不同的设置一起使用，以创建不同的中间格式和映射。中间形式和地图用于个人分析和源到源转换环境，并进行分析和源到源转换。期望提供统一的工具集，包括标准编译器前端工具和代码转换/生成工具，其中执行源代码编辑以便使源代码更适于翻译成中间形式。由各种工具创建的分析结果或中间形式由其他工具使用，并进一步分析以创建中间形式的有效性和无效区域的映射，并跟踪执行的源代码编辑以获得相同的。除了其他好处之外，这提供了最佳代码分析覆盖的最佳工具组合的选择。

25. 发明申请

US20110099429A1 SYSTEMS AND METHODS FOR BACKWARD-COMPATIBLE CONSTANT-TIME EXCEPTION-PROTECTION MEMORY 有权
标题翻译：用于后向兼容持续时间异常保护存储器的系统和方法
公开(公告)号：US20110099429A1
公开(公告)日：2011-04-28
申请号：US12607625
申请日：2009-10-28
申请人： Pradeep Varma , Rudrapatna K. Shyamasundar , Harshit J. Shah
发明人： Pradeep Varma , Rudrapatna K. Shyamasundar , Harshit J. Shah
IPC分类号： G06F11/36 , G06F11/00
CPC分类号： G06F11/366
摘要： Embodiments of the invention provide a table-free technique for detecting all temporal and spatial memory access errors in programs supporting general pointers. Embodiments of the invention provide such error checking using constant-time operations. Embodiments of the invention rely on fat pointers, whose size is contained within standard scalar sizes (up to two words) so that atomic hardware support for operations upon the pointers is obtained along with meaningful casts in-between pointers and other scalars. Optimized compilation of code becomes possible since the scalarized-for-free encoded pointers get register allocated and manipulated. Backward compatibility is enabled by the scalar pointer sizes, with automatic support provided for encoding and decoding of fat pointers in place for interaction with unprotected code.
摘要翻译：本发明的实施例提供了一种用于检测支持通用指针的程序中的所有时间和空间存储器访问错误的无桌面技术。本发明的实施例使用恒定时间操作来提供这种错误检查。本发明的实施例依赖于胖指针，其大小包含在标准标量大小（最多两个字）内，从而获得指针上的操作的原子硬件支持以及指针和其他标量之间的有意义的投射。代码的优化编译成为可能，因为无标量化编码指针获得寄存器分配和操作。向后兼容性由标量指针大小启用，自动支持为脂肪指针的编码和解码提供了与无保护代码交互的位置。

26. 发明授权

US07823144B2 Computer program code comparison using lexemes 有权
标题翻译：使用词法的计算机程序代码比较
公开(公告)号：US07823144B2
公开(公告)日：2010-10-26
申请号：US11321178
申请日：2005-12-29
申请人： Donald P Pazel , Pradeep Varma
发明人： Donald P Pazel , Pradeep Varma
IPC分类号： G06F9/44 , G06F17/00 , G10L15/06
CPC分类号： G06F8/425
摘要： A method, apparatus and computer program product for comparing two computer program codes is disclosed. For each code, a stream of lexemes is generated for the program text of each code. The streams are concatenated in the same order as the program text. The two concatenated streams of lexemes are compared on a language-type by language-type basis to identify lexemes present only in one stream. The comparison derives a set of edit operations including minimal text block moves needed to convert one program code into the other program code.
摘要翻译：公开了一种用于比较两个计算机程序代码的方法，装置和计算机程序产品。对于每个代码，为每个代码的程序文本生成一个词汇流。流以与程序文本相同的顺序连接。通过语言类型对语言类型进行两个连结的词汇流进行比较，以确定仅在一个流中存在的词汇。比较导出一组编辑操作，包括将一个程序代码转换为其他程序代码所需的最小文本块移动。

27. 发明授权

US07721250B2 System and method for interactive and integrated software development process and phases 有权
标题翻译：用于交互式和集成软件开发过程和阶段的系统和方法
公开(公告)号：US07721250B2
公开(公告)日：2010-05-18
申请号：US11402007
申请日：2006-04-12
申请人： Ashok Anand , Amitkumar Manoharrao Paradkar , Donald P. Pazel , Beth R. Tibbitts , Pradeep Varma
发明人： Ashok Anand , Amitkumar Manoharrao Paradkar , Donald P. Pazel , Beth R. Tibbitts , Pradeep Varma
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F8/20
摘要： A system (and method, and method for deploying computing infrastructure) for facilitating fixing program development errors found during different phases of program development using different programming tools, such as compilers, linkers, library managers, and debuggers, and can be integrated into a program development environment encompassing all tools. The exemplary aspects of the present invention can detect a qualified set of problems from which to recover with sufficient information, as typically provided by a user or other intelligent or artificial intelligent means, and upon error detection, can initiate a communication with the user (or other support software), to acquire information that could remedy the problem.
摘要翻译：一种用于部署计算基础设施的系统（和方法以及部署计算基础设施的方法），用于促进使用不同编程工具（如编译器，链接器，库管理器和调试器）在程序开发的不同阶段发现的程序开发错误，并可以集成到程序中包含所有工具的开发环境。本发明的示例性方面可以通过用户或其他智能或人造智能装置通常提供的足够的信息来检测要从中恢复的一组合格的问题，并且在错误检测时，可以发起与用户的通信（或其他支持软件），获取可以解决问题的信息。

28. 发明申请

US20080154710A1 Minimal Effort Prediction and Minimal Tooling Benefit Assessment for Semi-Automatic Code Porting 审中-公开
标题翻译：半自动代码移植的最小努力预测和最小工具效益评估
公开(公告)号：US20080154710A1
公开(公告)日：2008-06-26
申请号：US11614249
申请日：2006-12-21
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： G06Q10/00
CPC分类号： G06Q10/00
摘要： A method of computing effort requirements of porting issues in source code includes estimating the minimal number of code text characters needed to be read by a user when the user is searching for porting issues, estimating the minimal number of context switches needed to be made by the user when shifting from one reading region to another reading region during the searching for the porting issues, and estimating the minimal number of keystrokes needed to be made by the user during searching for the porting issues. In a similar manner, the method involves estimating the minimal number of code text characters, the minimal number of context switches, and the minimal number of keystrokes needed to be made by the user for found porting issues. With this information the method establishes an effort model based on a weighted sum of the minimal number of code text characters, the minimal number of context switches, and the minimal number of keystrokes, for individual porting issues. The weights in the model are identified by porting issue type and user capabilities in handling each porting issue.
摘要翻译：计算源代码中移植问题的工作需求的方法包括估计当用户正在搜索移植问题时用户需要读取的代码文本字符的最小数量，估计需要由用户进行的上下文切换的最小数目用户在搜索移植问题期间从一个读取区域移动到另一个读取区域，以及估计用户在搜索移植问题期间需要进行的最小击键次数。以类似的方式，该方法包括估计代码文本字符的最小数量，上下文切换的最小数量以及用户为发现的移植问题而需要的最小击键次数。利用该信息，该方法基于对于个别移植问题的最小数量的代码文本字符，上下文切换的最小数量和最小击键次数的加权和建立努力模型。通过在处理每个移植问题时移植问题类型和用户能力来识别模型中的权重。

29. 发明申请

US20070157073A1 Software weaving and merging 审中-公开
标题翻译：软件编织和合并
公开(公告)号：US20070157073A1
公开(公告)日：2007-07-05
申请号：US11321176
申请日：2005-12-29
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： G06F17/00 , G06F15/00
CPC分类号： G06F17/218 , G06F8/33
摘要： There is disclosed transforming an electronic plain text to an electronic anchored text, comprising inserting anchors located between characters in said plain text. Each character has a unique association with a nearest preceding or succeeding anchor. Each anchor serves as a join point and specifies a predetermined state and a predetermined operation. There is also disclosed the weaving and merging of two or more electronic plain texts.
摘要翻译：公开了将电子纯文本转换为电子锚定文本，包括插入位于所述纯文本中的字符之间的锚点。每个角色与最近的前一个或后续锚具有唯一的关联。每个锚点用作连接点并指定预定状态和预定操作。还披露了两种或多种电子纯文本的编织和合并。

30. 发明授权

US06336134B1 Dynamic clients, dynamic partitions, locking, and migration capability for distributed server for real-time collaboration 有权
标题翻译：用于实时协作的分布式服务器的动态客户端，动态分区，锁定和迁移功能
公开(公告)号：US06336134B1
公开(公告)日：2002-01-01
申请号：US09476445
申请日：1999-12-30
申请人： Pradeep Varma
发明人： Pradeep Varma
IPC分类号： G06F1514
CPC分类号： H04L47/10 , G06F2209/505 , H04L12/1813 , H04L47/125 , H04L67/10 , H04L67/38
摘要： A method for building a locking, migration, dynamic clients, and dynamic partitions capable distributed server for a real-time collaboration session supports the synchronous creation and deletion of partitions by clients as well as the addition and withdrawal of clients during a current collaboration session. The method is based on history servers for providing a history of modifications so that a newly-added client can compute the current state of a shared workspace. The history servers cache and granularize intermediate modification sequences so that computation space and time are reduced. The method supports migrating partition server(s), history server(s), a creation/deletion server, and a collaboration server to different machines. Partition(s) can be dynamically locked and unlocked and, in an extension of this procedure, creation and deletion of partition(s) can be pre-announced and supported. Advanced dynamic-partitioning activities like splitting a partition, merging partitions, shifting data from partition to partition are carried out naturally by locking the concerned partitions during the process of execution.
摘要翻译：构建用于实时协作会话的分布式服务器的锁定，迁移，动态客户端和动态分区的方法支持客户端同步创建和删除分区，以及在当前协作会话期间添加和退出客户端。该方法基于用于提供修改历史的历史服务器，使得新添加的客户端可以计算共享工作空间的当前状态。历史服务器缓存和粒化中间修改序列，从而减少计算空间和时间。该方法支持将分区服务器，历史服务器，创建/删除服务器和协作服务器迁移到不同的机器。分区可以动态锁定和解锁，并且在此过程的扩展中，分区的创建和删除可以被预先宣布和支持。通过在执行过程中锁定相关的分区，可以自然地执行高级动态分区活动，如分割分区，合并分区，将数据从分区转移到分区。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式