Deadlock prevention by acyclic orientations (Q1399106): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Efficient deadlock-free routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Requirements for deadlock-free, adaptive packet routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock-Free Message Routing in Multiprocessor Interconnection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to emulate shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00232-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087462236 / rank
 
Normal rank

Latest revision as of 09:27, 30 July 2024

scientific article
Language Label Description Also known as
English
Deadlock prevention by acyclic orientations
scientific article

    Statements

    Deadlock prevention by acyclic orientations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 July 2003
    0 references
    0 references
    computational and structural complexity
    0 references
    parallel algorithms
    0 references
    routing and communication in interconnection networks
    0 references
    0 references