Albert Mo Kim Cheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Albert Mo Kim Cheng has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Guangli Dai
Department of Computer Science, University of Houston, Houston, TX, USA
4 shared publications Chaitanya Belwal
Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA#TAB
3 shared publications- Pavan Kumar Paluri
Department of Computer Science, University of Houston, Houston, TX, USA
3 shared publications - Weizhe Zhang
Harbin Institute of Technology
3 shared publications - Carlos A. Rincon C.
Department of Computer Science, University of Houston, Houston, TX, USA
2 shared publications - Chaitanya Belwal
Department of Computer Science, University of Houston, TX, USA
2 shared publications
Latest Publications
- Open Access
- 17 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 11-12
Work-in-Progress: Flexible bus arbitration in mixed criticality systems
- 17 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 11-12
Open AccessWork-in-Progress: Flexible bus arbitration in mixed criticality systems
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 241-242
FACSAT: Conception as a cyber-physical system for satellite observation of the Earth: Automated mission planning and scheduling
Earth observation satellites such as FACSAT, equipped with embedded hardware and software systems, require interaction with physical variables such as time, energy and space for their operation. In this paper, a FACSAT is characterized conceptually as a cyber-physical system. We propose a model that, based on a series of assumptions and restrictions, describes the operating principle of the system. Using this model, we describe the development of a tool for the automation of mission planning and scheduling that is modularly integrated into the mission control software, which is validated in real operational scenarios with the FACSAT-1 satellite.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 241-242
Open AccessFACSAT: Conception as a cyber-physical system for satellite observation of the Earth: Automated mission planning and scheduling
Earth observation satellites such as FACSAT, equipped with embedded hardware and software systems, require interaction with physical variables such as time, energy and space for their operation. In this paper, a FACSAT is characterized conceptually as a cyber-physical system. We propose a model that, based on a series of assumptions and restrictions, describes the operating principle of the system. Using this model, we describe the development of a tool for the automation of mission planning and scheduling that is modularly integrated into the mission control software, which is validated in real operational scenarios with the FACSAT-1 satellite.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 469-471
Poster Abstract: Implementing Dynamic User Equilibrium in a Scaled City Environment with Duckietown and SUMO | Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation
Effective traffic routing is an important part of a city’s architecture, with numerous simulation based representations being developed throughout the years. An important part of simulation based solutions is the practicality of these solutions in a real environment. To this end, we propose a scheme to bring a theoretical approach known as Dynamic User Equilibrium (DUE) from the simulator to a scaled city with wirelessly connected miniature autonomous vehicles. We describe how we translate a DUE solution from traffic simulator Simulation of Urban Mobility (SUMO) to physical Duckietown Robots. Our goal is to develop a predictable DUE solution for Duckietown Robots using SUMO as not only a development environment but guiding tool.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 469-471
Open AccessPoster Abstract: Implementing Dynamic User Equilibrium in a Scaled City Environment with Duckietown and SUMO | Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation
Effective traffic routing is an important part of a city’s architecture, with numerous simulation based representations being developed throughout the years. An important part of simulation based solutions is the practicality of these solutions in a real environment. To this end, we propose a scheme to bring a theoretical approach known as Dynamic User Equilibrium (DUE) from the simulator to a scaled city with wirelessly connected miniature autonomous vehicles. We describe how we translate a DUE solution from traffic simulator Simulation of Urban Mobility (SUMO) to physical Duckietown Robots. Our goal is to develop a predictable DUE solution for Duckietown Robots using SUMO as not only a development environment but guiding tool.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 494-495
Demo Abstract: Collaborative Real-Time Scheduling (CRTS) Algorithm for AGV Transportation System within a CPS Architecture | Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation
The use of Autonomous Guided Vehicles (AGVs) is important in smart factories to enhance manufacturing operations. However, current AGV scheduling algorithms are inadequate and not connected to real-time data on manufacturing needs, leading to underutilized AGVs and missed delivery deadlines. The lack of algorithms that ensure timely delivery of materials results in idle time of AGVs and material shortages. We present a collaborative real-time scheduling (CRTS) algorithm for AGVs in smart factories. The algorithm not only ensures timely delivery of materials to processing units but also predicts the minimum number of AGVs required. The algorithm is designed to operate within a cyber-physical system architecture, where AGVs and processing units exchange data via a wireless network. The simulation results on the Node-Red platform show that the algorithm is efficient and adequate to meet real-time delivery requirements, with an average AGV utilization of over 92%.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 494-495
Open AccessDemo Abstract: Collaborative Real-Time Scheduling (CRTS) Algorithm for AGV Transportation System within a CPS Architecture | Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation
The use of Autonomous Guided Vehicles (AGVs) is important in smart factories to enhance manufacturing operations. However, current AGV scheduling algorithms are inadequate and not connected to real-time data on manufacturing needs, leading to underutilized AGVs and missed delivery deadlines. The lack of algorithms that ensure timely delivery of materials results in idle time of AGVs and material shortages. We present a collaborative real-time scheduling (CRTS) algorithm for AGVs in smart factories. The algorithm not only ensures timely delivery of materials to processing units but also predicts the minimum number of AGVs required. The algorithm is designed to operate within a cyber-physical system architecture, where AGVs and processing units exchange data via a wireless network. The simulation results on the Node-Red platform show that the algorithm is efficient and adequate to meet real-time delivery requirements, with an average AGV utilization of over 92%.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 491-493
Demo Abstract: Implementing a COVID-19 Risk Assessment System for User-Informed Travel Planning in Harris County | Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation
The COVID-19 pandemic has forced people worldwide to modify their daily activities, including travel plans. To help individuals make informed decisions about visiting public places, Cheng [2] first proposed a real-time COVID-19 risk assessment system called RT-CIRAM and implemented prototypes for two U.S. metropolitan locations. The system calculates a COVID-19 risk score and categorizes the risk levels into high, medium, and low, recommends the safe travel destination using the users’ location and the specified distance the user is willing to travel, thereby helping users make informed decisions about their travel plans.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 491-493
Open AccessDemo Abstract: Implementing a COVID-19 Risk Assessment System for User-Informed Travel Planning in Harris County | Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation
The COVID-19 pandemic has forced people worldwide to modify their daily activities, including travel plans. To help individuals make informed decisions about visiting public places, Cheng [2] first proposed a real-time COVID-19 risk assessment system called RT-CIRAM and implemented prototypes for two U.S. metropolitan locations. The system calculates a COVID-19 risk score and categorizes the risk levels into high, medium, and low, recommends the safe travel destination using the users’ location and the specified distance the user is willing to travel, thereby helping users make informed decisions about their travel plans.
- 3 November 2022
- Published by Springer Nature in Real-Time Systems
- Vol. 58 (4) , 401-429
Enhanced schedulability tests for real-time regularity-based virtualized systems with dependent and self-suspension tasks
- 3 November 2022
- Published by Springer Nature in Real-Time Systems
- Vol. 58 (4) , 401-429
Enhanced schedulability tests for real-time regularity-based virtualized systems with dependent and self-suspension tasks
- 23 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 71 (10) , 2592-2605
Regularity-Based Virtualization Under the ARINC 653 Standard for Embedded Systems
In embedded real-time virtualized systems (ERTVS), the ARINC 653 standard specifies a cyclic scheduling policy to guarantee the real-time performance of tasks in multiple Virtual Machines (VMs) residing on shared hardware. Based on this policy, the Regularity-based Resource Partitioning (RRP) model defines an efficient interface specification to hierarchically partition and assign resource slices among VMs. Although this model has received plenty of attention recently, three major pieces remain missing for applying this model in ERTVS. (1) Embedded systems are more sensitive to resource utilization efficiency since this may drastically affect their deployment cost for including additional cores. Therefore, this paper proposes an optimal and an approximate RRP resource scheduler for multi-core platforms. (2) A resource reconfiguration is required when an embedded system has to switch between operating modes, resulting in the current cyclic schedule being replaced by another pre-configured and verified cyclic schedule. This paper formalizes a new One-Hop Reconfiguration (OHR) problem tailored for mode-switch-capable embedded systems and introduces a corresponding optimal solution. (3) No RRP-based toolset is currently available for embedded systems. This paper thus presents an optimized RRP toolset tailored for embedded systems. Numerous experiments are conducted to evaluate the efficacy of this toolset.
- 23 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 71 (10) , 2592-2605
Regularity-Based Virtualization Under the ARINC 653 Standard for Embedded Systems
In embedded real-time virtualized systems (ERTVS), the ARINC 653 standard specifies a cyclic scheduling policy to guarantee the real-time performance of tasks in multiple Virtual Machines (VMs) residing on shared hardware. Based on this policy, the Regularity-based Resource Partitioning (RRP) model defines an efficient interface specification to hierarchically partition and assign resource slices among VMs. Although this model has received plenty of attention recently, three major pieces remain missing for applying this model in ERTVS. (1) Embedded systems are more sensitive to resource utilization efficiency since this may drastically affect their deployment cost for including additional cores. Therefore, this paper proposes an optimal and an approximate RRP resource scheduler for multi-core platforms. (2) A resource reconfiguration is required when an embedded system has to switch between operating modes, resulting in the current cyclic schedule being replaced by another pre-configured and verified cyclic schedule. This paper formalizes a new One-Hop Reconfiguration (OHR) problem tailored for mode-switch-capable embedded systems and introduces a corresponding optimal solution. (3) No RRP-based toolset is currently available for embedded systems. This paper thus presents an optimized RRP toolset tailored for embedded systems. Numerous experiments are conducted to evaluate the efficacy of this toolset.
- Open Access
- 22 June 2021
- Published by Association for Computing Machinery (ACM)
- p. 134-145
ARINC 653-inspired regularity-based resource partitioning on xen
A multitude of cloud-native applications take up a significant share of today's world wide web, the majority of which implicitly require soft-real-time guarantees when hosted on servers at various data centers across the globe. With the rapid development of cloud computing and virtualization techniques, many applications have been moved onto cloud and edge platforms that require efficient virtualization techniques. This means a set of applications must be executed on a Virtual Machine (VM) and multiple VMs must be temporally and spatially scheduled on a set of CPUs. Designed to leverage the cloud infrastructure model, many of these cloud-native applications such as media servers strongly demand low data latency and high compute-resource availability, both of which must be predictable. However, state-of-art VM schedulers fail to satisfy these requirements simultaneously. The scheduling of cloud-native applications on VMs and the scheduling of VMs on physical resources (CPUs), collectively need to be real-time in nature as specified by the Hierarchical Real-Time Scheduling (HiRTS) framework. Conforming to the specifications of this framework, the Regularity-based Resource Partitioning (RRP) model has been proposed that introduces the concept of regularity to provide a near-ideal resource supply to all VMs. In this paper, we make the theoretically superior Regularity-based Resource Partitioning (RRP) model ready for prime time by implementing its associated resource partitioning algorithms for the first time ever on the popular x-86 open-source hypervisor Xen, i.e., RRP-Xen. This paper also compares and contrasts the real-time performance of RRP-Xen against contemporary Xen schedulers such as Credit and RTDS. Our contributions include: (1) a novel implementation of the RRP model on Xen's x-86 based hypervisor, thereby providing a test-bed for future researchers; (2) the first-ever multi-core ARINC 653 VM scheduler prototype on Xen; and (3) numerous experiments and theoretical analysis to determine the real-time performance of RRP-Xen under a stringent workload environment.
- 22 June 2021
- Published by Association for Computing Machinery (ACM)
- p. 134-145
Open AccessARINC 653-inspired regularity-based resource partitioning on xen
A multitude of cloud-native applications take up a significant share of today's world wide web, the majority of which implicitly require soft-real-time guarantees when hosted on servers at various data centers across the globe. With the rapid development of cloud computing and virtualization techniques, many applications have been moved onto cloud and edge platforms that require efficient virtualization techniques. This means a set of applications must be executed on a Virtual Machine (VM) and multiple VMs must be temporally and spatially scheduled on a set of CPUs. Designed to leverage the cloud infrastructure model, many of these cloud-native applications such as media servers strongly demand low data latency and high compute-resource availability, both of which must be predictable. However, state-of-art VM schedulers fail to satisfy these requirements simultaneously. The scheduling of cloud-native applications on VMs and the scheduling of VMs on physical resources (CPUs), collectively need to be real-time in nature as specified by the Hierarchical Real-Time Scheduling (HiRTS) framework. Conforming to the specifications of this framework, the Regularity-based Resource Partitioning (RRP) model has been proposed that introduces the concept of regularity to provide a near-ideal resource supply to all VMs. In this paper, we make the theoretically superior Regularity-based Resource Partitioning (RRP) model ready for prime time by implementing its associated resource partitioning algorithms for the first time ever on the popular x-86 open-source hypervisor Xen, i.e., RRP-Xen. This paper also compares and contrasts the real-time performance of RRP-Xen against contemporary Xen schedulers such as Credit and RTDS. Our contributions include: (1) a novel implementation of the RRP model on Xen's x-86 based hypervisor, thereby providing a test-bed for future researchers; (2) the first-ever multi-core ARINC 653 VM scheduler prototype on Xen; and (3) numerous experiments and theoretical analysis to determine the real-time performance of RRP-Xen under a stringent workload environment.
- 1 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 505-508
Work-In-Progress: Fault Tolerance in a Two-State Regularity-Based Checkpointing System
Embedded real-time virtualized systems serve a wide range of functions for many important industries. They can encompass multiple independent applications sharing limited computational resources. Many models have been introduced to ensure reliability and energy efficiency for these systems. Hierarchical Real-Time Scheduling (HiRTS) is a framework to enable the sharing of resources. It is used alongside the Regularity-Based Resource Partition model (RRP) to achieve transparent scheduling. A checkpointing system is an effective method to resolve transient faults. However, checkpoint insertions are known to incur high time and energy overheads. This paper proposes a two-state regularity-based checkpointing model within the HiRTS framework. It will ensure fault tolerance when scheduling independent, mixedcriticality real-time task sets on limited resources. By reducing checkpoint insertions before the first fault, the system will achieve higher utilization and less overhead while still ensuring fault tolerance. The simulation-based experiments presented suggest the model could offer a significant increase in utilization and reliability. They will be used as a guideline for future simulations using more complex schedules.
- 1 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 505-508
Work-In-Progress: Fault Tolerance in a Two-State Regularity-Based Checkpointing System
Embedded real-time virtualized systems serve a wide range of functions for many important industries. They can encompass multiple independent applications sharing limited computational resources. Many models have been introduced to ensure reliability and energy efficiency for these systems. Hierarchical Real-Time Scheduling (HiRTS) is a framework to enable the sharing of resources. It is used alongside the Regularity-Based Resource Partition model (RRP) to achieve transparent scheduling. A checkpointing system is an effective method to resolve transient faults. However, checkpoint insertions are known to incur high time and energy overheads. This paper proposes a two-state regularity-based checkpointing model within the HiRTS framework. It will ensure fault tolerance when scheduling independent, mixedcriticality real-time task sets on limited resources. By reducing checkpoint insertions before the first fault, the system will achieve higher utilization and less overhead while still ensuring fault tolerance. The simulation-based experiments presented suggest the model could offer a significant increase in utilization and reliability. They will be used as a guideline for future simulations using more complex schedules.
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 379-382
Work-In-Progress: Designing a Server-Side Progressive JPEG Encoder for Real-Time Applications
Images are an important part of digital communication in this era. The optimization of image file size and algorithms for image transfer are vital to ensure quality of service levels and expected time requirements for services. This paper describes and evaluates a combination of file reduction and scheduling techniques from a system design level to ensure that image transfer timing constraints are satisfied.
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 379-382
Work-In-Progress: Designing a Server-Side Progressive JPEG Encoder for Real-Time Applications
Images are an important part of digital communication in this era. The optimization of image file size and algorithms for image transfer are vital to ensure quality of service levels and expected time requirements for services. This paper describes and evaluates a combination of file reduction and scheduling techniques from a system design level to ensure that image transfer timing constraints are satisfied.