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

61. 发明申请

US20120324483A1 REMOTE PROCEDURE CALL (RPC) BIND SERVICE WITH PHYSICAL INTERFACE QUERY AND SELECTION 审中-公开
标题翻译：远程程序呼叫（RPC）BIND服务与物理界面查询和选择
公开(公告)号：US20120324483A1
公开(公告)日：2012-12-20
申请号：US13584359
申请日：2012-08-13
申请人： Adekunle Bello , Andrew Dunshea , Nikhil Hegde , Paul H. Hernandez , Aruna Yedavilli
发明人： Adekunle Bello , Andrew Dunshea , Nikhil Hegde , Paul H. Hernandez , Aruna Yedavilli
IPC分类号： G06F9/44
CPC分类号： G06F9/547
摘要： A service module that provides for discovery of one or more network interfaces connecting a prospective remote procedure call (RPC) client, facilitates the provision of RPC programs in a network including multi-horned systems. When a request for a network address to an RPC application providing an RPC program is received from the RPC client, the RPC bind daemon discovers from the module, using the client response address, over which interface(s) the client is accessible. The daemon then selects an address of a network path to the RPC application that the prospective client can access and returns the corresponding network address. The service module monitors the network stack for RPC get address requests and builds tables of client address entries with corresponding network interface identifiers. The entries are retired according to an aging policy.
摘要翻译：提供用于发现连接预期远程过程调用（RPC）客户端的一个或多个网络接口的服务模块，有助于在包括多角度系统的网络中提供RPC程序。当从RPC客户端接收到提供RPC程序的RPC应用程序的网络地址的请求时，RPC绑定守护程序使用客户端响应地址从模块发现客户端可访问哪个接口。守护程序然后选择预期客户端可以访问的RPC应用程序的网络路径的地址，并返回相应的网络地址。服务模块监视网络堆栈以获取RPC获取地址请求，并使用相应的网络接口标识符构建客户端地址表的表。这些条目根据老龄化政策退休。

62. 发明授权

US08214609B2 Data transference to virtual memory 有权
标题翻译：数据转移到虚拟内存
公开(公告)号：US08214609B2
公开(公告)日：2012-07-03
申请号：US12174476
申请日：2008-07-16
申请人： Shashidhar Bomma , Andrew Dunshea , Douglas J. Griffith , Jean-Philippe Sugarbroad
发明人： Shashidhar Bomma , Andrew Dunshea , Douglas J. Griffith , Jean-Philippe Sugarbroad
IPC分类号： G06F12/12
CPC分类号： G06F12/10 , G06F9/45537 , G06F2009/45583
摘要： Some embodiments comprise a method for selecting data to be transferred to a storage space of virtual memory and include identifying a set of data and determining subsets. Determining subsets may allow for delays before transferring the subsets and allow access to memory of the subsets during the delays. Accesses during the delays may enable embodiments to select other data to be transferred to the storage space and prevent transference of the accessed data. Other embodiments comprise apparatuses that have a paging space, a page identifier, and a page transferrer to transfer pages to the paging space after a delay. The delay may prevent a number of pages from being transferred to the paging space, such as for pages that were accessed during the delay.
摘要翻译：一些实施例包括用于选择要传送到虚拟存储器的存储空间的数据的方法，并且包括识别一组数据和确定子集。确定子集可以允许在传送子集之前的延迟，并允许在延迟期间访问子集的存储器。延迟期间的访问可以使实施例能够选择要传送到存储空间的其他数据，并防止所访问的数据的传送。其他实施例包括具有寻呼空间的装置，页面标识符和页面传送器，以在延迟之后将页面传送到寻呼空间。延迟可以防止将多页传送到寻呼空间，例如在延迟期间被访问的页面。

63. 发明授权

US07912913B2 Facilitating presentation and monitoring of electronic mail messages with reply by constraints 失效
标题翻译：通过约束回应促进电子邮件的呈现和监控
公开(公告)号：US07912913B2
公开(公告)日：2011-03-22
申请号：US11227031
申请日：2005-09-15
申请人： Jos M. Accapadi , Andrew Dunshea
发明人： Jos M. Accapadi , Andrew Dunshea
IPC分类号： G06F15/16
CPC分类号： H04L43/00 , G06Q10/107 , H04L43/045 , H04L51/00 , H04L51/30
摘要： A method, system, and program for facilitating presentation and monitoring of electronic mail messages with reply by constraints are provided. Within a network environment, a server receives electronic mail messages with separate selected reply by dates, wherein each electronic mail message is addressed for delivery by the server to at least one particular recipient. The server enables, for display within a user interface accessible to the particular recipient, a separate record for each electronic mail message within an inbox. The inbox include at least one selectable sublevel, wherein upon selection of the particular selectable sublevel of the inbox, only a selection of records for electronic mail messages with a same reply by date as the selectable sublevel are displayed within the user interface.
摘要翻译：提供了一种用于通过约束回复来促进电子邮件消息的呈现和监视的方法，系统和程序。在网络环境中，服务器按日期接收具有单独选择的答复的电子邮件消息，其中每个电子邮件消息被寻址以供服务器传送给至少一个特定接收者。服务器能够在特定接收者可访问的用户界面内显示用于收件箱内的每个电子邮件消息的单独记录。收件箱包括至少一个可选择的子级别，其中在选择收件箱的特定可选子级别时，在用户界面内仅显示具有与可选子级别相同的答复的电子邮件消息的记录选择。

64. 发明授权

US07752620B2 Administration of locks for critical sections of computer programs in a computer that supports a multiplicity of logical partitions 失效
标题翻译：在支持多个逻辑分区的计算机中管理计算机程序的关键部分的锁
公开(公告)号：US07752620B2
公开(公告)日：2010-07-06
申请号：US11146453
申请日：2005-06-06
申请人： Jos M. Accapadi , Andrew Dunshea , Sujatha Kashyap
发明人： Jos M. Accapadi , Andrew Dunshea , Sujatha Kashyap
IPC分类号： G06F9/455 , G06F9/46 , G06F13/00
CPC分类号： G06F9/526 , G06F9/5077
摘要： Administration of locks for critical sections of computer programs in a computer that supports a multiplicity of logical partitions that include determining by a thread executing on a virtual processor executing in a time slice on a physical processor whether an expected lock time for a critical section of the thread exceeds a remaining entitlement of the virtual processor in the time slice and deferring acquisition of a lock if the expected lock time exceeds the remaining entitlement.
摘要翻译：管理计算机中计算机程序的关键部分的锁，其支持多个逻辑分区，所述逻辑分区包括由在物理处理器上的时间片中执行的在虚拟处理器上执行的线程来确定是否预期的锁定时间线程超过了时间片中虚拟处理器的剩余权限，如果预期的锁定时间超过剩余权限，则推迟获取锁定。

65. 发明申请

US20100017576A1 Data Transference to Virtual Memory 有权
标题翻译：数据转移到虚拟内存
公开(公告)号：US20100017576A1
公开(公告)日：2010-01-21
申请号：US12174476
申请日：2008-07-16
申请人： Shashidhar Bomma , Andrew Dunshea , Douglas J. Griffith , Jean-Philippe Sugarbroad
发明人： Shashidhar Bomma , Andrew Dunshea , Douglas J. Griffith , Jean-Philippe Sugarbroad
IPC分类号： G06F12/02
CPC分类号： G06F12/10 , G06F9/45537 , G06F2009/45583
摘要： Some embodiments comprise a method for selecting data to be transferred to a storage space of virtual memory and include identifying a set of data and determining subsets. Determining subsets may allow for delays before transferring the subsets and allow access to memory of the subsets during the delays. Accesses during the delays may enable embodiments to select other data to be transferred to the storage space and prevent transference of the accessed data. Other embodiments comprise apparatuses that have a paging space, a page identifier, and a page transferrer to transfer pages to the paging space after a delay. The delay may prevent a number of pages from being transferred to the paging space, such as for pages that were accessed during the delay.
摘要翻译：一些实施例包括用于选择要传送到虚拟存储器的存储空间的数据的方法，并且包括识别一组数据和确定子集。确定子集可以允许在传送子集之前的延迟，并允许在延迟期间访问子集的存储器。延迟期间的访问可以使实施例能够选择要传送到存储空间的其他数据，并防止所访问的数据的传送。其他实施例包括具有寻呼空间的装置，页面标识符和页面传送器，以在延迟之后将页面传送到寻呼空间。延迟可以防止将多页传送到寻呼空间，例如在延迟期间被访问的页面。

66. 发明申请

US20090113433A1 THREAD CLASSIFICATION SUSPENSION 失效
标题翻译：螺纹分类悬挂
公开(公告)号：US20090113433A1
公开(公告)日：2009-04-30
申请号：US11923360
申请日：2007-10-24
申请人： Andrew Dunshea , Douglas James Griffith
发明人： Andrew Dunshea , Douglas James Griffith
IPC分类号： G06F9/46
CPC分类号： G06F9/5016 , G06F9/485 , G06F9/5022
摘要： The exemplary embodiments provide a computer-implemented method, apparatus, and computer-usable program code for managing memory. A notice of a shortage of real memory is received. For each active thread, the thread classification of the active thread is compared to a global hierarchy of thread classifications to determine a thread to affect. The global hierarchy of thread classifications defines the relative importance of each thread classification. An action to take for the determined thread is determined. The determined action is performed for the determined thread.
摘要翻译：示例性实施例提供了一种用于管理存储器的计算机实现的方法，装置和可计算机可用的程序代码。收到实际记忆短缺的通知。对于每个活动线程，将活动线程的线程分类与线程分类的全局层次进行比较，以确定线程的影响。线程分类的全局层次定义了每个线程分类的相对重要性。确定确定的线程采取的动作。对所确定的线程执行确定的动作。

67. 发明授权

US07475194B2 Apparatus for aging data in a cache 有权
标题翻译：用于在缓存中老化数据的装置
公开(公告)号：US07475194B2
公开(公告)日：2009-01-06
申请号：US11968481
申请日：2008-01-02
申请人： Jos Accapadi , Andrew Dunshea , Greg R. Mewhinney , Mysore Sathyanaranyana Srinivas
发明人： Jos Accapadi , Andrew Dunshea , Greg R. Mewhinney , Mysore Sathyanaranyana Srinivas
IPC分类号： G06F12/00
CPC分类号： G06F12/0897 , G06F12/0891
摘要： A computer implemented method, apparatus, and computer usable code for managing cache data. A partition identifier is associated with a cache entry in a cache, wherein the partition identifier identifies a last partition accessing the cache entry. The partition identifier associated with the cache entry is compared with a previous partition identifier located in a processor register in response to the cache entry being moved into a lower level cache relative to the cache. The cache entry is marked if the partition identifier associated with the cache entry matches the previous partition identifier located in the processor register to form a marked cache entry, wherein the marked cache entry is aged at a slower rate relative to an unmarked cache entry.
摘要翻译：计算机实现的方法，装置和用于管理高速缓存数据的计算机可用代码。分区标识符与高速缓存中的高速缓存条目相关联，其中分区标识符标识访问高速缓存条目的最后一个分区。与高速缓存条目相关联的分区标识符与位于处理器寄存器中的先前分区标识符进行比较，以响应于高速缓存条目相对于高速缓存移动到较低级高速缓存。如果与高速缓存条目相关联的分区标识与位于处理器寄存器中的先前分区标识符相匹配以形成标记的高速缓存条目，则标记高速缓存条目，其中标记的高速缓存条目相对于未标记的高速缓存条目以较慢的速率进行老化。

68. 发明授权

US07454570B2 Efficient memory update process for on-the-fly instruction translation for well behaved applications executing on a weakly-ordered processor 失效
标题翻译：高效的内存更新过程，用于在弱有序处理器上执行的运行良好的应用程序的即时指令转换
公开(公告)号：US07454570B2
公开(公告)日：2008-11-18
申请号：US11006371
申请日：2004-12-07
申请人： Andrew Dunshea , Satya Prakash Sharma , Mysore Sathyanarayana Srinivas
发明人： Andrew Dunshea , Satya Prakash Sharma , Mysore Sathyanarayana Srinivas
IPC分类号： G06F12/00
CPC分类号： G06F12/0837 , G06F9/3004 , G06F9/30087 , G06F9/3834 , G06F9/3836 , G06F9/3857
摘要： A multiprocessor data processing system (MDPS) with a weakly-ordered architecture providing processing logic for substantially eliminating issuing sync instructions after every store instruction of a well-behaved application. Instructions of a well-behaved application are translated and executed by a weakly-ordered processor. The processing logic includes a lock address tracking utility (LATU), which provides an algorithm and a table of lock addresses, within which each lock address is stored when the lock is acquired by the weakly-ordered processor. When a store instruction is encountered in the instruction stream, the LATU compares the target address of the store instruction against the table of lock addresses. If the target address matches one of the lock addresses, indicating that the store instruction is the corresponding unlock instruction (or lock release instruction), a sync instruction is issued ahead of the store operation. The sync causes all values updated by the intermediate store operations to be flushed out to the point of coherency and be visible to all processors.
摘要翻译：具有弱有序体系结构的多处理器数据处理系统（MDPS）提供处理逻辑，用于在运行良好的应用的每个存储指令之后基本上消除发出同步指令。良好的应用程序的指令由弱有序的处理器转换和执行。处理逻辑包括一个锁定地址跟踪实用程序（LATU），它提供一种算法和一个锁定地址表，当弱锁定处理器获取锁时，锁存地址被存储在该地址中。当在指令流中遇到存储指令时，LATU将存储指令的目标地址与锁定地址表进行比较。如果目标地址与其中一个锁定地址匹配，指示存储指令是相应的解锁指令（或锁定释放指令），则在存储操作之前发出同步指令。同步使得由中间存储操作更新的所有值被刷新到一致性点，并且对于所有处理器可见。

69. 发明授权

US09262357B2 Associating process priority with I/O queuing 有权
标题翻译：将流程优先级与I / O排队关联
公开(公告)号：US09262357B2
公开(公告)日：2016-02-16
申请号：US12240190
申请日：2008-09-29
申请人： Jos M. Accapadi , Andrew Dunshea , Vandana Mallempati , Agustin Mena, III
发明人： Jos M. Accapadi , Andrew Dunshea , Vandana Mallempati , Agustin Mena, III
IPC分类号： G06F3/00 , G06F13/364
CPC分类号： G06F13/362 , G06F13/364
摘要： Input/output (I/O) requests generated by processes are typically stored in I/O queues. Because the queued I/O requests may not be associated with the processes that generated them, changing a process' priority may not affect the priority of the I/O requests generated by the process. Therefore, after the process' priority has been increased, it may be forced to wait for an I/O handler to service its I/O request, which may be stuck behind an I/O request generated by a lower priority process. Functionality can be implemented to associate the processes' priorities with the I/O requests generated by the processes. Also, reordering the queued I/O requests to reflect changes in the processes' priorities can ensure that the I/O requests from high priority processes are serviced before the I/O requests from low priority processes. This can ensure efficient processing and lower wait times for high priority processes.
摘要翻译：由进程生成的输入/输出（I / O）请求通常存储在I / O队列中。因为排队的I / O请求可能不与生成它们的进程相关联，所以更改进程的优先级可能不会影响进程生成的I / O请求的优先级。因此，在进程优先级增加之后，可能迫使其等待I / O处理程序来服务其I / O请求，这可能会被较低优先级进程生成的I / O请求所困扰。可以实现功能，将进程的优先级与进程生成的I / O请求相关联。此外，重新排序排队的I / O请求以反映进程优先级的更改可以确保在优先级较低的进程的I / O请求之前对来自高优先级进程的I / O请求进行服务。这可以确保高优先级进程的有效处理和较短的等待时间。

70. 发明授权

US09201703B2 Sharing kernel services among kernels 有权
标题翻译：在内核之间共享内核服务
公开(公告)号：US09201703B2
公开(公告)日：2015-12-01
申请号：US11422656
申请日：2006-06-07
申请人： Andrew Dunshea , Diane G. Flemming
发明人： Andrew Dunshea , Diane G. Flemming
IPC分类号： G06F3/00 , G06F9/44 , G06F9/46 , G06F13/00 , G06F9/50
CPC分类号： G06F9/5077
摘要： Sharing kernel services among kernels, including receiving, by a partition manager from an application in a logical partition, a first system call for a kernel service from a first kernel, the first system call having form and content compatible with the first kernel, generating, in dependence upon the first system call, a second system call for the kernel service from a second kernel, the second system call having form and content compatible with the second kernel, and sending the second system call through the partition manager to the second kernel for execution.
摘要翻译：在内核之间共享内核服务，包括由分区管理器从逻辑分区中的应用程序接收来自第一内核的内核服务的第一系统调用，第一系统调用具有与第一内核兼容的形式和内容，根据第一系统调用，第二系统调用来自第二内核的内核服务，第二系统调用具有与第二内核兼容的形式和内容，并且通过分区管理器将第二系统调用发送到第二内核，用于执行。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式