Sciweavers

    2 search results - page 1 / 1
    » Deadlock-Free Oblivious Wormhole Routing with Cyclic Depende...
    Sort
    View
    SPAA
    1997
    ACM
    130views Distributed And Parallel Com...» more  SPAA 1997»
    Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
    13 years 8 months ago
    Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
    Download  www.cs.wayne.edu
    Loren Schwiebert
    claim paper
    Read More »
    IPPS
    1996
    IEEE
    96views Distributed And Parallel Com...» more  IPPS 1996»
    Generic Methodologies for Deadlock-Free Routing
    13 years 8 months ago
    Generic Methodologies for Deadlock-Free Routing
    Download  ipdps.cc.gatech.edu
    This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
    Hyunmin Park, Dharma P. Agrawal
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.