Made available in DSpace on 2014-06-11T19:32:24Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-03-18Bitstream added on 2014-06-13T20:03:51Z : No. of bitstreams: 1 jesus_cgn_dr_assis_parcial.pdf: 72742 bytes, checksum: 615bcf5018f8ecaa6066385c6d483bff (MD5) Bitstreams deleted on 2015-02-09T17:15:03Z: jesus_cgn_dr_assis_parcial.pdf,Bitstream added on 2015-02-09T17:15:40Z : No. of bitstreams: 1 000649923.pdf: 4860627 bytes, checksum: 2cf2b7387e859434937acabd2f39f1d5 (MD5) / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / Gil Blas surgiu na cidade do Rio de Janeiro, em 13 de fevereiro de 1919 e circulou até 6 de maio de 1923. A publicação foi porta voz do governo Epitácio Pessoa (1919-1923) e esteio de concepções nacionalistas da década de 1920, fato que a torna fonte relevante para se entender o panorama político e cultural do Brasil daquele momento. Deve-se destacar que, em mais de quatro anos de existência, o periódico teve várias fases, nas quais abraçou propostas nacionalistas diversas, imprimiu caráter dinâmico aos seus objetivos, seções, artigos e mesmo materialidade. O propósito da pesquisa foi o de demarcar tais mudanças, distinguir os projetos defendidos nas suas páginas, além de explicar que tais alterações estavam em consonância com o envolvimento político e doutrinário da revista. / Gil Blas appeared in the city of Rio de Janeiro, in 13 of February of 1919, having circulated up to 6 of May of 1923. Such publication if constituted in door voice of the Epitácio Pessoa Government (1919-1923) and support of nationalistic conceptions of the decade of 1920, fact that became it an excellent source to understand the panorama cultural politician and of Brazil of this moment. It must be detached that, in more than four years of publication, the periodic one had some phases that if had articulated with diverse nationalistic proposals, what it gave a dynamic character to its objectives, sections, articles and materiality. The intention of this research was to demarcate such changes, as well as the nature of the proposals that had appeared in the interior of the periodic one, showing that such alterations were in accord with the initiatives doctrinal politics of the magazine.

Ulm, Univ., Diss., 2008.

Thesis--Columbia University. / Without thesis statement. Bibliography: p. 117-121.

Orientador: Tânia Regina de Luca / Banca: Sílvia Maria Azevedo / Banca: Marly Silva da Motta / Banca: Raimundo Pereira Alencar Arrais / Banca: Zelia Lopes da Silva / Resumo: Gil Blas surgiu na cidade do Rio de Janeiro, em 13 de fevereiro de 1919 e circulou até 6 de maio de 1923. A publicação foi porta voz do governo Epitácio Pessoa (1919-1923) e esteio de concepções nacionalistas da década de 1920, fato que a torna fonte relevante para se entender o panorama político e cultural do Brasil daquele momento. Deve-se destacar que, em mais de quatro anos de existência, o periódico teve várias fases, nas quais abraçou propostas nacionalistas diversas, imprimiu caráter dinâmico aos seus objetivos, seções, artigos e mesmo materialidade. O propósito da pesquisa foi o de demarcar tais mudanças, distinguir os projetos defendidos nas suas páginas, além de explicar que tais alterações estavam em consonância com o envolvimento político e doutrinário da revista. / Abstract: Gil Blas appeared in the city of Rio de Janeiro, in 13 of February of 1919, having circulated up to 6 of May of 1923. Such publication if constituted in door voice of the Epitácio Pessoa Government (1919-1923) and support of nationalistic conceptions of the decade of 1920, fact that became it an excellent source to understand the panorama cultural politician and of Brazil of this moment. It must be detached that, in more than four years of publication, the periodic one had some phases that if had articulated with diverse nationalistic proposals, what it gave a dynamic character to its objectives, sections, articles and materiality. The intention of this research was to demarcate such changes, as well as the nature of the proposals that had appeared in the interior of the periodic one, showing that such alterations were in accord with the initiatives doctrinal politics of the magazine. / Doutor

Durant ces dernières années, Il est de plus en plus compliqué d'écrire du code qui utilise une architecture au mieux de ses capacités. Certaines opérations clefs ont soit un accélérateur dédié, ou admettent une implémentation finement optimisée qui délivre les meilleurs performances. Ainsi, il est intéressant d'identifier ces opérations pendant la compilation d'un programme, et de faire appel à une implémentation optimisée.Nous nous intéressons dans cette thèse au problème de détection de ces opérations. Nous proposons un procédé qui détecte des sous-calculs correspondant à des opérations d'algèbre linéaire à l'intérieur de programmes polyédriques. L'idée principale de ce procédé est de découper le programme en sous-calculs isolés, et essayer de reconnaître chaque sous-calculs comme une combinaison d'opérateurs d'algèbre linéaire.Le découpage du calcul est effectué en utilisant une transformation de programme appelée tuilage monoparamétrique. Cette transformation partitionne le calcul en tuiles dont la forme est un agrandissement paramétrique d'une tuile de taille constante. Nous montrons que le programme tuilé reste polyédrique tout en permettant une paramétrisation limitée des tailles de tuile. Les travaux précédents sur le tuilage nous forçaient à choisir l'une de ces deux propriétés.Ensuite, afin d'identifier les opérateurs, nous introduisons un algorithme de reconnaissance de template, qui est une extension d'un algorithme d'équivalence de programme. Nous proposons plusieurs extensions afin de tenir compte des propriétés sémantiques communément rencontrées en algèbre linéaire.Enfin, nous combinons les deux contributions précédentes en un procédé qui détecte les sous-calculs correspondant à des opérateurs d'algèbre linéaire. Une de ses composantes est une librairie de template, inspirée de la spécification BLAS. Nous démontrons l'efficacité de notre procédé sur plusieurs applications. / Writing a code which uses an architecture at its full capability has become an increasingly difficult problem over the last years. For some key operations, a dedicated accelerator or a finely tuned implementation exists and delivers the best performance. Thus, when compiling a code, identifying these operations and issuing calls to their high-performance implementation is attractive. In this dissertation, we focus on the problem of detection of these operations. We propose a framework which detects linear algebra subcomputations within a polyhedral program. The main idea of this framework is to partition the computation in order to isolate different subcomputations in a regular manner, then we consider each portion of the computation and try to recognize it as a combination of linear algebra operations.We perform the partitioning of the computation by using a program transformation called monoparametric tiling. This transformation partitions the computation into blocks, whose shape is some homothetic scaling of a fixed-size partitioning. We show that the tiled program remains polyhedral while allowing a limited amount of parametrization: a single size parameter. This is an improvement compared to the previous work on tiling, that forced us to choose between these two properties.Then, in order to recognize computations, we introduce a template recognition algorithm. This template recognition algorithm is built on a state-of-the-art program equivalence algorithm. We also propose several extensions in order to manage some semantic properties.Finally, we combine these two previous contributions into a framework which detects linear algebra subcomputations. A part of this framework is a library of template, based on the BLAS specification. We demonstrate our framework on several applications.

Le problème de non-reproductibilté numérique surgit dans les calculs parallèles principalement à cause de la non-associativité de l’addition flottante. Les environnements parallèles changent dynamiquement l’ordre des opérations. Par conséquent, les résultats numériques peuvent changer d’une exécution à une autre. Nous garantissons la reproductibilité en étendant autantque possible l’arrondi correct à des séquences de calculs plus importantes que les opérations arithmétique exigées par le standard IEEE-754. Nous introduisons RARE-BLAS une implémentation des BLAS qui est reproductible et précise en utilisant les transformations sans erreur et les algorithmes de sommation appropriés. Nous présentons dans cette thèsedes solutions pour le premier (asum, dot and nrm2) et le deuxième (gemv and trsv) niveaux des BLAS. Nous développons une implémentation de ces solutions qui utilise les interfaces de programmation parallèles (OpenMP et MPI) et les jeu d’instructions vectorielles. Nous comparons l’efficacité de RARE-BLAS à une bibliothèque optimisé (Intel MKL) et à des solutionsreproductibles existantes. / Numerical reproducibility failures rise in parallel computation because floating-point summation is non-associative. Massively parallel systems dynamically modify the order of floating-point operations. Hence, numerical results might change from one run to another. We propose to ensure reproducibility by extending as far as possible the IEEE-754 correct rounding property to larger computing sequences. We introduce RARE-BLAS a reproducible and accurate BLAS library that benefits from recent accurate and efficient summation algorithms. Solutions for level 1 (asum, dot and nrm2) and level 2 (gemv and trsv) routines are designed. Implementations relying on parallel programming API (OpenMP, MPI) and SIMD extensions areproposed. Their efficiency is studied compared to optimized library (Intel MKL) and other existing reproducible algorithms.

No description available.

La primera vez que visité San Blas fue en el año 2007. Fui con mi promoción del colegio. Con el único ánimo de conocer, compré algunos souvenirs en la feria artesanal del barrio, paseé por sus calles y observé con fascinación sus hermosos balcones azules. No podía faltar también, la típica foto con toda la promoción bajo la paqcha de la plaza. ―Quería volver. No. Tenía que volver‖ ––me dije a mí misma––. Tal fue mi admiración por el Cusco que mi primer trabajo académico en la universidad fue sobre la región y su relación con el turismo. Recuerdo que fue para el curso de ―Argumentación‖. Este, sería mi primer acercamiento a mucha de la bibliografía de esta tesis. Digamos pues, que el Cusco acompañó mis rutas como estudiante desde que salí del colegio. / Tesis

Dense linear algebra(DLA) is one of the most seven important kernels in high performance computing. The introduction of new machines from vendors provides us opportunities to optimize DLA libraries for the new machines and thus exploit their power. Unfortunately the optimization phase is not straightforward. The optimum code of a certain Basic Linear Algebra Subprogram (BLAS) kernel, which is the core of DLA algorithms, in two different machines with different semiconductor process can be different even if they share the same features in terms of instruction set architecture, memory hierarchy and clock speed. It has become a tradition to optimize BLAS for new machines. Vendors maintain highly optimized BLAS libraries targeting their CPUs. Unfortunately the existing BLAS for GPUs is not highly optimized for DLA algorithms. In my research, I have provided new algorithms for several important BLAS kernels for different generation of GPUs and introduced a pointer redirecting approach to make BLAS run faster in generic problem size. I have also presented an auto-tuning approach to parameterize the developed BLAS algorithms and select the best set of parameters for a given card. The hardware trends have also brought up the need for updates on existing legacy DLA software packages, such as the sequential LAPACK. To take advantage of the new computational environment, successors of LAPACK must incorporate algorithms of three main characteristics: high parallelism, reduced communication, and heterogeneity-awareness. On multicore architectures, Parallel Linear Algebra Software for Multicore Architectures (PLASMA) has been developed to meet the challenges in multicore. On the other extreme, Matrix Algebra on GPU and Multicore Architectures (MAGMA) library demonstrated a hybridization approach that indeed streamlined the development of high performance DLA for multicores with GPU accelerators. The performance of these two libraries depend upon right choice of parameters for a given problem size and given number of cores and/or GPUs. In this work, the issue of automatically tuning these two libraries is presented. A prune based empirical auto-tuning method has been proposed for tuning PLASMA. Part of the tuning method for PLASMA was considered to tune hybrid MAGMA library.

Dense linear algebra(DLA) is one of the most seven important kernels inhigh performance computing. The introduction of new machines from vendorsprovides us opportunities to optimize DLA libraries for the new machinesand thus exploit their power. Unfortunately the optimization phase is notstraightforward. The optimum code of a certain Basic Linear AlgebraSubprogram (BLAS) kernel, which is the core of DLA algorithms, in twodifferent machines with different semiconductor process can be differenteven if they share the same features in terms of instruction setarchitecture, memory hierarchy and clock speed. It has become a traditionto optimize BLAS for new machines. Vendors maintain highly optimized BLASlibraries targeting their CPUs. Unfortunately the existing BLAS for GPUsis not highly optimized for DLA algorithms. In my research, I haveprovided new algorithms for several important BLAS kernels for differentgeneration of GPUs and introduced a pointer redirecting approach to makeBLAS run faster in generic problem size. I have also presented anauto-tuning approach to parameterize the developed BLAS algorithms andselect the best set of parameters for a given card.The hardware trends have also brought up the need for updates on existinglegacy DLA software packages, such as the sequential LAPACK. To takeadvantage of the new computational environment, successors of LAPACK mustincorporate algorithms of three main characteristics: high parallelism,reduced communication, and heterogeneity-awareness. On multicorearchitectures, Parallel Linear Algebra Software for MulticoreArchitectures (PLASMA) has been developed to meet the challenges inmulticore. On the other extreme, Matrix Algebra on GPU and MulticoreArchitectures (MAGMA) library demonstrated a hybridization approach thatindeed streamlined the development of high performance DLA for multicoreswith GPU accelerators. The performance of these two libraries depend uponright choice of parameters for a given problem size and given number ofcores and/or GPUs. In this work, the issue of automatically tuning thesetwo libraries is presented. A prune based empirical auto-tuning method hasbeen proposed for tuning PLASMA. Part of the tuning method for PLASMA wasconsidered to tune hybrid MAGMA library.