US20090216893A1 - Buffer discovery in a parrallel multi-tasking multi-processor environment - Google Patents

Buffer discovery in a parrallel multi-tasking multi-processor environment Download PDF

Info

Publication number
US20090216893A1
US20090216893A1 US12/051,634 US5163408A US2009216893A1 US 20090216893 A1 US20090216893 A1 US 20090216893A1 US 5163408 A US5163408 A US 5163408A US 2009216893 A1 US2009216893 A1 US 2009216893A1
Authority
US
United States
Prior art keywords
buffers
connection
size
management connection
computer program
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US12/051,634
Inventor
Richard K. Errickson
Leonard W. Helmer, Jr.
John S. Houston
Ambrose A. Verdibello, Jr.
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US12/051,634 priority Critical patent/US20090216893A1/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ERRICKSON, RICHARD K., HELMER, LEONARD W., JR., HOUSTON, JOHN S., VERDIBELLO, AMBROSE A., JR.
Publication of US20090216893A1 publication Critical patent/US20090216893A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogram communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/54—Indexing scheme relating to G06F9/54
    • G06F2209/548—Queue

Definitions

  • the present disclosure relates generally to multi-tasking multi-processor environments, and in particular, to buffer discovery in a multi-tasking multi-processor environment.
  • 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.
  • 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.
  • 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.
  • 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.
  • FIG. 1A illustrates an exemplary embodiment of a multi-tasking multi-processor Infiniband system
  • FIG. 1B illustrates an example of a multi-tasking multi-processor environment
  • FIG. 1C illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment
  • FIG. 1D illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment
  • 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
  • FIG. 3 illustrates an example of a message exchange in accordance with exemplary embodiments.
  • FIG. 4 depicts one embodiment of an article of manufacture incorporating one or more aspects 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.
  • 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.
  • 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 .
  • CF coupling facility
  • 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 (CF 1 ).
  • zOS C and zOS D are tied together through CF 2 .
  • zOS E is a stand alone operating system. In this configuration separate channels are connected through separate adapters in the separate frames.
  • FIG. 1C illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment.
  • multiple internal channels 121 , 122 , 123 share the same physical connection.
  • 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 .
  • 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.
  • the system 200 establishes a management connection between an active end and a passive end.
  • the system 200 confirms that end points of the management connection are connected to respective targets.
  • the active end sends a negotiate counts message, including a number and size of buffers associated with parameters of the management connection.
  • 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.
  • the management connection 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.
  • AQCB Management Control Block
  • WQEs Work Queue Elements
  • 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.
  • the passive end Upon receipt of the Negotiate Counts message, the passive end compares the information in the packet with those from its own configuration.
  • the passive end upon receipt of the Negotiate Request packet, 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.
  • the active end 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.
  • ND Node Descriptor
  • the passive end 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.
  • 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.
  • 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.
  • exemplary embodiments include the ability to add more buffers to each channel in order to keep the channel as busy as possible.
  • exemplary embodiments include the ability to adjust the number of buffers assigned to a channel based upon the characteristics of the link.
  • Embodiments can be embodied in the form of computer-implemented processes and apparatuses for practicing those processes.
  • 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.
  • the computer program code logic 404 segments configure the microprocessor to create specific logic circuits.

Abstract

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.

Description

  • 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
  • 1. Field of Invention
  • The present disclosure relates generally to multi-tasking multi-processor environments, and in particular, to buffer discovery in a multi-tasking multi-processor environment.
  • 2. Description of Background
  • 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.
  • 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
  • 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.
  • 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.
  • 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.
  • 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
  • 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:
  • FIG. 1A illustrates an exemplary embodiment of a multi-tasking multi-processor Infiniband system;
  • FIG. 1B illustrates an example of a multi-tasking multi-processor environment;
  • FIG. 1C illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment;
  • FIG. 1D illustrates an example of a multi-tasking multi-processor environment in accordance with an exemplary embodiment;
  • 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;
  • FIG. 3 illustrates an example of a message exchange in accordance with exemplary embodiments; and
  • FIG. 4 depicts one embodiment of an article of manufacture incorporating one or more aspects of the present invention.
    •
  • 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
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • This approach significantly improves upon the limited capability contained in the support for the previous coupling technologies.
  • 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.
  • 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.

Claims (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
US12/051,634 2008-02-25 2008-03-19 Buffer discovery in a parrallel multi-tasking multi-processor environment Abandoned US20090216893A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/051,634 US20090216893A1 (en) 2008-02-25 2008-03-19 Buffer discovery in a parrallel multi-tasking multi-processor environment

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US3131508P 2008-02-25 2008-02-25
US12/051,634 US20090216893A1 (en) 2008-02-25 2008-03-19 Buffer discovery in a parrallel multi-tasking multi-processor environment

Publications (1)

Publication Number Publication Date
US20090216893A1 true US20090216893A1 (en) 2009-08-27

Family

ID=40999405

Family Applications (6)

Application Number Title Priority Date Filing Date
US12/051,631 Expired - Fee Related US7895462B2 (en) 2008-02-25 2008-03-19 Managing recovery and control of a communications link via out-of-band signaling
US12/051,628 Expired - Fee Related US8793699B2 (en) 2008-02-25 2008-03-19 Negating initiative for select entries from a shared, strictly FIFO initiative queue
US12/051,630 Expired - Fee Related US8432793B2 (en) 2008-02-25 2008-03-19 Managing recovery of a link via loss of link
US12/051,634 Abandoned US20090216893A1 (en) 2008-02-25 2008-03-19 Buffer discovery in a parrallel multi-tasking multi-processor environment
US12/058,034 Expired - Fee Related US8225280B2 (en) 2008-02-25 2008-03-28 Incorporating state machine controls into existing non-state machine environments
US12/058,054 Expired - Fee Related US8429662B2 (en) 2008-02-25 2008-03-28 Passing initiative in a multitasking multiprocessor environment

Family Applications Before (3)

Application Number Title Priority Date Filing Date
US12/051,631 Expired - Fee Related US7895462B2 (en) 2008-02-25 2008-03-19 Managing recovery and control of a communications link via out-of-band signaling
US12/051,628 Expired - Fee Related US8793699B2 (en) 2008-02-25 2008-03-19 Negating initiative for select entries from a shared, strictly FIFO initiative queue
US12/051,630 Expired - Fee Related US8432793B2 (en) 2008-02-25 2008-03-19 Managing recovery of a link via loss of link

Family Applications After (2)

Application Number Title Priority Date Filing Date
US12/058,034 Expired - Fee Related US8225280B2 (en) 2008-02-25 2008-03-28 Incorporating state machine controls into existing non-state machine environments
US12/058,054 Expired - Fee Related US8429662B2 (en) 2008-02-25 2008-03-28 Passing initiative in a multitasking multiprocessor environment

Country Status (1)

Country Link
US (6) US7895462B2 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080168300A1 (en) * 2007-01-10 2008-07-10 International Business Machines Corporation Methods, systems, and computer products for detection of and policy directed resolution of signaling sympathy sickness in a multisystem cluster
CN103414938A (en) * 2013-08-01 2013-11-27 深圳Tcl新技术有限公司 Method for controlling internal communication of digital television all-in-one machine and digital television all-in-one machine
US8645454B2 (en) 2010-12-28 2014-02-04 Canon Kabushiki Kaisha Task allocation multiple nodes in a distributed computing system
JP2014520321A (en) * 2011-06-10 2014-08-21 インターナショナル・ビジネス・マシーンズ・コーポレーション Management of operator message buffer for the combined facility
JP2020526968A (en) * 2017-07-12 2020-08-31 インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ Methods, computer systems, and computer programs performed by processors for remote node discovery and communication channel verification and communication channel connectivity.

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8762125B2 (en) * 2008-02-25 2014-06-24 International Business Machines Corporation Emulated multi-tasking multi-processor channels implementing standard network protocols
US7895462B2 (en) * 2008-02-25 2011-02-22 International Business Machines Corporation Managing recovery and control of a communications link via out-of-band signaling
CN101686158B (en) * 2008-09-22 2012-11-14 中兴通讯股份有限公司 Control method for Ethernet loop guard fault recovery and Ethernet loop node
US9219956B2 (en) 2008-12-23 2015-12-22 Keyssa, Inc. Contactless audio adapter, and methods
US9191263B2 (en) * 2008-12-23 2015-11-17 Keyssa, Inc. Contactless replacement for cabled standards-based interfaces
US9602648B2 (en) 2015-04-30 2017-03-21 Keyssa Systems, Inc. Adapter devices for enhancing the functionality of other devices
US10869172B2 (en) * 2015-09-18 2020-12-15 Telefonaktiebolaget Lm Ericsson (Publ) Management of communication between M2M device and M2M server with finite state transitions created by the M2M device
US10992515B1 (en) 2019-06-10 2021-04-27 Cisco Technology, Inc. Link state tracking for virtual interfaces

Citations (50)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3643227A (en) * 1969-09-15 1972-02-15 Fairchild Camera Instr Co Job flow and multiprocessor operation control system
US4993014A (en) * 1989-05-30 1991-02-12 At&T Bell Laboratories Dynamic shared facility system for private networks
US5170472A (en) * 1991-03-28 1992-12-08 International Business Machines Corp. Dynamically changing a system i/o configuration definition
US5339413A (en) * 1992-08-21 1994-08-16 International Business Machines Corporation Data stream protocol for multimedia data streaming data processing system
US5343867A (en) * 1991-06-12 1994-09-06 Florida Atlantic University Research Corp. Method and apparatus for detecting the onset and relative degree of atherosclerosis in humans
US5388266A (en) * 1992-03-30 1995-02-07 International Business Machines Corporation Management of data objects used intain state information for shared data at a local complex
US5524212A (en) * 1992-04-27 1996-06-04 University Of Washington Multiprocessor system with write generate method for updating cache
US5764641A (en) * 1995-09-08 1998-06-09 Cisco Systems, Inc. Early and integrated tail packet discard system
US5777987A (en) * 1995-12-29 1998-07-07 Symbios, Inc. Method and apparatus for using multiple FIFOs to improve flow control and routing in a communications receiver
US6073181A (en) * 1997-06-03 2000-06-06 International Business Machines Corporation Multi-buffer error detection for an open data-link interface LAN adapter
US6181677B1 (en) * 1998-02-18 2001-01-30 Milgo Solutions, Inc. Method and apparatus for detection and protection against data loss in a fractional T1/E1 communications environment
US6185629B1 (en) * 1994-03-08 2001-02-06 Texas Instruments Incorporated Data transfer controller employing differing memory interface protocols dependent upon external input at predetermined time
US20010014954A1 (en) * 1998-05-11 2001-08-16 Purcell Brian T. System and method for fail-over data transport
US6289386B1 (en) * 1998-05-11 2001-09-11 Lsi Logic Corporation Implementation of a divide algorithm for buffer credit calculation in a high speed serial channel
US20010030943A1 (en) * 1998-09-10 2001-10-18 International Business Machines Corporation System of controlling the flow of information between senders and receivers across links being used as channels
US6363457B1 (en) * 1999-02-08 2002-03-26 International Business Machines Corporation Method and system for non-disruptive addition and deletion of logical devices
US20020091826A1 (en) * 2000-10-13 2002-07-11 Guillaume Comeau Method and apparatus for interprocessor communication and peripheral sharing
US20020107903A1 (en) * 2000-11-07 2002-08-08 Richter Roger K. Methods and systems for the order serialization of information in a network processing environment
US6483804B1 (en) * 1999-03-01 2002-11-19 Sun Microsystems, Inc. Method and apparatus for dynamic packet batching with a high performance network interface
US20020194245A1 (en) * 2001-06-05 2002-12-19 Simpson Shell S. Job ticket service
US20030005039A1 (en) * 2001-06-29 2003-01-02 International Business Machines Corporation End node partitioning using local identifiers
US6507567B1 (en) * 1999-04-09 2003-01-14 Telefonaktiebolaget Lm Ericsson (Publ) Efficient handling of connections in a mobile communications network
US20030018828A1 (en) * 2001-06-29 2003-01-23 International Business Machines Corporation Infiniband mixed semantic ethernet I/O path
US20030061379A1 (en) * 2001-09-27 2003-03-27 International Business Machines Corporation End node partitioning using virtualization
US6741552B1 (en) * 1998-02-12 2004-05-25 Pmc Sierra Inertnational, Inc. Fault-tolerant, highly-scalable cell switching architecture
US20040123068A1 (en) * 2002-12-19 2004-06-24 Akiyoshi Hashimoto Computer systems, disk systems, and method for controlling disk cache
US20040154007A1 (en) * 1991-04-23 2004-08-05 Shinobu Koizumi Retargetable information processing system
US20040202189A1 (en) * 2003-04-10 2004-10-14 International Business Machines Corporation Apparatus, system and method for providing multiple logical channel adapters within a single physical channel adapter in a systen area network
US20040221070A1 (en) * 2003-03-07 2004-11-04 Ortega William M. Interface for distributed processing of SCSI tasks
US20050018669A1 (en) * 2003-07-25 2005-01-27 International Business Machines Corporation Infiniband subnet management queue pair emulation for multiple logical ports on a single physical port
US6862609B2 (en) * 2001-03-07 2005-03-01 Canopy Group, Inc. Redundant storage for multiple processors in a ring network
US20050060374A1 (en) * 2003-09-11 2005-03-17 International Business Machines Corporation Methods, systems, and media to enhance persistence of a message
US20050060445A1 (en) * 2003-09-11 2005-03-17 International Business Machines Corporation Method for implementing dynamic virtual lane buffer reconfiguration
US20050080933A1 (en) * 2003-10-14 2005-04-14 International Business Machines Corporation Master-slave adapter
US20050120237A1 (en) * 2001-10-26 2005-06-02 Roux Peter T. Control of processes in a processing system
US20050144313A1 (en) * 2003-11-20 2005-06-30 International Business Machines Corporation Infiniband multicast operation in an LPAR environment
US6993032B1 (en) * 2000-06-29 2006-01-31 Intel Corporation Buffer arrangements to support differential link distances at full bandwidth
US20060048214A1 (en) * 2004-08-24 2006-03-02 Whitehat Security, Inc. Automated login session extender for use in security analysis systems
US20060176167A1 (en) * 2005-01-25 2006-08-10 Laser Shield Systems, Inc. Apparatus, system, and method for alarm systems
US20060230185A1 (en) * 2005-04-07 2006-10-12 Errickson Richard K System and method for providing multiple virtual host channel adapters using virtual switches
US20060230219A1 (en) * 2005-04-07 2006-10-12 Njoku Ugochukwu C Virtualization of an I/O adapter port using enablement and activation functions
US20060230209A1 (en) * 2005-04-07 2006-10-12 Gregg Thomas A Event queue structure and method
US20070239963A1 (en) * 2006-03-29 2007-10-11 Shenzhen Mindray Bio-Medical Electronics Co., Ltd. Multiprocessor system
US20080109891A1 (en) * 2006-11-03 2008-05-08 Greenwald Michael B Methods and apparatus for delivering control messages during a malicious attack in one or more packet networks
US7444641B1 (en) * 1998-03-10 2008-10-28 Agere Systems Inc. Context controller having context-specific event selection mechanism and processor employing the same
US20090019312A1 (en) * 2007-07-11 2009-01-15 Bea Systems, Inc. System and Method for Providing an Instrumentation Service Using Dye Injection and Filtering in a SIP Application Server Environment
US20090094603A1 (en) * 2007-10-09 2009-04-09 Vmware, Inc. In-Place Conversion of Virtual Machine State
US20090217238A1 (en) * 2008-02-25 2009-08-27 International Business Machines Corporation Incorporating state machine controls into existing non-state machine environments
US7602774B1 (en) * 2005-07-11 2009-10-13 Xsigo Systems Quality of service for server applications
US7613183B1 (en) * 2000-10-31 2009-11-03 Foundry Networks, Inc. System and method for router data aggregation and delivery

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05128080A (en) * 1991-10-14 1993-05-25 Mitsubishi Electric Corp Information processor
US6018515A (en) * 1997-08-19 2000-01-25 Ericsson Messaging Systems Inc. Message buffering for prioritized message transmission and congestion management
US6715055B1 (en) * 2001-10-15 2004-03-30 Advanced Micro Devices, Inc. Apparatus and method for allocating buffer space

Patent Citations (59)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3643227A (en) * 1969-09-15 1972-02-15 Fairchild Camera Instr Co Job flow and multiprocessor operation control system
US4993014A (en) * 1989-05-30 1991-02-12 At&T Bell Laboratories Dynamic shared facility system for private networks
US5170472A (en) * 1991-03-28 1992-12-08 International Business Machines Corp. Dynamically changing a system i/o configuration definition
US20040154007A1 (en) * 1991-04-23 2004-08-05 Shinobu Koizumi Retargetable information processing system
US5343867A (en) * 1991-06-12 1994-09-06 Florida Atlantic University Research Corp. Method and apparatus for detecting the onset and relative degree of atherosclerosis in humans
US5388266A (en) * 1992-03-30 1995-02-07 International Business Machines Corporation Management of data objects used intain state information for shared data at a local complex
US5524212A (en) * 1992-04-27 1996-06-04 University Of Washington Multiprocessor system with write generate method for updating cache
US5339413A (en) * 1992-08-21 1994-08-16 International Business Machines Corporation Data stream protocol for multimedia data streaming data processing system
US6185629B1 (en) * 1994-03-08 2001-02-06 Texas Instruments Incorporated Data transfer controller employing differing memory interface protocols dependent upon external input at predetermined time
US5764641A (en) * 1995-09-08 1998-06-09 Cisco Systems, Inc. Early and integrated tail packet discard system
US5777987A (en) * 1995-12-29 1998-07-07 Symbios, Inc. Method and apparatus for using multiple FIFOs to improve flow control and routing in a communications receiver
US6073181A (en) * 1997-06-03 2000-06-06 International Business Machines Corporation Multi-buffer error detection for an open data-link interface LAN adapter
US6741552B1 (en) * 1998-02-12 2004-05-25 Pmc Sierra Inertnational, Inc. Fault-tolerant, highly-scalable cell switching architecture
US6181677B1 (en) * 1998-02-18 2001-01-30 Milgo Solutions, Inc. Method and apparatus for detection and protection against data loss in a fractional T1/E1 communications environment
US7444641B1 (en) * 1998-03-10 2008-10-28 Agere Systems Inc. Context controller having context-specific event selection mechanism and processor employing the same
US6289386B1 (en) * 1998-05-11 2001-09-11 Lsi Logic Corporation Implementation of a divide algorithm for buffer credit calculation in a high speed serial channel
US20010014954A1 (en) * 1998-05-11 2001-08-16 Purcell Brian T. System and method for fail-over data transport
US20010030943A1 (en) * 1998-09-10 2001-10-18 International Business Machines Corporation System of controlling the flow of information between senders and receivers across links being used as channels
US6363457B1 (en) * 1999-02-08 2002-03-26 International Business Machines Corporation Method and system for non-disruptive addition and deletion of logical devices
US6483804B1 (en) * 1999-03-01 2002-11-19 Sun Microsystems, Inc. Method and apparatus for dynamic packet batching with a high performance network interface
US6507567B1 (en) * 1999-04-09 2003-01-14 Telefonaktiebolaget Lm Ericsson (Publ) Efficient handling of connections in a mobile communications network
US6993032B1 (en) * 2000-06-29 2006-01-31 Intel Corporation Buffer arrangements to support differential link distances at full bandwidth
US20020091826A1 (en) * 2000-10-13 2002-07-11 Guillaume Comeau Method and apparatus for interprocessor communication and peripheral sharing
US7613183B1 (en) * 2000-10-31 2009-11-03 Foundry Networks, Inc. System and method for router data aggregation and delivery
US20020107903A1 (en) * 2000-11-07 2002-08-08 Richter Roger K. Methods and systems for the order serialization of information in a network processing environment
US6862609B2 (en) * 2001-03-07 2005-03-01 Canopy Group, Inc. Redundant storage for multiple processors in a ring network
US20020194245A1 (en) * 2001-06-05 2002-12-19 Simpson Shell S. Job ticket service
US20030018828A1 (en) * 2001-06-29 2003-01-23 International Business Machines Corporation Infiniband mixed semantic ethernet I/O path
US20030005039A1 (en) * 2001-06-29 2003-01-02 International Business Machines Corporation End node partitioning using local identifiers
US20030061379A1 (en) * 2001-09-27 2003-03-27 International Business Machines Corporation End node partitioning using virtualization
US7093024B2 (en) * 2001-09-27 2006-08-15 International Business Machines Corporation End node partitioning using virtualization
US20050120237A1 (en) * 2001-10-26 2005-06-02 Roux Peter T. Control of processes in a processing system
US20040123068A1 (en) * 2002-12-19 2004-06-24 Akiyoshi Hashimoto Computer systems, disk systems, and method for controlling disk cache
US20040221070A1 (en) * 2003-03-07 2004-11-04 Ortega William M. Interface for distributed processing of SCSI tasks
US20040202189A1 (en) * 2003-04-10 2004-10-14 International Business Machines Corporation Apparatus, system and method for providing multiple logical channel adapters within a single physical channel adapter in a systen area network
US7283473B2 (en) * 2003-04-10 2007-10-16 International Business Machines Corporation Apparatus, system and method for providing multiple logical channel adapters within a single physical channel adapter in a system area network
US20050018669A1 (en) * 2003-07-25 2005-01-27 International Business Machines Corporation Infiniband subnet management queue pair emulation for multiple logical ports on a single physical port
US20050060445A1 (en) * 2003-09-11 2005-03-17 International Business Machines Corporation Method for implementing dynamic virtual lane buffer reconfiguration
US20050060374A1 (en) * 2003-09-11 2005-03-17 International Business Machines Corporation Methods, systems, and media to enhance persistence of a message
US20050080933A1 (en) * 2003-10-14 2005-04-14 International Business Machines Corporation Master-slave adapter
US20050144313A1 (en) * 2003-11-20 2005-06-30 International Business Machines Corporation Infiniband multicast operation in an LPAR environment
US20060048214A1 (en) * 2004-08-24 2006-03-02 Whitehat Security, Inc. Automated login session extender for use in security analysis systems
US7467402B2 (en) * 2004-08-24 2008-12-16 Whitehat Security, Inc. Automated login session extender for use in security analysis systems
US20060176167A1 (en) * 2005-01-25 2006-08-10 Laser Shield Systems, Inc. Apparatus, system, and method for alarm systems
US20060230219A1 (en) * 2005-04-07 2006-10-12 Njoku Ugochukwu C Virtualization of an I/O adapter port using enablement and activation functions
US20080196041A1 (en) * 2005-04-07 2008-08-14 International Business Machines Corporation Event Queue in a Logical Partition
US20070245050A1 (en) * 2005-04-07 2007-10-18 International Business Machines Corporation Event Queue in a Logical Partition
US7290077B2 (en) * 2005-04-07 2007-10-30 International Business Machines Corporation Event queue structure and method
US20080028116A1 (en) * 2005-04-07 2008-01-31 International Business Machines Corporation Event Queue in a Logical Partition
US7366813B2 (en) * 2005-04-07 2008-04-29 International Business Machines Corporation Event queue in a logical partition
US20060230185A1 (en) * 2005-04-07 2006-10-12 Errickson Richard K System and method for providing multiple virtual host channel adapters using virtual switches
US20060230209A1 (en) * 2005-04-07 2006-10-12 Gregg Thomas A Event queue structure and method
US7200704B2 (en) * 2005-04-07 2007-04-03 International Business Machines Corporation Virtualization of an I/O adapter port using enablement and activation functions
US7602774B1 (en) * 2005-07-11 2009-10-13 Xsigo Systems Quality of service for server applications
US20070239963A1 (en) * 2006-03-29 2007-10-11 Shenzhen Mindray Bio-Medical Electronics Co., Ltd. Multiprocessor system
US20080109891A1 (en) * 2006-11-03 2008-05-08 Greenwald Michael B Methods and apparatus for delivering control messages during a malicious attack in one or more packet networks
US20090019312A1 (en) * 2007-07-11 2009-01-15 Bea Systems, Inc. System and Method for Providing an Instrumentation Service Using Dye Injection and Filtering in a SIP Application Server Environment
US20090094603A1 (en) * 2007-10-09 2009-04-09 Vmware, Inc. In-Place Conversion of Virtual Machine State
US20090217238A1 (en) * 2008-02-25 2009-08-27 International Business Machines Corporation Incorporating state machine controls into existing non-state machine environments

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080168300A1 (en) * 2007-01-10 2008-07-10 International Business Machines Corporation Methods, systems, and computer products for detection of and policy directed resolution of signaling sympathy sickness in a multisystem cluster
US8006122B2 (en) * 2007-01-10 2011-08-23 International Business Machines Corporation Methods, systems, and computer products for detection of and policy directed resolution of signaling sympathy sickness in a multisystem cluster
US8645454B2 (en) 2010-12-28 2014-02-04 Canon Kabushiki Kaisha Task allocation multiple nodes in a distributed computing system
JP2014520321A (en) * 2011-06-10 2014-08-21 インターナショナル・ビジネス・マシーンズ・コーポレーション Management of operator message buffer for the combined facility
CN103414938A (en) * 2013-08-01 2013-11-27 深圳Tcl新技术有限公司 Method for controlling internal communication of digital television all-in-one machine and digital television all-in-one machine
JP2020526968A (en) * 2017-07-12 2020-08-31 インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ Methods, computer systems, and computer programs performed by processors for remote node discovery and communication channel verification and communication channel connectivity.
JP7098711B2 (en) 2017-07-12 2022-07-11 インターナショナル・ビジネス・マシーンズ・コーポレーション Methods, computer systems, and computer programs performed by processors for remote node discovery, as well as communication channel confirmation and communication channel connectivity.

Also Published As

Publication number Publication date
US20090217270A1 (en) 2009-08-27
US8793699B2 (en) 2014-07-29
US20090216923A1 (en) 2009-08-27
US8225280B2 (en) 2012-07-17
US7895462B2 (en) 2011-02-22
US20090217238A1 (en) 2009-08-27
US20090216927A1 (en) 2009-08-27
US8432793B2 (en) 2013-04-30
US8429662B2 (en) 2013-04-23
US20090217284A1 (en) 2009-08-27

Similar Documents

Publication Publication Date Title
US20090216893A1 (en) Buffer discovery in a parrallel multi-tasking multi-processor environment
CN103636181B (en) By the transmission operation of the arbitrary size that Remote Direct Memory accesses
US6195682B1 (en) Concurrent server and method of operation having client-server affinity using exchanged client and server keys
US8762125B2 (en) Emulated multi-tasking multi-processor channels implementing standard network protocols
US6912604B1 (en) Host channel adapter having partitioned link layer services for an infiniband server system
EP1399849B1 (en) Arrangement for creating multiple virtual queue pairs from a compressed queue pair based on shared attributes
US7076545B2 (en) Load balancing the servicing of received packets
CN104320350B (en) Method and system for providing fiduciary flow control
US9596186B2 (en) Multiple processes sharing a single infiniband connection
US20090238072A1 (en) Method and system for load balancing using queued packet information
US8539089B2 (en) System and method for vertical perimeter protection
US8065279B2 (en) Performance neutral heartbeat for a multi-tasking multi-processor environment
CN113014528B (en) Message processing method, processing unit and virtual private network server
Bogatyrev et al. Multipath Redundant Transmission with Packet Segmentation
CN109684269A (en) A kind of PCIE exchange chip kernel and working method
US20230359577A1 (en) Spatial distribution in a 3d data processing unit
US10572400B2 (en) Shared processing of a packet flow by multiple cores
US7428239B1 (en) Apparatus and method for priority queuing with segmented buffers
US7209489B1 (en) Arrangement in a channel adapter for servicing work notifications based on link layer virtual lane processing
US7591011B1 (en) Assigning higher priority to transactions based on subscription level
US20090132582A1 (en) Processor-server hybrid system for processing data
TWI323845B (en) Application and verb resource management
US7782870B1 (en) Method and apparatus for consolidating available computing resources on different computing devices
US6904545B1 (en) Fault tolerant computing node having multiple host channel adapters
CN115865334A (en) Quantum key distribution method and device and electronic equipment

Legal Events

Date Code Title Description
AS Assignment

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

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION