Sciweavers

    2544 search results - page 5 / 509
    » Process pipeline scheduling
    Sort
    View
    ISCA
    2005
    IEEE
    166views Hardware» more  ISCA 2005»
    Increased Scalability and Power Efficiency by Using Multiple Speed Pipelines
    15 years 3 months ago
    Increased Scalability and Power Efficiency by Using Multiple Speed Pipelines
    Download  www.ece.cmu.edu
    One of the most important problems faced by microarchitecture designers is the poor scalability of some of the current solutions with increased clock frequencies and wider pipelin...
    Emil Talpes, Diana Marculescu
    claim paper
    Read More »
    JEC
    2006
    61views more  JEC 2006»
    Time-constrained loop scheduling with minimal resources
    14 years 9 months ago
    Time-constrained loop scheduling with minimal resources
    Download  www.utdallas.edu
    Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
    Timothy W. O'Neil, Edwin Hsing-Mean Sha
    claim paper
    Read More »
    IJPP
    2000
    80views more  IJPP 2000»
    Enhanced Co-Scheduling: A Software Pipelining Method Using Modulo-Scheduled Pipeline Theory
    14 years 9 months ago
    Enhanced Co-Scheduling: A Software Pipelining Method Using Modulo-Scheduled Pipeline Theory
    Download  www.serc.iisc.ernet.in
    Ramaswamy Govindarajan, N. S. S. Narasimha Rao, Er...
    claim paper
    Read More »
    BMCBI
    2008
    122views more  BMCBI 2008»
    High-throughput bioinformatics with the Cyrille2 pipeline system
    14 years 9 months ago
    High-throughput bioinformatics with the Cyrille2 pipeline system
    Download  www.biomedcentral.com
    Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
    Mark W. E. J. Fiers, Ate van der Burgt, Erwin Date...
    claim paper
    Read More »
    GLVLSI
    2002
    IEEE
    109views VLSI» more  GLVLSI 2002»
    Minimizing resources in a repeating schedule for a split-node data-flow graph
    15 years 2 months ago
    Minimizing resources in a repeating schedule for a split-node data-flow graph
    Download  www.utdallas.edu
    Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
    Timothy W. O'Neil, Edwin Hsing-Mean Sha
    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-2025, USA.