公开(公告)号：JP2005166043A

公开(公告)日：2005-06-23

申请号：JP2004331079

申请日：2004-11-15

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： CHEN JAMES CHIENCHIUNG ,  CORCORAN BRIAN J ,  KALOS MATTHEW J ,  PADILLA RICARDO S

IPC: G06K19/07 ,  G06F9/00 ,  G06F9/445 ,  G06F11/00 ,  G06F13/28

CPC classification number: G06F8/65

Abstract: PROBLEM TO BE SOLVED: To provide an apparatus, system and method for performing fastload code update on a communication adapter.
SOLUTION: An image load module 320 loads a copy of a new code image 316 in a memory 310 on the communication adapter. The memory also concurrently stores a copy of an old code image 314 used by the communication adapter. A memory initialization module 324 invokes the new code image to perform a memory initialization operation. The memory initialization module may perform the memory initialization operation concurrently with ongoing I/O requests possibly accepted. An image overlay module 326 is configured to overlay the old code image with the new code image. The fastload code update minimizes the time that the communication adapter is off-line to overlay the old code image with the new code image and reinitialize the communication adapter.
COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：提供用于在通信适配器上执行快速加载代码更新的装置，系统和方法。 解决方案：图像加载模块320将新的代码图像316的副本加载到通信适配器上的存储器310中。 存储器还同时存储由通信适配器使用的旧代码图像314的副本。 存储器初始化模块324调用新的代码图像以执行存储器初始化操作。 存储器初始化模块可以与可能接受的正在进行的I / O请求同时执行存储器初始化操作。 图像覆盖模块326被配置为用新的代码图像覆盖旧的代码图像。 快速加载代码更新最大限度地减少通信适配器离线覆盖旧代码图像与新代码图像并重新初始化通信适配器的时间。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：JP2001222501A

公开(公告)日：2001-08-17

申请号：JP2000397075

申请日：2000-12-27

Applicant: IBM

Inventor： BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIENCHIUNG

IPC: G06F13/10 ,  G06F9/48 ,  G06F13/00 ,  H04L12/56 ,  H04L29/06

Abstract: PROBLEM TO BE SOLVED: To provide a method, a system, a program and a data structure for queuing requests. SOLUTION: Each of requests is related with one of plural priority levels. A queue containing plural entries is generated. The respective entries correspond to the plural levels and the plural requests can be queued in one entry. At the time of receiving a new request having a related priority for enqueuing in the queue, a decision on the entry pointed by a pointer is performed. The priority concerning the new request is controlled just for a certain value so that the priority can be related with an entry different from the entry pointed by the pointer. The new request is queued in one entry related with the controlled priority.

公开(公告)号：DE10062063B4

公开(公告)日：2006-02-09

申请号：DE10062063

申请日：2000-12-13

Applicant: IBM

Inventor： BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIENCHIUNG

IPC: G06F13/10 ,  G06F9/48 ,  G06F13/00 ,  G06F15/173 ,  H04L12/56 ,  H04L29/06

Abstract: Disclosed is a method, system, program, and data structure for queuing requests. Each request is associated with one of a plurality of priority levels. A queue is generated including a plurality of entries. Each entry corresponds to a priority level and a plurality of requests can be queued at one entry. When a new request having an associated priority is received to enqueue on the queue, a determination is made of an entry pointed to by a pointer. The priority associated with the new request is adjusted by a value such that the adjusted priority is associated with an entry different from the entry pointed to by the pointer. The new request is queued at one entry associated with the adjusted priority.

公开(公告)号：DE10062063A1

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

申请号：DE10062063

申请日：2000-12-13

Applicant: IBM

Inventor： BENHASE MICHAEL THOMAS ,  CHEN JAMES CHIENCHIUNG

IPC: G06F9/48 ,  G06F13/10 ,  G06F13/00 ,  H04L12/56 ,  H04L29/06 ,  G06F15/173

Abstract: The control method has each incoming input/output request inserted in an entry in the waiting loop data structure (8) corresponding to the request priority plane, each entry having a number of requests of similar priority arranged in sequence, with processing of the requests held in the waiting loop in order of priority. Also included are Independent claims for the following: (a) a control system for an incoming request waiting loop; (b) a computer program product for an incoming request waiting loop control procedure; (c) a memory device with a request waiting loop data structure.