To see the other types of publications on this topic, follow the link: Fortran.
Dissertations / Theses on the topic 'Fortran'
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 'Fortran.'
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.
1
Narayan, Mohanish. "PolyOpt/Fortran: A Polyhedral Optimizer for Fortran Programs." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338331413.
Full text
2
Molony, Scott. "Finding Divinity in Fortran." Thesis, Boston College, 2011. http://hdl.handle.net/2345/1980.
Full textAbstract:
Thesis advisor: Richard SpinelloThesis advisor: Stephen Pope
The information revolution is the single most important change in society since the printing press. At no other time has our society benefited from nearly limitless access to information and communication, and the changes brought on by this access have changed, and are changing, society in fundamental ways. Our homes, our workplaces, and our democracy have all been transformed by information and communication technologies.However, our ethics have not kept pace with our technological progress, and the immense changes brought by this this revolution have posed some equally immense moral questions. Indeed, there has been an almost total lack of religious discourse regarding the problems which have arisen out of the information revolution. This thesis is an attempt to change that.The thesis itself is structured as a series of essays on four key problems:1. Intellectual Property, as it relates to Scripture2. Information Ethics, the novel moral theory arising from Computer Ethics3. Robotic Ethics, especially the ethics of robotic warfare4. Hacker Culture, and its implicit spiritualityEach of these essays attempts to tackle one of these key problems, and demonstrate how a religious perspective illuminates some aspect of it. As befits a thesis from a Jesuit, Catholic university, most of the essays are drawn from a Catholic, Christian perspective
Thesis (BA) — Boston College, 2011
Submitted to: Boston College. College of Arts and Sciences
Discipline: Theology Honors Program
Discipline: Philosophy Honors Program
Discipline: Theology
3
Janaki, S. "A Parallelizing Compiler for Fortran." Thesis, Indian Institute of Science, 1999. https://etd.iisc.ac.in/handle/2005/79.
Full textAbstract:
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and C+ allow the user to specify data distribution across processor with some directives, and the compiler for these language use the directives to compile the programme in to an SPMD code. There are number of old program which are still in use and rewriting them in to new data parallel languages is a costly effort.
Most of the work on these parallelizing compilers concentrate on efficient data communication between the processors.With the advancement in technology, data communication time is also decreasing.This allows bigger programs to execute in the same time span.The resources of a DMM being finite puts a limit on the size of the
problem that can be run. Improving the memory usage for a problem will hence allow us run bigger size problems.
Further, as communication speed increases, the overhead caused by house-keeping computations like global index to local index transformation, and owner processor computation will degrade the performance of the resultant code. Hence a uniform and efficient method for these computations also becomes a necessity.
We have implemented parallelizing parts of a compiler using the SUIF compiler system, which accepts programs written in Fortran77 with directives to the compiler as comments. The output of the compiler is an SPMD C program,
with embedded PVM calls for message communication between the processors.
We have also proposed algorithms to improve data communications,and minimizing memory usage in the output code. A uniform method for performing owner processor computations and global-to-local transformations has also been implemented.
4
Janaki, S. "A Parallelizing Compiler for Fortran." Thesis, Indian Institute of Science, 1999. http://hdl.handle.net/2005/79.
Full textAbstract:
With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and C+ allow the user to specify data distribution across processor with some directives, and the compiler for these language use the directives to compile the programme in to an SPMD code. There are number of old program which are still in use and rewriting them in to new data parallel languages is a costly effort.
Most of the work on these parallelizing compilers concentrate on efficient data communication between the processors.With the advancement in technology, data communication time is also decreasing.This allows bigger programs to execute in the same time span.The resources of a DMM being finite puts a limit on the size of the
problem that can be run. Improving the memory usage for a problem will hence allow us run bigger size problems.
Further, as communication speed increases, the overhead caused by house-keeping computations like global index to local index transformation, and owner processor computation will degrade the performance of the resultant code. Hence a uniform and efficient method for these computations also becomes a necessity.
We have implemented parallelizing parts of a compiler using the SUIF compiler system, which accepts programs written in Fortran77 with directives to the compiler as comments. The output of the compiler is an SPMD C program,
with embedded PVM calls for message communication between the processors.
We have also proposed algorithms to improve data communications,and minimizing memory usage in the output code. A uniform method for performing owner processor computations and global-to-local transformations has also been implemented.
5
Saliba, Walter Luiz Caram. "Um editor orientado a Fortran 77." Instituto Tecnológico de Aeronáutica, 1992. http://www.bd.bibl.ita.br/tde_busca/arquivo.php?codArquivo=1852.
Full textAbstract:
Um editor orientado a uma linguagem de programação explora conhecimentos sobre a mesma para conduzir o processo de edição e prover um auxílio mais efetivo ao usuário. Este auxílio geralmente é expresso por um maior controle sob a forma do texto editado e pela detecção de erros no mesmo. Estas capacidades requerem que editores desta natureza possuam uma estrutura mais complexa: usualmente eles resultam da composição entre um editor de textos comum e analisadores léxico, sintático e semântico para a linguagem alvo. Este trabalho trata da concepção e implementação de um editor orientado a FORTRAN 77. Este editor é uma das ferramentas componentes do Ambiente de Reestruturação de Programas do Projeto Computação Científica do CTA-IEAv. A necessidade de manutenção de informações atualizadas sobre a árvore sintática e sobre os erros detectados nos programas editados exige que o editor recompile-os freqüentemente. Mostra-se que a utilização de princípios convencionais de compilação deteriora o desempenho do editor na medida em que o tamanho dos programas editados aumenta. Como alternativa, são propostos algoritmos incrementais que reaproveitam informações de análises anteriores para reduzir o tempo gasto na compilação. Como conseqüência, impõe-se uma nova estrutura ao compilador, onde aspectos livres e dependentes de contexto são tratados separadamente.
6
Gururaghavendran, Ashwin. "Applying Polyhedral Transformation to Fortran Programs." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1301032351.
Full text
7
Bloch, Jon Thomas. "Interfacing Fortran to the Legion System." Full text, Acrobat Reader required, 1997. http://viva.lib.virginia.edu/etd/theses/bloch%5Fj.pdf.
Full text
8
Boniati, Bruno Batista. "REFATORAÇÃO DE PROGRAMAS FORTRAN DE ALTO DESEMPENHO." Universidade Federal de Santa Maria, 2009. http://repositorio.ufsm.br/handle/1/5351.
Full textAbstract:
Refactoring is a software engineering technique that aims at improving the internal structure of an application, in such a way that the changes do not interfere in the results
produced by the software. This technique is permanently employed in the software life cycle and refers to non-functional characteristics as legibility and performance. Most refactoring techniques currently apply to object-oriented systems and are widely available in integrated development environments for this programming paradigm. In high performance computing applications, code refactoring is a little-explored technique, as a great amount of legacy high performance code was written before the widespread use of object-oriented languages. The Fortran language (FORmula TRANslator) is heavily used in high performance applications, but has a few and limited tools for code refactoring. In such context, our work explores this open research area through the development of
new techniques for refactoring Fortran source code. Our development starts from identifying refactoring opportunities for Fortran code and extends the Photran tool, which is an Eclipse IDE plugin for Fortran programming. The new automated refactoring techniques
are applied to third-party code written in Fortran, in order to evaluate their impact on the software performance.Refatoração é uma técnica de engenharia de software que consiste em alterar a estrutura interna de uma aplicação sem que tais alterações interfiram nos resultados produzidos pela mesma. Trata-se de uma tarefa permanentemente presente no ciclo de vida de uma aplicação e está diretamente associada às características não funcionais do software, como legibilidade e desempenho. Técnicas de refatoração são amplamente utilizadas em sistemas desenvolvidos para o paradigma da orientação a objetos e estão presentes de forma automatizada em diversas ferramentas que atuam neste paradigma. Na computação de alto desempenho, a refatoração de código é pouco explorada, principalmente em função de que boa parte do código legado de programas de alto desempenho está escrita em linguagens anteriores ao paradigma da orientação a objetos. A linguagem Fortran (FORmula TRANslator), largamente utilizada em aplicações de alto desempenho, possui poucas e limitadas ferramentas para refatoração de código. Neste contexto, este trabalho explora essa deficiência através da automatização de técnicas de refatoração, utilizando-se do framework da ferramenta Photran (um plugin para edição de código Fortran integrado ao IDE Eclipse). Partindo-se da identificação de oportunidades de refatoração para código Fortran, algumas técnicas são desenvolvidas e integradas à ferramenta Photran. As técnicas automatizadas são utilizadas em aplicações escritas nesta linguagem, de forma a avaliar seu impacto no desempenho das mesmas.
9
Smith, Kevin Scott. "PAT : an interactive fortran parallelizing assistant tool." Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/9193.
Full text
10
Li, Jun. "McFor: A MATLAB-to-fortran 95 compiler." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86985.
Full textAbstract:
The high-level array programming language MATLAB is widely used for prototyping algorithms and applications of scientific computations. However, its dynamically-typed nature, which means that MATLAB programs are usually executed via an interpreter, leads to poor performance. An alternative approach would be converting MATLAB programs to equivalent Fortran 95 programs. The resulting programs could be compiled using existing high-performance Fortran compilers and thus could provide better performance. This thesis presents techniques that are developed for our MATLAB-to-Fortran compiler, McFor, for extracting information from the high-level semantics of MATLAB programs to produce efficient and reusable Fortran code.The McFor compiler includes new type inference techniques for inferring intrinsic type and shape of variables and uses a value-propagation analysis to precisely estimate the sizes of arrays and to eliminate unnecessary array bounds checks and dynamic reallocations. In addition to the techniques for reducing execution overhead, McFor also aims to produce programmer-friendly Fortran code. By utilizing Fortran 95 features, the compiler generates Fortran code that keeps the original program structure and preserves the same function declarations.
We implemented the McFor system and experimented with a set of benchmarks with different kinds of computations. The results show that the compiled Fortran programs perform better than corresponding MATLAB executions, with speedups ranging from 1.16 to 102, depending on the characteristics of the program.
Le langage de programmation de tableaux de haut niveau MATLAB est largement utilisé afin de faire du prototypage d'algorithmes et des applications de calculs scientifiques. Cependant, sa nature de type dynamique, ce qui veut dire que les programmes MATLAB sont habituellement exécutés par un interpréteur, amène une mauvaise performance. Une approche alternative serait de convertir les programmes MATLAB aux programmes Fortran 95 équivalents. Les programmes résultants pourraient être compilés en utilisant les compilateurs de haute performance Fortran, ainsi ils peuvent fournir une meilleure performance. Cette thèse présente les techniques qui sont développées pour notre compilateur MATLAB-à-Fortran, McFor, pour extraire l'information des hauts niveaux des sémantiques des programmes MATLAB afin de produire un code Fortran efficace et réutilisable.
Le compilateur McFor inclut de nouvelles techniques de déduction pour inférer les types et formes intrinsèques des variables et utilise une analyse à propagation de valeurs pour estimer avec précision la tailles des tableaux de variables et pour éliminer les vérifications des limites et les réallocations dynamiques superflues de ces tableaux. En plus de ces techniques de réduction des temps d'exécution, McFor vise aussi a génèrer du code Fortran convivial pour les développeurs. En utilisant les avantages de Fortran 95, le compilateur génère du code Fortran qui préserve la structure originale du programme ainsi que les mêmes déclarations de fonctions.
Nous avons mis en oeuvre le système McFor et l'avons expérimenté avec un ensemble de tests de performance avec différentes sortes de calculs. Les résultats montrent que les programmes de Fortran compilés offrent une meilleure performance que les exécutions MATLAB correspondantes, avec une cadence accélérée de l'ordre de 1.16 à 102, selon les caractéristiques du programme.
11
Li, Xu. "Mc2For: a MATLAB to Fortran 95 complier." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=123271.
Full textAbstract:
MATLAB is a dynamic numerical scripting language widely used by scientists, engineers and students. While MATLAB's high-level syntax and dynamic types make it ideal for fast prototyping, programmers often prefer using high-performance static languages such as FORTRAN for their final distribution. Rather than rewriting the code by hand, our solution is to provide a source-to-source compiler that translates the original MATLAB program to an equivalent FORTRAN program.In this thesis, we introduce MC2FOR, a source-to-source compiler which transforms MATLAB to FORTRAN and handles several important challenges during the transformation, such as efficiently estimating the static type characteristics of all the variables in a given MATLAB program, mapping numerous MATLAB built-in functions to FORTRAN, and correctly supporting some MATLAB dynamic features in the generated FORTRAN code.This compiler consists of two major parts. The first part is an interprocedural analysis component to estimate the static type characteristics, such as the shapes of the arrays and the ranges of the scalars, which are used to generate variable declarations and to remove unnecessary array bounds checking in the translated FORTRAN program. The second part is an extensible FORTRAN code generation framework automatically transforming MATLAB constructs to equivalent FORTRAN constructs.This work has been implemented within the McLab framework, and we evaluated the performance of the MC2FOR compiler on a collection of 20 MATLAB benchmarks. For most of the benchmarks, the generated FORTRAN program runs 1.2 to 337 times faster than the original MATLAB program, and in terms of physical lines of code, typically grows only by a factor of around 2. These experimental results show that the code generated by MC2FOR performs better on average, at the cost of only a modest increase in code size.MATLAB est un langage de script dynamique très utilisé par les scientifiques, les ingénieurs et les étudiants. La syntaxe de haut niveau et le typage dynamique de MATLAB en font un langage idéal pour faire du prototypage rapide, mais les programmeurs préfèrent souvent utiliser des langages statiques performants comme FORTRAN pour la distribution finale. Au lieu de réécrire le code à la main, notre solution est de proposer un compilateur qui traduit le programme MATLAB original vers un program FORTRAN équivalent.Dans cette thèse, nous introduisons MC2FOR, un compilateur qui transforme MATLAB vers FORTRAN et surmonte plusieurs difficultés importantes rencontrées durant la transformation, dont celles d'estimer efficacement le type statique de toutes les variables dans un programme MATLAB donné, de trouver une correspondance pour les nombreuses fonctions intégrées de MATLAB vers FORTRAN et de supporter correctement quelques caractéristiques dynamiques de MATLAB dans le code FORTRAN généré.Le compilateur est constitué de deux parties majeures: la première partie est une analyse interprocédurale qui estime des caractéristiques du type statique, comme la forme des tableaux et les limites des scalaires, qui sont utlilisées pour générer des déclarations de variables et pour supprimer les vérifications de limite de tableaux inutiles dans le programme FORTRAN généré. La deuxième partie est un framework de génération de code extensible qui transforment utomatiquement des constructions de MATLAB vers des constructions de FORTRAN équivalentes.Ce travail a été implementé dans le framework McLab, et nous avons évalué les performances du compilateur MC2FOR sur une collection de 20 programmes MATLAB. Pour la plupart des programmes, le programme FORTRAN généré s'éxécute entre 1.2 et 337 fois plus rapidement que le programme MATLAB original, et en termes de lignes de code, grandit seulement par un facteur de deux. Ces résultats expérimentaux démontrent que MC2FOR est en mesure de générer du code qui performe mieux en moyenne que l'original sans pour autant augmenter de trop sa taille.
12
Santavicca, Jeffery W. "Fluid mechanics tutorials in GKS supported FORTRAN." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-09122009-040300/.
Full text
13
Castañeda, Cristian Fernando Flores. "Otimização Unroll and Jam através da refatoração." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2011. http://hdl.handle.net/10183/37182.
Full textAbstract:
As otimizações de um programa podem ser efetuadas no código intermediário gerado na fase de compilação, ou através da Performance Refactoring que consiste na inserção de otimizações diretamente no código fonte da aplicação. Na estrutura do código fonte, os laços de iteração possuem um importante impacto no desempenho da aplicação, pois consomem elevados tempos de execução, sendo assim, é fundamental que estes sejam alvo de otimizações. Uma das otimizações de laço é o Unroll and Jam, que aplica operações de reestruturação de laços aninhados, permitindo utilizar eficientemente a hierarquia de memória. Os passos desta otimização consistem em primeiramente desenrolar os laços a serem otimizados, e posteriormente fusioná-los formando um bloco único de instrução. Neste trabalho se propôs usar refatoração de código para automatizar o Unroll and Jam de laços em nível do código fonte, o que possibilita acumular os efeitos da otimização no programa original com as melhorias tradicionais propiciadas pelo compilador na fase de otimização do código intermediário. A implementação foi realizada com base nas estruturas da ferramenta Photran 7.0, que consiste em um ambiente de desenvolvimento integrado para a linguagem Fortran 77-2008. Os resultados de desempenho obtidos demonstraram que a utilização de Unroll and Jam através da Performance Refactoring, com diferentes níveis de otimização, obteve ganhos significativos de desempenho em comparação a otimização realizada pelo com- pilador da Intel. Deve-se destacar que a aplicação conjunta de ambas as técnicas de oti- mização, originou resultados melhores que a utilização de uma técnica somente. Como trabalhos futuros, é interessante que novas pesquisas possam ser realizadas na obtenção de índices de desenrolamento ótimos e na aplicação conjunta de outras abordagens de otimização. Também pode haver estudos que permitam que outras otimizações sejam aplicadas pela Performance Refactoring.The optimizations of a program can be performed on the intermediate code, generated during compilation time, or through the Performance Refactoring that consists of insertion of optimizations directly in the source code of the application. In the source code structure, iteration loops have a major impact in the performance of the application because they are time-consuming code and, thus, an essential target of optimizations. One loop optimization is the Unroll and Jam that applies restructuring operations in nested loops allowing efficient usage of memory hierarchy. Its optimization steps are: to unroll the target loops, and to join them forming a single block of instruction. This work proposes the usage of refactoring to automate Unroll and Jam loops in source code level, allowing to accumulate the effects of optimization in the original pro- gram with the optimizations in the intermediate code by traditional compilers. The im- plementation was based on structures of Photran tool 7.0, which consists of an integrated development environment for Fortran 77-2008. The performance results using Unroll and Jam by Performance Refactoring with dif- ferent levels of unrolling, showed significant gains compared to the optimization per- formed by the Intel compiler. It should also be noted that the joint of both optimization techniques has led to better results than the use of an individual technique. As future works, new researches can be performed to obtain optimal rates of unrolling and to join the application of other optimization approaches. Furthermore, studies may search for optimizations to be applied by the Performance Refactoring.
14
Coelho, Fabien. "Contributions a la compilation du high performance fortran." Paris, ENMP, 1996. http://www.theses.fr/1996ENMP0815.
Full textAbstract:
Cette these presente nos contributions a la compilation du high performance fortran (hpf). Hpf est un langage data-parallele base sur fortran. Des directives permettent de preciser le parallelisme et le placement des donnees sur une machine parallele a memoire repartie. Nous voulons traduire un programme hpf a adressage global et communications implicites vers un modele a passage de messages. Notre approche a consiste a formuler les problemes de compilation dans un cadre mathematique et a utiliser des algorithmes standards pour generer du code optimise. Tout d'abord, le langage hpf est presente et les autres travaux discutes. Ensuite, nous analysons le langage et suggerons des ameliorations possibles. Apres nous presentons nos techniques de compilation pour les boucles paralleles, les entrees-sorties et les re placements de hpf. Toutes les questions sont abordees, y compris l'allocation memoire, la gestion des donnees temporaires, le partage de charge etc. Des resultats d'optimalite et des experiences sont egalement presentes. Enfin nous decrivons notre prototype de compilateur (hpfc) ainsi que l'environnement logiciel dans lequel il a ete developpe (pips) avant de conclure.
15
Chabot, Éric. "Parallélisme et communications dans les applications scientifiques (fortran) /." Thèse, Chicoutimi : Université du Québec à Chicoutimi, 1993. http://theses.uqac.ca.
Full text
16
Reid, Ian. "Symmetric level index arithmetic : towards its integration into the scientific computing environment." Thesis, Lancaster University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334342.
Full text
17
Phillips, C. "An automatic distribution tool." Thesis, Queen's University Belfast, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.396221.
Full text
18
Reid, N. K. "A formal semantics of parallel features of Fortran 95." Thesis, Queen's University Belfast, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273424.
Full text
19
CHERKI, SOPHIE. "Retro-ingenierie de programmes fortran utilisant les specifications algebriques." Paris 11, 1998. http://www.theses.fr/1998PA112313.
Full textAbstract:
Lorsque la maintenance est negligee pendant le developpement du logiciel, elle fait souvent l'objet d'une pratique empirique, couteuse et source de deterioration du logiciel. Pour les nouveaux logiciels, l'integration de specifications formelles dans le processus de developpement fournit un cadre pour une maintenance plus performante. Pour les logiciels existants, une integration a posteriori peut se faire via une phase de retro-ingenierie qui consiste a extraire des descriptions abstraites du logiciel a partir de ses sources. Dans cette these, nous proposons une methode de retro-ingenierie qui fournit des descriptions de la structure et des fonctionnalites d'un logiciel fortran sous la forme de specifications algebriques. Pour extraire la signature, nous utilisons des techniques d'analyse de flots de donnees et de controle et nous traitons de problemes lies a l'absence de declaration de type en fortran, a la manipulation de pointeurs et a l'utilisation incoherente de variables globales et locales dans le code. Pour extraire les axiomes, nous utilisons des techniques de decoupage de programmes et de reconnaissance de schemas de code et nous traitons de problemes lies a l'imbrication de boucles et de selections et a l'utilisation de goto. Par ailleurs, nous avons concu plusieurs processus permettant d'automatiser les etapes de la methode qui pouvaient l'etre. Enfin, il est important de noter que la methode proposee permet aussi de detecter des defauts dans le code : faux parametres, code mort, cycles, code redondant, decalages entre le code et la documentation.
20
Ammarguellat, Zahira. "Restructuration des programmes fortran en vue de leur parallelisation." Paris 6, 1988. http://www.theses.fr/1988PA066021.
Full textAbstract:
La phase preliminaire de restructuration proposee consiste a transformer les programmes de sorte qu'ils n'utilisent que des if, while et affectations. Ces while pouvant representer des boucles do cachees, une phase de standardisation des listes d'indices de boucles est necessaire
21
Ammarguellat, Zahira. "Restructuration des programmes FORTRAN en vue de la parallélisation." Grenoble 2 : ANRT, 1988. http://catalogue.bnf.fr/ark:/12148/cb37611317c.
Full text
22
Walker, Edward. "Extracting data flow information for parallelizing FORTRAN nested loop kernels." Thesis, University of York, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239812.
Full text
23
Perez, Paulo Andre Sant\'Anna. "P2D - Um Ambiente de Auxílio a Paralelização de Aplicações Fortran." Universidade de São Paulo, 1996. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-15012018-095545/.
Full textAbstract:
Neste trabalho é apresentado um ambiente integrado para o auxílio à paralelização de aplicações escritas na linguagem Fortran. O sistema foi desenvolvido com o objetivo de sanar uma necessidade de melhores ferramentas para programação paralela, conforme identificado na revisão bibliográfica apresentada. Diversas técnicas de Engenharia de Software são utilizadas neste trabalho. A análise do sistema é apresentada, e são discutidos os seus objetivos e a descrição das suas características principais. O projeto do sistema e o modelo de geração do código paralelo são descritos. E feita uma análise dos algoritmos envolvidos na sua implementação. Também são apresentados exemplos de utilização do sistema e os resultados obtidos são avaliados. Finalmente, podem ser encontradas diversas sugestões de novos projetos, importantes para a continuidade do trabalho até aqui desenvolvido.This thesis presents an integrated environment to help with the parallelization of serial Fortran applications. This is an effort to provide improved tools for parallel programming, a need emphasized by the review of the bibliography presented. Software Engineering principles are extensively used in this work. The system definition is based on a deep analysis of its goals, requirements and applications. The software project and the algorithms used for parallel code generation are discussed. Some results obtained from case studies are presented and analysed. Finally, several new research projects are proposed aiming at the continuity of this work.
24
Rissetti, Gustavo. "CATÁLOGO DE REFATORAÇÕES PARA A EVOLUÇÃO DE PROGRAMAS EM LINGUAGEM FORTRAN." Universidade Federal de Santa Maria, 2011. http://repositorio.ufsm.br/handle/1/5377.
Full textAbstract:
Coordenação de Aperfeiçoamento de Pessoal de Nível SuperiorEvolution is a natural characteristic in software development. During the life cycle of a system, usually there is the need of evolution, mainly to add a new requirement, to change existing functionality, or to evolve the programming language used. The Fortran (FORmula TRANslation) language, despite having more than fifty years of existence, is still widely used in scientific applications. The majority of the existent Fortran applications is composed of legacy code, using obsolete or deprecated constructions of the language and, thus, need to evolve to improve their quality attributes. However, this process is often done manually, without the existence of well-defined rules to be followed, facilitating the introduction of anomalies in these applications. Software evolution can be benefited from refactoring, which provides well-defined mechanisms to be followed, helping to maintain and to improve the quality of existent systems. Refactoring is a software engineering technique that transforms software artefacts in order to improve them, without compromising their functionality. It is a permanent task in the life cycle of an application and is directly associated with the software non-functional requirements, such as modularization, legibility, and performance. This technique is widely used in objectoriented languages, but is still largely unexplored in procedural languages such as Fortran. In this context, this work explores the need for refactorings for the Fortran language, together with the issue of evolving legacy code. This goal is achieved through the proposal of a refactoring catalog to the evolution of Fortran programs, and the automation of some of them in the Photran framework. The proposed refactorings are evaluated and validated in applications written in Fortran.
A evolução é uma característica natural no desenvolvimento de software. Durante o ciclo de vida de um sistema, geralmente existe a necessidade de evolução, seja para a adição de um novo requisito, para a alteração de funcionalidades existentes, ou para a evolução da linguagem de programação usada. A linguagem Fortran (FORmula TRANslation), apesar de possuir mais de cinquenta anos de existência, ainda é amplamente usada em aplicações científicas. A maioria das aplicações Fortran existentes é composta de códigos legados, que usam construções obsoletas ou de uso desencorajado da linguagem, e normalmente precisam passar por uma evolução para melhorar seus atributos de qualidade. Porém, muitas vezes, esse processo é conduzido manualmente, sem a existência de regras bem definidas a serem seguidas, podendo ocorrer a introdução de anomalias nessas aplicações. A evolução de software pode ser auxiliada através de refatoração, que oferece mecanismos bem definidos a serem seguidos, ajudando a manter e melhorar a qualidade dos sistemas existentes. Refatoração é uma técnica de engenharia de software que efetua transformações em artefatos de software a fim de melhorá-los, sem comprometer suas funcionalidades. Trata-se de uma tarefa permanentemente presente no ciclo de vida de uma aplicação e está diretamente associada à requisitos não funcionais de software, tais como modularização, legibilidade e desempenho. Essa técnica é amplamente difundida para linguagens orientadas a objetos, mas é ainda pouco explorada em linguagens procedurais como Fortran. Nesse contexto, este trabalho explora a carência de refatorações para a linguagem Fortran, aliada à questão da evolução de código legado. Esse objetivo é alcançado através da proposta de um catálogo de refatorações para a evolução de programas Fortran, e da automação de algumas delas no framework Photran. As refatorações propostas são avaliadas e validadas em aplicações escritas em Fortran.
25
Fonseca, Rubens Pontes da. "Suporte ao teste de programas FORTRAN-77 no ambiente POKE-TOOL." [s.n.], 1993. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261470.
Full textAbstract:
Orientadores : Jose Carlos Maldonado , Mario JinoDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica
Made available in DSpace on 2018-07-18T04:25:13Z (GMT). No. of bitstreams: 1 Fonseca_RubensPontesda_M.pdf: 9449914 bytes, checksum: 191429c3dcbecf5a913dde0cd47721d7 (MD5) Previous issue date: 1993
Resumo: As atividades de teste conduzidas manualmente são tão sujeitas a erros quanto as outras atividades do desenvolvimento de software. Critérios de teste estrutural baseados em análise de fluxo de dados têm sido propostos para o teste de unidade; não existe uma ferramenta de teste que apóie a aplicação desses critérios para programas implementados na linguagem FORTRAN-77. No DCA/FEE/UNICAMP foi desenvolvida uma ferramenta de teste que apóia a aplicação dos Critérios Potenciais Usos PU (uma famíl ia de critérios de fluxo de dados), denominada POKE-TOOL, configurável para diversas linguagens e que está operacional para as linguagens C e COBOL. Este trabalho apresenta a configuração da POKE-TOOL para a linguagem FORTRAN-77. A POKE-TOOL/versão FORTRAN-77 foi vai idada parcialmente com sua aplicação no teste de um conjunto de programas selecionados da literatura; os resultados dessa atividade são também apresentados e brevemente analisados neste trabalho
Abstract: Testing activities applied manually are as error-prone as other software development activities. Data-flow based structured testing criteria have been proposed for unit testing; there is no testing tool supporting these criteria for programs implemented in the FORTRAN-77. At DCA/FEE/UNICAMP a configurable testing tool, named POKE- TOOL., which supports the application of the Potential Uses Criteria (a data-flow based testing criteria family) has been developed and 15 operational for languages C and COBOL. This work presents the configuration of POKE-TOOL for FORTRAN-77. POKE-TOOL/version FORTRAN-77 has been partially validated using a program set selected from the Iiterature; the results of this activitv are also presented and briefly analysed in this work
Mestrado
Automação
Mestre em Engenharia Elétrica
26
Williams, Nicola. "Application des specifications algebriques a la retro-ingenierie de codes fortran." Cachan, Ecole normale supérieure, 2000. http://www.theses.fr/2000DENS0014.
Full textAbstract:
Nous proposons une methode de retro-ingenierie de vieux codes fortran77 a l'aide de specifications algebriques : une specification concrete decrit les structures de donnees specialisees et les algorithmes efficaces du code et une specification abstraite decrit la finalite du calcul dans les termes du domaine d'application. Les deux sont liees par des specifications intermediaires integrant un par un les choix successifs d'implementation qui expliquent le passage de la specification abstraite a la specification concrete. La construction de la specification concrete est rendue difficile par de nombreuses caracteristiques de fortran77, largement exploitees par les programmeurs de l'epoque. Nous proposons diverses analyses et transformations du code et notamment une methode d'inference automatique des profils des operations specifiant les sous-programmes fortran. La specification abstraite est une description de la comprehension intuitive du code acquise par le retro-ingenieur pendant la partie de l'analyse qui doit etre effectuee a la main. La specification concrete doit etre suffisamment proche du code pour assurer qu'elle en est une description exacte et la specification abstraite doit etre justifiee par une comparaison avec la specification concrete. Pour des raisons pratiques, l'elaboration des specifications et la justification de la specification abstraite sont effectuees sur un fragment a la fois du code entier. Les abstractions que nous desirons exprimer ne satisfont pas toujours l'inverse de la relation d'implementation correcte entre les deux specifications du fragment de code. C'est pourquoi nous proposons une nouvelle relation, appelee abstraction correcte, entre specifications algebriques. Nous avons teste notre methode sur de nombreux exemples extraits de codes reels fournis par edf et presentons les specifications concrete et abstraite, ainsi que les sept specifications intermediaires, du fragment de code qui constitue notre exemple principal.
27
Au, Kwok Tat Peter. "Portable implementations of nested data-parallel programming languages." Thesis, Imperial College London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325055.
Full text
28
Reid, Darryl. "The design and implementation of a large scientific code using FORTRAN 90 /." Internet access available to MUN users only, 2003. http://collections.mun.ca/u?/theses,159602.
Full text
29
Campbell, John A. "FORTRAN programs for aerodynamic analyses on the MicroVAX/2000 CAD/CAE workstation." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/23241.
Full text
30
Dunlop, Alistair Neil. "Estimating the execution time of Fortran programs on distributed memory, parallel computers." Thesis, University of Southampton, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.242759.
Full text
31
Kothapalli, Malini. "Automated Conversion of Structured Fortran 77 Ccode Into Object-Oriented C++ Code." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/9676.
Full textAbstract:
The maintenance of legacy software systems that were developed using a procedural design approach is becoming increasingly expensive. The procedural approach is often ill suited for complex systems that need to integrate with other codes. Furthermore, these legacy systems are usually written in FORTRAN, for which there is increasingly less personnel available compared to, say, C++. While it would be desirable to convert these legacy systems into object-oriented codes described in C++, such a conversion process is nontrivial. Currently, the structural design must be manually examined, interpreted, and converted into an object-oriented design described in an object-oriented language. Therefore, the conversion process is likely to introduce numerous new inconsistencies and errors, which degrades the software's quality and increases its costs.
The preferred solution would be to automate this conversion process. Automation would promote consistency by eliminating the manual variations in interpretation and implementation. It would therefore maximize the likelihood that the converted code does not introduce new errors relative to the original code.
The work presented here automates the conversion process from procedural design described in the FORTRAN77 language into object-oriented design described in the C++ language. It demonstrates the extraction of object-oriented elements using FORTRAN common block structures and FORTRAN subroutine and function-calling hierarchies. The result is a consistent, first-cut converted design, which enhances cohesion within classes and reduces coupling between classes. This result is described in the contemporary, broadly used computer language C++, which integrates with adjacent modules that might still remain procedural and described in FORTRAN.Master of Science
32
Padhy, Bijaya L. "NITSOL -- A Newton iterative solver for nonlinear systems a FORTRAN-to-MATLAB implementation." Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-042806-161216/.
Full text
33
Fang, Zigang 1958. "A CHEMKIN based Fortran simulation code for the laminar opposed jet diffusion flame." Thesis, The University of Arizona, 1993. http://hdl.handle.net/10150/291383.
Full textAbstract:
Although it has been used for many years, an existing computer code, developed to simulate the laminar opposed-jet diffusion flame (LOJDF), was found not to be written in an user-friendly fashion. This was especially true for the portion dealing with calculation of thermochemical properties. The purpose of this research was to replace the appropriate portions of the existing program by the corresponding portions of the CHEMKIN package. CHEMKIN has become a recognized standard in inputing chemical kinetics data into program, since the inputing is almost format free and easy to manipulate. A series of test cases show that the updated code is now better structured, user-friendly, and ready to use. The previous LOJDF model, in addition, is modified by adding source terms for species generation in the governing equations. The source-contained LOJDF model has proven to be useful in evaluating the numerical relation of the fate of an impurity to its location and strength.
34
Altstadt, Eberhard, and Thomas Mössner. "Extension of the ANSYS® creep and damage simulation capabilities." Forschungszentrum Dresden, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:d120-qucosa-29940.
Full textAbstract:
The user programmable features (UPF) of the finite element code ANSYS® are used to generate a customized ANSYS-executable including a more general creep behaviour of materials and a damage module. The numerical approach for the creep behaviour is not restricted to a single creep law (e.g. strain hardening model) with parameters evaluated from a limited stress and temperature range. Instead of this strain rate - strain relations can be read from external creep data files for different temperature and stress levels. The damage module accumulates a damage measure based on the creep strain increment and plastic strain increment of the load step and the current fracture strains for creep and plasticity (depending on temperature and stress level). If the damage measure of an element exceeds a critical value this element is deactivated. Examples are given for illustration and verification of the new program modules.
35
Altstadt, Eberhard, and Thomas Mössner. "Extension of the ANSYS® creep and damage simulation capabilities." Forschungszentrum Rossendorf, 2000. https://hzdr.qucosa.de/id/qucosa%3A21821.
Full textAbstract:
The user programmable features (UPF) of the finite element code ANSYS® are used to generate a customized ANSYS-executable including a more general creep behaviour of materials and a damage module. The numerical approach for the creep behaviour is not restricted to a single creep law (e.g. strain hardening model) with parameters evaluated from a limited stress and temperature range. Instead of this strain rate - strain relations can be read from external creep data files for different temperature and stress levels. The damage module accumulates a damage measure based on the creep strain increment and plastic strain increment of the load step and the current fracture strains for creep and plasticity (depending on temperature and stress level). If the damage measure of an element exceeds a critical value this element is deactivated. Examples are given for illustration and verification of the new program modules.
36
Dauxois, Jean-Yves. "Quelques résultats de fiabilité en données censurées." Pau, 1996. http://www.theses.fr/1996PAUU3002.
Full textAbstract:
Réalisé dans le cadre d'une convention CIFRE avec la société Turbomeca, ce travail porte sur l'analyse de fiabilité des matériels à partir de retour d'expériences. La première partie du travail s'intéresse à des problèmes d'estimation de l'écart à l'exponentialité en données de survie censurées et, pour ce faire, on considère un indicateur de non-constance du temps résiduel moyen. On introduit alors deux statistiques de test pour un test de l'exponentialité contre l'Idmrl (increasing, then decreasing mean residual life) dont on détermine les lois asymptotiques sous l'hypothèse nulle. La deuxième partie du travail s'intéresse à l'utilisation dans les calculs de fiabilité de données de survie sous réparation minimale avec censures non identiquement distribuées. Sous ce modèle, on effectue des estimations non paramétriques de la fonction de répartition et du taux de panne cumulé. Par des techniques de processus de comptage et de martingales, on mène ensuite une étude asymptotique de ces estimateurs. Dans la troisième partie on s'attache à étudier les propriétés asymptotiques des estimateurs bayesiens non paramétriques introduits par Hjort. Pour cela, on utilise des techniques similaires à celles de la partie précedente. La dernière partie du travail porte sur la présentation par simulation (les données réelles étant confidentielles) des applications numériques réalisées pour Turbomeca.
37
Brégier, Frédéric. "Extension du langage HPF pour la mise en œuvre de progammes parallèles manipulant des structures de données irrégulières." Bordeaux 1, 1999. http://www.theses.fr/1999BOR10623.
Full text
38
Malara, Rodrigo Daniel. "Paralelização do cálculo de estruturas de bandas de semicondutores usando o High Performance Fortran." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/76/76132/tde-12112007-092040/.
Full textAbstract:
O uso de sistemas multiprocessados para a resolução de problemas que demandam um grande poder computacional tem se tornado cada vez mais comum. Porém a conversão de programas seqüenciais para programas concorrentes ainda não é uma tarefa trivial. Dentre os fatores que tornam esta tarefa difícil, destacamos a inexistência de um paradigma único e consolidado para a construção de sistemas computacionais paralelos e a existência de várias plataformas de programação para o desenvolvimento de programas concorrentes. Nos dias atuais ainda é impossível isentar o programador da especificação de como o problema será particionado entre os vários processadores. Para que o programa paralelo seja eficiente, o programador deve conhecer a fundo aspectos que norteiam a construção do hardware computacional paralelo, aspectos inerentes à arquitetura onde o software será executado e à plataforma de programação concorrente escolhida. Isto ainda não pode ser mudado. O ganho que podemos obter é na implementação do software paralelo. Esta tarefa pode ser trabalhosa e demandar muito tempo para a depuração, pois as plataformas de programação não possibilitam que o programador abstraia dos elementos de hardware. Tem havido um grande esforço na criação de ferramentas que otimizem esta tarefa, permitindo que o programador se expresse mais fácil e sucintamente quanto à para1elização do programa. O presente trabalho se baseia na avaliação dos aspectos ligados à implementação de software concorrente utilizando uma plataforma de portabilidade chamada High Performance Fortran, aplicado a um problema específico da física: o cálculo da estrutura de bandas de heteroestruturas semicondutoras. O resultado da utilização desta plataforma foi positivo. Obtivemos um ganho de performance superior ao esperado e verificamos que o compilador pode ser ainda mais eficiente do que o próprio programador na paralelização de um programa. O custo inicial de desenvolvimento não foi muito alto, e pode ser diluído entre os futuros projetos que venham a utilizar deste conhecimento pois após a fase de aprendizado, a paralelização de programas se torna rápida e prática. A plataforma de paralelização escolhida não permite a paralelização de todos os tipos de problemas, apenas daqueles que seguem o paradigma de paralelismo por dados, que representam uma parcela considerável dos problemas típicos da Física.The employment of multiprocessor systems to solve problems that demand a great computational power have become more and more usual. Besides, the conversion of sequential programs to concurrent ones isn\'t trivial yet. Among the factors that makes this task difficult, we highlight the nonexistence of a unique and consolidated paradigm for the parallel computer systems building and the existence of various programming platforms for concurrent programs development. Nowadays it is still impossible to exempt the programmer of the specification about how the problem will be partitioned among the various processors. In order to have an efficient parallel program the programmer have to deeply know subjects that heads the parallel hardware systems building, the inherent architecture where the software will run and the chosen concurrent programming platform. This cannot be changed yet. The gain is supposed to be on the parallel software implementation. This task can be very hard and consume so much time on debugging it, because the programming platforms do not allow the programmer to abstract from the hardware elements. It has been a great effort in the development of tools that optimize this task, allowing the programmer to work easily and briefly express himself concerning the software parallelization. The present work is based on the evaluation of aspects linked to the concurrent software implementation using a portability platform called High Performance Fortran, applied to a physics specific problem: the calculus of semiconductor heterostructures? valence band structure. The result of the use of this platform use was positive. We obtained a performance gain superior than we expected and we could assert that the compiler is able to be more effective than the programmer on the paralelization of a program. The initial development cost wasn\'t so high and it can be diluted between the next projects that would use the acquired knowledge, because after the learning phase, the programs parallelization task becomes quick and practical. The chosen parallelization platform does not allow the parallelization of all kinds of problems, but just the ones that follow the data parallelism paradigm that represents a considerable parcel of tipical Physics problems.
39
Nicolas, Christophe. "Une mesure de la cohésion fonctionnelle pour l'évaluation du code source des logiciels fortran." Versailles-St Quentin en Yvelines, 1995. http://www.theses.fr/1995VERS0003.
Full textAbstract:
Il est généralement admis que les modules réalisant plusieurs fonctions comportent des erreurs structurelles. De tels modules dits de cohésion non fonctionnelle, peuvent être détectés par des métriques fondées sur un nouveau modèle. Ce modèle peut de plus apporter une aide à la décomposition des modules d'un logiciel, et il prévoit les conséquences minimales sur les flux d'information du logiciel, de cette décomposition
40
Platonoff, Alexis. "Contribution à la distribution automatique des données pour machines massivement parallèles." Paris 6, 1995. http://www.theses.fr/1995PA066825.
Full text
41
Coche, Jacques Bolliet Louis. "Outil de mise au point et de surveillance d'applications, activable sous un système transactionnel." S. l. : Université Grenoble 1, 2008. http://dumas.ccsd.cnrs.fr/dumas-00295471.
Full text
42
KERVELLA, LIONEL. "Conception et realisation d'un compilateur fortran pour des architectures paralleles munies d'une memoire virtuelle partagee." Rennes 1, 1995. http://www.theses.fr/1995REN10183.
Full textAbstract:
Les machines paralleles a memoire distribuee apparaissent depuis quelques annees comme une solution interessante pour construire les architectures massivement paralleles. Cependant, le modele de programmation, tres different des modeles habituels, necessite un effort important de l'utilisateur pour developper ses programmes. Pour cette raison, la conception d'environnements de programmation pour architectures paralleles a memoire distribuee est devenue un theme de recherche important. Une memoire virtuelle partagee (mvp) est l'une des solutions possibles pour faciliter l'exploitation de ces machines. Une mvp offre un espace d'adressage global, resolvant ainsi les problemes de l'acces global aux donnees. Nous avons etudie, pendant cette these, les problemes de generation de code pour architectures paralleles munies de mvp. Cette etude a ete realisee a travers la conception et la realisation d'un compilateur fortran, fortran-s, permettant la parallelisation d'applications numeriques. Le prototype a permis de valider cette approche sur un ensemble varie d'applications numeriques executees sur les machines paralleles ipsc/2 et paragon x/ps munies de mvp, ainsi que sur la machine ksr-1. A partir des resultats experimentaux, nous avons propose des optimisations pour aider le compilateur a generer un code plus efficace pour les machines munies de mvp. Nous avons propose, notamment, un algorithme pour ameliorer le placement statique des synchronisations
43
Nembo, Jean. "Gestion des objets complexes persistants dans les langages de programmation : une application au langage fortran." Paris 6, 1991. http://www.theses.fr/1991PA066593.
Full textAbstract:
Cette these presente une approche d'extension d'un langage de programmation classique au support des objets complexes et des fonctionnalites bases de donnees. Apres un etat de l'art sur les differentes approches de modelisation d'objets complexes et de gestion de la persistance dans les langages de programmation, nous presentons le prototype nomme fop (fortran objets persistants), qui resulte de l'integration de la gestion des objets complexes persistants dans le langage fortran. Pour introduire les objets complexes dans ce langage, nous avons defini un modele de donnees base sur des concepts orientes objets. Un langage de definition de classes est implemente et permet de decrire les classes et les methodes associees, conformement au modele de donnees. L'architecture du systeme fop comporte deux niveaux essentiels: le premier niveau represente l'environnement de programmation et regroupe les interfaces de definition et de manipulation d'objets. Il offre un compilateur de classes, une interface graphique et le langage fortran enrichi par des mecanismes de manipulation d'objets complexes et de gestion des fonctionnalites bases de donnees. Le deuxieme niveau represente le gerant d'objets qui assure la transmission de messages aux objets, l'implementation des operateurs predefinis, la gestion des mecanismes de regroupement, de stockage et d'adressage des objets en memoire et sur disque. Pour garantir l'orthogonalite de la persistance, l'uniformite et l'homogeneite du langage fop, chaque objet est designe et manipule dans le programme via des noms attribues par l'usager ou via un identificateur genere par le systeme
44
Geimer, Greg. "Modeling of conservation practices on a HUC-12 watershed scale using Hydrological Simulation Program -- FORTRAN." Thesis, University of Iowa, 2018. https://ir.uiowa.edu/etd/6422.
Full textAbstract:
Conservation practices are frequently used to try and restore the natural resilience of the landscape to retain water, decrease nutrient loads, and mitigate flooding. Quantifying the potential benefits of conservation practices can inform stakeholders and improve the effectiveness of watershed planning. To this end, an existing Hydrological Simulation Program --- FORTRAN (HSPF) model of the English River was enhanced to enable detailed modeling of conservation practices. Using site-specific nutrient removal wetlands and water and sediment control basins (WASCOBs) derived from the Agricultural Conservation Planning Framework (ACPF) two 12-digit hydrologic unit code (HUC-12) watersheds within the English River, Headwaters North English River and Gritter Creek, were selected for modeling. Wetlands drain much larger areas than ponds that currently exist in the two watersheds. Average flood peak reductions are over 50% near the wetland sites, and diminish moving downstream to a few percent or less at the watershed outlets. Many WASCOBs exist in the two watersheds, but WASCOB use is minimal in other areas of the state. WASCOBs provide slightly more flood storage than ACPF wetlands but the storage isy distributed throughout the watershed. As a result the simulations show that the peak reduction is greater than for wetlands at many locations.
45
Kuo, Hsien-Chih. "Applying network flow and simulated annealing in job shop rescheduling due to machine breakdowns." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178224749.
Full text
46
Craddock, David M. "A FORTRAN 77 simulation of a low temperature storage freezer utilizing a non-azeotropic refrigerant blend." Ohio : Ohio University, 1995. http://www.ohiolink.edu/etd/view.cgi?ohiou1179341435.
Full text
47
Hanson, Clyde Russell 1959. "Implementation of Fletcher-Reeves in the GOSPEL optimization package." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277144.
Full textAbstract:
Implementation of the Fletcher-Reeves optimization strategy into the GOSPEL optimization package is examined. An explanation of the GOSPEL package is provided, followed by the presentation of the Fletcher-Reeves strategy. Performance of all strategies in the updated GOSPEL package are compared for nine test cases. A user manual for GOSPEL operation as well as the source code are also included.
48
Rapp, Anthony P. "Numerical simulations of cold atom ratchets in dissipative optical lattices." Miami University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=miami1565625897258688.
Full text
49
Pazat, Jean-Louis. "Génération de code réparti par distribution de données." [S.l.] : [s.n.], 1997. ftp://ftp.irisa.fr/techreports/habilitations/pazat.pdf.
Full text
50
Muniz, da Silva Helmut. "Análise paramétrica de um reator anelar pulsado." Universidade Federal de Pernambuco, 2006. https://repositorio.ufpe.br/handle/123456789/9950.
Full textAbstract:
Made available in DSpace on 2014-06-12T23:17:02Z (GMT). No. of bitstreams: 2
arquivo9097_1.pdf: 765158 bytes, checksum: 745d34e0d954ba2dce1ab1422f136e83 (MD5)
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2006Um conceito de reator pulsado denominado VICHFPR (Very Intense Continuous Flux Pulsed Reactor) foi apresentado em 1997 como uma possível extensão do reator periodicamente pulsado russo IBR-2. O núcleo desse reator tem geometria anelar e é percorrido por um modulador de reatividade que é responsável pelo surgimento de um pulso rotativo no fluxo neutrônico no reator. Enquanto a maior parte do núcleo opera na subcriticalidade (kef<1), a região vizinha ao modulador é supercriticamente pronta (kef>1+β), gerando um fluxo máximo bem maior do que o fluxo médio. A razão entre os valores máximo e médio de fluxo é o fator de vantagem do conceito. Esse princípio pode ser empregado para gerar altos níveis de fluxo e fluência necessários para avaliação de danos em elementos de reatores, queima de rejeitos radioativos e produção de isótopos transurânicos. A análise paramétrica realizada por este estudo avaliou a influência das dimensões do núcleo e do modulador e da fração de nêutrons atrasados, através da alteração no tipo de elemento físsil empregado como combustível, no fator de vantagem e na distribuição de fluxo e da concentração de precursor de nêutrons atrasados ao longo de todo reator. Para tal finalidade, desenvolveu-se um código computacional em linguagem FORTRAN denominado ANÀLISE. Um algoritmo em diferença finita, empregando o método de Crank-Nicolson generalizado, foi usado na discretização do núcleo. Depois de serem obtidas a distribuição de fluxo neutrônico e o fator de vantagem, calculou-se a distribuição da concentração de precursor de nêutrons atrasados no sistema e, finalmente, a magnitude do pulso de fluxo de nêutrons foi reavaliada. Foram comprovados a presença do pulso na distribuição de fluxo neutrônico, a dependência linear do fator de vantagem com o perímetro anelar e a independência em relação à fração de nêutrons atrasados. A distribuição da concentração de precursor de nêutrons atrasados foi homogênea para os três elementos físseis e a magnitude do pulso na distribuição de fluxo de nêutrons foi mantida