Browsing by Subject "Parallel processing systems"

Now showing items 21-40 of 49

    • 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 course grain parallelism from FORTRAN by mapping it to IF1 

      Lachanas, Adrianos; Evripidou, Paraskevas (1998)
      FORTRAN, a classical imperative language is mapped into IF1, a machine-independent dataflow graph description language with Single Assingment Semantics (SAS). Parafrase 2 (P2) is used as the front-end of our system. It ...
    • Conference Object  

      Exploring HPC parallelism with data-driven multithreating 

      Christofides, Constantinos; Michael, G.; Trancoso, Pedro; Evripidou, Paraskevas (IEEE Computer Society, 2013)
      The switch to Multi-core systems has ended the reliance on the single processor for increase in performance and moved into Parallelism. However, the exponential growth in performance of the single processor in the 80's and ...
    • Conference Object  

      Extracting parallelism in Fortran by translation to a single assignment intermediate form 

      Barry, Robert J.; Evripidou, Paraskevas (Publ by IEEE, 1994)
      This paper presents MUSTANG, a system for translating Fortran to single assignment form in an effort to automatically extract parallelism. Specifically, a sequential Fortran source program is translated into IF1, a ...
    • Conference Object  

      FAST: a functional algorithm simulation testbed 

      Dikaiakos, Marios D.; Rogers, Anne; Steiglitz, Kenneth (Publ by IEEE, 1994)
      In this paper we extend the practical range of simulations of parallel executions by what we call 'functional algorithm simulation,' that is, simulation without actually performing most of the numerical computations involved. ...
    • Article  

      Fine-grain parallelism using multi-core, Cell/BE, and GPU systems 

      Pratas, F.; Trancoso, Pedro; Sousa, L.; Stamatakis, A.; Shi, G.; Kindratenko, V. (2012)
      Currently, we are facing a situation where applications exhibit increasing computational demands and where a large variety of parallel processor systems are available. In this paper we focus on exploiting fine-grain ...
    • Conference Object  

      Getting ready for approximate computing: Trading parallelism for accuracy for dss workloads 

      Trancoso, Pedro (Association for Computing Machinery, 2014)
      Processors have evolved dramatically in the last years and current multicore systems deliver very high performance. We are observing a rapid increase in the number of cores per processor thus resulting in more dense and ...
    • Article  

      Incorporating input/output operations into dynamic data-flow graphs 

      Evripidou, Paraskevas; Gaudiot, J. -L (1995)
      Driven by the 'side-effect' environment of sequential von Neumann computing, Input/Output operations have evolved as state operations on shared files. In parallel programs, if multiple instances of an I/O-performing process ...
    • Article  

      Initial experiences porting a bioinformatics application to a graphics processor 

      Charalambous, Maria; Trancoso, Pedro; Stamatakis, A. (2005)
      Bioinformatics applications are one of the most relevant and compute-demanding applications today. While normally these applications are executed on clusters or dedicated parallel systems, in this work we explore the use ...
    • Article  

      Mapping fortran programs to single assignment semantics for efficient parallelization 

      Evripidou, Paraskevas (1998)
      This paper presents Mustang, a system that automatically parallellizes Fortran programs by mapping them to single assignment semantics. Specifically, sequential Fortran source programs are translated into IF1, a ...
    • Article  

      Metacomputing with mobile agents 

      Evripidou, Paraskevas; Samaras, George S. (2006)
      In this paper we present Parallel Computing with Mobile Agents (PaCMAn), a mobile agent based Metacomputer that enables its users to utilize idle resources on the internet to tackle computational problems that could not ...
    • Article  

      Net-console: Web-based development environment for parallel programs 

      Evripidou, Paraskevas; Samaras, George S.; Spyrou, Christiana; Papagapiou, Andreas (2001)
      Net-Console is an integrated program development environment that can be used as a front-end for High Performance Computing (HPC) sites. It consist of an MPI-aware editor, an execution console, a debugger, monitoring tools ...
    • Article  

      Net-dbx: A web-based debugger of MPI programs over low-bandwidth lines 

      Neophytou, Neophytos; Evripidou, Paraskevas (2001)
      This paper describes Net-dbx, a tool that utilizes Java and other World Wide Web tools for the debugging of MPI programs from anywhere in the Internet. Net-dbx is a source-level interactive debugger with the full power of ...
    • Article  

      Object-oriented term graph rewriting 

      Papadopoulos, George Angelos (1999)
      The relationship between the generalised computational model of Term Graph Rewriting Systems (TGRS) and Object-Oriented Programming (OOP) is explored and exploited by extending the TGRS model with records where access to ...
    • Article  

      On the complexity of parallelizing sequential circuits using the parallel-prefix method 

      Hadjicostis, Christoforos N. (2001)
      The parallel-prefix method uses a tree of identical processing nodes to calculate in parallel, the state and output response of a finite-state machine (FSM) to a finite-length input sequence. Traditionally, each computing ...
    • 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  

      The PaCMAn Metacomputer: Parallel computing with Java mobile agents 

      Evripidou, Paraskevas; Samaras, George S.; Panayiotou, Christoforos; Pitoura, Evaggelia 1967- (2001)
      The PaCMAn (parallel computing with Java mobile agents) Metacomputer launches multiple Java mobile agents that communicate and cooperate to solve problems in parallel. Each mobile agent can travel anywhere in the Web to ...
    • Article  

      Performance and stability bounds for dynamic networks 

      Koukopoulos, D.; Mavronicolas, Marios; Spirakis, Paul G. (2007)
      In this work, we study the impact of dynamically changing link capacities on the delay bounds of LIS (Longest-In-System) and SIS (Shortest-In-System) protocols on specific networks (that can be modelled as Directed Acyclic ...
    • Conference Object  

      Performance study of cosmological simulations on message-passing and shared-memory multiprocessors 

      Dikaiakos, Marios D.; Stadel, Joachim (ACM, 1996)
      In this paper we describe PKDGRAV, a parallel hierarchical tree-structured code used to conduct cosmological simulations on shared-memory and message-passing multiprocessors. We explore performance traits of cosmological ...
    • Article  

      The Price of Anarchy for restricted parallel links 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2006)
      In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed links for the user. In a (pure) Nash equilibrium, ...