A versatilidade e principalmente o poder de processamento dos atuais celulares, mais conhecidos como smartphones, e também dos tablets, impulsionam a computação de algorítimos complexos nesses dispositivos. Cada celular ou tablet pode fazer parte de uma grande rede de computadores com capacidade para processar uma enorme quantidade de dados com um consumo muito baixo de energia se comparado aos computadores convencionais. Um outro grande motivador é que muitos desses celulares possuem o sistema operacional Android, o qual é baseado no núcleo Linux. Isso facilita a migração de projetos já desenvolvidos em computadores para essa nova plataforma móvel, uma vez que é possível executar um sistema operacional completo GNU/Linux nesses dispositivos. O objetivo desse trabalho é avaliar e comparar o desempenho de um cluster híbrido formado por dispositivos móveis e computadores, mostrando que é possível desenvolver aplicativos utilizando MPI para processamento paralelo em celulares da mesma forma com que se desenvolve aplicativos para computadores em GNU/Linux. Os resultados mostram qual é a diferença de poder computacional entre os computadores de arquitetura x86 e os dispositivos móveis de tecnologia ARM. / Versatility and mainly processing power of nowadays smartphones and tablets boost complex algorithms computation on these devices. Each cellphone or tablet can be part of a big computer network capable of processing a huge amount of data with low power consumption compared to personal computers. A great motivator also is that these devices have the Android operational system that is based on Linux kernel, what facilitates developed projects to migrate easily to this new platform. The goal of this project is to evaluate and compare a hybrid cluster performance formed by mobile devices and computers, showing that is possible to develop software using MPI for parallel processing over smartphones and tablets the same way as for GNU/Linux computers. The results show what is the processing power difference between x86 architecture computers and mobile devices using ARM architecture.

Cognitive Computing is a new and quickly advancing technology. In thelast decade Cognitive Computing has been used to assist researchers in theirendeavors in many different scientific fields such as Health & medicine,Education, Marketing, Psychology and Financial Services. On the otherhand, Parallel programming is a more complex concept than sequentialprogramming. The additional complexity of Parallel Programming isintroduced by its nature that requires implementations of more complexalgorithms and it introduces additional concepts to the developers, namelythe communication between the processes (Distributed memory systems)that execute the parallel program and their synchronization (Share memorysystems). As a result of this additional complexity, a lot of novice developersare reserved in their attempts to implement parallel programs. The objectiveof this research project was to investigate whether we can assist parallelprogramming process through cognitive computing solutions. In order toachieve our objective, the MPI Assistant, a Q&A system has been developedand a case study has been carried out to determine our application’s efficiencyin our attempt to assist parallel programming developers. The case studyshowed that our MPI Assistant system indeed helped developers reduce thetime they spend to develop their solutions, but not improve the quality ofthe program or its efficiency as these improvements require features that areout of this research project’s scope. However, the case study had limitednumber of participants, which may affect our results’ reliability. As a nextstep in our attempt to determine if cognitive computing technologies are ableto assist developers in their parallel programming development, we movedto investigate if cognitive solutions can extract better and more completeresponses compared to our manually-created responses that we created forthe MPI Assistant. We have experimented with 2 different approaches to theproblem. An approach where we manually created responses for the MPIAssistant, and an approach where we investigated if cognitive solutions canautomatically extract better and complete responses. We compared the qualityof the latter automatic responses with the quality of the former which weremanually created.

PN code tracking plays a very important role in CDMA communication systems. In literature, the influences of multipath fading and of multiuser interference on PN code tracking are studied separately. The multipath fading influence is mitigated by combining a rake receiver and a channel estimator in the Delay-Locked Loop (DLL). The multiuser interference is overcome by incorporating a data estimator into the DLL. In the downlink, PN code tracking may suffer from the multipath fading influence. However, the multipath fading and the multiuser interference influences exist in the uplink. Unfortunately, sole use of the aforementioned methods cannot solve out both influences simultaneously. In this thesis, two new Coherent Decision-Directed Delay-Locked Loop (CDD-DLL) PN-Code tracking schemes are developed and either can overcome both influences. First, a channel and a data estimators are incorporated into the DLL inherent with a rake receiver. This new scheme works properly in an environment with multipath fading and multiuser interference. Second, the original CDD-DLL is combined with a multipath interference canceller (MPI) to reduce both influences. Analytical results are derived for the two schemes proposed and are validated with numerical simulations. Simulation results show that the conventional DLLs working in a multipath fading and multiuser interference environment can be significantly improved using the new schemes. Moreover, the latter outperforms the former because the multipath interference is cancelled completely.

The MPI_Barrier-collective operation, as a part of the MPI-1.1 standard, is extremely important for all parallel applications using it. The latency of this operation increases the application run time and can not be overlaid. Thus, the whole MPI performance can be decreased by unsatisfactory barrier latency. The main goals of this work are to lower the barrier latency for InfiniBand networks by analyzing well known barrier algorithms with regards to their suitability within InfiniBand networks, to enhance the barrier operation by utilizing standard InfiniBand operations as much as possible, and to design a constant time barrier for InfiniBand with special hardware support. This partition into three main steps is retained throughout the whole thesis. The first part evaluates publicly known models and proposes a new more accurate model (LoP) for InfiniBand. All barrier algorithms are evaluated within the well known LogP and this new model. Two new algorithms which promise a better performance have been developed. A constant time barrier integrated into InfiniBand as well as a cheap separate barrier network is proposed in the hardware section. All results have been implemented inside the Open MPI framework. This work led to three new Open MPI collective modules. The first one implements different barrier algorithms which are dynamically benchmarked and selected during the startup phase to maximize the performance. The second one offers a special barrier implementation for InfiniBand with RDMA and performs up to 40% better than the best solution that has been published so far. The third implementation offers a constant time barrier in a separate network, leveraging commodity components, with a latency of only 2.5 microseconds. All components have their specialty and can be used to enhance the barrier performance significantly.

This work covers the implementation of a raw Ethernet communication module for the Open MPI message passing library. Thereby it focuses on both the reduction of the communication latency for small messages and maximum possible compatibility. Especially the need for particular network devices, adapted network device drivers or kernel patches is avoided. The work is divided into three major parts: First, the networking subsystem of the version 2.6 Linux kernel is analyzed. Second, an Ethernet protocol family is implemented as a loadable kernel module, consisting of a basic datagram protocol (EDP), providing connection-less and unreliable datagram transport, and a streaming protocol (ESP), providing connection-oriented, sequenced and reliable byte streams. The protocols use the standard device driver interface of the Linux kernel for data transmission and reception. Their services are made available to user-space applications through the standard socket interface. Last, the existing Open MPI TCP communication module is ported atop the ESP. With bare EDP/ESP sockets a message latency of about 30 us could be achieved for small messages, which compared to the TCP latency of about 40 us is a reduction of 25 %.

The broadcast function MPI_Bcast() from the MPI-1.1 standard is one of the most heavily used collective operations for the message passing programming paradigm. This diploma thesis makes use of a feature called "Multicast", which is supported by several network technologies (like Ethernet or InfiniBand), to create an efficient MPI_Bcast() implementation, especially for large communicators and small-sized messages. A preceding analysis of existing real-world applications leads to an algorithm which does not only perform well for synthetical benchmarks but also even better for a wide class of parallel applications. The finally derived broadcast has been implemented for the open source MPI library "Open MPI" using IP multicast. The achieved results prove that the new broadcast is usually always better than existing point-to-point implementations, as soon as the number of MPI processes exceeds the 8 node boundary. The performance gain reaches a factor of 4.9 on 342 nodes, because the new algorithm scales practically independently of the number of involved processes. / Die Broadcastfunktion MPI_Bcast() aus dem MPI-1.1 Standard ist eine der meistgenutzten kollektiven Kommunikationsoperationen des nachrichtenbasierten Programmierparadigmas. Diese Diplomarbeit nutzt die Multicastfähigkeit, die von mehreren Netzwerktechnologien (wie Ethernet oder InfiniBand) bereitgestellt wird, um eine effiziente MPI_Bcast() Implementation zu erschaffen, insbesondere für große Kommunikatoren und kleinere Nachrichtengrößen. Eine vorhergehende Analyse von existierenden parallelen Anwendungen führte dazu, dass der neue Algorithmus nicht nur bei synthetischen Benchmarks gut abschneidet, sondern sein Potential bei echten Anwendungen noch besser entfalten kann. Der letztendlich daraus entstandene Broadcast wurde für die Open-Source MPI Bibliothek "Open MPI" entwickelt und basiert auf IP Multicast. Die erreichten Ergebnisse belegen, dass der neue Broadcast üblicherweise immer besser als jegliche Punkt-zu-Punkt Implementierungen ist, sobald die Anzahl von MPI Prozessen die Grenze von 8 Knoten überschreitet. Der Geschwindigkeitszuwachs erreicht einen Faktor von 4,9 bei 342 Knoten, da der neue Algorithmus praktisch unabhängig von der Knotenzahl skaliert.

Cette thèse porte sur la simulation tridimensionnelle (3D) des décharges couronnes à l'aide du calcul haute performance. Lorsqu'on applique une impulsion de haute tension entre une pointe et un plan, les lignes de champ électrique fortement resserrées autour de la pointe induisent la propagation simultanée de plusieurs streamers et la formation d'une décharge couronne de structure arborescente. Dans ces conditions, seule une simulation électro-hydrodynamique 3D est apte à reproduire cette structure et fournir les ordres de grandeur de l'énergie déposée et de la concentration des espèces créées durant la phase de décharge. Cependant, cette simulation 3D est très consommatrice en temps et mémoire de calcul et n'est désormais accessible que grâce à l'accroissement permanent de la puissance des ordinateurs dédié au calcul haute performance. Dans le cadre d'une simulation électro-hydrodynamique 3D, une attention particulière doit être prise concernant l'efficacité des solveurs à résoudre les équations elliptiques 3D car leur contribution en termes de temps de calcul peut dépasser 80% du temps global de la simulation. Ainsi, une partie de manuscrit est consacrée aux tests de performances de méthodes de résolution d'équations elliptiques directes ou itératives telle que SOR R&B, BiCGSTAB et MUMPS, en utilisant le calcul massivement parallèle et les librairies MPI. Les calculs sont réalisés sur le supercalculateur EOS du réseau CALMIP, avec un nombre de cœurs de calcul allant jusqu'à 1800, et un nombre de mailles atteignant 8003 (soit plus 1/2 Milliard de mailles). Les tests de performances sont réalisés en statique sur le calcul du potentiel géométrique et en dynamique en propageant une densité de charge d'espace analytique caractéristique des streamers. Pour réaliser une simulation complète 3D de la décharge il faut également intégrer au programme un algorithme capable de résoudre les équations de transport de particule chargée à fort gradients de densité caractéristiques aux streamers. Dans ce manuscrit, l'algorithme MUSCL est testé dans différentes conditions de propagation d'un cube de densité (à vitesse homogène ou non homogène spatialement) afin d'optimiser le transport des densités d'espèces chargées impliquées. Le code 3D, conçu pour résoudre le modèle électro- hydrodynamique complet de la décharge (couplant les équations de transport, de Poisson et de cinétique réactionnelle) est ensuite validé par la confrontation des résultats 3D et 2D dans une condition de simulation présentant une symétrie de révolution autour de l'axe de propagation d'un streamer. Enfin, les premiers résultats des simulations 3D de la phase décharge avec la propagation d'un ou plusieurs streamers asymétriques sont présentés et analysés. Ces simulations permettent de suivre la structure arborescente de la décharge lorsqu'on applique une tension pulsée entre une pointe et un plan. L'initiation de la structure arborescente est étudiée en fonction de la position de spots plasmas et de leur influence sur l'amorçage des streamers. / This work is devoted to the three dimensional (3D) simulation of streamer corona discharges in air at atmospheric pressure using high-performance parallel computing. When a pulsed high-voltage is applied between a tip and a plane in air, the strong electric field lines constricted around the tip induce the simultaneous propagation of several streamers leading to a corona discharge with a tree structure. Only a true 3D electro-hydrodynamics simulation is able to reproduce this branching and to provide the orders of magnitude of the local deposited energy and the concentration of the species created during the discharge phase. However, such a 3D simulation which requires large computational memory and huge time calculation is nowadays accessible only when performed with massively parallel computation. In the field of 3D electro-hydrodynamics simulations, a special attention must be paid to the efficiency of solvers in solving 3D elliptic equations because their contribution can exceed 80% of the global computation time. Therefore, a specific chapter is devoted to test the performance of iterative and direct methods (such as SOR R&B, BiCGSTAB and MUMPS) in solving elliptic equations, using the massively parallel computation and the MPI library. The calculations are performed on the supercomputer EOS of the CALMIP network, with a number of computing cores and meshes increasing up to respectively 1800 and 8003 (i.e. more than 1/2 Billion meshes). The performances are compared for the calculation of the geometric potential and in a dynamic simulation conditions consisting in the propagation of an analytical space charge density characteristic of the streamers. To perform a complete 3D simulation of the streamer discharge, must also involve a robust algorithm able to solve the coupled conservation equations of the charged particle density with very sharp gradients characteristic of the streamers. In this manuscript, the MUSCL algorithm is tested under different propagation conditions of a cubic density (with uniform or non-uniform velocity field). The 3D code, designed to solve the complete electro-hydrodynamics model of the discharge (coupling the conservation equations, the Poisson equation and the chemical kinetics) is validated by comparing the 3D and 2D results in a simulation conditions presenting a rotational symmetry around the propagation axis of a mono-filamentary streamer. Finally, the first results of the 3D simulations of the discharge phase with the propagation of one or several asymmetric streamers are presented and analyzed. These simulations allow to follow the tree structure of a corona discharge when a pulsed voltage is applied between a tip and a plane. The ignition of the tree structure is studied as a function of the initial position of the plasma spots.

Made available in DSpace on 2016-06-02T19:05:26Z (GMT). No. of bitstreams: 1 1631.pdf: 1988300 bytes, checksum: e305adb917a8fdf720897942982390b7 (MD5) Previous issue date: 2007-08-24 / Different algorithms provide efficient scheduling of parallel applications on distributed and heterogeneous computational platforms, such as computational grids. Most scheduling algorithms for such environments require an application model represented by a directed acyclic graph (DAG), selecting tasks for execution according to their processing and communication characteristics. The obtainment of DAGs for real applications, however, is not a simple quest. The required knowledge about the application tasks and the communication among them, considering existing transmission cycles, harden the elaboration of appropriate graphs. Particularly, MPI programs, that represent a meaningful portion of existing parallel applications, usually present a cyclic communication model among the master and the processing nodes. This behavior prevents most scheduling algorithms to be employed as they recursively traverse the graphs to prioritize the tasks. In this sense, this work presents a mechanism for the automatic creation of DAGs for real MPI application originally developed for homogeneous clusters. In order to do so, applications go through a monitored execution in a cluster and the collected data are used for the elaboration of an appropriate DAGs. Data dependencies are identified and existing cycles among the tasks are eliminated. The HEFT scheduling algorithm is used to evaluate the application model and the schedule obtained is then automatically converted into an RSL (Resource Specification Language) file for execution in a grid with Globus. Results from running real applications and simulations show using the grid can be advantageous. / Algoritmos diferentes possibilitam o escalonamento eficiente de aplicações paralelas em plataformas computacionais heterogêneas e distribuídas, tais como grids computacionais. Vários algoritmos de escalonamento para esses ambientes necessitam de um modelo de aplicação representado por um grafo acíclico direcionado (GAD), selecionando tarefas para execução de acordo com suas características de comunicação e de processamento. A obtenção de um GAD para uma aplicação real, contudo, não é uma questão simples. O conhecimento necessário sobre as tarefas da aplicação e as comunicações entre elas, considerando ciclos de transmissão, dificulta a elaboração de um grafo apropriado. Particularmente, programas MPI, os quais representam uma parcela significativa das aplicações paralelas, apresentam um modelo de comunicação cíclico entre o nó master e os nós de processamento. Esse comportamento impede a utilização de muitos algoritmos de escalonamento devido ao fato de eles percorrerem o grafo recursivamente para priorizar as tarefas. Nesse sentido, esse trabalho apresenta um mecanismo para a criação automática de GADs para aplicações MPI reais originalmente desenvolvidas para clusters homogêneos. Para essa implementação, aplicações são monitoradas durante a execução em um cluster e os dados coletados são usados para a elaboração de um GADs apropriados. Dependências de dados são identificadas e ciclos existentes entre as tarefas são eliminados. O algoritmo de escalonamento HEFT é usado para avaliar o modelo de aplicação e o escalonamento obtido é então automaticamente convertido em um arquivo RSL (Resource Specification Language) para execução em um grid com Globus. Resultados de execuções de aplicações reais e simulações demonstram que o uso de grid pode ser vantajoso.

Made available in DSpace on 2014-12-17T14:56:04Z (GMT). No. of bitstreams: 1 ClaudioACF.pdf: 1310703 bytes, checksum: 20942a00fb9b1da452758bbafaf1b59d (MD5) Previous issue date: 2003-09-23 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / The last years have presented an increase in the acceptance and adoption of the parallel processing, as much for scientific computation of high performance as for applications of general intention. This acceptance has been favored mainly for the development of environments with massive parallel processing (MPP - Massively Parallel Processing) and of the distributed computation. A common point between distributed systems and MPPs architectures is the notion of message exchange, that allows the communication between processes. An environment of message exchange consists basically of a communication library that, acting as an extension of the programming languages that allow to the elaboration of applications parallel, such as C, C++ and Fortran. In the development of applications parallel, a basic aspect is on to the analysis of performance of the same ones. Several can be the metric ones used in this analysis: time of execution, efficiency in the use of the processing elements, scalability of the application with respect to the increase in the number of processors or to the increase of the instance of the treat problem. The establishment of models or mechanisms that allow this analysis can be a task sufficiently complicated considering parameters and involved degrees of freedom in the implementation of the parallel application. An joined alternative has been the use of collection tools and visualization of performance data, that allow the user to identify to points of strangulation and sources of inefficiency in an application. For an efficient visualization one becomes necessary to identify and to collect given relative to the execution of the application, stage this called instrumentation. In this work it is presented, initially, a study of the main techniques used in the collection of the performance data, and after that a detailed analysis of the main available tools is made that can be used in architectures parallel of the type to cluster Beowulf with Linux on X86 platform being used libraries of communication based in applications MPI - Message Passing Interface, such as LAM and MPICH. This analysis is validated on applications parallel bars that deal with the problems of the training of neural nets of the type perceptrons using retro-propagation. The gotten conclusions show to the potentiality and easinesses of the analyzed tools. / Os ?ltimos anos t?m apresentado um aumento na aceita??o e ado??o do processamento paralelo, tanto para computa??o cient?fica de alto desempenho como para aplica??es de prop?sito geral. Essa aceita??o tem sido favorecida principalmente pelo desenvolvimento dos ambientes com processamento maci?amente paralelo (MPP - Massively Parallel Processing) e da computa??o distribu?da. Um ponto comum entre sistemas distribu?dos e arquiteturas MPPs ? a no??o de troca de mensagem, que permite a comunica??o entre processos. Um ambiente de troca de mensagem consiste basicamente de uma biblioteca de comunica??o que, atuando como uma extens?o das linguagens de programa??o, permite a elabora??o de aplica??es paralelas, tais como C, C++ e Fortran. No desenvolvimento de aplica??es paralelas, um aspecto fundamental esta ligado ? an?lise de desempenho das mesmas. V?rias podem ser as m?tricas utilizadas nesta an?lise: tempo de execu??o, efici?ncia na utiliza??o dos elementos de processamento, escalabilidade da aplica??o com respeito ao aumento no n?mero de processadores ou ao aumento da inst?ncia do problema tratado. O estabelecimento de modelos ou mecanismos que permitam esta an?lise pode ser uma tarefa bastante complicada considerando-se par?metros e graus de liberdade envolvidos na implementa??o da aplica??o paralela. Uma alternativa encontrada tem sido a utiliza??o de ferramentas de coleta e visualiza??o de dados de desempenho, que permitem ao usu?rio identificar pontos de estrangulamento e fontes de inefici?ncia em uma aplica??o. Para uma visualiza??o eficiente torna-se necess?rio identificar e coletar dados relativos ? execu??o da aplica??o, etapa esta denominada instrumenta??o. Neste trabalho ? apresentado, inicialmente, um estudo das principais t?cnicas utilizadas na coleta dos dados de desempenho, e em seguida ? feita uma an?lise detalhada das principais ferramentas dispon?veis que podem ser utilizadas em arquiteturas paralelas do tipo Cluster Beowulf com Linux sobre plataforma X86 utilizando bibliotecas de comunica??o baseadas em aplica??es MPI - Message Passing Interface, tais como LAM e MPICH . Esta an?lise ? validada sobre aplica??es paralelas que tratam do problema do treinamento de redes neurais do tipo perceptrons usando retropropaga??o. As conclus?es obtidas mostram as potencialidade e facilidades das ferramentas analisadas.

La turbine Pelton est une turbine hydraulique dont le fonctionnement se caractérise par l’interaction d’un jet d’eau avec les augets d’une roue. Cette étude a pour but de comprendre les phénomènes influençant le jet et son interaction avec les augets. Pour cela deux actions différentes ont été menées. Une première a visé à caractériser expérimentalement la fragmentation d’un jet de turbine Pelton. La seconde s’est attachée à développer une méthode numérique pouvant mener`à la simulation précise de jets réels de turbines Pelton. La partie expérimentale a permis de déterminer le mode de fragmentation de ces jets (atomisation turbulente), mais aussi l’influence de la rugosité des parois de l’injecteur sur les performances de la turbine. La participation de ce travail à un projet expérimental a permis de montrer l’influence de l’écoulement en sortie d’injecteur sur la fragmentation du jet. Les phénomènes physiques influençant principalement l’évolution du jet ont ainsi été déterminés. La partie numérique a eu pour but de mettre en place une méthode permettant de simuler l’évolution d’un jet de turbine Pelton (fragmentation) et son interaction avec un auget. Etant donnés les progrès de la méthode SPH-ALE pour la simulation d’impact de jets pour les turbines Pelton, il a été décidé d’adapter cette méthode pour les simulations visées. Ainsi une étude du choix de la vitesse des interfaces de problème de Riemann a permis de réaliser un modèle multiphase stable pour les forts rapports de densité (eau-air). Cette méthode s’est avérée garantir les propriétés de continuité de vitesse normale et de pression à l’interface entre les fluides. L’ajout des phénomènes de tension de surface s’est fait par l’adaptation du modèle CSF (Continuum Surface Force) et le développement d’un second modèle nommé Laplace Law Pressure Correction (LLPC).L’intégration du saut de pression dans le solveur de Riemann a nécessité une étude précise du calcul de la courbure et a permis d’améliorer la simulation de loi de Laplace. La méthode numérique a été ensuite validée sur les cas académiques d’onde gravitaire, de rupture de barrage et d’oscillation de goutte. Les ressources en mémoire et le temps de calcul associé à cette méthode ont nécessité la parallélisation du code de calcul. Le caractère lagrangien de la méthode a très largement influencé la méthode de découpe de domaine pour permettre une bonne répartition de la charge de calcul entre les différents processeurs. En conclusion les phénomènes physiques influençant la fragmentation de jets issus d’injecteurs de turbine Pelton sont désormais mieux connus et ils ont pu être introduits dans la méthode numérique. Les prochains développements porteront sur la simulation de jets dont la condition d’entrée s’attachera à être représentative des caractéristiques d’un écoulement en sortie d’un injecteur de turbine Pelton. / A Pelton turbine is characterized by a water jet which is impacting rotating buckets. The main goal of this study is to understand the phenomena which are impacting the jet and its interaction with the bucket. This study was considering two main works. One is considering experiments which allow determining the jet fragmentation. The second part considers development of a numerical code able to reproduce phenomena linked to Pelton jet fragmentation. The experimental part succeeds to associate Pelton jet behavior with mode of jet fragmentation (turbulent dispersion) and shows the impact of hydraulic roughness on Pelton turbine performances. The access to experimental results from a project involving this PhD work, demonstrates the role of the inlet velocity/turbulence profile on the jet fragmentation. The numerical part used the SPH-ALE (Smoothed Particle Hydrodynamics - Arbitrary Lagrange Euler) method to implement physical models linked with jet fragmentation. This choice was done because of its ability to predict pressure fields resulting of the interaction of a water jet and a rotating bucket. A multiphase model was developed based on a modification of the velocity of the interface of Riemann problem. This model does not diffuse the interface and recovers continuity of normal velocity and pressure at the interface between both fluids. Surface tension effect was implemented through an adaptation of the CSF (Continuum Surface Force) model and through amodel called LLPC for Laplace Law Pressure Correction. A study of the computational methods to determine the interface curvature was performed for the integration of the pressure jump in the Riemann solver. Validation was done on academicals test cases as gravity waves, dam breakor droplet oscillations. The numerical code was parallelized to perform large numerical simulations.To conclude, the numerical code integrates physical phenomena which were shown as important in the experiments. The developments will try to perform jet simulation with inlet condition which will be representative of flow conditions at the outlet of a Pelon turbine injector.