http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-10719376-B2
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_4008e4a2500d9673afd2464a1915a70b |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F15-17318 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F9-542 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F15-17375 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F9-3867 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F15-173 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-54 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-46 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F3-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-44 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-38 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F13-00 |
| filingDate | 2018-08-24-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate | 2020-07-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_e4e98092602ffb97f07cd84d048d60e2 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_c4927033220460cb86d3925949c2bc14 |
| publicationDate | 2020-07-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | US-10719376-B2 |
| titleOfInvention | Methods and apparatus for multiplexing data flows via a single data structure |
| abstract | Methods and apparatus for transacting multiple data flows between multiple processors. In one such implementation, multiple data pipes are aggregated over a common transfer data structure. Completion status information corresponding to each data pipe is provided over individual completion data structures. Allocating a common fixed pool of resources for data transfer can be used in a variety of different load balancing and/or prioritization schemes; however, individualized completion status allows for individualized data pipe reclamation. Unlike prior art solutions which dynamically created and pre-allocated memory space for each data pipe individually, the disclosed embodiments can only request resources from a fixed pool. In other words, outstanding requests are queued (rather than immediately serviced with a new memory allocation), thus overall bandwidth remains constrained regardless of the number of data pipes that are opened and/or closed. |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11757796-B2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-11347567-B2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-2023099304-A1 |
| priorityDate | 2018-08-24-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: 69.