Jeronimo Castrillon

Jeronimo Castrillon

Auto-generated profile, based on publicly available information

Jeronimo Castrillon

Technische Universität Dresden Dresden Germany

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
24 March 2020 in Proceedings of the IEEE
Verified
Journal Article
Open access
RBRobin Blasing
Robin Blasing
AKAsif Ali Khan
Asif Ali Khan
PFPanagiotis Ch. Filippou
Panagiotis Ch. Filippou
CGChirag Garg
Chirag Garg
FHFazal Hameed
Fazal Hameed
SPStuart S. P. Parkin
Stuart S. P. Parkin
Racetrack memory (RTM) is a novel spintronic memory-storage technology that has the potential to overcome fundamental constraints of existing memory and storage devices. It is unique in that its core differentiating feature is the movement of data, which is composed of magnetic domain walls (DWs), by short current pulses. This enables more data to be stored per unit area compared to any other current technologies. On the one hand, RTM has the potential for mass data storage with unlimited endurance using considerably less energy than today's technologies. On the other hand, RTM promises an ultrafast nonvolatile memory competitive with static random access memory (SRAM) but with a much smaller footprint. During the last decade, the discovery of novel physical mechanisms to operate RTM has led to a major enhancement in the efficiency with which nanoscopic, chiral DWs can be manipulated. New materials and artificially atomically engineered thin-film structures have been found to increase the speed and lower the threshold current with which the data bits can be manipulated. With these recent developments, RTM has attracted the attention of the computer architecture community that has evaluated the use of RTM at various levels in the memory stack. Recent studies advocate RTM as a promising compromise between, on the one hand, power-hungry, volatile memories and, on the other hand, slow, nonvolatile storage. By optimizing the memory subsystem, significant performance improvements can be achieved, enabling a new era of cache, graphical processing units, and high capacity memory devices. In this article, we provide an overview of the major developments of RTM technology from both the physics and computer architecture perspectives over the past decade. We identify the remaining challenges and give an outlook on its future.

14 February 2019 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
AKAsif Ali Khan
Asif Ali Khan
FHFazal Hameed
Fazal Hameed
RBRobin Blaesing
Robin Blaesing
SPStuart Parkin
Stuart Parkin
JCJeronimo Castrillon
Jeronimo Castrillon
Racetrack memories (RTMs) have drawn considerable attention from computer architects of late. Owing to their SRAM's comparable access latency and ultra-high capacity, RTMs are promising candidates to revolutionize the memory subsystem. In order to evaluate their performance and appraise their suitability at various levels in the memory hierarchy, it is crucial to have RTM-specific simulation tools that accurately model their behavior and enable exhaustive design space exploration. To this end, we propose RTSim, an open source cycle-accurate memory simulator that empowers performance evaluation of the domain-wall-based racetrack memories. The skyrmions-based RTMs can also be modeled with RTSim because they are architecturally similar to domain-wall-based RTMs. RTSim is developed in collaboration with physicists and computer scientists. It accurately models RTM-specific shifting operations, access ports and the sequence of memory commands beside handling the routine read/write operations. RTSim is built on top of NVMain2.0, rendering larger design space for exploration.

2 August 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
ASAdam Siemieniuk
Adam Siemieniuk
LCLorenzo Chelini
Lorenzo Chelini
AKAsif Ali Khan
Asif Ali Khan
JCJeronimo Castrillon
Jeronimo Castrillon
ADAndi Drebes
Andi Drebes
MKMartin Kong
Martin Kong
Memristive devices promise an alternative approach toward non-Von Neumann architectures, where specific computational tasks are performed within the memory devices. In the machine learning (ML) domain, crossbar arrays of resistive devices have shown great promise for ML inference, as they allow for hardware acceleration of matrix multiplications. But, to enable widespread adoption of these novel architectures, it is critical to have an automatic compilation flow as opposed to relying on a manual mapping of specific kernels on the crossbar arrays. We demonstrate the programmability of memristor-based accelerators using the new compiler design principle of multilevel rewriting, where a hierarchy of abstractions lowers programs level-by-level and perform code transformations at the most suitable abstraction. In particular, we develop a prototype compiler, which progressively lowers a mathematical notation for tensor operations arising in ML workloads, to fixed-function memristor-based hardware blocks.

26 October 2023 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
CMChristian Menard
Christian Menard
MLMarten Lohstroh
Marten Lohstroh
SBSoroush Bateni
Soroush Bateni
MCMatthew Chorlian
Matthew Chorlian
ADArthur Deng
Arthur Deng
ELEdward Lee
Edward Lee
Actor frameworks and similar reactive programming techniques are widely used for building concurrent systems. They promise to be efficient and scale well to a large number of cores or nodes in a distributed system. However, they also expose programmers to nondeterminism, which often makes implementations hard to understand, debug, and test. The recently proposed reactor model is a promising alternative that enables deterministic concurrency. In this paper, we present an efficient, parallel implementation of reactors and demonstrate that the determinacy of reactors does not imply a loss in performance. To show this, we evaluate Lingua Franca (LF), a reactor-oriented coordination language. LF equips mainstream programming languages with a deterministic concurrency model that automatically takes advantage of opportunities to exploit parallelism. Our implementation of the Savina benchmark suite demonstrates that, in terms of execution time, the runtime performance of LF programs even exceeds popular and highly optimized actor frameworks. We compare against Akka and CAF, which LF outperforms by 1.86x and 1.42x, respectively.

6 December 2018 in Proceedings of the IEEE
Verified
Journal Article
Closed access
GFGerhard P. Fettweis
Gerhard P. Fettweis
MDMeik Dorpinghaus
Meik Dorpinghaus
JCJeronimo Castrillon
Jeronimo Castrillon
Akash KumarAkash Kumar
Akash Kumar
CBChristel Baier
Christel Baier
TSThorsten Strufe
Thorsten Strufe
With the explosion of the number of compute nodes, the bottleneck of future computing systems lies in the network architecture connecting the nodes. Addressing the bottleneck requires replacing current backplane-based network topologies. We propose to revolutionize computing electronics by realizing embedded optical waveguides for onboard networking and wireless chip-to-chip links at 200-GHz carrier frequency connecting neighboring boards in a rack. The control of novel rate-adaptive optical and mm-wave transceivers needs tight interlinking with the system software for runtime resource management.

26 December 2019 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
PDF file
AKAsif Ali Khan
Asif Ali Khan
FHFazal Hameed
Fazal Hameed
RBRobin Bläsing
Robin Bläsing
SPStuart S. P. Parkin
Stuart S. P. Parkin
JCJeronimo Castrillon
Jeronimo Castrillon
Racetrack memories (RMs) have significantly evolved since their conception in 2008, making them a serious contender in the field of emerging memory technologies. Despite key technological advancements, the access latency and energy consumption of an RM-based system are still highly influenced by the number of shift operations. These operations are required to move bits to the right positions in the racetracks. This article presents data-placement techniques for RMs that maximize the likelihood that consecutive references access nearby memory locations at runtime, thereby minimizing the number of shifts. We present an integer linear programming (ILP) formulation for optimal data placement in RMs, and we revisit existing offset assignment heuristics, originally proposed for random-access memories. We introduce a novel heuristic tailored to a realistic RM and combine it with a genetic search to further improve the solution. We show a reduction in the number of shifts of up to 52.5%, outperforming the state of the art by up to 16.1%.