On Space-Time Trade-Off for Montgomery Multipliers over Finite Fields

La multiplication dans le corps de Galois à 2^m éléments (i.e. GF(2^m)) est une opérations très importante pour les applications de la théorie des correcteurs et de la cryptographie. Dans ce mémoire, nous nous intéressons aux réalisations parallèles de multiplicateurs dans GF(2^m) lorsque ce dernier est généré par des trinômes irréductibles. Notre point de départ est le multiplicateur de Montgomery qui calcule A(x)B(x)x^(-u) efficacement, étant donné A(x), B(x) in GF(2^m) pour u choisi judicieusement. Nous étudions ensuite l'algorithme diviser pour régner PCHS qui permet de partitionner les multiplicandes d'un produit dans GF(2^m) lorsque m est impair. Nous l'appliquons pour la partitionnement de A(x) et de B(x) dans la multiplication de Montgomery A(x)B(x)x^(-u) pour GF(2^m) même si m est pair. Basé sur cette nouvelle approche, nous construisons un multiplicateur dans GF(2^m) généré par des trinôme irréductibles. Une nouvelle astuce de réutilisation des résultats intermédiaires nous permet d'éliminer plusieurs portes XOR redondantes. Les complexités de temps (i.e. le délais) et d'espace (i.e. le nombre de portes logiques) du nouveau multiplicateur sont ensuite analysées: 1. Le nouveau multiplicateur demande environ 25% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito lorsque GF(2^m) est généré par des trinômes irréductible et m est suffisamment grand. Le nombre de portes du nouveau multiplicateur est presque identique à celui du multiplicateur de Karatsuba proposé par Elia. 2. Le délai de calcul du nouveau multiplicateur excède celui des meilleurs multiplicateurs d'au plus deux évaluations de portes XOR. 3. Nous determinons le délai et le nombre de portes logiques du nouveau multiplicateur sur les deux corps de Galois recommandés par le National Institute of Standards and Technology (NIST). Nous montrons que notre multiplicateurs contient 15% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito au coût d'un délai d'au plus une porte XOR supplémentaire. De plus, notre multiplicateur a un délai d'une porte XOR moindre que celui du multiplicateur d'Elia au coût d'une augmentation de moins de 1% du nombre total de portes logiques.

Algorithm-oriented design of efficient many-core architectures applied to dense matrix multiplication

Recent integrated circuit technologies have opened the possibility to design parallel architectures with hundreds of cores on a single chip. The design space of these parallel architectures is huge with many architectural options. Exploring the design space gets even more difficult if, beyond performance and area, we also consider extra metrics like performance and area efficiency, where the designer tries to design the architecture with the best performance per chip area and the best sustainable performance. In this paper we present an algorithm-oriented approach to design a many-core architecture. Instead of doing the design space exploration of the many core architecture based on the experimental execution results of a particular benchmark of algorithms, our approach is to make a formal analysis of the algorithms considering the main architectural aspects and to determine how each particular architectural aspect is related to the performance of the architecture when running an algorithm or set of algorithms. The architectural aspects considered include the number of cores, the local memory available in each core, the communication bandwidth between the many-core architecture and the external memory and the memory hierarchy. To exemplify the approach we did a theoretical analysis of a dense matrix multiplication algorithm and determined an equation that relates the number of execution cycles with the architectural parameters. Based on this equation a many-core architecture has been designed. The results obtained indicate that a 100 mm(2) integrated circuit design of the proposed architecture, using a 65 nm technology, is able to achieve 464 GFLOPs (double precision floating-point) for a memory bandwidth of 16 GB/s. This corresponds to a performance efficiency of 71 %. Considering a 45 nm technology, a 100 mm(2) chip attains 833 GFLOPs which corresponds to 84 % of peak performance These figures are better than those obtained by previous many-core architectures, except for the area efficiency which is limited by the lower memory bandwidth considered. The results achieved are also better than those of previous state-of-the-art many-cores architectures designed specifically to achieve high performance for matrix multiplication.

Sparse matrix multiplication on a reconfigurable many-core architecture

Sparse matrix-vector multiplication (SMVM) is a fundamental operation in many scientific and engineering applications. In many cases sparse matrices have thousands of rows and columns where most of the entries are zero, while non-zero data is spread over the matrix. This sparsity of data locality reduces the effectiveness of data cache in general-purpose processors quite reducing their performance efficiency when compared to what is achieved with dense matrix multiplication. In this paper, we propose a parallel processing solution for SMVM in a many-core architecture. The architecture is tested with known benchmarks using a ZYNQ-7020 FPGA. The architecture is scalable in the number of core elements and limited only by the available memory bandwidth. It achieves performance efficiencies up to almost 70% and better performances than previous FPGA designs.

Failure of nitric oxide production by macrophages and decrease in CD4+ T cells in oral paracoccidioidomycosis: possible mechanisms that permit local fungal multiplication

Paracoccidioidomycosis is a chronic granulomatous disease that induces a specific inflammatory and immune response. The participation of nitric oxide (NO), a product of the inducible nitric oxide synthase enzyme (iNOS), as an important fungicidal molecule against Paracoccidioides brasiliensis has been demonstrated. In order to further characterize the Oral Paracoccidioidomycosis (OP), we undertook an immunohistochemical study of iNOS+, CD45RO+, CD3+, CD8+, CD20+, CD68+ cells and mast cells. The samples were distributed in groups according to the number of viable fungi per mm². Our results showed weak immunolabeling for iNOS in the multinucleated giant cells (MNGC) and in most of the mononuclear (MN) cells, and the proportion of iNOS+ MN/MNGC cells in the OP were comparable to Control (clinically healthy oral tissues). Additionally, our analysis revealed a similarity in the number of CD4+ cells between the Control and the OP groups with higher numbers of fungi. These findings suggest that a low expression of iNOS and a decrease in the CD4+ T cells in OP may represent possible mechanisms that permit the local fungal multiplication and maintenance of active oral lesions.

Saul's Conversion (Acts 9-22-26) and the Multiplication of Narrative in Acts

(Résumé de l'ouvrage) The essays in this collection come from a research symposium involving the universities of Manchester and Lausanne. The essays cover a wide range of mutually-enriching approaches to the study of the Lukan writings. Aspects considered include Luke's use of the term 'Son of Man', his use of scripture, his literary achievements, and the issue of 'godfearers' in Acts.

Montgomery County Reaudit, July 1, 2001 through June 30, 2002

County Audit Report

Montgomery County, Independent Auditor's Reports, Basic Financial Statements and Supplementary Information, Schedule of Findings, June 30, 2004

County Audit Report

Montgomery County, Independent Auditor's Reports, Basic Financial Statements and Supplementary Information, Schedule of Findings, June 30, 2005

County Audit Report

Audit report on Montgomery County, Iowa for the year ended June 30, 2006

Audit report on Montgomery County, Iowa for the year ended June 30, 2006

Audit report on Montgomery County, Iowa for the year ended June 30, 2007

Audit report on Montgomery County, Iowa for the year ended June 30, 2007

Audit report on Montgomery County, Iowa for the year ended June 30, 2008

Audit report on Montgomery County, Iowa for the year ended June 30, 2008

Audit report on Montgomery County, Iowa for the year ended June 30, 2009

Audit report on Montgomery County, Iowa for the year ended June 30, 2009

Audit report on Montgomery County, Iowa for the year ended June 30, 2010

Audit report on Montgomery County, Iowa for the year ended June 30, 2010