• Conference Object  

      Data-Driven Serendipity Navigation in Urban Places 

      Ge, X.; Daphalapurkar, A.; Shimpi, M.; Kohli, D.; Pelechrinis, K.; Chrysanthis, Panos K.; Zeinalipour-Yazdi, Constantinos D. (Institute of Electrical and Electronics Engineers Inc., 2017)
      With the proliferation of mobile computing and the ability to collect detailed data for the urban environment a number of systems that aim at providing Points of Interest (POIs) and tour recommendations have appeared. The ...
    • Article  

      DBGlobe: A service-oriented P2P system for global computing 

      Pitoura, Evaggelia 1967-; Abiteboul, S.; Pfoser, D.; Samaras, George S.; Vazirgiannis, M. (2003)
      The challenge of peer-to-peer computing goes beyond simple file sharing. In the DBGlobe project, we view the multitude of peers carrying data and services as a super-database. Our goal is to develop a data management system ...
    • Conference Object  

      Developing a consistent domain-oriented distributed object service 

      Georgiou, Chryssis; Musiał, Peter M.; Shvartsman, A. A. (2005)
      This paper presents a new algorithm for a reconfigurable distributed domain-oriented atomic object service, called DO-RAMBO, which stands for Domain-Oriented Reconfigurable Atomic Memory for Basic Objects. This service is ...
    • Article  

      Distributed adaptation reasoning for a mobility and adaptation enabling middleware 

      Paspallis, Nearchos; Papadopoulos, George Angelos (2006)
      The prospect of adaptive, mobile applications provides both opportunity and challenge to the application developers. Adaptive, mobile applications are designed to constantly adapt to the contextual conditions with the aim ...
    • Conference Object  

      Distributed context management in a Mobility and Adaptation Enabling Middleware (MADAM) 

      Mikalsen, M.; Paspallis, Nearchos; Floch, J.; Stav, E.; Papadopoulos, George Angelos; Chimaris, Avraam N. (2006)
      As computing devices are getting smaller, we tend to bring them everywhere. Consequently the operating conditions of the devices are constantly changing (e.g. changing user requirements, change in the system context and ...
    • 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  

      Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum 

      Charalambous, T.; Rabbat, M. G.; Johansson, M.; Hadjicostis, Christoforos N. (2016)
      Many of the algorithms that have been proposed in the field of distributed computation rely on assumptions that require nodes to be aware of some global parameters. In this paper, we propose algorithms to compute some ...
    • Article  

      Distributed function calculation and consensus using linear iterative strategies 

      Sundaram, S.; Hadjicostis, Christoforos N. (2008)
      Given an arbitrary network of interconnected nodes, we develop and analyze a distributed strategy that enables a subset of the nodes to calculate any given function of the node values. Our scheme utilizes a linear iteration ...
    • Article  

      Distributed function calculation via linear iterative strategies in the presence of malicious agents 

      Sundaram, S.; Hadjicostis, Christoforos N. (2011)
      Given a network of interconnected nodes, each with its own value (such as a measurement, position, vote, or other data), we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary ...
    • Article  

      Distributed middleware architectures for scalable media services 

      Kalogeraki, Vana; Zeinalipour-Yazdi, Constantinos D.; Gunopulos, Dimitrios; Delis, Alexis (2007)
      The fusion of Multimedia and Internet technology has introduced an ever-increasing demand for large-scale reliable media services. This exposes the scalability limitations of current middleware architectures, as they ...
    • Article  

      A distributed middleware infrastructure for personalized services 

      Dikaiakos, Marios D.; Zeinalipour-Yazdi, Constantinos D. (2004)
      In this paper, we present an overview of extensible Retrieval, Annotation and Caching Engine (eRACE), a modular and distributed intermediary infrastructure that collects information from heterogeneous Internet sources ...
    • Conference Object  

      Distributed, low contention task allocation 

      Kapidakis, Sarantos; Mavronicolas, Marios (IEEE, 1996)
      A new approach to solve task allocation problems is proposed. The method involves introducing a load balancing network, a new class of distributed, and asynchronous algorithms for task allocation in shared memory ...
    • Article  

      Dynamic reconfiguration in coordination languages 

      Papadopoulos, George Angelos; Arbab, Farhad (2000)
      A rather recent approach in programming parallel and distributed systems is that of coordination models and languages. Coordination programming enjoys a number of advantages such as the ability to express different software ...
    • Conference Object  

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

      Fatourou, Panagiota; Mavronicolas, Marios; Spirakis, Paul G. (ACM, 1997)
      Lower and upper bounds on convergence complexity, under varying degrees of locality, for optimistic, rate-based flow control algorithms are established. It is shown that randomness can be exploited to yield an even simpler ...
    • 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. (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  

      Enabling the deployment of mobile services for end-users: the SMS approach 

      Kapitsaki, Georgia M.; Kateros, D. A.; Pappas, C. (2013)
      Service provision in mobile environments is nowadays moving toward easiness and openness. The end-user’s role in this procedure can be supported through platforms that encourage user’s participation. This is critical toward ...
    • Conference Object  

      Experience with the International Testbed in the CrossGrid Project 

      Gomes, Jorge; David, Mário; Martins, João Paulo; Bernardo, L.; García, A.; Hardt, M.; Kornmayer, H.; Marco, Jesús; Marco, R.; Rodríguez, David Prada; Diaz, I.; Cano, D.; Salt, J.; Gonzalez, S.; Sánchez, J.; Fassi, F.; Lara, V.; Nyczyk, P.; Lason, P.; Ozieblo, A.; Wolniewicz, P.; Bluj, M.; Nawrocki, K.; Padee, A.; Wislicki, W.; Fernández, C.; Fontán, J.; Cotronis, Yiannis; Floros, Evangelos; Tsouloupas, George; Xing, Wei; Dikaiakos, Marios D.; Astaloš, Ján; Coghlan, B.; Heymann, E.; Senar, M.; Kanellopoulos, Christos; Ramos, A.; Groen, D. (2005)
      The International Testbed of the CrossGrid Project has been in operation for the last three years, including 16 sites in 9 countries across Europe. The main achievements in installation and operation are described, and ...
    • Article  

      Exploiting locality for scalable information retrieval in peer-to-peer networks 

      Zeinalipour-Yazdi, Constantinos D.; Kalogeraki, Vana; Gunopulos, Dimitrios (2005)
      An important problem in unstructured peer-to-peer (P2P) networks is the efficient content-based retrieval of documents shared by other peers. However, existing searching mechanisms are not scaling well because they are ...
    • Article  

      Failure management in Grids: The case of the EGEE infrastructure 

      Neocleous, Kyriacos; Dikaiakos, Marios D.; Fragopoulou, Paraskevi; Markatos, Evangelos P. (2007)
      The emergence of Grid infrastructures like EGEE has enabled the deployment of large-scale computational experiments that address challenging scientific problems in various fields. However, to realize their full potential, ...