• Article  

      Automated implementation of complex distributed algorithms specified in the IOA language 

      Georgiou, Chryssis; Lynch, N.; Mavrommatis, Panayiotis; Tauber, J. A. (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 Do-All with crashes 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (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 multi-agent collaboration. ...
    • Conference Object  

      A congestion control algorithm for max-min resource allocation and bounded queue sizes 

      Lestas, Marios; Ioannou, Petros A.; Pitsillides, Andreas (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 

      Georgiou, Chryssis; Shvartsman, A. A. (2003)
      This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing 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 

      Hadjicostis, Christoforos N.; Domínguez-Garcia, A. D. (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 Edge-Disjoint Spanning Trees for Robustifying Distributed Algorithms against Man-in-the-Middle Attacks 

      Oliva, G.; Cioaba, S.; Hadjicostis, Christoforos N. (2017)
      In this paper we provide a distributed methodology to allow a network of agents, tasked to execute a distributed algorithm, to overcome Man-in-the-middle attacks that aim at steering the result of the algorithm towards ...
    • Conference Object  

      Distributed Cooperation and Adversity: Complexity Trade-Offs 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (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 

      Keroglou, C.; Hadjicostis, Christoforos N. (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 Finite-Time Average Consensus in Digraphs in the Presence of Time Delays 

      Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (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 finite-time average-consensus with limited computational and storage capability 

      Oliva, G.; Setola, R.; Hadjicostis, Christoforos N. (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 wireless-sensor networks, or decentralized control of smart ...
    • Article  

      Distributed finite-time calculation of node eccentricities, graph radius and graph diameter 

      Oliva, G.; Setola, R.; Hadjicostis, Christoforos N. (2016)
      The distributed calculation of node eccentricities, graph radius and graph diameter are fundamental steps to tune network protocols (e.g., setting an adequate time-to-live of packets), to select cluster heads, or to execute ...
    • Article  

      A Distributed Frequency Regulation Architecture for Islanded Inertialess AC Microgrids 

      Cady, S. T.; Zholbaryssov, M.; Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (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 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (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  

      Distributed monitoring and control for smart buildings : a model-based fault diagnosis and accommodation framework 

      Papadopoulos, Panayiotis M. (Πανεπιστήμιο Κύπρου, Πολυτεχνική Σχολή / University of Cyprus, Faculty of Engineering, 2020-05)
      ‘Eξυπνα κτίρια ονομάζονται τα κτίρια τα οποία είναι ενισχυμένα με προηγμένους αλγόριθμους που μπορούν να λαμβάνουν αποφάσεις και μέτρα για τη βελτίωση της ενεργειακής απόδοσης και τη διατήρηση των εσωτερικών άνετων συνθηκών ...
    • Article  

      Efficiency of oblivious versus nonoblivious schedulers for optimistic, rate-based flow control 

      Fatourou, Panagiota; Mavronicolas, Marios; Spirakis, Paul G. (2005)
      Two important performance parameters of distributed, rate-based 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 

      Georgiou, Chryssis; Kowalski, D. R.; Shvartsman, A. A. (2005)
      This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T=O(log2p) and message complexity M=O(p1+ε), for any ε>0. This ...
    • Conference Object  

      Fault-tolerant semi fast implementations of atomic read/write registers 

      Georgiou, Chryssis; Nicolaou, Nicolas C.; Shvartsman, A. A. (2006)
      This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we study the case of a single writer, multiple ...
    • Article  

      Fault-tolerant semifast implementations of atomic read/write registers 

      Georgiou, Chryssis; Nicolaou, Nicolas C.; Shvartsman, A. A. (2009)
      This paper investigates time-efficient implementations of atomic read-write registers in message-passing 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 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2015)
      A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important ...
    • Article  

      Long-lived Rambo: Trading knowledge for communication 

      Georgiou, Chryssis; Musiał, Peter M.; Shvartsman, A. A. (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. ...