Semi-retirement, or, really, changing my relationship with the BSDs - Dr. Brian Robert Callahan

No Semicolons Needed | Terts Diepraam

Comp.compilers: Announcing Ox release 1.12.3

From comp.compilers newsgroup: Announcing Ox release 1.12.3

Torturing rustc by Emulating HKTs, Causing an Inductive Cycle and Borking the Compiler — ramblings of @harudagondi

I just wanted higher kinded types. I borked the compiler instead.

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers (Technical Report) | OSTI.GOV

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels. | OSTI.GOV

Lambda Calculus Explorer

0 comments