-
公开(公告)号：JPH10334066A
公开(公告)日：1998-12-18
申请号：JP8470598
申请日：1998-03-30
Applicant: IBM
Inventor： BIRD COLIN LEONARD , WALLIS GRAHAM DEREK
IPC: G06F15/16 , G06F9/46 , G06F15/177
Abstract: PROBLEM TO BE SOLVED: To provide a parallel processing system whose reliability is improved. SOLUTION: The parallel processing system is provided with some processing nodes (S1, S2 to Sn), each node is provided with message processing kernels (13, 23 to n3) and related process registers (14, 24 to n4), the process registers are capable of being loaded under control of an application (3) by a loading means (4), messages are exchanged and processed through a message interface (2) by nodes and a message processing process called according to contents of the related processing register by the related nodes is decided.
-
公开(公告)号：GB2354141A
公开(公告)日：2001-03-14
申请号：GB9921411
申请日：1999-09-11
Applicant: IBM
Inventor： WALLIS GRAHAM DEREK
IPC: G06F3/0481 , G06F9/44 , G06F17/30
Abstract: Disclosed is a method, in a computer system having a graphical user interface, for controlling a display of a tree structure, the method comprising the steps of: determining that a subtree of the tree has been expanded; determining that the subtree has not been accessed for a determined period; and collapsing the subtree. Disclosed is also the further step of: responsive to a user input, setting a period to be the determined period.
-
公开(公告)号：GB2315888A
公开(公告)日：1998-02-11
申请号：GB9616075
申请日：1996-07-31
Applicant: IBM
Inventor： BIRD COLIN LEONARD , LINGENFELDER CHRISTOPH , PHIPPEN ROBERT WILLIAM , WALLIS GRAHAM DEREK
Abstract: An inherently serial program is processed in parallel, thus leading to higher processing speeds, while maintaining a close approximation to the specific result obtained through a serial running of the program. This goal has been attained based on the fact that the desired degree of closeness between a parallel result and the serial result depends on the particular inherently serial program being run and the type of analysis being performed. That is, some inherently serial processes require a "fine-tuned" result while for others a "coarser" result is acceptable. The frequency at which the parallel branches consolidate their respective results is changed accordingly to alter the degree of closeness between the parallel processed result and the serially processed result.
-
公开(公告)号：GB2305747A
公开(公告)日：1997-04-16
申请号：GB9520035
申请日：1995-09-30
Applicant: IBM
Inventor： WALLIS GRAHAM DEREK
IPC: G06F9/445 , G06F9/50 , H04L29/06 , H04L29/08 , G06F15/177
Abstract: To connect a terminal (20) to a selected server 60, 70, 80 to perform a task on behalf of the terminal, server determination means (14) can retrieve from a storage means (90) data identifying the plurality of servers, and reference an address conversion means (92, 94) to determine an address currently associated with each server; and chooser means (16) can provide information about the plurality of servers for display on the terminal, so the user can select one of said servers for connection (18). The data in the storage means (90) identifying a parallel (i.e. multi-processor) server is a generic identifier for the processors within that server. The address conversion means (92, 94) periodically identifies one of these processors based on predetermined criteria, for load balancing, and updates the information in the address conversion means such that the address associated with the generic identifier is the address of the identified processor. The server determination means (14) recognises any generic identifier, and references the address conversion means to determine the address associated with that generic identifier after a user selection of the parallel server corresponding to that generic identifier.
-
公开(公告)号：GB2272310A
公开(公告)日：1994-05-11
申请号：GB9223389
申请日：1992-11-07
Applicant: IBM
Inventor： ROPER MICHAEL IAN , WALLIS GRAHAM DEREK
IPC: G06F13/00 , G06F15/16 , G06F15/177 , H04L12/18 , H04L12/56
Abstract: A computer forms a node in a network, consisting of computer nodes linked together into a minimum spanning tree topology. When a computer receives a message from a first node linked to it, it forwards the message to other nodes linked to that computer, as well as storing information about the message. As replies are received from the other computers, they are stored and collated together, to allow the computer to send just a single reply message back to the originating node based on the collated replies. This single reply is in turn collated at the next node, with the result that network traffic is reduced.
-
Patent Agency Ranking
公开(公告)号：GB2270821A
公开(公告)日：1994-03-23
申请号：GB9219862
申请日：1992-09-19
Applicant: IBM
Inventor： ROPER MICHAEL IAN , EVANS LAWRENCE STEVEN , WALLIS GRAHAM DEREK
Abstract: Computers are linked together to form a network. Messages are sent over the links between the computers in compressed, segmented form, the size of the segments (packets) being appropriate to the transmission characteristics of the link. A message previously received or transmitted by a computer is stored in compressed and segmented form. If it is desired to forward or re-transmit this message, the segment size of the stored form is compared against the optimum segment size for the link over which the message is to be sent. If there is a close match, then the stored segmented, compressed message is retrieved for direct transmittal, without having to resegment or recompress the message.
-
公开(公告)号：DE69433833T2
公开(公告)日：2006-04-06
申请号：DE69433833
申请日：1994-08-26
Applicant: IBM
Abstract: The present invention provides a data processing system, and method of operating such a system, for facilitating a connection of a program on a client computer to a server, the server consisting of a plurality of server computers with shared resources. The data processing system, the client computer, and the server computers all reside in a logical network. The data processing system has an input means for receiving a request from the client computer for a machine address of a server computer identified by a server computer name sent with the request, such a machine address enabling a connection to be made from the client computer to that server computer via the network. A storage device is provided by the system for storing a list identifying server computer names with machine addresses of the server computers. A conversion means in the system uses the list to convert the server computer name received by the input means into the machine address of the server computer, and then an output means sends the machine address from the conversion means to the client computer. The system is characterised by decision logic for studying the server computers at predetermined intervals having regard to a predetermined test criteria, in order to select one of the server computers; and writing means for updating the list by associating the machine address for the server computer selected by the decision logic with a particular server computer name contained as a generic server computer name in the list. Using this technique, when a client computer specifies the generic server computer name, it receives the machine address of the server computer identified by the decision logic.
-
公开(公告)号：DE69433833D1
公开(公告)日：2004-07-15
申请号：DE69433833
申请日：1994-08-26
Applicant: IBM
Abstract: The present invention provides a data processing system, and method of operating such a system, for facilitating a connection of a program on a client computer to a server, the server consisting of a plurality of server computers with shared resources. The data processing system, the client computer, and the server computers all reside in a logical network. The data processing system has an input means for receiving a request from the client computer for a machine address of a server computer identified by a server computer name sent with the request, such a machine address enabling a connection to be made from the client computer to that server computer via the network. A storage device is provided by the system for storing a list identifying server computer names with machine addresses of the server computers. A conversion means in the system uses the list to convert the server computer name received by the input means into the machine address of the server computer, and then an output means sends the machine address from the conversion means to the client computer. The system is characterised by decision logic for studying the server computers at predetermined intervals having regard to a predetermined test criteria, in order to select one of the server computers; and writing means for updating the list by associating the machine address for the server computer selected by the decision logic with a particular server computer name contained as a generic server computer name in the list. Using this technique, when a client computer specifies the generic server computer name, it receives the machine address of the server computer identified by the decision logic.
-
公开(公告)号：DE69324756D1
公开(公告)日：1999-06-10
申请号：DE69324756
申请日：1993-02-25
Applicant: IBM
Inventor： STANFORD-CLARK ANDREW J , ROPER MICHAEL IAN , EVANS LAWRENCE STEVEN , WALLIS GRAHAM DEREK , FYLES ANTHONY , KEY ANDREW , SETHI VINCENT
IPC: H04L29/06
-
公开(公告)号：CA2099421C
公开(公告)日：1999-01-12
申请号：CA2099421
申请日：1993-06-30
Applicant: IBM
Inventor： EVANS LAWRENCE STEVEN , ROPER MICHAEL IAN , WALLIS GRAHAM DEREK
Abstract: Computers are linked together to form a network. Messages are sent over the links between the computers in compressed, segmented form, the size of the segments being appropriate to the transmission characteristics of the link. A message previously received or transmitted by a computer is stored in compressed and segmented form. If it is desired to forward or re-transmit this message, the segment size of the stored form is compared against the optimum segment size for the link over which the message is to be sent. If there is a close match, then the stored segmented, compressed message is retrieved for direct transmittal, without having to resegment or recompress the message.
-
-
-
-
-
-
-
-
-
Search Results
21
records
(took 0.021 seconds)
