METHOD AND SYSTEM FOR DETERMINING WHETHER TO SEND A SYNCHRONOUS OR ASYNCHRONOUS RESOURCE REQUEST
    51.
    发明申请
    METHOD AND SYSTEM FOR DETERMINING WHETHER TO SEND A SYNCHRONOUS OR ASYNCHRONOUS RESOURCE REQUEST 审中-公开
    用于确定发送同步或异步资源请求的方法和系统

    公开(公告)号:US20080168130A1

    公开(公告)日:2008-07-10

    申请号:US11621193

    申请日:2007-01-09

    IPC分类号: G06F15/16

    摘要: A system for making a determination to send a synchronous or asynchronous resource request. In response to sending a request to receive response time data for resource requests, the response time data for resource requests is received and stored. A request from a requester is received for response time data for a particular type of resource request. The response time data for the resource requests is searched for the particular type of resource request. In response to finding the response time data for the particular type of resource request within the response time data for the resource requests, the response time data for the particular type of resource request is sent to the requester. The requester either sends a synchronous or asynchronous resource request based on the response time data for the particular type of resource request.

    摘要翻译: 用于确定发送同步或异步资源请求的系统。 响应于发送用于接收资源请求的响应时间数据的请求,接收并存储资源请求的响应时间数据。 收到来自请求者的请求,用于特定类型的资源请求的响应时间数据。 搜索资源请求的响应时间数据以查找特定类型的资源请求。 响应于在资源请求的响应时间数据内找到特定类型的资源请求的响应时间数据,将特定类型的资源请求的响应时间数据发送到请求者。 请求者基于特定类型的资源请求的响应时间数据发送同步或异步资源请求。

    GUARD BANDS IN VERY LARGE VIRTUAL MEMORY PAGES
    53.
    发明申请
    GUARD BANDS IN VERY LARGE VIRTUAL MEMORY PAGES 审中-公开
    在非常大的虚拟存储器页面中的保护套

    公开(公告)号:US20080034179A1

    公开(公告)日:2008-02-07

    申请号:US11462055

    申请日:2006-08-03

    IPC分类号: G06F12/14

    CPC分类号: G06F12/1036 G06F2212/652

    摘要: A computer implemented method, apparatus, and computer usable program code for guarding data structures in a data processing system. An exemplary method includes establishing a first guard address range in a portion of a first virtual memory page associated with the data processing system. The portion is less than the entirety first virtual memory page. Responsive to an attempt to access the first guard address range, a storage exception signal is generated.

    摘要翻译: 一种用于保护数据处理系统中的数据结构的计算机实现的方法,装置和计算机可用程序代码。 示例性方法包括在与数据处理系统相关联的第一虚拟存储器页面的一部分中建立第一保护地址范围。 该部分小于整个第一个虚拟内存页面。 响应于尝试访问第一保护地址范围,产生存储异常信号。

    Method and apparatus for managing access contention to a linear list without the use of locks
    54.
    发明授权
    Method and apparatus for managing access contention to a linear list without the use of locks 有权
    用于在不使用锁的情况下管理对线性列表的访问争用的方法和装置

    公开(公告)号:US06651146B1

    公开(公告)日:2003-11-18

    申请号:US09513810

    申请日:2000-02-24

    IPC分类号: G06F1200

    摘要: The present invention discloses a method of managing lists in a multiprocessor system without the use of locks that prevent contention for the list. List management in a linear list with a front and a back of the list has applications where it is desirable to manage the list in a Last In First Out (LIFO) and a First In First Out (FIFO) or a combination of LIFO and FIFO. LIFO and FIFO list management can be done by restrictively adding data elements to the front, back and removing data elements from the front of a managed list. At certain times there can be contention for a list and either locking routines are in place to prevent contention or some other method is used to guarantee data element integrity. The present invention discloses a set of operations that when used with certain protocols allow two or more processors to access a list as a LIFO or FIFO in a multiprocessor system without the use of locks.

    摘要翻译: 本发明公开了一种在多处理器系统中管理列表的方法,而不使用防止列表竞争的锁。 具有列表前面和后面的线性列表中的列表管理具有应用程序,其中希望以先出先出(LIFO)和先进先出(FIFO)或LIFO和FIFO的组合来管理列表 。 LIFO和FIFO列表管理可以通过限制性地将数据元素添加到前端,后端和从托管列表的前面移除数据元素来完成。 在某些时候,可能会有一个列表的争用,并且锁定例程已经到位以防止争用,或者使用其他一些方法来保证数据元素的完整性。 本发明公开了一组操作,当与某些协议一起使用时,允许两个或多个处理器在不使用锁的情况下在多处理器系统中作为LIFO或FIFO访问列表。