Hiren Patel

Hiren Patel

Auto-generated profile, based on publicly available information

Hiren Patel

University of Waterloo, Waterloo, Canada

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
20 November 2023 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
FLFrancesco Lumpp
Francesco Lumpp
FFFranco Fummi
Franco Fummi
HPHiren D. Patel
Hiren D. Patel
NBNicola Bombieri
Nicola Bombieri
Containerization and orchestration have become two key requirements in software development best practices. Containerization allows for better resource utilization, platform-independent development, and secure deployment of software. Orchestration automates the deployment, networking, scaling, and availability of containerized workloads and services. While containerization is increasingly being adopted in the robotic community, the use of task orchestration platforms (e.g., Kubernetes) is still an open challenge. The biggest limitation is due to the fact that state-of-the-art orchestrators do not support real-time (RT) containers, while advanced robotic software often consists of a mix of heterogeneous tasks (i.e., ROS nodes) with different levels of temporal constraints (i.e., mixed-criticality systems). This work addresses this challenge by presenting RT-Kube, a platform that extends the de-facto reference standard for container orchestration, Kubernetes, to schedule tasks with mixed-criticality requirements. It implements monitoring of tasks and detects missed deadlines for those with RT constraints. It selects low-priority tasks to be migrated at runtime to different units of the computing cluster to free resources and recover from temporal violations. We present quantitative experimental results on the software implementing the mission of a Robotnik RB-Kairos mobile robot to demonstrate the effectiveness of the proposed approach. The source code is publicly available on GitHub.

1 December 2021 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
AKAnirudh Mohan Kaushik
Anirudh Mohan Kaushik
MHMohamed Hassan
Mohamed Hassan
HPHiren Patel
Hiren Patel
This work addresses the challenge of allowing simultaneous and predictable accesses to shared data on multi-core systems. We propose a collection of predictable cache coherence protocols, which mandate the use of certain design invariants to ensure predictability. In particular, we enforce these invariants by augmenting the classic modify-share-invalid (MSI) protocol and modify-exclusive-share-invalid (MESI) protocol. This allows us to derive worst-case latency bounds on the resulting predictable MSI (PMSI) and predictable MESI (PMESI) protocols. Our analysis shows that while the arbitration latency scales linearly, the coherence latency scales quadratically with the number of cores, which emphasizes the importance of accounting for cache coherence effects on latency bounds. We implement PMSI and PMESI in a detailed micro-architectural simulator, and execute SPLASH-2 and synthetic workloads. Results show that our approach is always within the analytical worst-case latency bounds, and that PMSI and PMESI improve average-case performance by up to 4 over the next best predictable alternative. PMSI and PMESI have average slowdowns of 1.45 and 1.46 compared to conventional MSI and MESI protocols, respectively.

1 April 2015
Verified
Conference Paper
Closed access
MHMohamed Hassan
Mohamed Hassan
AKAnirudh M. Kaushik
Anirudh M. Kaushik
HPHiren Patel
Hiren Patel
We explore techniques to reverse-engineer properties of DRAM memory controllers (MCs). This includes page policies, address mapping schemes and command arbitration schemes. There are several benefits to knowing this information: they allow analysis techniques to effectively compute worst-case bounds, and they allow customizations to be made in software for predictability. We develop a latency-based analysis, and use this analysis to devise algorithms for micro-benchmarks to extract properties of MCs. In order to cover a breadth of page policies, address mappings and command arbitration schemes, we explore our technique using a micro-architecture simulation framework and document our findings.

30 September 2007
Verified
Conference Paper
Open access
RBReinaldo Bergamaschi
Reinaldo Bergamaschi
INIndira Nair
Indira Nair
GDGero Dittmann
Gero Dittmann
HPHiren Patel
Hiren Patel
GJGeert Janssen
Geert Janssen
GHGuoling Han
Guoling Han

23 August 2025
Verified
Book Chapter
Closed access
PDF file
RSRuimin Shi
Ruimin Shi
GSGabin Schieffer
Gabin Schieffer
MGMaya Gokhale
Maya Gokhale
PLPeihung Lin
Peihung Lin
HPHiren Patel
Hiren Patel
IPIvy Peng
Ivy Peng

15 November 2025
Verified
Conference Paper
Open access
HLHung-Ming Lai
Hung-Ming Lai
PLPeihung Lin
Peihung Lin
MGMaya Gokhale
Maya Gokhale
IPIvy Peng
Ivy Peng
HPHiren Patel
Hiren Patel
JLJenq-Kuen Lee
Jenq-Kuen Lee