利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.014 秒)

    Recovering failed writes to vital product data devices
    2.
    发明授权
    Recovering failed writes to vital product data devices 失效
    恢复对重要产品数据设备的写入失败

    公开(公告)号：US08447921B2

    公开(公告)日：2013-05-21

    申请号：US13008047

    申请日：2011-01-18

    申请人： Douglas M. Boecker ,  Brent W. Jacobs ,  Nathan D. Miller ,  Matthew S. Spinler ,  Shaun A. Wetzstein

    发明人： Douglas M. Boecker ,  Brent W. Jacobs ,  Nathan D. Miller ,  Matthew S. Spinler ,  Shaun A. Wetzstein

    IPC分类号： G06F13/00 ,  G06F13/28

    CPC分类号： G06F11/0793 ,  G06F8/656

    摘要： A method for maintaining vital product data (VPD) contained in an EEPROM (Electrically Erasable Programmable Read-Only Memory) on a field replaceable unit (FRU) of a computer system that has a cache. The method includes maintaining a copy of the VPD in the cache, retrieving the copy of the VPD from the cache upon receiving a read request of the VPD, and, upon receiving a write request to write data to the VPD, writing the data to the copy of the VPD, determining whether the VPD in the EEPROM is in synchronization with the copy of the VPD in the cache, and, if the VPD and the copy of the VPD are in synchronization, writing the data to the EEPROM.

    摘要翻译： 一种用于维持包含在具有高速缓存的计算机系统的现场可更换单元（FRU）上的EEPROM（电可擦除可编程只读存储器）中的重要产品数据（VPD）的方法。 该方法包括将VPD的副本保存在高速缓存中，在接收到VPD的读取请求时从高速缓存中检索VPD的副本，并且在接收到向VPD写入数据的写入请求时，将数据写入到 VPD的副本，确定EEPROM中的VPD是否与高速缓存中的VPD的副本同步，并且如果VPD和VPD的副本同步，则将数据写入EEPROM。

    Data transfer with implicit notification
    3.
    发明授权
    Data transfer with implicit notification 失效
    带隐式通知的数据传输

    公开(公告)号：US06985970B2

    公开(公告)日：2006-01-10

    申请号：US10424189

    申请日：2003-04-25

    申请人： Charles S. Graham ,  Brent W. Jacobs ,  Daniel F. Moertl ,  Timothy J. Schimke

    发明人： Charles S. Graham ,  Brent W. Jacobs ,  Daniel F. Moertl ,  Timothy J. Schimke

    IPC分类号： G06F13/14

    CPC分类号： G06F13/124

    摘要： A method, apparatus, system, and signal-bearing medium are provided that in an embodiment receive a command at an adapter from an initiator that requests a transfer of data, transfer the data from the initiator to the adapter, and respond with a notification to the initiator that the command completed successfully after transferring the data to the adapter and prior to the adapter completing a process based on the command.

    摘要翻译： 提供了一种方法，装置，系统和信号承载介质，其在一个实施例中从适配器接收请求数据传送的发起者的命令，将数据从发起者传送到适配器，并且响应于通知 在将数据传输到适配器之后，以及在适配器完成基于该命令的进程之前，该命令成功启动。

    REDUNDANT SERVICE PROCESSOR FAILOVER PROTOCOL
    5.
    发明申请
    REDUNDANT SERVICE PROCESSOR FAILOVER PROTOCOL 审中-公开
    冗余服务处理者失败协议

    公开(公告)号：US20080126854A1

    公开(公告)日：2008-05-29

    申请号：US11535532

    申请日：2006-09-27

    申请人： Gary D. Anderson ,  Brent W. Jacobs ,  William A. Thompson

    发明人： Gary D. Anderson ,  Brent W. Jacobs ,  William A. Thompson

    IPC分类号： G06F11/20

    CPC分类号： G06F11/203 ,  G06F11/2025 ,  G06F11/2028 ,  G06F11/2033 ,  G06F11/2038

    摘要： A data processing system (or server) is designed with redundant service processors and a hypervisor. Both service processors are capable of performing the full set of service processor functions, with one service processor (SP) registering itself as a primary SP with the system firmware/hypervisor and the other SP registering as the backup SP. The primary SP performs the initialization, monitoring and control of system resources. The backup SP and hypervisor monitor the primary SP for indications that the primary SP is failing. In the event of a failure of the primary SP, any one of the three components, the backup SP, hypervisor, or even the primary SP itself, is able to initiate a failover to the backup SP. During failover conditions, backup SP checks the system to ensure that there is no ongoing failover before a new failover is initiated

    摘要翻译： 数据处理系统（或服务器）设计有冗余服务处理器和管理程序。 两个服务处理器都能够执行全套服务处理器功能，一个服务处理器（SP）将系统固件/管理程序注册为主SP，另一个SP注册为备份SP。 主SP执行系统资源的初始化，监控和控制。 备份SP和管理程序监视主SP，以指示主SP发生故障。 在主SP发生故障的情况下，三个组件中的任何一个，备份SP，虚拟机管理程序甚至主SP本身都能够启动到备份SP的故障切换。 在故障切换条件期间，备份SP会检查系统，以确保在启动新的故障转移之前不进行故障转移

    ADJUSTING THE AMOUNT OF MEMORY ALLOCATED TO A CALL STACK
    6.
    发明申请
    ADJUSTING THE AMOUNT OF MEMORY ALLOCATED TO A CALL STACK 有权
    调整存储器的数量分配给一个电话堆栈

    公开(公告)号：US20120324194A1

    公开(公告)日：2012-12-20

    申请号：US13159480

    申请日：2011-06-14

    申请人： Brent W. Jacobs ,  Nathan D. Miller

    发明人： Brent W. Jacobs ,  Nathan D. Miller

    IPC分类号： G06F12/02

    CPC分类号： G06F12/02 ,  G06F9/4484 ,  G06F9/5022

    摘要： In an embodiment, a plurality of stack depths of a stack are sampled from all stack depths of the stack. An average of the plurality of stack depths is calculated. If a number of the plurality of stack depths is greater than a maximum sample threshold and the average of the plurality of stack depths is greater than or equal to a current depth of the stack, then pages are deallocated from the stack that are above the average of the plurality of stack depths. If the number of the plurality of stack depths is greater than the maximum sample threshold and the average of the plurality of stack depths is less than the current depth of the stack, then pages are deallocated from the stack that are above the current depth of the stack.

    摘要翻译： 在一个实施例中，堆叠的多个堆叠深度从堆叠​​的所有堆叠深度被采样。 计算多个堆叠深度的平均值。 如果多个堆叠深度中的多个数量大于最大采样阈值，并且多个堆叠深度的平均值大于或等于堆叠的当前深度，则从堆栈释放高于平均值的页面 的多个堆叠深度。 如果多个堆叠深度的数量大于最大采样阈值，并且多个堆叠深度的平均值小于堆叠的当前深度，则从堆栈释放高于当前深度的页面 堆栈

    Adjusting the amount of memory allocated to a call stack
    8.
    发明授权
    Adjusting the amount of memory allocated to a call stack 有权
    调整分配给调用堆栈的内存量

    公开(公告)号：US08769233B2

    公开(公告)日：2014-07-01

    申请号：US13159480

    申请日：2011-06-14

    申请人： Brent W. Jacobs ,  Nathan D. Miller

    发明人： Brent W. Jacobs ,  Nathan D. Miller

    IPC分类号： G06F12/00 ,  G06F13/00 ,  G06F13/28

    CPC分类号： G06F12/02 ,  G06F9/4484 ,  G06F9/5022

    摘要： In an embodiment, a plurality of stack depths of a stack are sampled from all stack depths of the stack. An average of the plurality of stack depths is calculated. If a number of the plurality of stack depths is greater than a maximum sample threshold and the average of the plurality of stack depths is greater than or equal to a current depth of the stack, then pages are deallocated from the stack that are above the average of the plurality of stack depths. If the number of the plurality of stack depths is greater than the maximum sample threshold and the average of the plurality of stack depths is less than the current depth of the stack, then pages are deallocated from the stack that are above the current depth of the stack.

    摘要翻译： 在一个实施例中，堆叠的多个堆叠深度从堆叠​​的所有堆叠深度被采样。 计算多个堆叠深度的平均值。 如果多个堆叠深度中的多个数量大于最大采样阈值，并且多个堆叠深度的平均值大于或等于堆叠的当前深度，则从堆栈释放高于平均值的页面 的多个堆叠深度。 如果多个堆叠深度的数量大于最大采样阈值，并且多个堆叠深度的平均值小于堆叠的当前深度，则从堆栈释放高于当前深度的页面 堆栈

    RECOVERING FAILED WRITES TO VITAL PRODUCT DATA DEVICES
    10.
    发明申请
    RECOVERING FAILED WRITES TO VITAL PRODUCT DATA DEVICES 失效
    恢复失败的写作到产品数据设备

    公开(公告)号：US20120185637A1

    公开(公告)日：2012-07-19

    申请号：US13008047

    申请日：2011-01-18

    申请人： Douglas M. Boecker ,  Brent W. Jacobs ,  Nathan D. Miller ,  Matthew S. Spinler ,  Shaun A. Wetzstein

    发明人： Douglas M. Boecker ,  Brent W. Jacobs ,  Nathan D. Miller ,  Matthew S. Spinler ,  Shaun A. Wetzstein

    IPC分类号： G06F12/00 ,  G06F12/02

    CPC分类号： G06F11/0793 ,  G06F8/656

    摘要： A method for maintaining vital product data (VPD) contained in an EEPROM (Electrically Erasable Programmable Read-Only Memory) on a field replaceable unit (FRU) of a computer system that has a cache. The method includes maintaining a copy of the VPD in the cache, retrieving the copy of the VPD from the cache upon receiving a read request of the VPD, and, upon receiving a write request to write data to the VPD, writing the data to the copy of the VPD, determining whether the VPD in the EEPROM is in synchronization with the copy of the VPD in the cache, and, if the VPD and the copy of the VPD are in synchronization, writing the data to the EEPROM.

    摘要翻译： 一种用于维持包含在具有高速缓存的计算机系统的现场可更换单元（FRU）上的EEPROM（电可擦除可编程只读存储器）中的重要产品数据（VPD）的方法。 该方法包括将VPD的副本保存在高速缓存中，在接收到VPD的读取请求时从高速缓存中检索VPD的副本，并且在接收到向VPD写入数据的写入请求时，将数据写入到 VPD的副本，确定EEPROM中的VPD是否与高速缓存中的VPD的副本同步，并且如果VPD和VPD的副本同步，则将数据写入EEPROM。