Búsqueda Imágenes Maps Play YouTube Noticias Gmail Drive Más »
Iniciar sesión
Usuarios de lectores de pantalla: deben hacer clic en este enlace para utilizar el modo de accesibilidad. Este modo tiene las mismas funciones esenciales pero funciona mejor con el lector.

Patentes

  1. Búsqueda avanzada de patentes
Número de publicaciónUS20090216893 A1
Tipo de publicaciónSolicitud
Número de solicitudUS 12/051,634
Fecha de publicación27 Ago 2009
Fecha de presentación19 Mar 2008
Fecha de prioridad25 Feb 2008
También publicado comoUS7895462, US8225280, US8429662, US8432793, US8793699, US20090216923, US20090216927, US20090217238, US20090217270, US20090217284
Número de publicación051634, 12051634, US 2009/0216893 A1, US 2009/216893 A1, US 20090216893 A1, US 20090216893A1, US 2009216893 A1, US 2009216893A1, US-A1-20090216893, US-A1-2009216893, US2009/0216893A1, US2009/216893A1, US20090216893 A1, US20090216893A1, US2009216893 A1, US2009216893A1
InventoresRichard K. Errickson, Leonard W. Helmer, Jr., John S. Houston, Ambrose A. Verdibello, Jr.
Cesionario originalInternational Business Machines Corporation
Exportar citaBiBTeX, EndNote, RefMan
Enlaces externos: USPTO, Cesión de USPTO, Espacenet
Buffer discovery in a parrallel multi-tasking multi-processor environment
US 20090216893 A1
Resumen
A computer program product, apparatus and method for buffer discovery in a multi-tasking multi-processor environment. An exemplary embodiment includes establishing a management connection, confirming that end points of the management connection are connected to respective targets, sending a negotiate counts message, including a number and size of buffers associated with parameters of the management connection and receiving a response to the negotiate counts message, the response including at least one of rejection of the management connection and an acceptance of the management connection, including an agreed number and size of the buffers.
Imágenes(6)
Previous page
Next page
Reclamaciones(20)
1. A computer program product for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment, the computer program product comprising:
a tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising:
establishing a management connection;
confirming that end points of the management connection are connected to respective targets;
sending a negotiate counts message, including a number and size of buffers associated with parameters of the management connection; and
receiving a response to the negotiate counts message, the response including at least one of rejection of the management connection and an acceptance of the management connection, including an agreed number and size of the buffers.
2. The computer program product as claimed in claim 1, wherein the method further comprises in response to a mismatch in the number of buffers, setting a lesser number of buffers in the management connection.
3. The computer program product as claimed in claim 1, wherein the method further comprises in response to a buffer size mismatch, selecting a smaller buffer size as the buffer size.
4. The computer program product as claimed in claim 1, wherein the acceptance of the connection includes a smaller number of selected buffers and a smaller size of the selected buffers.
5. The computer program product as claimed in claim 4, wherein the method further comprises:
accepting the connection; and
storing the agreed number and size of the buffers.
6. The computer program product as claimed in claim 4, wherein the method further comprises creating and connecting queue pairs associated with each of the buffers.
7. The computer program product as claimed in claim 4, wherein the method further comprises sending a node descriptor.
8. The computer program product as claimed in claim 1, wherein the rejection of the connection includes a request to drop the connection.
9. The computer program product as claimed in claim 8, wherein the method further comprises dropping the connection.
10. An apparatus for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment, the apparatus comprising:
a connection manager performing a method comprising:
establishing a management connection;
confirming that end points of the management connection are connected to respective targets;
sending a negotiate counts message, including a number and size of buffers associated with parameters of the management connection; and
receiving a response to the negotiate counts message, the response including at least one of rejection of the management connection and an acceptance of the management connection, including an agreed number and size of the buffers.
11. The apparatus as claimed in claim 10 wherein the method further comprises:
accepting the connection, wherein the acceptance of the connection includes a smaller number of selected buffers and a smaller size of the selected buffers.
storing an agreed number and size of the buffers; and
creating and connecting queue pairs associated with each of the buffers.
12. The apparatus as claimed in claim 10, wherein the method further comprises:
rejecting the connection; and
dropping the connection.
13. A method for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment, the method comprising:
establishing a management connection;
confirming that end points of the management connection are connected to respective targets;
sending a negotiate counts message, including a number and size of buffers associated with parameters of the management connection; and
receiving a response to the negotiate counts message, the response including at least one of rejection of the management connection and an acceptance of the management connection, including an agreed number and size of the buffers.
14. The method as claimed in claim 13, further comprising in response to a mismatch in the number of buffers, setting a lesser number of buffers in the management connection.
15. The method as claimed in claim 13, further comprising in response to a buffer size mismatch, selecting a smaller buffer size as the buffer size.
16. The method as claimed in claim 13, wherein the acceptance of the connection includes a smaller number of selected buffers and a smaller size of the selected buffers.
17. The method as claimed in claim 16, further comprising:
accepting the connection; and
storing the agreed number and size of the buffers.
18. The method as claimed in claim 16, further comprising creating and connecting queue pairs associated with each of the buffers.
19. The method as claimed in claim 13, wherein the rejection of the connection includes a request to drop the connection.
20. The method as claimed in claim 19, further comprising dropping the connection
Descripción
  • [0001]
    Priority based on U.S. Provisional Patent Application, Ser. No. 61/031,315, filed Feb. 25, 2008, and entitled “MULTI-TASKING MULTI-PROCESSOR ENVIRONMENTS OVER INFINIBAND” is claimed, the entire contents of which is incorporated by reference in its entirety.
  • BACKGROUND OF THE INVENTION
  • [0002]
    1. Field of Invention
  • [0003]
    The present disclosure relates generally to multi-tasking multi-processor environments, and in particular, to buffer discovery in a multi-tasking multi-processor environment.
  • [0004]
    2. Description of Background
  • [0005]
    In a multi-tasking multi-processor environment there is a need to confirm that the configuration of the connections on the two ends of the link is in agreement before the links come up. In current multi-tasking multi-processor coupling, technology this is handled by the Set Buffer Sizes command and a single channel associated with each hardware link.
  • [0006]
    Furthermore, the ever increasing speed of links, together with the greater distances raises the desire to keep the communications channel as busy as possible at all times. The buffer interface of a multi-tasking multi-processor environment is an exchange interface, which means that a single buffer must wait for round trip transport as well as processing time before the buffer may be used again. For this reason, there is a desire to add more buffers to each channel in order to keep the channel as busy as possible. Currently, there is no way to adjust the number of buffers assigned to a channel based upon the characteristics of the link.
  • BRIEF SUMMARY OF THE INVENTION
  • [0007]
    An exemplary embodiment includes a computer program product for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment, the computer program product including a tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method including establishing a management connection, confirming that end points of the management connection are connected to respective targets, sending a negotiate counts message, including a number and size of buffers associated with parameters of the management connection and receiving a response to the negotiate counts message, the response including at least one of rejection of the management connection and an acceptance of the management connection, including an agreed number and size of the buffers.
  • [0008]
    Another exemplary embodiment includes an apparatus for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment, the apparatus including a connection manager performing a method including establishing a management connection, confirming that end points of the management connection are connected to respective targets, sending a negotiate counts message, including a number and size of buffers associated with parameters of the management connection and receiving a response to the negotiate counts message, the response including at least one of rejection of the management connection and an acceptance of the management connection, including an agreed number and size of the buffers.
  • [0009]
    A further exemplary embodiment includes a method for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment, the method including establishing a management connection, confirming that end points of the management connection are connected to respective targets, sending a negotiate counts message, including a number and size of buffers associated with parameters of the management connection and receiving a response to the negotiate counts message, the response including at least one of rejection of the management connection and an acceptance of the management connection, including an agreed number and size of the buffers.
  • [0010]
    Other articles of manufacture, apparatuses, and/or methods according to embodiments will be or become apparent to one with skill in the art upon review of the following drawings and detailed description. It is intended that all such additional articles of manufacture, apparatuses, and/or methods be included within this description, be within the scope of the present invention, and be protected by the accompanying claims.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0011]
    The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
  • [0012]
    FIG. 1A illustrates an exemplary embodiment of a multi-tasking multi-processor Infiniband system;
  • [0013]
    FIG. 1B illustrates an example of a multi-tasking multi-processor environment;
  • [0014]
    FIG. 1C illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment;
  • [0015]
    FIG. 1D illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment;
  • [0016]
    FIG. 2 illustrates a flow chart of a method for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment in accordance with exemplary embodiments;
  • [0017]
    FIG. 3 illustrates an example of a message exchange in accordance with exemplary embodiments; and
  • [0018]
    FIG. 4 depicts one embodiment of an article of manufacture incorporating one or more aspects of the present invention.
  • [0019]
    The detailed description explains the preferred embodiments of the invention, together with advantages and features, by way of example with reference to the drawings.
  • DETAILED DESCRIPTION OF THE INVENTION
  • [0020]
    In accordance with an aspect of the present invention, the systems and methods described herein provide auto-discovery of the sizes and number of buffers that may be shared across a single communications channel. This exchange takes place across a management connection associated with the channel. In exemplary embodiments, the management connection is the first connection made across the channel. This connection confirms that the end points are properly connected to their intended targets. Once this confirmation is made, the ends negotiate the number of, and the size of the buffers that are to be connected for this channel. If there is a mismatch in the number of buffers, then the lesser number is used. If the buffer sizes do not match, then the smaller size is selected.
  • [0021]
    FIG. 1A illustrates an exemplary embodiment of a multi-tasking multi-processor Infiniband system 100. The system 100 can include an operating system 105 (e.g., IBM zOS) having a top layer including a relational database 101 a logging facility 102, a locking facility 103 and a cross system coupling facility (XCF). The operating system 105 can further include a multiple virtual storage (MVS) services layer 107 and a message facility layer 108. The system 100 can further include a coupling facility (CF) 110 having a CF structures layer 111, a link subsystem 112 and a message architecture extensions layer 113. In an exemplary embodiment, a transport layer 115 is disposed between and couples the operating system 105 and the CF 110. In an exemplary implementation, the transport layer 115 is supported by Infiniband. FIG. 1B illustrates an example of a multi-tasking multi-processor environment. The example shows three mainframes A, B, C connected into a two different Parallel Sysplex environments using the previous generation of coupling transports. zOS A, zOS B and zOS F are all tied together through a Coupling Facility (CF1). zOS C and zOS D are tied together through CF2. Meanwhile zOS E is a stand alone operating system. In this configuration separate channels are connected through separate adapters in the separate frames. It is appreciated that multiple internal channels 116, 117, 118 include separate external connections 120. FIG. 1C illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment. In this example, multiple internal channels 121, 122, 123 share the same physical connection. 125. FIG. 1D illustrates an example of a multi-tasking multi-processor environment 150 in accordance with an exemplary embodiment. The environment 150 can include one or more channels 155, each channel including command/response areas 156, data buffers 157, receive/send queues 158 and adapters 160 for mapping the channels 155 to ports 161 and ultimately communication links 162, as discussed further herein. The channels 155 can further include queue pairs 159 as discussed further herein. The system 150 can further include control code 165 having functions including but not limited to: rendezvous 166, auxiliary queue 167, channel 168, discovery 169 and subnet administrator 170.
  • [0022]
    FIG. 2 illustrates a flow chart of a method 200 for identifying sizes and number of buffers across a communication link in a multi-tasking multi-processor environment in accordance with exemplary embodiments. At block 210, the system 200 establishes a management connection between an active end and a passive end. At block 220, the system 200 confirms that end points of the management connection are connected to respective targets. At block 230, the active end sends a negotiate counts message, including a number and size of buffers associated with parameters of the management connection. At block 240, the active end receives a response to the negotiate counts message, the response including a rejection of the management connection or an acceptance of the management connection, including an agreed number and size of the buffers.
  • [0023]
    In an exemplary embodiment, upon establishing the management connection using the management queue pair denoted in FIG. 3 as Aux QP (or Auxiliary Queue Pair), the management connection completes initialization of its management control block (Auxiliary Queue Control Block or AQCB) and posts Work Queue Elements (WQEs) which will be available to receive packets from its partner. Once this is complete, the end point designated by the Infiniband connection manager as the active end sends a Negotiate Counts message, with the number and size of buffers that were specified in its configuration, to its partner. Upon receipt of the Negotiate Counts message, the passive end compares the information in the packet with those from its own configuration. FIG. 3 illustrates an example of a message exchange in accordance with exemplary embodiments. In an exemplary embodiment, upon receipt of the Negotiate Request packet, the passive end can choose to either accept or reject the connection. If it chooses to accept the connection, then it selects the smaller of the number of buffers and the size of buffers, sets up those parameters in its own structures, and respond to the active side with the agreed upon number and size of the buffers and prepares to start connecting the queue pairs associated with the buffers. If it decides not to accept the connection, then it requests the connection manager to drop the connection. When the active side receives the response message, it too can either accept or reject the parameters. If it rejects the connection, then the link is dropped. If it accepts the agreement, then it will ensure that the agreed upon parameters are stored. Assuming that all goes well through the negotiation, the active end will start creating and connecting the queue pairs associated with each of the buffers.
  • [0024]
    When the last of the buffer queue pairs has been connected, the active end will generate a Node Descriptor (ND) message containing data pertinent to the software layers that will be using the channel, and sends that message to the passive partner. Upon receipt of the Node Descriptor message, the passive end will save that data, notify the higher layer software (in this case the I/O Processor or IOP) of its arrival, and then generate its own Node Descriptor message and send it to the active end. Upon receiving the Node Descriptor, the active end will save the data and notify the higher layer software of its arrival. At this point the buffers of the channel are available for sending and receiving application data.
  • [0025]
    This same methodology could be used in a number of other communications environments where communications pathways are bundled, and there is an ability to use an out of band connection to set up and manage the communications channel.
  • [0026]
    Technical effects of exemplary embodiments include the ability to add more buffers to each channel in order to keep the channel as busy as possible. In addition the exemplary embodiments include the ability to adjust the number of buffers assigned to a channel based upon the characteristics of the link.
  • [0027]
    This approach significantly improves upon the limited capability contained in the support for the previous coupling technologies.
  • [0028]
    As described above, embodiments can be embodied in the form of computer-implemented processes and apparatuses for practicing those processes. In exemplary embodiments, the invention is embodied in computer program code executed by one or more network elements. Embodiments include a computer program product 400 as depicted in FIG. 4 on a computer usable medium 402 with computer program code logic 404 containing instructions embodied in tangible media as an article of manufacture. Exemplary articles of manufacture for computer usable medium 402 may include floppy diskettes, CD-ROMs, hard drives, universal serial bus (USB) flash drives, or any other computer-readable storage medium, wherein, when the computer program code logic 404 is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. Embodiments include computer program code logic 404, for example, whether stored in a storage medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the computer program code logic 404 is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. When implemented on a general-purpose microprocessor, the computer program code logic 404 segments configure the microprocessor to create specific logic circuits.
  • [0029]
    While the invention has been described with reference to exemplary embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims. Moreover, the use of the terms first, second, etc. do not denote any order or importance, but rather the terms first, second, etc. are used to distinguish one element from another. Furthermore, the use of the terms a, an, etc. do not denote a limitation of quantity, but rather denote the presence of at least one of the referenced item.
Citas de patentes
Patente citada Fecha de presentación Fecha de publicación Solicitante Título
US3643227 *15 Sep 196915 Feb 1972Fairchild Camera Instr CoJob flow and multiprocessor operation control system
US4993014 *30 May 198912 Feb 1991At&T Bell LaboratoriesDynamic shared facility system for private networks
US5170472 *28 Mar 19918 Dic 1992International Business Machines Corp.Dynamically changing a system i/o configuration definition
US5339413 *21 Ago 199216 Ago 1994International Business Machines CorporationData stream protocol for multimedia data streaming data processing system
US5343867 *12 Jul 19936 Sep 1994Florida Atlantic University Research Corp.Method and apparatus for detecting the onset and relative degree of atherosclerosis in humans
US5388266 *30 Mar 19927 Feb 1995International Business Machines CorporationManagement of data objects used intain state information for shared data at a local complex
US5524212 *27 Abr 19924 Jun 1996University Of WashingtonMultiprocessor system with write generate method for updating cache
US5764641 *8 Sep 19959 Jun 1998Cisco Systems, Inc.Early and integrated tail packet discard system
US5777987 *29 Dic 19957 Jul 1998Symbios, Inc.Method and apparatus for using multiple FIFOs to improve flow control and routing in a communications receiver
US6073181 *3 Jun 19976 Jun 2000International Business Machines CorporationMulti-buffer error detection for an open data-link interface LAN adapter
US6181677 *18 Feb 199830 Ene 2001Milgo Solutions, Inc.Method and apparatus for detection and protection against data loss in a fractional T1/E1 communications environment
US6185629 *8 Mar 19946 Feb 2001Texas Instruments IncorporatedData transfer controller employing differing memory interface protocols dependent upon external input at predetermined time
US6289386 *11 May 199811 Sep 2001Lsi Logic CorporationImplementation of a divide algorithm for buffer credit calculation in a high speed serial channel
US6363457 *8 Feb 199926 Mar 2002International Business Machines CorporationMethod and system for non-disruptive addition and deletion of logical devices
US6483804 *1 Mar 199919 Nov 2002Sun Microsystems, Inc.Method and apparatus for dynamic packet batching with a high performance network interface
US6507567 *9 Abr 199914 Ene 2003Telefonaktiebolaget Lm Ericsson (Publ)Efficient handling of connections in a mobile communications network
US6741552 *12 Feb 199825 May 2004Pmc Sierra Inertnational, Inc.Fault-tolerant, highly-scalable cell switching architecture
US6862609 *7 Mar 20021 Mar 2005Canopy Group, Inc.Redundant storage for multiple processors in a ring network
US6993032 *29 Jun 200031 Ene 2006Intel CorporationBuffer arrangements to support differential link distances at full bandwidth
US7093024 *27 Sep 200115 Ago 2006International Business Machines CorporationEnd node partitioning using virtualization
US7200704 *7 Abr 20053 Abr 2007International Business Machines CorporationVirtualization of an I/O adapter port using enablement and activation functions
US7283473 *10 Abr 200316 Oct 2007International Business Machines CorporationApparatus, system and method for providing multiple logical channel adapters within a single physical channel adapter in a system area network
US7290077 *7 Abr 200530 Oct 2007International Business Machines CorporationEvent queue structure and method
US7366813 *19 Jun 200729 Abr 2008International Business Machines CorporationEvent queue in a logical partition
US7444641 *17 Dic 199828 Oct 2008Agere Systems Inc.Context controller having context-specific event selection mechanism and processor employing the same
US7467402 *23 Ago 200516 Dic 2008Whitehat Security, Inc.Automated login session extender for use in security analysis systems
US7602774 *11 Jul 200513 Oct 2009Xsigo SystemsQuality of service for server applications
US7613183 *31 Oct 20003 Nov 2009Foundry Networks, Inc.System and method for router data aggregation and delivery
US20010014954 *23 Abr 200116 Ago 2001Purcell Brian T.System and method for fail-over data transport
US20010030943 *20 Jun 200118 Oct 2001International Business Machines CorporationSystem of controlling the flow of information between senders and receivers across links being used as channels
US20020091826 *30 Ago 200111 Jul 2002Guillaume ComeauMethod and apparatus for interprocessor communication and peripheral sharing
US20020107903 *1 Mar 20018 Ago 2002Richter Roger K.Methods and systems for the order serialization of information in a network processing environment
US20020194245 *5 Jun 200119 Dic 2002Simpson Shell S.Job ticket service
US20030005039 *29 Jun 20012 Ene 2003International Business Machines CorporationEnd node partitioning using local identifiers
US20030018828 *29 Jun 200123 Ene 2003International Business Machines CorporationInfiniband mixed semantic ethernet I/O path
US20030061379 *27 Sep 200127 Mar 2003International Business Machines CorporationEnd node partitioning using virtualization
US20040123068 *26 Feb 200324 Jun 2004Akiyoshi HashimotoComputer systems, disk systems, and method for controlling disk cache
US20040154007 *23 Ene 20045 Ago 2004Shinobu KoizumiRetargetable information processing system
US20040202189 *10 Abr 200314 Oct 2004International Business Machines CorporationApparatus, system and method for providing multiple logical channel adapters within a single physical channel adapter in a systen area network
US20040221070 *5 Mar 20044 Nov 2004Ortega William M.Interface for distributed processing of SCSI tasks
US20050018669 *25 Jul 200327 Ene 2005International Business Machines CorporationInfiniband subnet management queue pair emulation for multiple logical ports on a single physical port
US20050060374 *11 Sep 200317 Mar 2005International Business Machines CorporationMethods, systems, and media to enhance persistence of a message
US20050060445 *11 Sep 200317 Mar 2005International Business Machines CorporationMethod for implementing dynamic virtual lane buffer reconfiguration
US20050080933 *14 Oct 200314 Abr 2005International Business Machines CorporationMaster-slave adapter
US20050120237 *26 Abr 20042 Jun 2005Roux Peter T.Control of processes in a processing system
US20050144313 *20 Nov 200330 Jun 2005International Business Machines CorporationInfiniband multicast operation in an LPAR environment
US20060048214 *23 Ago 20052 Mar 2006Whitehat Security, Inc.Automated login session extender for use in security analysis systems
US20060176167 *25 Ene 200510 Ago 2006Laser Shield Systems, Inc.Apparatus, system, and method for alarm systems
US20060230185 *7 Abr 200512 Oct 2006Errickson Richard KSystem and method for providing multiple virtual host channel adapters using virtual switches
US20060230209 *7 Abr 200512 Oct 2006Gregg Thomas AEvent queue structure and method
US20060230219 *7 Abr 200512 Oct 2006Njoku Ugochukwu CVirtualization of an I/O adapter port using enablement and activation functions
US20070239963 *27 Nov 200611 Oct 2007Shenzhen Mindray Bio-Medical Electronics Co., Ltd.Multiprocessor system
US20070245050 *19 Jun 200718 Oct 2007International Business Machines CorporationEvent Queue in a Logical Partition
US20080028116 *13 Jul 200731 Ene 2008International Business Machines CorporationEvent Queue in a Logical Partition
US20080109891 *3 Nov 20068 May 2008Greenwald Michael BMethods and apparatus for delivering control messages during a malicious attack in one or more packet networks
US20080196041 *6 Mar 200814 Ago 2008International Business Machines CorporationEvent Queue in a Logical Partition
US20090019312 *21 Nov 200715 Ene 2009Bea Systems, Inc.System and Method for Providing an Instrumentation Service Using Dye Injection and Filtering in a SIP Application Server Environment
US20090094603 *19 Mar 20089 Abr 2009Vmware, Inc.In-Place Conversion of Virtual Machine State
US20090217238 *28 Mar 200827 Ago 2009International Business Machines CorporationIncorporating state machine controls into existing non-state machine environments
Citada por
Patente citante Fecha de presentación Fecha de publicación Solicitante Título
US8006122 *10 Ene 200723 Ago 2011International Business Machines CorporationMethods, systems, and computer products for detection of and policy directed resolution of signaling sympathy sickness in a multisystem cluster
US864545428 Dic 20104 Feb 2014Canon Kabushiki KaishaTask allocation multiple nodes in a distributed computing system
US20080168300 *10 Ene 200710 Jul 2008International Business Machines CorporationMethods, systems, and computer products for detection of and policy directed resolution of signaling sympathy sickness in a multisystem cluster
CN103414938A *1 Ago 201327 Nov 2013深圳Tcl新技术有限公司Method for controlling internal communication of digital television all-in-one machine and digital television all-in-one machine
Clasificaciones
Clasificación de EE.UU.709/230
Clasificación internacionalG06F15/16
Clasificación cooperativaG06F9/546, G06F2209/548
Clasificación europeaG06F9/54M
Eventos legales
FechaCódigoEventoDescripción
19 May 2008ASAssignment
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ERRICKSON, RICHARD K.;HELMER, LEONARD W., JR.;HOUSTON, JOHN S.;AND OTHERS;REEL/FRAME:020967/0485
Effective date: 20080422