Tesis sobre el tema "Metodo parallelo"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Metodo parallelo".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Synn, Sang-Youp. "Practical domain decomposition approaches for parallel finite element analysis". Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/17032.
Texto completoSu, (Philip) Shin-Chen. "Parallel subdomain method for massively parallel computers". Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/17376.
Texto completoPippig, Michael. "Massively Parallel, Fast Fourier Transforms and Particle-Mesh Methods: Massiv parallele schnelle Fourier-Transformationen und Teilchen-Gitter-Methoden". Doctoral thesis, Universitätsverlag der Technischen Universität Chemnitz, 2015. https://monarch.qucosa.de/id/qucosa%3A20398.
Texto completoDie vorliegende Dissertation beschreibt einen modularisierten Blick auf die Struktur schneller numerischer Methoden für die Berechnung der Coulomb-Wechselwirkungen zwischen Ladungen im dreidimensionalen Raum. Die gemeinsame Struktur ist geprägt durch drei selbstständige und auf einander aufbauenden Algorithmen, nämlich der schnellen Fourier-Transformation (FFT), der nicht äquidistanten schnellen Fourier-Transformation (NFFT) und der NFFT-basierten Teilchen-Gitter-Methode (P²NFFT). Für jeden dieser Algorithmen werden Verbesserungen und parallele Implementierungen vorgestellt mit besonderem Augenmerk auf massiv paralleler Skalierbarkeit. Im Kontext der FFT werden parallele Algorithmen aus den Hardware adaptiven Modulen der FFTW Softwarebibliothek zusammengesetzt. Die neuen NFFT-Konzepte beinhalten abgeschnittene NFFT, Versatz, analytische Differentiation und optimierte Entfaltung im Fourier-Raum bezüglich des mittleren quadratischen Aliasfehlers. Mit Hilfe dieser Verallgemeinerungen bietet die NFFT einen vereinheitlichten Zugang zu Teilchen-Gitter-Methoden. Insbesondere gemischt periodische Randbedingungen werden einheitlich behandelt und Versatz wird effizienter umgesetzt. Heuristiken für die Parameterwahl werden auf Basis sorgfältiger Fehlerabschätzungen angegeben.
Baladron, Pezoa Javier. "Exploring the neural codes using parallel hardware". Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00847333.
Texto completoAdemoyero, Oreoluwa Oyinlade. "A parallel Galerkin boundary element method". Thesis, University of Hertfordshire, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410144.
Texto completoJackson, Benjamin Grant. "Parallel methods for short read assembly". [Ames, Iowa : Iowa State University], 2009.
Buscar texto completoKazemi, Noj. "Circuit analysis of a parallel plate waveguide". Thesis, KTH, Elektroteknisk teori och konstruktion, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-222617.
Texto completoM°alet med detta arbete var att modellera en fyr-portars v°agledare somen simpel elektrisk krets, genom att f¨orst b¨orja med en tv°a-portars sedantre-portars -v°agledare. Detta arbete var baserat p°a Nathan Marcuvitz bokWaveguide handbook, d¨arav s¨oktes det en analytisk l¨osning f¨or kretsparametrarna.F¨or att kunna f°a en analytisk l¨osning, studerades tre metoder;Variationsmetoden, Integralsekvationsmetoden samt den Statiskametoden.Av dessa tre metoder valdes den sistn¨amnda, p°a grund av dess styrka medatt f¨orenkla randvillkoren. M°alet att modellera en fyr-portars samt en treportarsv°agledare var alldeles f¨or komplicerat. Detta ledde till att m°alet¨andrades till att f¨ors¨oka f°a en h¨ogre precision p°a den befintliga kretsmodellenf¨or en tv°a portars v°agledare, genom att l¨osa ut flera termer till kretsparametern.Detta gjordes d°a Marcuvitz endast hanterade de tv°a f¨orstamoderna korrekt, samt att det inte framgick ifall kretsmodellen ¨ar stabil f¨orh¨ogre ordningar av Taylor serier. I slut¨andan l¨ostes en kretsmodel f¨or env°agledare med en iris som hanterar de f¨orsta 16 moderna korrekt. Genomatt kolla p°a de dispersiva egenskaperna f¨or kretsen, kunde en j¨amf¨orelse medsimuleringsprogrammet CST Microwave Studio ske, d¨ar slutsatsen blev attkretsmodellen gav goda resultat upp till 2b/ < 1. Det visade ¨aven sig attprecisionen var ungef¨ar densamma som den kretsmodell som°aterfinns i Waveguidehandbook, men det kan n¨amnas att precisionen ¨ar minimalt b¨attref¨or den kretsmodell som togs fram i detta arbete. En sak som uppt¨acktes underdetta arbete var att restriktionen som n¨amns i Waveguide handbook f¨orfallet n¨ar gapet f¨or irisen ¨ar centrerad st¨ammer inte, den b¨or vara 2b/ < 1.Dessutom visade det sig att kretsmodellen fortfarande var stabil f¨or h¨ogreordningar av Taylorserier, i detta fall upp till den 16:e ordningen.
Driver, Maria Sosonkina Jr. "Parallel Sparse Linear Algebra for Homotopy Methods". Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30718.
Texto completoPh. D.
Lecomber, David. "Methods of BSP programming". Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299799.
Texto completoMüller, Björn. "Parallel Finite Element Method with FEAP 8.2". Darmstadt TU, Fachgebiet Numerische Berechnungsverfahren im Maschinenbau, 2009. http://tuprints.ulb.tu-darmstadt.de/1336/.
Texto completoOu, Rongfu. "Parallel numerical integration methods for nonlinear dynamics". Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/18181.
Texto completoWood, Kenneth Robert. "Parallel logic simulation and applied formal methods". Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315774.
Texto completoPotgieter, Andrew. "A Parallel Multidimensional Weighted Histogram Analysis Method". Thesis, University of Cape Town, 2014. http://pubs.cs.uct.ac.za/archive/00000986/.
Texto completoKlene, Michael. "Parallel implementation of the MC-SCF method". Thesis, King's College London (University of London), 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397278.
Texto completoDavidson, David Bruce. "Parallel algorithms for electromagnetic moment method formulations". Thesis, Stellenbosch : Stellenbosch University, 1991. http://hdl.handle.net/10019.1/69369.
Texto completoENGLISH ABSTRACT: This dissertation investigates the moment method solution of electromagnetic radiation and scattering problems using parallel computers. In particular, electromagnetically large problems with arbitrary geometries are considered. Such problems require a large number of unknowns to obtain adequate approximate solutions, and make great computational demands. This dissertation considers in detail the efficient exploitation of the potential offered by parallel computers for solving such problems, and in particular the class of local memory Multiple Instruction, Multiple Data systems. A brief history of parallel computing is presented. Methods for quantifying the efficiency of parallel algorithms are reviewed. The use of pseudo-code for documenting algorithms is discussed and a pseudo-code notation is defined that is used in later chapters. A new parallel conjugate gradient algorithm, suitable for the solution of general systems of linear equations with complex values, is presented. A method is described to handle efficiently the Hermitian transpose of the matrix required by the algorithm. Careful attention is paid to the theoretical analysis of the algorithm's parallel properties (in particular, speed-up and efficiency). Pseudo-code is presented for the algorithms. Timing results for a moment method code, running on a transputer array and using this conjugate gradient solver, are presented and compared to the theoretical predictions. A parallel LU algorithm is described and documented in pseudo-code. A new graphical description of the algorithm is presented that simplifies the identification of the parallelism and the analysis of the algorithm. The use of formal methods for extracting parallelism via the use of invariants is presented and new examples given. The speed-up and efficiency of the algorithm are analyzed theoretically, using new methods that are simpler than those described in the literature. Techniques for optimizing the efficiency of parallel algorithms are introduced, and illustrated with pseudo-code. New parallel forward and backward substitution algorithms using the data distribution required for the parallel LV algorithm are described, and documented with pseudo-code. Results obtained with a Occam 2 moment method code running on a transputer array using these parallel LU solver and substitution algorithms are presented and compared with the theoretical predictions. PARNEC, a new Occam 2 implementation of the thin-wire core of NEC2, is discussed. The basic 'theory of NEC2 is reviewed. Problems with early attempts at combining Occam and FORTRAN are reported. Methodologies for re-coding an old code written in an unstructured language in a. modern structured language are discussed. Methods of parallelizing the matrix generation are discussed. The accuracy of large moment method formulations is investigated, as is the effect of machine precision on the solutions. The use of the biconjugate gradient method to accelerate convergence is briefly considered and rejected. The increased size of problem that can be handled by PARNEC, running on a transputer array, is demonstrated. Conclusions are dra.wn regarding the contributions of this dissertation to the development of efficient parallel electromagnetic moment method algorithms.
AFRIKAANSE OPSOMMING: Hierdie proefskrif ondersoek die momentmetode oplossing van elektromagnetiese straling- en strooiingprobleme d.m.v. multiverwerkers. In besonder, elektromagneties groot probleme met arbitrere geometriee word beskou. Sulke probleme vereis 'n groot aantal onbekendes om 'n voldoende benaderde oplossing te kry, en stel groot berekenings vereistes. Hierdie proefskrif beskou in detail die doeltreffende benutting van die potensiaal wat multiverwerkers vir sulke problem hied, in besonder die klas van lokale geheue Veelvoudige Instruksie, Veelvoudige Data stelsels. 'n Kort geskiedenis van multiverwerkers word gegee. Metodes vir die kwantifisering van die effektiwiteit van multiverwerkers word hersien. Die . gebruik van pseudokode vir die dokumentering van algoritmes word bespreek en 'n pseudokode notasie word gedefinieer wat gebruik word in latere hoofstukke. 'n Nuwe parallelle toegevoegde helling-algoritme wat geskik is vir die oplossing van algemene stelsels van lineere vergelykings word aangebied. 'n Metode word beskryf om op 'n doeltreffende wyse die Hermitiese transponent van die matriks, wat deur die algoritme benodig word, te hanteer. Sorgvuldige aandag word aan die teoretiese analise van die paralleleienskappe van die algoritme gegee (in die besonder, versnelling en doeltreffendheid). Pseudokode word aangebied vir die algoritmes. Resultate vir die looptyd van 'n momentmetode program, wat op 'n transputerskikking loop, word gegee en vergelyk met die teoretiese voorspellings. 'n Parallelle L U algoritme word beskryf en gedokumenteer in pseudokode. 'n Nuwe grafiese beskrywing van die algoritme, wat die identifikasie van parallelisme en die analise van die algoritme vergemaklik, word gegee. Die gebruik van formele metodes vir die onttrekking van parallelisme d.m.v. invariante word getoon en nuwe voorbeelde word gegee. Die versnelling en doeltreffendheid van die algoritme word teoreties geanaliseer, d.m.v. nuwe metodes wat eenvoudiger is as die wat in die literatuur beskryf word. Tegnieke vir die optimering van die doeltreffendheid van parallelle algoritmes word ingevoer, en gelllustreer met pseudokode. Nuwe parallelle voor- en truwaarts-substitusie algoritmes wat die data verspreiding van die parallelle LU algoritme gebruik word beskryf, en gedokumenteer met pseudokode. Resultate verkry met 'n Occam 2 momentmetode program wat op 'n transputerskikking loop en die parallelle L U en substit'usie algoritmes gebruik, word gegee en vergelyk met teoretiese voorspellings. PARNEC, 'n nuwe Occam 2 implementering van die dun-draad kern van NEC2, word bespreek. Die basiese teorie van NEC2 word opgesom. Verslag word gedoen oor probleme met vroee pogings orh Occam en FORTRAN te kombineer. Metodes om 'n ou program, geskryf in 'n ongestruktureerde taal, in 'n moderne gestruktureerde taal te herskryf word bespreek. Metodes om die matriksopwekking te paralleliseer word bespreek. Die akkuraatheid van groot momentmetode formulerings word ondersoek, asook die effek van masjienpresisie op die oplossings. Die gebruik van die dubbeltoegevoegde helling-metode om konvergensie te versnel word kortliks beskou en verwerp. Die vergrote probleemgrootte, wat met PARNEC op- 'n transputerskikking uitgevoer kan word, word gedemonstreer. Gevolgtrekkings word gemaak rakende die bydraes van hierdie proefskrif tot die ontwikkeling van doeltreffende parallelle elektromagnetiese momentmetode algoritmes.
Tofts, Chris. "Proof methods and pragmatics for parallel programming". Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/14544.
Texto completoWu, Fei. "Parallel computational methods for constrained mechanical systems". Diss., The University of Arizona, 1997. http://hdl.handle.net/10150/282561.
Texto completoCoomer, Rob. "Parallel iterative methods in semiconductor device modelling". Thesis, University of Bath, 1994. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359852.
Texto completoLinardakis, Leonidas. "A Parallel Two Dimensional Delaunay Decoupling Method". W&M ScholarWorks, 2003. https://scholarworks.wm.edu/etd/1539626828.
Texto completoJohnson, Anne. "Parallelising implicit methods on unstructured grids". Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320231.
Texto completoSellami, Hatem. "Parallel simulation of marked graphs". Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/13045.
Texto completoChen, Y. "Formal methods for global synchrony". Thesis, University of Oxford, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365295.
Texto completoKopek, Christopher Vincent. "Parallel intrusion detection systems for high speed networks using the divided data parallel method". Electronic thesis, 2007. http://dspace.zsr.wfu.edu/jspui/handle/10339/191.
Texto completoChuang, Shih-Chang. "Parallel methods for high-performance finite element methods based on sparsity". Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/18177.
Texto completoPieskä, J. (Jali). "Domain decomposition methods for continuous casting problem". Doctoral thesis, University of Oulu, 2004. http://urn.fi/urn:isbn:9514274679.
Texto completoIbraev, Suiunbek. "A new parallel method for verified global optimization". [S.l.] : [s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=963452304.
Texto completoFleissner, Florian. "Parallel object oriented simulation with Lagrangian particle methods". Aachen Shaker, 2009. http://d-nb.info/1000976742/04.
Texto completoSaltvik, Ingar. "Parallel Methods for Real-Time Visualization of Snow". Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10097.
Texto completoUsing computer generated imaging is becoming more and more popular in areas such as computer gaming, movie industry and simulation. A familiar scene in the winter months for most us in the Nordic countries is snow. This thesis discusses some of the complex numerical algorithms behind snow simulations. Previous methods for snow simulation have either covered only a very limited aspect of snow, or have been unsuitable for real-time performance. In this thesis, some of these methods are combined into a model for real-time snow simulation that handles both snowflake motion through the air, wind simulation, and accumulation of snow on objects and the ground. With a goal towards achieving real-time performance with more than 25 frames per second, some new parallel methods for the snow model are introduced. Focus is set on efficient parallelization on new SMP and multi-core computer systems. The algorithms are first parallelized in a pure data-parallel manner by dividing the data structures among threads. This scheme is then improved by overlapping inherently sequential algorithms with computations for the following frame, to eliminate processor idle time. A speedup of 1.9 on modern dual CPU workstations is achieved, while displaying a visually satisfying result in real-time. By utilizing Hyper-Threading enabled dual CPU systems, the speedup is further improved to 2.0.
Chelliah, Joel Eelaraj. "Parallel Methods for Projection on Strongly Curved Surfaces". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-14979.
Texto completoMehdi, Malika. "PARALLEL HYBRID OPTIMIZATION METHODS FOR PERMUTATION BASED PROBLEMS". Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2011. http://tel.archives-ouvertes.fr/tel-00841962.
Texto completoAndersen, Johannes Harder. "Linear programming methods for fine grain parallel computers". Thesis, Brunel University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241255.
Texto completo朱展強 y Chin-keung Chu. "Parallel computation for time domain boundary element method". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31220678.
Texto completoAzizian, Kaveh. "Optimum-synthesis methods for cable-driven parallel mechanisms". Thesis, Université Laval, 2012. http://www.theses.ulaval.ca/2012/29255/29255.pdf.
Texto completoTakeda, Kenji. "Parallel discrete vortex methods for viscous flow simulation". Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287340.
Texto completoDuller, A. W. G. "Parallel computation applied to the finite element method". Thesis, University of Bristol, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376605.
Texto completoArchibald, Thomas Welsh. "Parallel iterative solution methods for Markov decision processes". Thesis, University of Edinburgh, 1992. http://hdl.handle.net/1842/14792.
Texto completoNavarro, Guerrero Cristóbal Alejandro. "Parallel methods for classical and disordered Spin models". Tesis, Universidad de Chile, 2015. http://repositorio.uchile.cl/handle/2250/136491.
Texto completoEn las últimas décadas han crecido la cantidad de trabajos que buscan encontrar metodos eficientes que describan el comportamiento macroscópico de los sistemas de spin, a partir de una definición microscópica. Los resultados que se obtienen de estos sistemas no solo sirven a la comunidad fı́sica, sino también a otras áreas como dinámica molecular, redes sociales o problemas de optimización, entre otros. El hecho de que los sistemas de spin puedan explicar fenómenos de otras áreas ha generado un interés global en el tema. El problema es, sin embargo, que el costo computacional de los métodos involucrados llega a ser muy alto para fines prácticos. Por esto, es de gran interés estudiar como la computación paralela, combinada con nuevas estrategias algorı́tmicas, puede generar una mejora en velocidad y eficiencia sobre los metodos actuales. En esta tesis se presentan dos contribuciones; (1) un algoritmo exacto multi-core distribuido de tipo transfer matrix y (2) un método Monte Carlo multi-GPU para la sim- ulación del modelo 3D Random Field Ising Model (RFIM). La primera contribución toma ventaja de las relaciones jerárquicas encontradas en el espacio de configuraciones del problema para agruparlas en árboles de familias que se solucionan en paralelo. La segunda contribución extiende el método Exchange Monte Carlo como un algoritmo paralelo multi-GPU que in- cluye una fase de adaptación de temperaturas para mejorar la calidad de la simulación en las zonas de temperatura mas complejas de manera dinámica. Los resultados muestran que el nuevo algoritmo de transfer matrix reduce el espacio de configuraciones desde O(4^m ) a O(3^m ) y logra un fixed-size speedup casi lineal con aproxi- madamente 90% de eficiencia al solucionar los problemas de mayor tamaño. Para el método multi-GPU Monte Carlo, se proponen dos niveles de paralelismo; local, que escala con GPUs mas rápidas y global, que escala con múltiples GPUs. El método logra una aceleración de entre uno y dos ordenes de magnitud respecto a una implementación de referencia en CPU, y su paralelismo escala con aproximadamente 99% de eficiencia. La estrategia adaptativa de distribución de temperaturas incrementa la taza de intercambio en las zonas que estaban mas comprometidas sin aumentar la taza en el resto de las zonas, generando una simulación mas rápida aun y de mejor calidad a que si se usara una distribución uniforme de temperaturas. Las contribuciones logradas han permitido obtener nuevos resultados para el área de la fı́sica, como el calculo de la matriz transferencia para el kagome lattice en m = 9 y la simulación del modelo 3D Random Field Ising Model en L = {32, 64}.
CULLEY, ROBERT J. "FDTD METHODS USING PARALLEL COMPUTATIONS AND HARDWARE OPTIMIZATION". University of Cincinnati / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1182524209.
Texto completoWatkins, Rees Collyer. "Algorithmic skeletons as a method of parallel programming". Thesis, Rhodes University, 1993. http://hdl.handle.net/10962/d1004889.
Texto completoMcElfish, Erin Marie. "Methods for parallel amplification of single DNA molecules". Diss., [La Jolla] : University of California, San Diego, 2009. http://wwwlib.umi.com/cr/ucsd/fullcit?p1467961.
Texto completoTitle from first page of PDF file (viewed September 17, 2009). Available via ProQuest Digital Dissertations. Includes bibliographical references (p.76-77).
Chu, Chin-keung. "Parallel computation for time domain boundary element method /". Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20565574.
Texto completoLi, Jueyou. "Distributed and parallel methods for structural convex optimization". Thesis, Federation University Australia, 2014. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/81614.
Texto completoDoctor of Philosophy
Mahawar, Hemant. "Parallel algorithms for inductance extraction". Texas A&M University, 2003. http://hdl.handle.net/1969.1/5930.
Texto completoEllingworth, H. R. P. "Parallel algorithms for the force-field method in molecular modelling". Thesis, University of Oxford, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.236102.
Texto completoGoehlich, Ralph Dietmar. "Design of finite element systems for parallel computers". Diss., Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/16817.
Texto completoGecgel, Murat. "Parallel, Navier". Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/12604807/index.pdf.
Texto completodimensional laminar and turbulent flowfields over rotary wing configurations. The code employs finite volume discretization and the compact, four step Runge-Kutta type time integration technique to solve unsteady, thin&ndash
layer Navier&ndash
Stokes equations. Zero&ndash
order Baldwin&ndash
Lomax turbulence model is utilized to model the turbulence for the computation of turbulent flowfields. A fine, viscous, H type structured grid is employed in the computations. To reduce the computational time and memory requirements parallel processing with distributed memory is used. The data communication among the processors is executed by using the MPI ( Message Passing Interface ) communication libraries. Laminar and turbulent solutions around a two bladed UH &ndash
1 helicopter rotor and turbulent solution around a flat plate is obtained. For the rotary wing configurations, nonlifting and lifting rotor cases are handled seperately for subsonic and transonic blade tip speeds. The results are, generally, in good agreement with the experimental data.
Thompson, R. T. "Fast sequential and parallel methods for solving multistage stochastic linear programmes". Thesis, University of Essex, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387829.
Texto completoChiang, K. (Kuoning). "Parallel processing approach for crash dynamic analysis". Diss., Georgia Institute of Technology, 1989. http://hdl.handle.net/1853/17917.
Texto completoScheiderer, Stephan. "Effiziente parallele Lattice-Boltzmann-Simulation für turbulente Strömungen". [S.l. : s.n.], 2006. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-28269.
Texto completoHaider, Shahid Abbas. "Systolic arrays for the matrix iterative methods". Thesis, Loughborough University, 1993. https://dspace.lboro.ac.uk/2134/28173.
Texto completo