Browsing by Subject "Distributed algorithms"
Now showing items 120 of 22

Article
Automated implementation of complex distributed algorithms specified in the IOA language
(2009)IOA is a formal language for describing Input/Output automata that serves both as a formal specification language and as a programming language (Garland et al. in http://theory.lcs.mit.edu/tds/ioa/manual.ps, 2004). The IOA ...

Article
The complexity of synchronous iterative DoAll with crashes
(2004)The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multiagent collaboration. ...

Conference Object
A congestion control algorithm for maxmin resource allocation and bounded queue sizes
(2004)This paper deals with the congestion control problem in computer networks which is viewed as a resource allocation problem constrained by the additional requirement that the queue sizes need to be bounded. We propose a ...

Article
Cooperative computing with fragmentable and mergeable groups
(2003)This work considers the problem of performing a set of N tasks on a set of P cooperating messagepassing processors (P ≤ N). The processors use a group communication service (GCS) to coordinate their activity in the setting ...

Article
Distributed Balancing of Commodity Networks Under Flow Interval Constraints
(2018)We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...

Article
Distributed Calculation of EdgeDisjoint Spanning Trees for Robustifying Distributed Algorithms against ManintheMiddle Attacks
(2017)In this paper we provide a distributed methodology to allow a network of agents, tasked to execute a distributed algorithm, to overcome Maninthemiddle attacks that aim at steering the result of the algorithm towards ...

Conference Object
Distributed Cooperation and Adversity: Complexity TradeOffs
(2003)The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such ...

Article
Distributed Fault Diagnosis in Discrete Event Systems via Set Intersection Refinements
(2018)We extend and verify diagnosability for a class of set intersection refinement strategies, which can be used for distributed state estimation and fault diagnosis in nondeterministic finite automata that are observed at ...

Article
Distributed FiniteTime Average Consensus in Digraphs in the Presence of Time Delays
(2015)Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...

Article
Distributed finitetime averageconsensus with limited computational and storage capability
(2017)Consensus is a fundamental feature of distributed systems, and it is the prerequisite for several complex tasks, such as flocking of mobile robots, localization in wirelesssensor networks, or decentralized control of smart ...

Article
Distributed finitetime calculation of node eccentricities, graph radius and graph diameter
(2016)The distributed calculation of node eccentricities, graph radius and graph diameter are fundamental steps to tune network protocols (e.g., setting an adequate timetolive of packets), to select cluster heads, or to execute ...

Article
A Distributed Frequency Regulation Architecture for Islanded Inertialess AC Microgrids
(2017)We address the problem of frequency regulation in islanded ac microgrids with no inertia, i.e., those consisting entirely of generators interfaced through power electronics. The control architecture we propose to achieve ...

Article
Distributed matrix scaling and application to average consensus in directed graphs
(2013)We propose a class of distributed iterative algorithms that enable the asymptotic scaling of a primitive column stochastic matrix, with a given sparsity structure, to a doubly stochastic form. We also demonstrate the ...

Doctoral Thesis Open Access
Distributed monitoring and control for smart buildings : a modelbased fault diagnosis and accommodation framework
(Πανεπιστήμιο Κύπρου, Πολυτεχνική Σχολή / University of Cyprus, Faculty of Engineering, 202005)‘Eξυπνα κτίρια ονομάζονται τα κτίρια τα οποία είναι ενισχυμένα με προηγμένους αλγόριθμους που μπορούν να λαμβάνουν αποφάσεις και μέτρα για τη βελτίωση της ενεργειακής απόδοσης και τη διατήρηση των εσωτερικών άνετων συνθηκών ...

Article
Efficiency of oblivious versus nonoblivious schedulers for optimistic, ratebased flow control
(2005)Two important performance parameters of distributed, ratebased flow control algorithms are their locality and convergence complexity. The former is characterized by the amount of global knowledge that is available to their ...

Article
Efficient gossip and robust distributed computation
(2005)This paper presents an efficient deterministic gossip algorithm for p synchronous, crashprone, messagepassing processors. The algorithm has time complexity T=O(log2p) and message complexity M=O(p1+ε), for any ε>0. This ...

Conference Object
Faulttolerant semi fast implementations of atomic read/write registers
(2006)This paper investigates timeefficient implementations of atomic readwrite registers in messagepassing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...

Article
Faulttolerant semifast implementations of atomic read/write registers
(2009)This paper investigates timeefficient implementations of atomic readwrite registers in messagepassing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...

Conference Object
Integer weight balancing in directed graphs in the presence of communication delays
(Institute of Electrical and Electronics Engineers Inc., 2015)A digraph with positive weights on its edges is weightbalanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weightbalanced digraphs play an important ...

Article
Longlived Rambo: Trading knowledge for communication
(2007)Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with efficiency in practical algorithms is difficult. ...