Engineering Papers⌕ Search

Engineering topics

Torres, David

Publications and source records attributed to Torres, David.

Automatically parallelizing batch inference on deep neural networks using Fiats and Fortran 2023 `do concurrent`

This paper introduces novel programming strategies that leverage features of the Fortran 2023 standard of the International Standards Organization (ISO) to automatically parallelize computations on deep neural networks. The paper focuses on the interplay of object-oriented, parallel, and functional programming paradigms in the Fiats deep learning library. We demonstrate how several infrequently used language features play a role in enabling efficient, parallel execution. Specifically, the ability to explicitly declare that a procedure is pure facilitates inference in the context of the language’s loop-parallelism construct `do concurrent`. Also, explicitly prohibiting the overriding of a parent type’s type-bound procedures eliminates the need for dynamic dispatch in performance-critical code. Finally, this paper uses batch inference calculations on a neural network surrogate for atmospheric aerosol dynamics to demonstrate that LLVM Flang compiler’s automatic parallelization of `do concurrent` achieves roughly the same performance and scalability as achieved by OpenMP compiler directives. We also demonstrate that double-precision inference costs 37–72% longer runtime than default-real precision with most values in the range 57-60%.

Rouson, Damian↗

Motility Analysis of T-Cell Histories in Activation (Matcha) v0.1.0

Despite advances in microscopy, imaging techniques only capture a very small spatial and temporal fraction of T cell activity within a tissue. For this reason, we have pursued the development of a virtual T cell model. Matcha's objective is to design virtual T cells that move like biological T cells. The virtual T cells will match the speed and turning angle distributions of biological cells. In addition, Matcha will also attempt to match the volume patrolled by the biological cells and the dependence on speed and turning angle on the previous speed.

Rouson, Damian↗

Diversity for Microelectronics Lifecycle Security

In this work we examine approaches for using implementation diversity to disrupt or disable hardware trojans. We explore a variety of general frameworks for building diverse variants of circuits in voting architectures, and examine the impact of these on attackers and defenders mathematically and empirically. This work is augmented by analysis of a new majority voting technique. We also describe several automated approaches for generating diverse variants of a circuit and empirically study the overheads associated with these. We then describe a general technique for targeting functional circuit modifications to hardware trojans, present several specific implementations of this technique, and study the impact that they have on trojanized benchmark circuits.

97 MATHEMATICS AND COMPUTING↗

NC Space Grant Report

During the summer of 2018 I supported the Safety & Mission Assurance Directorate (SMA) and Operations Support Division (QA-20) at Stennis Space Center. The mission of the SMA team is to prove safety, risk, reliability, independent assessments, configuration management and quality assurance guidance, and services for all NASA Stennis Space Center (SSC) programs, facilities, and supporting infrastructure. The office actively participates and contributes to the Agency-level Safety & Mission Assurance (S&MA) effort. Over the course of the Summer I participated in three projects. Two of them were focused around Fault Tree Analysis (FTA) and the third focused on relief valves for their E-1 engine test stand.

Torres, David↗

An Efficient Spectral Method for Ordinary Differential Equations with Rational Function Coefficients

We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.

Coutsias, Evangelos A.↗