http://rdf.ncbi.nlm.nih.gov/pubchem/patent/KR-102223441-B1
Outgoing Links
Predicate | Object |
---|---|
classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F2205-067 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F2213-0026 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F2213-36 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F15-7807 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F2213-2806 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F15-167 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-4221 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F5-065 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-3625 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-1673 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-372 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-28 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-128 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-4282 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F13-4265 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-42 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-362 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-28 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-12 |
filingDate | 2015-06-05-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2021-03-04-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationDate | 2021-03-04-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | KR-102223441-B1 |
titleOfInvention | Optimized credit return mechanism for packet sends |
abstract | A method and apparatus are disclosed for implementing an optimized credit return mechanism for packet transmission. Programmed input/output (PIO) transmit memory is partitioned into a plurality of transmit contexts each comprising a memory buffer comprising a plurality of transmit blocks configured to store packet data. The storage scheme using FIFO semantics is implemented with each transmission block associated with each FIFO slot. In response to receiving the packet data written to the transmit block and detecting data in them, the transmit block is egressed from the transmit context, the corresponding freed FIFO slot is detected, and the lowest slot for which no credit return indicator is returned is Is determined. The highest slot in the sequence of slots made free from the lowest slot is then determined, and the corresponding credit return indicator is returned. In one embodiment, an absolute credit return count is implemented for each transmission context, the associated absolute credit transmission count is tracked through software writing to the PIO transmission memory, and two absolute credit counts are used for flow control. . |
priorityDate | 2014-06-26-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 50.