Dynamic malleability in iterative MPI applications

K El Maghraoui, TJ Desell… - … Computing and the …, 2007 - ieeexplore.ieee.org
Malleability enables a parallel application's execution system to split or merge processes
modifying granularity. While process migration is widely used to adapt applications to …

Malleable iterative MPI applications

K El Maghraoui, TJ Desell… - Concurrency and …, 2009 - Wiley Online Library
Malleability enables a parallel application's execution system to split or merge processes
modifying granularity. While process migration is widely used to adapt applications to …

Resource management of distributed virtual machines

L Wang, D Chen, J Zhao, J Tao - International Journal of …, 2012 - inderscienceonline.com
Using Virtual Machines (VMs) as a computing resource within a Service Oriented
Architecture (SOA) creates a variety of new issues and challenges. Traditionally parallel task …

An efficient weighted bi-objective scheduling algorithm for heterogeneous systems

C Boeres, IM Sardiña, LMA Drummond - Parallel Computing, 2011 - Elsevier
This paper proposes the Makespan and Reliability Cost Driven (MRCD) heuristic, a static
scheduling strategy for heterogeneous distributed systems that not only minimizes the …

Grid computing of spatial statistics: using the TeraGrid for G(d) analysis

S Wang, MK Cowles… - … and Computation: Practice …, 2008 - Wiley Online Library
The massive quantities of geographic information that are collected by modern sensing
technologies are difficult to use and understand without data reduction methods that …

Performance study of parallel programming on cloud computing environments using mapreduce

WC Shih, SS Tseng, CT Yang - 2010 International Conference …, 2010 - ieeexplore.ieee.org
Divisible load applications have such a rich source of parallelism that their parallelization
can significantly reduce their total completion time on cloud computing environments …

Frontal face authentication using variants of dynamic link matching based on mathematical morphology

C Kotropoulos, A Tefas, I Pitas - … 1998 International Conference …, 1998 - ieeexplore.ieee.org
Two variants of dynamic link matching based on mathematical morphology are developed
and tested for frontal face authentication, namely, the morphological dynamic link …

An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems

FGO Passos, VEF Rebello - Concurrency and Computation …, 2024 - Wiley Online Library
Backtracking branch‐and‐prune (BP) algorithms and their variants are exhaustive search
tree techniques widely employed to solve optimization problems in many scientific areas …

Dynamic self-scheduling for parallel applications with task dependencies

AP Nascimento, C Boeres, VEF Rebello - Proceedings of the 6th …, 2008 - dl.acm.org
As grids are in essence heterogeneous, dynamic, shared and distributed environments,
managing these kinds of platforms efficiently is extremely complex. Few transparent grid …

A2l2: An application aware flexible hpc scheduling model for low-latency allocation

GP Rodrigo Álvarez, PO Östberg, E Elmroth… - Proceedings of the 8th …, 2015 - dl.acm.org
High-performance computing (HPC) is focused on providing large-scale compute capacity to
scientific applications. HPC schedulers tend to be optimized for large parallel batch jobs …