Optimization of memory management on distributed machine
type: Dataset
description: In order to explore further the capabilities of parallel computing architectures such as grids, clusters, multi-processors and more recently, clouds and multi-cores, an easy-to-use parallel language is an important challenging issue. From the programmer's point of view, OpenMP is very easy to use with its ability to support incremental parallelization, features for dynamically setting the number of threads and scheduling strategies. However, as initially designed for shared memory systems, OpenMP is usually limited on distributed memory systems to intra-nodes' computations. Many attempts have tried to port OpenMP on distributed systems. The most emerged approaches mainly focus on exploiting the capabilities of a special network architecture and therefore cannot provide an open solution. Others are based on an already available software solution such as DMS, MPI or Global Array and, as a consequence, they meet difficulties to become a fully-compliant and high-performance implementation of OpenMP. As yet another attempt to built an OpenMP compliant implementation for distributed memory systems, CAPE − which stands for Checkpointing Aide Parallel Execution − has been developed which with the following idea: when reaching a parallel section, the master thread is dumped and its image is sent to slaves; then, each slave executes a different thread; at the end of the parallel section, slave threads extract and return to the master thread the list of all modifications that has been locally performed; the master includes these modifications and resumes its execution. In order to prove the feasibility of this paradigm, the first version of CAPE was implemented using complete checkpoints. However, preliminary analysis showed that the large amount of data transferred between threads and the extraction of the list of modifications from complete checkpoints lead to weak performance. Furthermore, this version was restricted to parallel problems satisfying the Bernstein's condition…
identifier: NNT: 2012TELE0042
issued: 2026-05-11T10:52:28.239454
language: en
modified: 2026-05-11T10:52:28.239462
contact point: Organization
  fn: CCSD
keyword: cape
keyword: chekpointing-aided-parallel-execution
keyword: dickpt
keyword: discontinuous-incremental-checkpointing
keyword: distributed-memory-system
keyword: infoeu-reposemanticsdoctoralthesis
keyword: infoinfo-ohcomputer-science-csother-csoh
keyword: memoire-distribuee
keyword: open-mp
keyword: open-mp-compliance
keyword: parallel-computing
keyword: parallelisme
keyword: shsecohumanities-and-social-scienceseconomics-and-finance
keyword: theses
keyword: uhlrc
keyword: updated-home-based-lazy-relaxed-consistency
landing page: https://theses.hal.science/tel-00814630

Optimization of memory management on distributed machine
type: Distribution
format: HTML
issued: 2026-05-11T10:52:28.285804
modified: 2026-05-11T10:52:28.217690
access URL: https://theses.hal.science/tel-00814630

test_moissonnage_selune
type: Agent