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

1. 发明申请

US20130086569A1 Packed Data Objects 有权
标题翻译：打包数据对象
公开(公告)号：US20130086569A1
公开(公告)日：2013-04-04
申请号：US13559908
申请日：2012-07-27
申请人： Graham A. Chapman , Anderson Klegues Fraga , Mike S. Fulton , Kishor V. Patil
发明人： Graham A. Chapman , Anderson Klegues Fraga , Mike S. Fulton , Kishor V. Patil
IPC分类号： G06F9/45
CPC分类号： G06F9/45516 , G06F8/443 , G06F8/4443
摘要： A computer-implemented process for creating a packed data object, the computer-implemented process comprising providing instrumentation to an enhanced runtime by an enhanced compiler for a computer executable program portion, detecting a special class in the computer executable program portion by the enhanced runtime, creating an internal representation of a packed data object header using the instrumentation, calculating a size of elements for a packed data object associated with the computer executable program portion, determining a type of packed data object using information in the packed data object header, and responsive to a determination that the type of packed data object is an on-heap packed data object, storing the packed data object header and associated packed data object data together for the packed data object in a memory heap.
摘要翻译：一种用于创建打包数据对象的计算机实现的过程，所述计算机实现的过程包括通过用于计算机可执行程序部分的增强编译器向增强型运行时提供仪器，通过增强的运行时间检测计算机可执行程序部分中的特殊类，使用所述仪器创建打包数据对象头的内部表示，计算与所述计算机可执行程序部分相关联的打包数据对象的元素的大小，使用所述打包数据对象头中的信息确定打包数据对象的类型，以及响应以确定打包数据对象的类型是堆叠打包数据对象，将打包数据对象头和相关联的打包数据对象数据存储在一起用于存储堆中的打包数据对象。

2. 发明申请

US20120254972A1 TRUST SYSTEM 审中-公开
标题翻译：信托系统
公开(公告)号：US20120254972A1
公开(公告)日：2012-10-04
申请号：US13079211
申请日：2011-04-04
申请人： Mike S. Fulton
发明人： Mike S. Fulton
IPC分类号： H04L9/32
CPC分类号： G06F21/57 , G06F21/6245 , G06F2221/2141 , H04L63/102
摘要： An illustrative embodiment of a computer-implemented process for delegating access to private data receives a request at a trusted server, forwards the received request to an untrusted third party application and invokes a transaction on a secure data store. The computer-implemented process further tokenizes data received from the secure data store by the trusted server, returns the tokenized data to the untrusted third party application, modifies the tokenized data by the untrusted third party application, requests the trusted server to send results to a requester and sends the results from the trusted server to the requester for display.
摘要翻译：用于委托对私有数据的访问的计算机实现的过程的说明性实施例在可信服务器处接收请求，将接收到的请求转发到不可信的第三方应用，并且在安全数据存储上调用事务。计算机实现的过程进一步标记由可信服务器从安全数据存储器接收的数据，将令牌化数据返回到不可信第三方应用程序，通过不受信任的第三方应用修改标记化数据，请求可信服务器将结果发送到请求者并将结果从可信服务器发送到请求者进行显示。

3. 发明授权

US07810073B2 Method of translating n to n instructions employing an enhanced extended translation facility 有权
标题翻译：使用增强的扩展翻译设施翻译n到n个指令的方法
公开(公告)号：US07810073B2
公开(公告)日：2010-10-05
申请号：US11469919
申请日：2006-09-05
申请人： John R. Ehrman , Mike S. Fulton , Dan F. Greiner
发明人： John R. Ehrman , Mike S. Fulton , Dan F. Greiner
IPC分类号： G06F9/44 , G06F9/445
CPC分类号： G06F9/30174 , G06F9/30018 , G06F9/30098 , G06F9/30145 , G06F9/30185
摘要： A method, article, and system for providing an effective implementation of assembler language translate-n-to-n instructions implemented on 21, 31, and 64-bit architectures, while maintaining backward compatibility with existing systems. The enhanced Extended-Translation Facility 2 (ETF2) instruction set introduces a new operand in an unused field (M3) that facilitates a change in the original instruction format and its intended function. With the ETF2-Enhancement Facility installed, a value of zeros in the M3 field indicates that instruction operation is to continue as originally defined. When a nonzero value is coded in the M3 field a new function is carried out. The assembler accommodates the changes by making the new M3 field optional when coding the instructions. If the M3 field is not coded, the assembler defaults to providing zeros in the M3 field (as found in the original instruction format), and backward compatible operation is provided.
摘要翻译：一种用于提供在21,31和64位架构上实现的汇编语言translate-n-to-n指令的有效实现的方法，文章和系统，同时保持与现有系统的向后兼容性。增强扩展转换工具2（ETF2）指令集在未使用的字段（M3）中引入了一个新的操作数，这有助于原始指令格式及其预期功能的改变。在安装了ETF2-Enhancement Facility的情况下，M3字段中的零值表示指令操作将按原来定义继续。当M3字段中的非零值被编码时，执行一个新的功能。汇编器通过在编写指令时使新的M3字段可选，来适应这些更改。如果M3字段未编码，则汇编器默认在M3字段中提供零（如原始指令格式所示），并提供向后兼容操作。

4. 发明授权

US07725894B2 Enhanced un-privileged computer instruction to store a facility list 有权
标题翻译：增强非特权计算机指令来存储设施清单
公开(公告)号：US07725894B2
公开(公告)日：2010-05-25
申请号：US11532177
申请日：2006-09-15
申请人： Mark A. Check , John R. Ehrman , Mark S. Farrell , Mike S. Fulton , Charles W. Gainey , Dan F. Greiner , Damian L. Osisek , Peter J. Relson
发明人： Mark A. Check , John R. Ehrman , Mark S. Farrell , Mike S. Fulton , Charles W. Gainey , Dan F. Greiner , Damian L. Osisek , Peter J. Relson
IPC分类号： G06F9/455
CPC分类号： G06F9/30076 , G06F9/45558 , G06F9/5077 , G06F2009/45579
摘要： A method is provided for recording a list of facilities available to a program executing on an information processing system. In such method a storage location and a length of data are defined for recording the list of facilities by a program being executed on the information processing system. An instruction is issued by the program for determining the available facilities and recording the list of available facilities in accordance with the defined storage location and data length. A processor executes the instruction to determine the available facilities and record the list of facilities in accordance with the defined storage location and defined data length. The recorded list of facilities can then be read by the first program.
摘要翻译：提供了一种用于记录可用于在信息处理系统上执行的程序的设施的列表的方法。在这种方法中，定义了存储位置和数据长度，用于通过在信息处理系统上执行的程序记录设施列表。程序发出用于确定可用设施并根据定义的存储位置和数据长度记录可用设施的列表的指令。处理器执行指令以确定可用设施，并根据定义的存储位置和定义的数据长度记录设施列表。记录的设施清单可以由第一个程序读取。

5. 发明申请

US20080126763A1 METHOD OF TRANSLATING N TO N INSTRUCTIONS EMPLOYING AN ENHANCED EXTENDED TRANSLATION FACILITY 有权
标题翻译：使用增强扩展翻译设施的N到N指令进行翻译的方法
公开(公告)号：US20080126763A1
公开(公告)日：2008-05-29
申请号：US11469919
申请日：2006-09-05
申请人： John R. Ehrman , Mike S. Fulton , Dan F. Greiner
发明人： John R. Ehrman , Mike S. Fulton , Dan F. Greiner
IPC分类号： G06F9/318
CPC分类号： G06F9/30174 , G06F9/30018 , G06F9/30098 , G06F9/30145 , G06F9/30185
摘要： A method, article, and system for providing an effective implementation of assembler language translate-n-to-n instructions implemented on 21, 31, and 64-bit architectures, while maintaining backward compatibility with existing systems. The enhanced Extended-Translation Facility 2 (ETF2) instruction set introduces a new operand in an unused field (M3) that facilitates a change in the original instruction format and its intended function. With the ETF2-Enhancement Facility installed, a value of zeros in the M3 field indicates that instruction operation is to continue as originally defined. When a nonzero value is coded in the M3 field a new function is carried out. The assembler accommodates the changes by making the new M3 field optional when coding the instructions. If the M3 field is not coded, the assembler defaults to providing zeros in the M3 field (as found in the original instruction format), and backward compatible operation is provided.
摘要翻译：一种用于提供在21,31和64位架构上实现的汇编语言translate-n-to-n指令的有效实现的方法，文章和系统，同时保持与现有系统的向后兼容性。增强型扩展转换工具2（ETF2）指令集在未使用的字段（M 3 3 ）中引入了一个新操作数，这有助于原始指令格式及其预期功能的改变。在安装了ETF2-Enhancement Facility的情况下，M＆lt; 3＆lt; 3＆gt;字段中的零值表示指令操作将按原来定义继续。当非零值被编码在M＆lt; 3＆lt; 3＆gt;字段中时，执行新的功能。当对指令进行编码时，通过使新的“3”字段可选，汇编器适应这些更改。如果M 3字段未被编码，则汇编器默认在M SUB 3字段中提供零（如原始指令格式所示），并且提供向后兼容操作。

6. 发明授权

US09021455B2 Packed data objects 有权
标题翻译：打包数据对象
公开(公告)号：US09021455B2
公开(公告)日：2015-04-28
申请号：US13559908
申请日：2012-07-27
申请人： Graham A. Chapman , Anderson Klegues Fraga , Mike S. Fulton , Kishor V. Patil
发明人： Graham A. Chapman , Anderson Klegues Fraga , Mike S. Fulton , Kishor V. Patil
IPC分类号： G06F9/45 , G06F9/455
CPC分类号： G06F9/45516 , G06F8/443 , G06F8/4443
摘要： A computer-implemented process for creating a packed data object, the computer-implemented process comprising providing instrumentation to an enhanced runtime by an enhanced compiler for a computer executable program portion, detecting a special class in the computer executable program portion by the enhanced runtime, creating an internal representation of a packed data object header using the instrumentation, calculating a size of elements for a packed data object associated with the computer executable program portion, determining a type of packed data object using information in the packed data object header, and responsive to a determination that the type of packed data object is an on-heap packed data object, storing the packed data object header and associated packed data object data together for the packed data object in a memory heap.
摘要翻译：一种用于创建打包数据对象的计算机实现的过程，所述计算机实现的过程包括通过用于计算机可执行程序部分的增强编译器向增强型运行时提供仪器，通过增强的运行时间检测计算机可执行程序部分中的特殊类，使用所述仪器创建打包数据对象头的内部表示，计算与所述计算机可执行程序部分相关联的打包数据对象的元素的大小，使用所述打包数据对象头中的信息确定打包数据对象的类型，以及响应以确定打包数据对象的类型是堆叠打包数据对象，将打包数据对象头和相关联的打包数据对象数据存储在一起用于存储堆中的打包数据对象。

7. 发明授权

US07596781B2 Register-based instruction optimization for facilitating efficient emulation of an instruction stream 有权
标题翻译：基于寄存器的指令优化，用于促进指令流的高效仿真
公开(公告)号：US07596781B2
公开(公告)日：2009-09-29
申请号：US11549718
申请日：2006-10-16
申请人： Mike S. Fulton , Ali I. Sheikh
发明人： Mike S. Fulton , Ali I. Sheikh
IPC分类号： G06F9/455
CPC分类号： G06F9/3017 , G06F9/30167 , G06F9/45504
摘要： A register-based instruction optimization is provided for facilitating efficient emulation of a target instruction stream. The optimization includes for at least one instruction in a frequently executed sequence of target instructions: confirming that at least one register is marked as a read-only register for the sequence; confirming that each register of the at least one register has been detected to have a constant value for the at least one instruction in multiple prior iterations of the executed sequence; and response thereto, optimizing the at least one instruction by replacing the at least one instruction with at least one immediate form instruction having at least one constant value encoded directly therein from the at least one register. The optimization results in an optimized sequence of target instructions, which when translated into a sequence of host instructions, is more efficiently executed by a host computing environment.
摘要翻译：提供基于寄存器的指令优化以便于有效地仿真目标指令流。优化包括频繁执行的目标指令序列中的至少一个指令：确认至少一个寄存器被标记为该序列的只读寄存器; 确认所述至少一个寄存器的每个寄存器已被检测为在所执行的序列的多个先前迭代中对所述至少一个指令具有恒定值; 以及对其的响应，通过用至少一个立即格式指令替换至少一个指令来优化所述至少一个指令，所述至少一个立即格式指令具有至少一个从所述至少一个寄存器直接编码的常数值。优化导致目标指令的优化序列，当被转换成主机指令序列时，其被主机计算环境更有效地执行。

8. 发明申请

US20090119668A1 DYNAMIC FEASIBILITY ANALYSIS FOR EVENT BASED PROGRAMMING 失效
标题翻译：基于事件编程的动态可行性分析
公开(公告)号：US20090119668A1
公开(公告)日：2009-05-07
申请号：US11934120
申请日：2007-11-02
申请人： Sean C. Foley , Mike S. Fulton
发明人： Sean C. Foley , Mike S. Fulton
IPC分类号： G06F9/46
CPC分类号： G06F9/542 , G06F8/75
摘要： Embodiments of the present invention provide a method, system and computer program product for dynamic feasibility analysis of event-driven program code. In an embodiment of the invention, a method for a dynamic feasibility analysis of event-driven program code can be provided. The method can include loading multiple different tasks associated with different registered events in event-driven program code of an event-driven application, reducing overlapping ones of the registered events for different ones of the tasks to a single task of the overlapping events to produce a reduced set of tasks and corresponding events, ordering the corresponding events of the reduced set of tasks and grouping the corresponding events by time slice for the event-driven application, and reporting whether or not adding a new event to a particular time slice for the event-driven application results in a depth of events in the particular time slice exceeding a capacity of the particular time slice rendering the event-driven application infeasible.
摘要翻译：本发明的实施例提供了一种用于事件驱动程序代码的动态可行性分析的方法，系统和计算机程序产品。在本发明的实施例中，可以提供一种用于事件驱动程序代码的动态可行性分析的方法。该方法可以包括将与事件驱动应用程序的事件驱动程序代码中的不同注册事件相关联的多个不同任务加载，将不同任务的注册事件中的重叠事件减少到重叠事件的单个任务，以产生减少任务和相应事件的集合，对减少的任务集进行相应的事件的排序，并根据事件驱动应用的时间片对相应的事件进行分组，以及报告是否将新事件添加到事件的特定时间片驱动应用程序导致特定时间片中的事件深度超过特定时间片的容量，从而使事件驱动的应用程序不可行。

9. 发明授权

US08789059B2 Dynamic scheduling feasibility analysis of event-driven applications based on reducing tasks of overlapping events 失效
标题翻译：基于重叠事件减少任务的事件驱动应用程序的动态调度可行性分析
公开(公告)号：US08789059B2
公开(公告)日：2014-07-22
申请号：US11934120
申请日：2007-11-02
申请人： Sean C. Foley , Mike S. Fulton
发明人： Sean C. Foley , Mike S. Fulton
IPC分类号： G06F9/46
CPC分类号： G06F9/542 , G06F8/75
摘要： Embodiments of the present invention provide a method, system and computer program product for dynamic feasibility analysis of event-driven program code. In an embodiment of the invention, a method for a dynamic feasibility analysis of event-driven program code can be provided. The method can include loading multiple different tasks associated with different registered events in event-driven program code of an event-driven application, reducing overlapping ones of the registered events for different ones of the tasks to a single task of the overlapping events to produce a reduced set of tasks and corresponding events, ordering the corresponding events of the reduced set of tasks and grouping the corresponding events by time slice for the event-driven application, and reporting whether or not adding a new event to a particular time slice for the event-driven application results in a depth of events in the particular time slice exceeding a capacity of the particular time slice rendering the event-driven application infeasible.
摘要翻译：本发明的实施例提供了一种用于事件驱动程序代码的动态可行性分析的方法，系统和计算机程序产品。在本发明的实施例中，可以提供一种用于事件驱动程序代码的动态可行性分析的方法。该方法可以包括将与事件驱动应用程序的事件驱动程序代码中的不同注册事件相关联的多个不同任务加载，将不同任务的注册事件中的重叠事件减少到重叠事件的单个任务，以产生减少任务和相应事件的集合，对减少的任务集进行相应的事件的排序，并根据事件驱动应用的时间片对相应的事件进行分组，以及报告是否将新事件添加到事件的特定时间片驱动应用程序导致特定时间片中的事件深度超过特定时间片的容量，从而使事件驱动的应用程序不可行。

10. 发明授权

US08429638B2 Instruction exploitation through loader late fix-up 有权
标题翻译：通过装载机后期修复的指令开发
公开(公告)号：US08429638B2
公开(公告)日：2013-04-23
申请号：US13365497
申请日：2012-02-03
申请人： Mike S. Fulton
发明人： Mike S. Fulton
IPC分类号： G06F9/44 , G06F9/45 , G06F7/38
CPC分类号： G06F9/3017 , G06F9/30076 , G06F9/30145 , G06F9/3802 , G06F9/382 , G06F9/445 , G06F9/44542
摘要： A method, computer program product, and data processing system for substituting a candidate instruction in application code being loaded during load time. Responsive to identifying the candidate instruction, a determination is made whether a hardware facility of the data processing system is present to execute the candidate instruction. If the hardware facility is absent from the data processing system, the candidate instruction is substituted with a second set of instructions.
摘要翻译：一种方法，计算机程序产品和数据处理系统，用于代替在加载时加载的应用代码中的候选指令。响应于识别候选指令，确定是否存在数据处理系统的硬件设施来执行候选指令。如果硬件设施不在数据处理系统中，则候选指令被替换为第二组指令。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式