Sciweavers

    OPODIS
    2008
    75views Distributed And Parallel Com...» more  OPODIS 2008»
    Distributed Approximation of Cellular Coverage
    13 years 6 months ago
    Distributed Approximation of Cellular Coverage
    Download  www.bgu.ac.il
    Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
    Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub
    claim paper
    Read More »
    OPODIS
    2008
    99views Distributed And Parallel Com...» more  OPODIS 2008»
    Computing and Updating the Process Number in Trees
    13 years 6 months ago
    Computing and Updating the Process Number in Trees
    Download  www-sop.inria.fr
    The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
    David Coudert, Florian Huc, Dorian Mazauric
    claim paper
    Read More »
    OPODIS
    2008
    89views Distributed And Parallel Com...» more  OPODIS 2008»
    Write Markers for Probabilistic Quorum Systems
    13 years 6 months ago
    Write Markers for Probabilistic Quorum Systems
    Download  reports-archive.adm.cs.cmu.edu
    Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probabi...
    Michael G. Merideth, Michael K. Reiter
    claim paper
    Read More »
    OPODIS
    2008
    95views Distributed And Parallel Com...» more  OPODIS 2008»
    Solving Atomic Multicast When Groups Crash
    13 years 6 months ago
    Solving Atomic Multicast When Groups Crash
    Download  doc.rero.ch
    In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
    Nicolas Schiper, Fernando Pedone
    claim paper
    Read More »
    OPODIS
    2008
    166views Distributed And Parallel Com...» more  OPODIS 2008»
    Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets
    13 years 6 months ago
    Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets
    Download  alexandria.tue.nl
    Abstract. In this paper we use colored Petri nets (CPNs) and the supporting CPN Tools for the modeling and performance analysis of grid architectures. The notation of Petri nets is...
    Nikola Trcka, Wil M. P. van der Aalst, Carmen Brat...
    claim paper
    Read More »
    OPODIS
    2008
    76views Distributed And Parallel Com...» more  OPODIS 2008»
    With Finite Memory Consensus Is Easier Than Reliable Broadcast
    13 years 6 months ago
    With Finite Memory Consensus Is Easier Than Reliable Broadcast
    Download  www-verimag.imag.fr
    We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
    Carole Delporte-Gallet, Stéphane Devismes, ...
    claim paper
    Read More »
    OPODIS
    2008
    181views Distributed And Parallel Com...» more  OPODIS 2008»
    Deadline Monotonic Scheduling on Uniform Multiprocessors
    13 years 6 months ago
    Deadline Monotonic Scheduling on Uniform Multiprocessors
    Download  dev.ulb.ac.be
    The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented a...
    Sanjoy K. Baruah, Joël Goossens
    claim paper
    Read More »
    OPODIS
    2008
    76views Distributed And Parallel Com...» more  OPODIS 2008»
    A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
    13 years 6 months ago
    A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
    Download  www.cs.hiroshima-u.ac.jp
    Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Mas...
    claim paper
    Read More »
    OPODIS
    2008
    71views Distributed And Parallel Com...» more  OPODIS 2008»
    Fast Geometric Routing with Concurrent Face Traversal
    13 years 6 months ago
    Fast Geometric Routing with Concurrent Face Traversal
    Download  deneb.cs.kent.edu
    We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
    Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
    claim paper
    Read More »
    OPODIS
    2008
    80views Distributed And Parallel Com...» more  OPODIS 2008»
    A Distributed Algorithm for Resource Clustering in Large Scale Platforms
    13 years 6 months ago
    A Distributed Algorithm for Resource Clustering in Large Scale Platforms
    Download  www.labri.fr
    Olivier Beaumont, Nicolas Bonichon, Philippe Ducho...
    claim paper
    Read More »
    « first‹ previous123next ›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.