ALLOCATING NETWORK ADAPTER RESOURCES AMONG LOGICAL PARTITIONS
    1.
    发明申请
    ALLOCATING NETWORK ADAPTER RESOURCES AMONG LOGICAL PARTITIONS 审中-公开
    在逻辑分区上分配网络适配器资源

    公开(公告)号:WO2009027300A3

    公开(公告)日:2009-04-16

    申请号:PCT/EP2008060919

    申请日:2008-08-21

    CPC classification number: G06F9/5077

    Abstract: In an embodiment, a network adapter has a physical port that is multiplexed to multiple logical ports, which have default queues. The adapter also has other queues, which can be allocated to any logical port, and resources, which map tuples to queues. The tuples are derived from data in packets received via the physical port. The adapter determines which queue should receive a packet based on the received tuple and the resources. If the received tuple matches a resource, then the adapter stores the packet to the corresponding queue; otherwise, the adapter stores the packet to the default queue for the logical port specified by the packet. In response to receiving an allocation request from a requesting partition, if no resources are idle, a resource is selected for preemption that is already allocated to a selected partition. The selected resource is then allocated to the requesting partition.

    Abstract translation: 在一个实施例中,网络适配器具有被复用到具有默认队列的多个逻辑端口的物理端口。 适配器还具有可以分配给任何逻辑端口的其他队列,以及将元组映射到队列的资源。 元组是通过物理端口接收的数据包中的数据导出的。 适配器根据接收的元组和资源确定哪个队列应该接收数据包。 如果接收到的元组与资源匹配,则适配器将数据包存储到相应的队列中; 否则,适配器将数据包存储到由数据包指定的逻辑端口的默认队列。 响应于从请求分区接收分配请求,如果没有资源空闲,则选择已经分配给所选分区的抢占资源。 然后将所选择的资源分配给请求分区。

    ALLOCATING NETWORK ADAPTER RESOURCES AMONG LOGICAL PARTITIONS

    公开(公告)号:CA2697155A1

    公开(公告)日:2009-03-05

    申请号:CA2697155

    申请日:2008-08-21

    Applicant: IBM

    Abstract: In an embodiment, a network adapter has a physical port that is multiplexed to multiple logical ports, which have default queues. The adapter also has other queues, which can be allocated to any logical port, and resources, which map tuples to queues. The tuples are derived from data in packets received via the physical port. The adapter determines which queue should receive a packet based on the received tuple and the resources. If the received tuple matches a resource, then the adapter stores the packet to the corresponding queue; otherwise, the adapter stores the packet to the default queue for the logical port specified by the packet. In response to receiving an allocation request from a requesting partition, if no resources are idle, a resource is selected for preemption that is already allocated to a selected partition. The selected resource is then allocated to the requesting partition.

    ALLOCATING NETWORK ADAPTER RESOURCES AMONG LOGICAL PARTITIONS

    公开(公告)号:CA2697155C

    公开(公告)日:2017-11-07

    申请号:CA2697155

    申请日:2008-08-21

    Applicant: IBM

    Abstract: In an embodiment, a network adapter has a physical port that is multiplexed to multiple logical ports, which have default queues. The adapter also has other queues, which can be allocated to any logical port, and resources, which map tuples to queues. The tuples are derived from data in packets received via the physical port. The adapter determines which queue should receive a packet based on the received tuple and the resources. If the received tuple matches a resource, then the adapter stores the packet to the corresponding queue; otherwise, the adapter stores the packet to the default queue for the logical port specified by the packet. In response to receiving an allocation request from a requesting partition, if no resources are idle, a resource is selected for preemption that is already allocated to a selected partition. The selected resource is then allocated to the requesting partition.

    A method and apparatus for updatable flash memory design and recovery with minimal redundancy

    公开(公告)号:IE20010675A1

    公开(公告)日:2002-04-03

    申请号:IE20010675

    申请日:2001-07-18

    Applicant: IBM

    Abstract: A method and an apparatus is presented for updating flash memory that contains a write protected code, a first copy of rewritable recovery code, a second copy of rewritable recovery code, and a rewritable composite code. Each block of rewritable code contains a checksum code to detect if the block of code has been corrupted. If it is detected that the first copy of the recovery code is corrupted then the second copy of the recovery code is copied into the first copy of the recovery code. If it is detected the second copy of the recovery code is corrupted then the first copy of the recovery code is copied into the second copy of the recovery code. The recovery code is responsible for checking and updating the composite code. If it is detected the composite code is corrupted then a fresh copy of the composite code is obtained from a removable storage device or a network connection. The data processing system is booted by executing the write protected code, the first copy of the recovery code, and the composite code. There is a minimum of redundant code by only replicating two copies of the recovery code while, at the same time, guaranteeing both the integrity and the updatability of the flash memory.

Patent Agency Ranking