Searcharxiv⌕ Search

arXiv subjects

Amir Mohammad Tavakkoli

Publications and source records attributed to Amir Mohammad Tavakkoli.

3 recordsLinked to original sources

On the extension of inner derivations from dense ideals in Banach algebras

Let $A$ be a Banach algebra and $I$ a dense ideal in $A$. A natural question in the theory of operator algebras is whether the property that all derivations $D: A \to I$ are inner (implemented by elements in $I$) implies that all derivations $D: A \to A$ are inner (implemented by elements in $A$). We present a rigorous negative answer to this question. By utilizing the algebra of compact operators $A = K(H)$ and the dense ideal of finite-rank operators $I = F(H)$ on a separable infinite-dimensional Hilbert space $H$, we demonstrate that while every derivation into $F(H)$ is inner, there exist outer derivations on $K(H)$. Furthermore, we generalize this result to Schatten $p$-classes and discuss the cohomological implications and the role of approximate identities. Moreover, the main results and counterexamples presented in this paper have been formally verified using the Lean theorem prover.

math.FA↗

LEGO: A Layout Expression Language for Code Generation of Hierarchical Mapping

We describe LEGO, a new approach to optimizing data movement whereby code is expressed as a layout-independent computation and composed with layouts for data and computation. This code generator organization derives complex indexing expressions associated with hierarchical parallel code and data movement for GPUs. LEGO maps from layout specification to indexing expressions, and can be integrated into existing compilers and code templates. It facilitates the exploration of data layouts in combination with other optimizations. We demonstrate LEGO's integration with the Triton and MLIR compilers, and with CUDA templates. We show that LEGO is capable of deriving performance competitive with Triton, and shows broad applicability for data and thread layout mapping optimizations in its integration with CUDA and MLIR.

cs.PL↗

Scheduling Languages: A Past, Present, and Future Taxonomy

Scheduling languages express to a compiler a sequence of optimizations to apply. Compilers that support a scheduling language interface allow exploration of compiler optimizations, i.e., exploratory compilers. While scheduling languages have become a common feature of tools for expert users, the proliferation of these languages without unifying common features may be confusing to users. Moreover, we recognize a need to organize the compiler developer community around common exploratory compiler infrastructure, and future advances to address, for example, data layout and data movement. To support a broader set of users may require raising the level of abstraction. This paper provides a taxonomy of scheduling languages, first discussing their origins in iterative compilation and autotuning, noting the common features and how they are used in existing frameworks, and then calling for changes to increase their utility and portability.

cs.PL↗