Timothy Mattson

Timothy Mattson

Auto-generated profile, based on publicly available information

Timothy Mattson

Intel Corporation, Hillsboro, United States

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2023
Verified
Book Chapter
Closed access
PDF file
TKTal Kadosh
Tal Kadosh
NSNadav Schneider
Nadav Schneider
NHNiranjan Hasabnis
Niranjan Hasabnis
TMTimothy Mattson
Timothy Mattson
Yuval PinterYuval Pinter
Yuval Pinter
GOGal Oren
Gal Oren

1 November 2021 in Computing in Science & Engineering
Verified
Journal Article
Closed access
TMTimothy G. Mattson
Timothy G. Mattson
TATodd A. Anderson
Todd A. Anderson
GGGiorgis Georgakoudis
Giorgis Georgakoudis
Python is a widely used language in scientific computing. When the goal is high performance, however, Python lags far behind low-level languages such as C and Fortran. To support applications that stress performance, Python needs to access the full capabilities of modern CPUs. That means support for parallel multithreading. In this article, we describe PyOMP, a system that enables OpenMP in Python. Programmers write code in Python with OpenMP, Numba generates code that compiles to LLVM, and the resulting programs run with performance that approaches that from code written with C and OpenMP. In this article, we provide an update on the PyOMP project and explain how to install it and use it to write parallel multithreaded code in Python.

12 November 2023
Verified
Conference Paper
Open access
NSNadav Schneider
Nadav Schneider
TKTal Kadosh
Tal Kadosh
NHNiranjan Hasabnis
Niranjan Hasabnis
TMTimothy Mattson
Timothy Mattson
YPYuval Pinter
Yuval Pinter
GOGal Oren
Gal Oren
Computational science has made rapid progress in recent years, leading to ever increasing demand for supercomputing resources. For scientific applications that leverage such resources, Message Passing Interface (MPI) plays a crucial role in enabling distributed memory parallelization across multiple nodes. However, parallelizing MPI code manually, and specifically, performing domain decomposition, is a challenging and error-prone task. In this paper, we address this problem by developing MPI-rical, a novel data-driven, programming-assistance tool that assists programmers in writing domain decomposition based distributed memory parallelization code using MPI. Specifically, we leverage Transformer architecture — the invention that led to advancements in the field of natural language processing (NLP) — with a supervised language model to suggest MPI functions and their proper locations in the code on the fly. In addition to the novel model for MPI-based parallel programming, in this paper, we also introduce MPICodeCorpus, the first publicly-available corpus of MPI-based parallel programs that is created by mining more than 15,000 open-source repositories on GitHub. Experimental results demonstrate the effectiveness of MPI-rical on both dataset from MPICodeCorpus and more importantly, on a compiled benchmark of MPI-based parallel programs for numerical computations that represent real-world scientific applications. Specifically, MPI-rical achieves F1 scores between 0.87-0.91 on these programs, demonstrating its accuracy in suggesting correct MPI functions at appropriate code locations. The source code used in this work, as well as other relevant sources, are available at: https://github.com/Scientific-Computing-Lab-NRCN/MPI-rical.

3 June 2024
Verified
Conference Paper
Open access
NSNadav Schneider
Nadav Schneider
NHNiranjan Hasabnis
Niranjan Hasabnis
VVVy A. Vo
Vy A. Vo
TKTal Kadosh
Tal Kadosh
NKNeva Krien
Neva Krien
GOGal Oren
Gal Oren
The imperative need to scale computation across numerous nodes highlights the significance of efficient parallel computing, particularly in the realm of Message Passing Interface (MPI) integration. While MPI serves as a cornerstone for large-scale parallelism, its seamless integration into codebases, especially concerning domain decomposition, has proven challenging. Static tools aimed at addressing this challenge have exhibited limited effectiveness and scalability. On the other hand, contemporary language models designed for programming problems have demonstrated utility in parallel programming tasks such as OpenMP pragma generation. However, the challenging parallel programming task of generating MPI-based parallel programs has remained unexplored. This study first investigates the performance of state-of-the-art language models in generating MPI-based parallel programs. Findings reveal that widely used models such as GPT-3.5 and PolyCoder (specialized multi-lingual code models) exhibit notable performance degradation when generating MPI-based programs compared to general-purpose programs. In contrast, domain-specific models such as MonoCoder, which are pre-trained on MPI-related programming languages of C and C++, outperform larger models. Subsequently, we introduce a dedicated downstream task of MPI-based program generation by fine-tuning MonoCoder on HPCorpusMPI. We call the resulting model as MPIrigen. We propose an innovative preprocessing for completion only after observing the whole code, thus enabling better completion with a wider context. Comparative analysis against GPT-3.5 zero-shot performance, using a novel HPC-oriented evaluation method, demonstrates that MPIrigen excels in generating accurate MPI functions calls. The success of this tailored solution underscores the importance of domain-specific fine-tuning in optimizing language models for parallel computing code generation, paving the way for a new generation of automatic parallelization tools. The sources of this work are available at our GitHub MPIrigen repository.

15 September 2024
Verified
Conference Paper
Closed access
OMOlivia Di Matteo
Olivia Di Matteo
SNSantiago Núñez-Corrales
Santiago Núñez-Corrales
MSMichał Stęchły
Michał Stęchły
SRSteven P. Reinhardt
Steven P. Reinhardt
TMTim Mattson
Tim Mattson
The computer industry, with over seven decades of experience to draw on, has shown that to thrive, there must be a community of software engineers that produce the applications users depend on. Supporting those software engineers so they can write code that performs well across multiple generations of hardware (since application software generally lasts longer than hardware) is fundamental to sustaining the computer industry. Today's quantum software developers must reason at a low level, close to the hardware, which is not sustainable. In this paper, we assert that quantum computing needs high-level abstractions that support a quantum computing applications ecosystem. A single abstraction that bridges from the mental models used by a programmer to the details of how qubits are realized in hardware is unlikely to work. We need a hierarchy of tightly coupled models that define a framework for reasoning about the software development process in quantum computing. We propose an abstraction hierarchy and then explore its utility with two approaches to the eigenvalue estimation problem: (1) a variational algorithm with error mitigation, and (2) phase estimation with error correction. We use our proposed abstraction hierarchy to pinpoint key differences between these approaches and demonstrate how an abstraction hierarchy helps us understand software development. This supports our central conclusion; that it is not enough to understand individual components of a software stack. To make progress, we need to think about an abstraction hierarchy holistically.

1 May 2001 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
BMBerna L. Massingill
Berna L. Massingill
TMTimothy G. Mattson
Timothy G. Mattson
BSBeverly A. Sanders
Beverly A. Sanders