Browsing by Author "Kowalski, D. R."

Now showing items 1-15 of 15

    • Article  

      Adaptive packet scheduling over a wireless channel under constrained jamming 

      Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Zavou, Elli (2017)
      In this work we consider the communication over a wireless link, between a sender and a receiver, being disrupted by a jammer. The objective of the sender is to transmit as much data as possible to the receiver in the most ...
    • Article  

      Asynchronous gossip 

      Georgiou, Chryssis; Gilbert, S.; Guerraoui, R.; Kowalski, D. R. (2013)
      We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. ...
    • Article  

      Competitive analysis of task scheduling algorithms on a fault-prone machine and the impact of resource augmentation 

      Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Zavou, Elli (2015)
      Reliable task execution on machines that are prone to unpredictable crashes and restarts is both important and challenging, but not much work exists on the analysis of such systems. We consider the online version of the ...
    • Conference Object  

      Confidential gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of the reliability and efficiency derives from processes collaborating, sharing the work of distributing ...
    • 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 ...
    • Article  

      Efficient gossip and robust distributed computation 

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

      Measuring the impact of adversarial errors on packet scheduling strategies 

      Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Widmer, J.; Zavou, Elli (2013)
      In this paper we explore the problem of achieving efficient packet transmission over unreliable links with worst case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve ...
    • Article  

      Measuring the impact of adversarial errors on packet scheduling strategies 

      Fernández Anta, A.; Georgiou, Chryssis; Kowalski, D. R.; Widmer, J.; Zavou, Elli (2016)
      In this paper, we explore the problem of achieving efficient packet transmission over unreliable links with worst-case occurrence of errors. In such a setup, even an omniscient offline scheduling strategy cannot achieve ...
    • Article  

      Meeting the deadline: On the complexity of fault-tolerant continuous gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
    • Conference Object  

      Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2010)
      In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
    • Article  

      On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts 

      Georgiou, Chryssis; Kowalski, D. R. (2015)
      To identify the tradeoffs between efficiency and fault-tolerance in dynamic cooperative computing, we initiate the study of a task performing problem under dynamic processes' crashes/restarts and task injections. The system ...
    • Conference Object  

      On the complexity of asynchronous gossip 

      Georgiou, Chryssis; Gilbert, S.; Guerraoui, R.; Kowalski, D. R. (2008)
      In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an ...
    • Article  

      Online parallel scheduling of non-uniform tasks: Trading failures for energy 

      Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Zavou, Elli (2015)
      Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of machines that are prone to crashes and restarts. In this paper we model and study the impact of parallelism ...
    • Article  

      Online parallel scheduling of non-uniform tasks: Trading failures for energy 

      Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Zavou, Elli (2013)
      Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of processors that are prone to crashes and restarts. In this paper we model and study the impact of ...
    • Article  

      Performing dynamically injected tasks on processes prone to crashes and restarts 

      Georgiou, Chryssis; Kowalski, D. R. (2011)
      To identify the tradeoffs between efficiency and fault-tolerance in dynamic cooperative computing, we initiate the study of a task performing problem under dynamic processes' crashes/restarts and task injections. The system ...