Error recovery to enable error-free message transfer between nodes of a computer network

Title: Error recovery to enable error-free message transfer between nodes of a computer network

Full Record
Other Related Research

Abstract

An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

Inventors:: Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd; Steinmacher-Burow, Burkhard; Vranas, Pavlos M.

Issue Date:: 2016-01-26

Research Org.:: International Business Machines Corp., Armonk, NY (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1236465

Patent Number(s):: 9,244,759

Application Number:: 14/148,348

Assignee:: International Business Machines Corporation

DOE Contract Number:: B517552

Resource Type:: Patent

Resource Relation:: Patent File Date: 2014 Jan 06

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING; 99 GENERAL AND MISCELLANEOUS

Citation Formats


                    Blumrich, Matthias A., Coteus, Paul W., Chen, Dong, Gara, Alan, Giampapa, Mark E., Heidelberger, Philip, Hoenicke, Dirk, Takken, Todd, Steinmacher-Burow, Burkhard, and Vranas, Pavlos M. Error recovery to enable error-free message transfer between nodes of a computer network.  United States: N. p., 2016. 
        Web.

Copy to clipboard


                    Blumrich, Matthias A., Coteus, Paul W., Chen, Dong, Gara, Alan, Giampapa, Mark E., Heidelberger, Philip, Hoenicke, Dirk, Takken, Todd, Steinmacher-Burow, Burkhard, & Vranas, Pavlos M. Error recovery to enable error-free message transfer between nodes of a computer network.  United States.

Copy to clipboard


                    Blumrich, Matthias A., Coteus, Paul W., Chen, Dong, Gara, Alan, Giampapa, Mark E., Heidelberger, Philip, Hoenicke, Dirk, Takken, Todd, Steinmacher-Burow, Burkhard, and Vranas, Pavlos M. Tue .  
        "Error recovery to enable error-free message transfer between nodes of a computer network".  United States.  https://www.osti.gov/servlets/purl/1236465.

Copy to clipboard


                    
@article{osti_1236465,

  title        = {Error recovery to enable error-free message transfer between nodes of a computer network},

  author       = {Blumrich, Matthias A. and Coteus, Paul W. and Chen, Dong and Gara, Alan and Giampapa, Mark E. and Heidelberger, Philip and Hoenicke, Dirk and Takken, Todd and Steinmacher-Burow, Burkhard and Vranas, Pavlos M.},

  abstractNote = {An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2016},

  month        = {1}

}

Copy to clipboard

Patent:

View Patent

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE Patents and OSTI.GOV collections:

Signaling completion of a message transfer from an origin compute node to a target compute node

Patent Blocksome, Michael A [Rochester, MN]

Signaling completion of a message transfer from an origin node to a target node includes: sending, by an origin DMA engine, an RTS message, the RTS message specifying an application message for transfer to the target node from the origin node; receiving, by the origin DMA engine, a remote get message containing a data descriptor for the message and a completion notification descriptor, the completion notification descriptor specifying a local memory FIFO data transfer operation for transferring data locally on the origin node; inserting, by the origin DMA engine in an injection FIFO buffer, the data descriptor followed by themore »« less
Full Text Available
Signaling completion of a message transfer from an origin compute node to a target compute node

Patent Blocksome, Michael A [Rochester, MN]; Parker, Jeffrey J [Rochester, MN]

Signaling completion of a message transfer from an origin node to a target node includes: sending, by an origin DMA engine, an RTS message, the RTS message specifying an application message for transfer to the target node from the origin node; receiving, by the origin DMA engine, a remote get message containing a data descriptor for the message and a completion notification descriptor, the completion notification descriptor specifying a local direct put transfer operation for transferring data locally on the origin node; inserting, by the origin DMA engine in an injection FIFO buffer, the data descriptor followed by the completionmore »« less
Full Text Available
Message communications of particular message types between compute nodes using DMA shadow buffers

Patent Blocksome, Michael A [Rochester, MN]; Parker, Jeffrey J [Rochester, MN]

Message communications of particular message types between compute nodes using DMA shadow buffers includes: receiving a buffer identifier specifying an application buffer having a message of a particular type for transmission to a target compute node through a network; selecting one of a plurality of shadow buffers for a DMA engine on the compute node for storing the message, each shadow buffer corresponding to a slot of an injection FIFO buffer maintained by the DMA engine; storing the message in the selected shadow buffer; creating a data descriptor for the message stored in the selected shadow buffer; injecting the datamore »« less
Full Text Available
Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node

Patent Archer, Charles J [Rochester, MN]; Hardwick, Camesha R [Fayetteville, NC]; McCarthy, Patrick J [Rochester, MN]; ...

Methods, parallel computers, and products are provided for identifying messaging completion on a parallel computer. The parallel computer includes a plurality of compute nodes, the compute nodes coupled for data communications by at least two independent data communications networks including a binary tree data communications network optimal for collective operations that organizes the nodes as a tree and a torus data communications network optimal for point to point operations that organizes the nodes as a torus. Embodiments include reading all counters at each node of the torus data communications network; calculating at each node a current node value in dependencemore »« less
Full Text Available
Fencing network direct memory access data transfers in a parallel active messaging interface of a parallel computer

Patent Blocksome, Michael A.; Mamidala, Amith R.

Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to a deterministic data communications network through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and the deterministic datamore »« less
Full Text Available

Similar Records