Sciweavers

    OPODIS
    2008
    114views Distributed And Parallel Com...» more  OPODIS 2008»
    Impact of Information on the Complexity of Asynchronous Radio Broadcasting
    13 years 8 months ago
    Impact of Information on the Complexity of Asynchronous Radio Broadcasting
    Download  www.dsi.uniroma1.it
    We consider asynchronous deterministic broadcasting in radio networks. An execution of a broadcasting protocol is a series of events, each of which consists of simultaneous transm...
    Tiziana Calamoneri, Emanuele G. Fusco, Andrzej Pel...
    claim paper
    Read More »
    OPODIS
    2008
    127views Distributed And Parallel Com...» more  OPODIS 2008»
    Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms
    13 years 8 months ago
    Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms
    Download  dev.ulb.ac.be
    Abstract Nowadays, most of the energy-aware real-time scheduling algorithms belong to the DVFS (Dynamic Voltage and Frequency Scaling) framework. These DVFS algorithms are usually ...
    Joël Goossens, Dragomir Milojevic, Vincent N&...
    claim paper
    Read More »
    OPODIS
    2008
    128views Distributed And Parallel Com...» more  OPODIS 2008»
    An Unreliable Failure Detector for Unknown and Mobile Networks
    13 years 8 months ago
    An Unreliable Failure Detector for Unknown and Mobile Networks
    Download  pagesperso-systeme.lip6.fr
    This paper presents an asynchronous implementation of a failure detector for unknown and mobile networks. Our approach does not rely on timers. Neither the composition nor the numb...
    Pierre Sens, Luciana Arantes, Mathieu Bouillaguet,...
    claim paper
    Read More »
    OPODIS
    2008
    117views Distributed And Parallel Com...» more  OPODIS 2008»
    Byzantine Consensus with Unknown Participants
    13 years 8 months ago
    Byzantine Consensus with Unknown Participants
    Download  www.navigators.di.fc.ul.pt
    Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
    Eduardo Adílio Pelinson Alchieri, Alysson N...
    claim paper
    Read More »
    OPODIS
    2008
    111views Distributed And Parallel Com...» more  OPODIS 2008»
    Graph Augmentation via Metric Embedding
    13 years 8 months ago
    Graph Augmentation via Metric Embedding
    Download  www.liafa.jussieu.fr
    Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
    Emmanuelle Lebhar, Nicolas Schabanel
    claim paper
    Read More »
    OPODIS
    2008
    78views Distributed And Parallel Com...» more  OPODIS 2008»
    On the Time-Complexity of Robust and Amnesic Storage
    13 years 8 months ago
    On the Time-Complexity of Robust and Amnesic Storage
    Download  www.deeds.informatik.tu-darmstadt.de
    We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
    Dan Dobre, Matthias Majuntke, Neeraj Suri
    claim paper
    Read More »
    OPODIS
    2008
    75views Distributed And Parallel Com...» more  OPODIS 2008»
    Distributed Approximation of Cellular Coverage
    13 years 8 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 8 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 8 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 8 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 »
    « first‹ previous…165166167168169170171172173…next ›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.