Sciweavers

    SPAA
    2009
    ACM
    109views Distributed And Parallel Com...» more  SPAA 2009»
    Field-split parallel architecture for high performance multi-match packet classification using FPGAs
    13 years 9 months ago
    Field-split parallel architecture for high performance multi-match packet classification using FPGAs
    Download  halcyon.usc.edu
    Weirong Jiang, Viktor K. Prasanna
    claim paper
    Read More »
    SPAA
    2009
    ACM
    170views Distributed And Parallel Com...» more  SPAA 2009»
    Brief announcement: a lower bound for depth-restricted work stealing
    13 years 9 months ago
    Brief announcement: a lower bound for depth-restricted work stealing
    Download  people.csail.mit.edu
    Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
    Jim Sukha
    claim paper
    Read More »
    SPAA
    2009
    ACM
    155views Distributed And Parallel Com...» more  SPAA 2009»
    The bell is ringing in speed-scaled multiprocessor scheduling
    13 years 11 months ago
    The bell is ringing in speed-scaled multiprocessor scheduling
    Download  www.nonner.de
    Gero Greiner, Tim Nonner, Alexander Souza
    claim paper
    Read More »
    SPAA
    2009
    ACM
    141views Distributed And Parallel Com...» more  SPAA 2009»
    Distributed algorithms for QoS load balancing
    13 years 11 months ago
    Distributed algorithms for QoS load balancing
    Download  www-i1.informatik.rwth-aachen.de
    We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
    Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
    claim paper
    Read More »
    SPAA
    2009
    ACM
    160views Distributed And Parallel Com...» more  SPAA 2009»
    Weak graph colorings: distributed algorithms and applications
    13 years 11 months ago
    Weak graph colorings: distributed algorithms and applications
    Download  people.csail.mit.edu
    We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
    Fabian Kuhn
    claim paper
    Read More »
    SPAA
    2009
    ACM
    106views Distributed And Parallel Com...» more  SPAA 2009»
    Scheduling to minimize staleness and stretch in real-time data warehouses
    13 years 11 months ago
    Scheduling to minimize staleness and stretch in real-time data warehouses
    Download  www-math.mit.edu
    MohammadHossein Bateni, Lukasz Golab, Mohammad Tag...
    claim paper
    Read More »
    SPAA
    2009
    ACM
    159views Distributed And Parallel Com...» more  SPAA 2009»
    Locally scalable randomized consensus for synchronous crash failures
    13 years 11 months ago
    Locally scalable randomized consensus for synchronous crash failures
    Download  carbon.ucdenver.edu
    We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
    Bogdan S. Chlebus, Dariusz R. Kowalski
    claim paper
    Read More »
    SPAA
    2009
    ACM
    156views Distributed And Parallel Com...» more  SPAA 2009»
    Brief announcement: low depth cache-oblivious sorting
    14 years 2 months ago
    Brief announcement: low depth cache-oblivious sorting
    Download  www.cs.cmu.edu
    Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
    Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardha...
    claim paper
    Read More »
    SPAA
    2009
    ACM
    138views Distributed And Parallel Com...» more  SPAA 2009»
    On the complexity of the regenerator placement problem in optical networks
    14 years 2 months ago
    On the complexity of the regenerator placement problem in optical networks
    Download  www-sop.inria.fr
    Michele Flammini, Alberto Marchetti-Spaccamela, Gi...
    claim paper
    Read More »
    SPAA
    2009
    ACM
    117views Distributed And Parallel Com...» more  SPAA 2009»
    Optimizing transactions for captured memory
    14 years 2 months ago
    Optimizing transactions for captured memory
    Download  infoscience.epfl.ch
    In this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is...
    Aleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabat...
    claim paper
    Read More »
    1234next ›last »
    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.