A provably tight delay-driven concurrently congestion mitigating global routing algorithm (Q299423): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2014.11.062 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: TimberWolf / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MaizeRouter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2014.11.062 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966579699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerant routing algorithm based on the artificial potential field model in network-on-chip / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provably tight delay-driven concurrently congestion mitigating global routing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum concurrent flow problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2014.11.062 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 9 December 2024

scientific article
Language Label Description Also known as
English
A provably tight delay-driven concurrently congestion mitigating global routing algorithm
scientific article

    Statements

    A provably tight delay-driven concurrently congestion mitigating global routing algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    Steiner tree
    0 references
    elmore delay
    0 references
    global routing
    0 references
    gradient method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references