Sciweavers

    SPAA
    1995
    ACM
    136views Distributed And Parallel Com...» more  SPAA 1995»
    A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks
    13 years 8 months ago
    A Universal Proof Technique for Deadlock-Free Routing in Interconnection Networks
    Download  www.cs.wayne.edu
    Loren Schwiebert, D. N. Jayasimha
    claim paper
    Read More »
    SPAA
    1995
    ACM
    90views Distributed And Parallel Com...» more  SPAA 1995»
    Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations
    13 years 8 months ago
    Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations
    Download  www.cs.huji.ac.il
    Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Marcel...
    claim paper
    Read More »
    SPAA
    1995
    ACM
    142views Distributed And Parallel Com...» more  SPAA 1995»
    Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
    13 years 8 months ago
    Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
    Download  theory.stanford.edu
    For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...
    Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias,...
    claim paper
    Read More »
    SPAA
    1995
    ACM
    109views Distributed And Parallel Com...» more  SPAA 1995»
    Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
    13 years 8 months ago
    Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
    Download  www.cs.cmu.edu
    Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
    Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
    claim paper
    Read More »
    SPAA
    1995
    ACM
    111views Distributed And Parallel Com...» more  SPAA 1995»
    Parallel Sorting with Limited Bandwidth
    13 years 8 months ago
    Parallel Sorting with Limited Bandwidth
    Download  www.ee.unlv.edu
    We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
    Micah Adler, John W. Byers, Richard M. Karp
    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.