Sciweavers

    CAL
    2008
    97views Software Engineering» more  CAL 2008»
    Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
    14 years 12 days ago
    Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
    Download  cwc.ucsd.edu
    Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
    Rohit Sunkam Ramanujam, Bill Lin
    claim paper
    Read More »
    ISCA
    2005
    IEEE
    101views Hardware» more  ISCA 2005»
    Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
    14 years 5 months ago
    Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
    Download  pages.cs.wisc.edu
    Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
    Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
    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.