Results 11 to 20 of about 3,487,111 (248)

A Local 6-Approximation Distributed Algorithm for Minimum Dominating Set Problem in Planar Triangle-Free Graphs

open access: yesAlgorithms
In this paper, we present a new distributed approximation algorithm for the minimum dominating set problem in planar triangle-free graphs. The algorithm operates in a constant number of rounds in the LOCAL model.
Wojciech Wawrzyniak
doaj   +2 more sources

An evaluation of load balancing algorithms for distributed systems [PDF]

open access: yes, 1991
Distributed systems are gradually being accepted as the dominant computing paradigm of the future. However, due to the diversity and multiplicity of resources, and the need for transparency to users, global resource management raises many questions.
Benmohammed-Mahieddine, Kouider
core   +6 more sources

Implications of VLSI Fault Models and Distributed Systems Failure Models --- A Hardware Designer's View [PDF]

open access: yes, 2009
The fault and failure models as well as their semantics within the VLSI community and the distributed systems/algorithms community are quite different.
Fuchs, Gottfried
core   +4 more sources

Formal proofs for broadcast algorithms [PDF]

open access: yes, 2014
Standard distributed algorithmic solutions to recurring distributed problems are commonly specified and described informally. A proper understanding of these distributed algorithms that clarifies ambiguities requires formal descriptions.
Francalanza, Adrian, Zammit, Mandy
core   +1 more source

An optimisation for a two‐round good‐case latency protocol

open access: yesIET Information Security, 2023
Byzantine broadcast is a fundamental primitive in distributed computing. A highly efficient Byzantine broadcast protocol, motivated by the real‐world performance of practical state machine replication protocols, is increasingly needed.
Kexin Hu   +5 more
doaj   +1 more source

HPIM‐DM: A fast and reliable dense‐mode multicast routing protocol

open access: yesIET Networks, 2023
The Hard‐state Protocol Independent Multicast—Dense Mode (HPIM‐DM) multicast routing protocol is proposed. HPIM‐DM is a hard‐state version of PIM‐DM that overcomes its poor convergence times and lack of resilience to replay attacks.
Pedro Oliveira   +2 more
doaj   +1 more source

Algon: a framework for supporting comparison of distributed algorithm performance [PDF]

open access: yes, 2003
Programmers often need to use distributed algorithms to add non-functional behaviour such as mutual exclusion, deadlock detection and termination, to a distributed application.
B. Worrall   +9 more
core   +1 more source

Optimizing electricity demand scheduling in microgrids using deep reinforcement learning for cost‐efficiency

open access: yesIET Generation, Transmission & Distribution, 2023
Renewable energy sources (RES) are increasingly being developed and used to address the energy crisis and protect the environment. However, the large‐scale integration of wind and solar energy into the power grid is still challenging and limits the ...
Baoyin Xiong   +5 more
doaj   +1 more source

Attack‐resilient event‐triggered distributed control strategy of microgrid based on multi‐objective optimization

open access: yesIET Generation, Transmission & Distribution, 2023
As an important form of renewable energy utilization, microgrid (MG) is considered to be the main bearing form of distributed generation in the future. One of the most concerning issues in the operation of MG is how to realize its economic dispatch (ED).
Jinglu Liu   +3 more
doaj   +1 more source

08371 Abstracts Collection – Fault-Tolerant Distributed Algorithms on VLSI Chips [PDF]

open access: yes, 2009
From September the $7^{\text{th}}$, 2008 to September the $10^{\text{th}}$, 2008 the Dagstuhl Seminar 08371 ``Fault-Tolerant Distributed Algorithms on VLSI Chips '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Dolev, Shlomi   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy