公开(公告)号：GB2472060B

公开(公告)日：2016-01-27

申请号：GB0912800

申请日：2009-07-23

Applicant: IBM

Inventor： BUENDGEN REINHARD ,  HOLZHEU MICHAEL ,  DENGLER HOLGER ,  SAMESKE VOLKER

IPC: G06F9/54

公开(公告)号：GB2472060A

公开(公告)日：2011-01-26

申请号：GB0912800

申请日：2009-07-23

Applicant: IBM

Inventor： BUENDGEN REINHARD ,  HOLZHEU MICHAEL ,  DENGLER HOLGER ,  SAMESKE VOLKER

IPC: G06F15/167 ,  G06F9/46

Abstract: A coupling device for communication between operating systems in a cluster has a number of FIFO queues. The operating systems have an application programming interface which uses Posix pipe semantics to read from and write to the queues. The coupling device maintains the data structures and locks needed to represent Posix pipes. This allows the use of standard mount, open, write, read and close function calls to the operating system kernel to be used to access the FIFO queues on the coupling device. If one of the operating systems connected to the coupling device crashes, the device repairs the data structures associated with the queues. The operating systems may run on a single computer system or may be distributed across several computer systems.

公开(公告)号：GB2472057A

公开(公告)日：2011-01-26

申请号：GB0912795

申请日：2009-07-23

Applicant: IBM

Inventor： BUENDGEN REINHARD ,  HOLZHEU MICHAEL ,  DENGLER HOLGER ,  SAMESKE VOLKER

IPC: G06F15/167 ,  G06F9/46

Abstract: A coupling device for communication between operating systems in a cluster has a number of FIFO queues. The operating systems have an application programming interface which uses Linux pipe semantics to read from and write to the queues. The coupling device maintains the data structures and locks needed to represent Linux pipes. This allows the use of standard mount, open, write, read and close function calls to the operating system kernel to be used to access the FIFO queues on the coupling device. A write function call with more data than will fit in a single queue entry is split into several entries. A read function call, for less data than will fit into single queue entry, will return an error code indicating that it has failed and not alter the queue. The operating systems my run on a single computer system or be distributed across several computer systems.

公开(公告)号：CA2300706A1

公开(公告)日：2000-10-22

申请号：CA2300706

申请日：2000-03-13

Applicant: IBM

Inventor： HOLZHEU MICHAEL ,  BREIT EDMUND

IPC: G06F9/44 ,  G06F17/30

Abstract: The basic idea comprised of the present invention is to represent a graph structure with the help of links, e.g., HTML links, by aid of which the user can navigate through the output of the name space and to avoid repeated work, e.g., display, output, etc., of the same object of a directed graph having meshes during scanning the graph by generating such a link to the location in which the object was output before instead of outputting it repeatedly. This is achieved by generating and maintaining a reference list during scanning the graph in which each object is identified uniquely and some information is stored for each object whether the object was already processed or not. In case it was already processed just a HTML link to said prior output is generated. Otherwise the object is processed, e.g., is output and the list is updated correspondingly. By using such an HTML link an output structure can be realized which enables the user to quickly understand the particular structure of the graph and to realize easily when there are different paths leading to one and the same object.

公开(公告)号：GB2472057B

公开(公告)日：2016-01-27

申请号：GB0912795

申请日：2009-07-23

Applicant: IBM

Inventor： BUENDGEN REINHARD ,  HOLZHEU MICHAEL ,  DENGLER HOLGER ,  SAMESKE VOLKER

IPC: G06F9/54

公开(公告)号：GB2508344A

公开(公告)日：2014-06-04

申请号：GB201221368

申请日：2012-11-28

Applicant: IBM

Inventor： SCHWEFLINGHAUS JOCHEN ,  MENCIAS ANGEL NUNEZ ,  SCHIRMER ALBERT ,  LANG JAKOB ,  HOLZHEU MICHAEL ,  BUENDGEN REINHARD ,  SCHWIDEFSKY MARTIN

IPC: G06F11/07 ,  G06F11/14

Abstract: A method for creating an operating system dump comprises dividing a main memory of a computer system into at least three contiguous memory areas 102, comprising a primary memory area, a secondary memory area and a data memory area. Also comprises booting a first instance of an OS (operating system) into the main memory 104, loading a second instance of the OS into the secondary memory 106 area using the active first instance of the OS, stopping execution of the first active instance of the OS 108 if a critical execution error occurs and re-starting the computer using the loaded, second instance of the OS 110 which becomes the active instance of the OS. Method further comprises creating a dump of the primary memory area 112, and loading a third instance of the OS into the primary memory area 114. Thus the secondary instance continues regular operation of the primary instance, while dumping the crashed primary instance so it may be possible to minimize downtime after a crash.