• Article  

      Advanced Array Optimizations for High Performance Functional Languages 

      Cann, D. C.; Evripidou, Paraskevas (1995)
      In this paper, we discuss and evaluate three opti- mizations for reducing memory management overhead and data copying costs in SISAL 1.2 programs that build arrays. The first, called framework preconstruction, eliminates ...
    • Article  

      Approximate Equilibria and Ball Fusion 

      Koutsoupias, Elias; Mavronicolas, Marios; Spirakis, Paul G. (2003)
      We consider selfish routing over a network consisting of m parallel links through which n selfish users route their traffic trying to minimize their own expected latency. We study the class of mixed strategies in which the ...
    • 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  

      Block Scheduling of Iterative Algorithms and Graph-Level Priority Scheduling in a Simulated Data-Flow Multiprocessor 

      Evripidou, Paraskevas; Gaudiot, J. -L (1993)
      While data-flow principles permit the utilization of large-scale multiprocessor systems with high programmability and good efficiency, they also introduce much overhead at runtime. In this paper, we have studied an important ...
    • Article  

      A case for chip multiprocessors based on the data-driven multithreading model 

      Trancoso, Pedro; Evripidou, Paraskevas; Stavrou, Kyriakos; Kyriacou, Costas (2006)
      Current high-end microprocessors achieve high performance as a result of adding more features and therefore increasing complexity. This paper makes the case for a Chip-Multiprocessor based on the Data-Driven Multithreading ...
    • Article  

      Coding techniques for fault-tolerant parallel prefix computations in Abelian groups 

      Hadjicostis, Christoforos N. (2004)
      This paper presents coding techniques that can be used to provide fault tolerance to a parallel prefix computation that is performed on a binary tree of processing nodes. More specifically, we discuss how a parallel prefix ...
    • Conference Object  

      Comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors 

      Dikaiakos, Marios D.; Steiglitz, Kenneth; Rogers, Anne (IEEE, 1994)
      This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of ...
    • Article  

      Complexity of rational and irrational Nash equilibria 

      Bilò, Vittorio; Mavronicolas, Marios (2011)
      We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
    • Conference Object  

      Computing Nash equilibria for scheduling on restricted parallel links 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2004)
      We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the ...
    • Article  

      Concurrent object-oriented programming using term graph rewriting techniques 

      Papadopoulos, George Angelos (1996)
      The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent object-oriented programming techniques exploiting the fine grain highly parallel features of TGRS in a ...
    • Article  

      Configuration and dynamic reconfiguration of components using the coordination paradigm 

      Papadopoulos, George Angelos; Arbab, Farhad (2001)
      One of the most promising approaches in developing component-based (possibly distributed) systems is that of coordination models and languages. Coordination programming enjoys a number of advantages such as the ability to ...
    • Conference Object  

      Coordinated cooperative work using undependable processors with unreliable broadcast 

      Davtyan, S.; Prisco, R. D.; Georgiou, Chryssis; Shvartsman, A. A. (IEEE Computer Society, 2014)
      With the end of Moore's Law in sight, parallelism became the main means for speeding up computationally intensive applications, especially in the cases where large collections of tasks need to be performed. Network ...
    • Conference Object  

      Coordination of systems with real-time properties in manifold 

      Papadopoulos, George Angelos; Arbab, Farhad (IEEE, 1996)
      This paper combines work done in the areas of asynchronous timed computations and coordination models in order to derive a framework able to express real-time coordination without adhering to special architectures or ...
    • Article  

      D3-machine: A decoupled data-driven multithreaded architecture with variable resolution support 

      Evripidou, Paraskevas (2001)
      This paper presents the Decoupled Data-Driven machine (D3-machine), a multithreaded architecture with data-driven synchronization. The D3-machine is an efficient and cost-effective design that combines the advantages of ...
    • Conference Object  

      Data parallel acceleration of decision support queries using cell/BE and GPUs 

      Trancoso, Pedro; Othonos, D.; Artemiou, A. (2009)
      Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that processes large data sets. Traditionally, DSS queries have been accelerated using large-scale multiprocessor. ...
    • Article  

      Distributed and parallel systems engineering in MANIFOLD 

      Papadopoulos, George Angelos (1998)
      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  

      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 ...
    • Conference Object  

      Editorial message: Special track on ubiquitous computing 

      Roussos, G.; Samaras, George S. (2005)
      Ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday ...
    • Conference Object  

      Essential features of a compiler target language for parallel machines 

      Papadopoulos, George Angelos (IEEE, 1995)
      Term Graph Rewriting Systems (TGRS) have been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) ...
    • Article  

      Experience using an intermediate compiler target language for parallel machines 

      Papadopoulos, George Angelos (1997)
      The generalised computational model of term graph rewriting systems (TGRSs) has been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional ...