Sciweavers

    OPODIS
    2008
    166views Distributed And Parallel Com...» more  OPODIS 2008»
    Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets
    14 years 12 days 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
    14 years 12 days 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
    14 years 12 days 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
    14 years 12 days 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
    14 years 12 days 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
    14 years 12 days 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 »
    OPODIS
    2008
    99views Distributed And Parallel Com...» more  OPODIS 2008»
    Group Renaming
    14 years 12 days ago
    Group Renaming
    Download  www.cs.tau.ac.il
    We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
    Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merri...
    claim paper
    Read More »
    OPODIS
    2008
    109views Distributed And Parallel Com...» more  OPODIS 2008»
    CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
    14 years 12 days ago
    CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
    Download  www.real-time.ece.vt.edu
    Due to the heterogenous power-saving requirement in wireless sensor networks, we propose the Cyclic Quorum System Pair (CQS-Pair) which can guarantee that two asynchronous nodes ad...
    Shouwen Lai, Bo Zhang, Binoy Ravindran, Hyeonjoong...
    claim paper
    Read More »
    OPODIS
    2008
    118views Distributed And Parallel Com...» more  OPODIS 2008»
    Ordering-Based Semantics for Software Transactional Memory
    14 years 12 days ago
    Ordering-Based Semantics for Software Transactional Memory
    Download  www.cs.rochester.edu
    It has been widely suggested that memory transactions should behave as if they acquired and released a single global lock. Unfortunately, this behavior can be expensive to achieve...
    Michael F. Spear, Luke Dalessandro, Virendra J. Ma...
    claim paper
    Read More »
    OPODIS
    2008
    113views Distributed And Parallel Com...» more  OPODIS 2008»
    Rendezvous of Mobile Agents When Tokens Fail Anytime
    14 years 12 days ago
    Rendezvous of Mobile Agents When Tokens Fail Anytime
    Download  people.ksp.sk
    Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
    Shantanu Das, Matús Mihalák, Rastisl...
    claim paper
    Read More »
    « first‹ previous…166167168169170171172173174…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.