Dissertations / Theses on the topic 'Parallelisation'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Parallelisation.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Schuilenburg, Alexander Marius. "Parallelisation of algorithms." Master's thesis, University of Cape Town, 1990. http://hdl.handle.net/11427/22211.
Full textCalinescu, Radu C. "Architecture-independent loop parallelisation." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299406.
Full textOrange, David Joseph. "Parallelisation on MIMD architectures." Thesis, University of Liverpool, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.317211.
Full textNagy, Lesleis. "Parallelisation of micromagnetic simulations." Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/20433.
Full textZhou, Ruoyu. "Guided automatic binary parallelisation." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/274753.
Full textJouvelot, Pierre. "Parallelisation semantique : une approche denotationnelle non-standard pour la parallelisation de programmes imperatifs sequentiels." Paris 6, 1986. http://www.theses.fr/1986PA066559.
Full textBotinčan, Matko. "Formal verification-driven parallelisation synthesis." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/274136.
Full textBoulet, Pierre. "Outils pour la parallelisation automatique." Lyon, École normale supérieure (sciences), 1996. http://www.theses.fr/1996ENSL0013.
Full textTournavitis, Georgios. "Profile-driven parallelisation of sequential programs." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5287.
Full textBratvold, Tore Andreas. "Skeleton-based parallelisation of functional programs." Thesis, Heriot-Watt University, 1994. http://hdl.handle.net/10399/1355.
Full textRybin, Pavel. "Speculative parallelisation with dynamic data structures." Thesis, University of Manchester, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.525935.
Full textSilber, Georges-André. "Parallelisation automatique par insertion de directives." Lyon, École normale supérieure (sciences), 1999. http://www.theses.fr/1999ENSL0139.
Full textGdura, Youssef Omran. "A new parallelisation technique for heterogeneous CPUs." Thesis, University of Glasgow, 2012. http://theses.gla.ac.uk/3406/.
Full textMak, Jonathan Chee Heng. "Facilitating program parallelisation : a profiling-based approach." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609451.
Full textBOURGET, DANIEL. "Compilation et parallelisation d'un langage sans variable." Paris 6, 1989. http://www.theses.fr/1989PA066673.
Full textCollard, Jean-François, and L. BOUGE. "Parallelisation automatique des programmes a controle dynamique." Paris 6, 1995. http://www.theses.fr/1995PA066056.
Full textDion, Michèle. "Alignement et distribution pour la parallelisation automatique." Lyon, École normale supérieure (sciences), 1996. http://www.theses.fr/1996ENSL0014.
Full textLabidi, Mohamed Khalil. "Parallelisation of hybrid metaheuristics for COP solving." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLED029/document.
Full textCombinatorial Optimization (CO) is an area of research that is in a constant progress. Solving a Combinatorial Optimization Problem (COP) consists essentially in finding the best solution (s) in a set of feasible solutions called a search space that is usually exponential in cardinality in the size of the problem. To solve COPs, several methods have been proposed in the literature. A distinction is made mainly between exact methods and approximation methods. Since it is not possible to aim for an exact resolution of NP-Complete problems when the size of the problem exceeds a certain threshold, researchers have increasingly used Hybrid (HA) or parallel computing algorithms in recent decades. In this thesis we consider the COP class of Survivability Network Design Problems. We present an approximation parallel hybrid algorithm based on a greedy algorithm, a Lagrangian relaxation algorithm and a genetic algorithm which produces both lower and upper bounds for flow-based formulations. In order to validate the proposed approach, a series of experiments is carried out on several applications: the k-Edge-Connected Hop-Constrained Network Design Problem (kHNDP) when L = 2,3, The problem of the Steiner k-Edge-Connected Network Design Problem (SkESNDP) and then, two more general problems namely the kHNDP when L >= 2 and the k-Edge-Connected Network Design Problem (kESNDP). The experimental study of the parallelisation is presented after that. In the last part of this work, we present a two parallel exact algorithms: a distributed Branch-and-Bound and a distributed Branch-and-Cut. A series of experiments has been made on a cluster of 128 processors and interesting speedups has been reached in kHNDP resolution when k=3 and L=3
Lewis, Tim. "Static dependency analysis of recursive structures for parallelisation." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/24832.
Full textEhlers, Thorsten [Verfasser]. "SAT and CP - Parallelisation and Applications / Thorsten Ehlers." Kiel : Universitätsbibliothek Kiel, 2017. http://d-nb.info/113755522X/34.
Full textAbbas, Naeem. "Runtime Parallelisation Switching for MPEG4 Encoder on MPSoC." Thesis, KTH, Elektronik- och datorsystem, ECS, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-144038.
Full textChen, Xian. "Automatic parallelisation for a class of URE problems." Thesis, University of Newcastle Upon Tyne, 1995. http://hdl.handle.net/10443/1974.
Full textCook, Andrew. "Using proof in transformation synthesis for automatic parallelisation." Thesis, Heriot-Watt University, 2001. http://hdl.handle.net/10399/462.
Full textROUSSEL-RAGOT, PIERRE. "La methode du recuit simule : acceleration et parallelisation." Paris 6, 1990. http://www.theses.fr/1990PA066305.
Full textPowell, Daniel Christopher. "Lightweight speculative support for aggressive auto-parallelisation tools." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10566.
Full textHewitt, Neil. "Parallelisation and use of large-scale atomic structure codes." Thesis, Queen's University Belfast, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337040.
Full textMazzoni, Christophe. "Construction d'un modele numerique de terrain : methodes et parallelisation." Paris 11, 1995. http://www.theses.fr/1995PA112220.
Full textAmmarguellat, Zahira. "Restructuration des programmes fortran en vue de leur parallelisation." Paris 6, 1988. http://www.theses.fr/1988PA066021.
Full textDUPONT, DE DINECHIN BENOIT. "Parallelisation de code et architectures superscalaires a controle statique." Paris 6, 1991. http://www.theses.fr/1991PA066722.
Full textPaul, Christian. "Etudes sur la parallelisation d'algorithmes de gestion de production." Nantes, 1993. http://www.theses.fr/1993NANT2098.
Full textChen, Xinuo. "Parallelisation for data-intensive applications over peer-to-peer networks." Thesis, University of Warwick, 2009. http://wrap.warwick.ac.uk/3640/.
Full textChao, Daphne (Yu Fen). "MDRIP: A Hybrid Approach to Parallelisation of Discrete Event Simulation." Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1076.
Full textBENAICHOUCHE, MOHAMED. "Parallelisation des methodes de recherche arborescente dans des environnements distribues." Paris 6, 1996. http://www.theses.fr/1996PA066029.
Full textCudel, Christophe. "Parallelisation d'algorithmes de compression d'images sur un reseau de transputers." Reims, 1995. http://www.theses.fr/1995REIMS021.
Full textBaloglu, Maximilian Volkan. "Parallelisation and Performance Analysis of a TreeSPH Code for Galaxy Simulations." Thesis, KTH, Numerisk analys, NA, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-147340.
Full textInom kosmologiska simulationer är den Lagrangianska metoden Smoothed Particle Hydrodynamics en vanligt förekommande metod för att täcka gasdynamik och kombineras med trädalgortimer för långdistanspotentialer, exempelvis Barnes-Huts metod för att inkludera självgravitation och effektivt konstruera listor med de närmaste grannarna. I detta examensarbete parallelliseras en så kallad TreeSPH-kod med hjälp av MPI, därefter analyseras prestandan. Gällande domändekomposition av processerna så undersöks strukturen av en octree där rymdfyllande kurvor appliceras för att uppnå en väl fungerande dynamisk lastbalansering. För en effektiv parallell SPH beräkning föreslås en ny metod med lokal randbehandling för att reducera kommunikation.
TAWBI, NADIA. "Parallelisation automatique : estimation des durees d'execution et allocation statique de processeurs." Paris 6, 1991. http://www.theses.fr/1991PA066355.
Full textADLE, ROXANE. "Outils de parallelisation automatique des programmes denses pour les structures creuses." Evry-Val d'Essonne, 1999. http://www.theses.fr/1999EVRY0007.
Full textDussert, Nathalie. "Parallelisation d'un langage fonctionnel selon le modèle a flots de données." Paris, ENST, 1996. http://www.theses.fr/1996ENST0043.
Full textChantemargue, Fabrice, and Jean Gallice. "Segmentation d'images par approche de type division-fusion : schemas de parallelisation." Clermont-Ferrand 2, 1991. http://www.theses.fr/1991CLF21395.
Full textLoechner, Vincent. "Contribution a l'etude des polyedres parametres et applications en parallelisation automatique." Strasbourg 1, 1997. http://www.theses.fr/1997STR13242.
Full textGrößlinger, Armin. "The challenges of non-linear parameters and variables in automatic loop parallelisation /." kostenfrei, 2009. http://www.opus-bayern.de/uni-passau/volltexte/2009/1789/.
Full textLegrand, Pascal. "Schemas de parallelisation d'applications de traitement d'images sur la machine parallele transvision." Clermont-Ferrand 2, 1995. http://www.theses.fr/1995CLF21740.
Full textDavid, Pierre. "Analyse semantique des programmes en langage c en vue de leur parallelisation." Paris 6, 1991. http://www.theses.fr/1991PA066088.
Full textKouicem, Nadia. "Parallelisation de l'algorithme du recuit simule : implantation et analyse de plusieurs algorithmes." Paris 5, 1992. http://www.theses.fr/1992PA05S011.
Full textMans, Bernard. "Contribution a l'algorithmique non numerique parallele : parallelisation de methodes de recherche arborescentes." Paris 6, 1992. http://www.theses.fr/1992PA066239.
Full textMALLET, OLIVIER. "Interpretation abstraite appliquee a la compilation et la parallelisation en programmation logique." Palaiseau, École polytechnique, 1992. http://www.theses.fr/1992EPXX0011.
Full textBolis, Alessandro. "Fourier spectral/hp element method : investigation of time-stepping and parallelisation strategies." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/25140.
Full textDidier, Keryan. "Contributions to the safe and efficient parallelisation of hard real-time systems." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS485.
Full textThe implementation of hard real-time systems involves a lot of steps that are traditionally manual. The growing complexity of such systems and hardware platforms on which they are executed makes increasingly difficult to ensure the correctness of those steps, in particular for the timing properties of the system on multi-core platform. This leads to the need for automation of the whole implementation process. In this thesis, we provide a method for automatic parallel implementation of real-time systems. The method bridge the gap between real-time systems implementation and compilation by integrating parallelization, scheduling, memory allocation, and code generation around a precise timing model and analysis that rely on strong hypothesis on the execution platform and the form of the generated code. The thesis also provides an implementation model for dataflow multithreaded software. Using the same formal ground as the first contribution, the dataflow synchronous formalisms, the model represents multithreaded implementations in a Lustre-like language extended with mapping annotations. This model allows formal reasoning on the correctness of all the mapping decisions used to build the implementation. We propose an approach toward the proof of correctness of the functionality of the implementation with respect to the functional specifications
ORTEGA-AGUILAR, AGUSTIN RAYMUNDO. "Parallelisation d'un langage fonctionnel sur une machine parallele avec une architecture non conventionnelle." Paris 6, 1995. http://www.theses.fr/1995PA066421.
Full textDUMAY, ALAIN. "Traitement des indexations non lineaires en parallelisation automatique : une methode de linearisation contextuelle." Paris 6, 1992. http://www.theses.fr/1992PA066461.
Full text