Kishwar Ahmed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Kishwar Ahmed has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Jason Liu
Florida International University, Miami, USA
4 shared publications - Shaolei Ren
University of California, Riverside, Riverside, USA
4 shared publications - Mohammad Atiqul Islam
University of Texas at Arlington, Arlington, USA
3 shared publications Jason Liu
2 shared publications- Nandakishore Santhi
Los Alamos National Laboratory, Los Alamos, NM, USA
2 shared publications - Samia Tasnim
Department of Electrical Engineering and Computer Science, The University of Toledo, Toledo, OH 43606, USA
2 shared publications
Latest Publications
- Open Access
- 28 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation
- 28 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessXOR Bidding and Knapsack Formulations for HPC Network Resource Allocation
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 424-432
From Soil to Software: Experience from a STEM Workshop on Smart Plant Care and Teachable Machines
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 424-432
Open AccessFrom Soil to Software: Experience from a STEM Workshop on Smart Plant Care and Teachable Machines
- Open Access
- 6 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 197-206
Scalable Analytical Memory Modeling of AI Accelerators
- 6 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 197-206
Open AccessScalable Analytical Memory Modeling of AI Accelerators
- Open Access
RCoD: Reputation-Based Context-Aware Data Fusion for Mobile IoT
The rapid development of mobile sensing technologies (e.g., smart devices embedded with various powerful sensors) has encouraged the proliferation of the Internet of Things (IoT). Although data reliability and accuracy are crucial in many sensor applications (e.g., air-quality monitoring), it is often difficult to ensure these properties. Mobile IoT’s people-centric architecture allows for more inaccurate and corrupted data. In this manuscript, we are addressing the problem of how to predict data more accurately in the presence of malicious participants who inject false data to manipulate the system. Our goal is to recover those missing or imprecise data values from the correlated data streams. To do so, we propose a Reputation-Based Context-Aware Data-Fusion (RCoD) mechanism that is resilient against on–off and data-corruption attacks. Furthermore, the Contextual Hidden Markov Model-based data prediction facilitates more accurate real-time data prediction. We tested the scenarios where most participants were malicious, injecting false data at varied rates. Our method accurately identified the honest participants based on their reported data and context. We empirically evaluate the performance using Beijing’s air-quality dataset. We compared the performance of our RCoD method against four state-of-the-art methods, and the results justify its superiority.
Open AccessRCoD: Reputation-Based Context-Aware Data Fusion for Mobile IoT
The rapid development of mobile sensing technologies (e.g., smart devices embedded with various powerful sensors) has encouraged the proliferation of the Internet of Things (IoT). Although data reliability and accuracy are crucial in many sensor applications (e.g., air-quality monitoring), it is often difficult to ensure these properties. Mobile IoT’s people-centric architecture allows for more inaccurate and corrupted data. In this manuscript, we are addressing the problem of how to predict data more accurately in the presence of malicious participants who inject false data to manipulate the system. Our goal is to recover those missing or imprecise data values from the correlated data streams. To do so, we propose a Reputation-Based Context-Aware Data-Fusion (RCoD) mechanism that is resilient against on–off and data-corruption attacks. Furthermore, the Contextual Hidden Markov Model-based data prediction facilitates more accurate real-time data prediction. We tested the scenarios where most participants were malicious, injecting false data at varied rates. Our method accurately identified the honest participants based on their reported data and context. We empirically evaluate the performance using Beijing’s air-quality dataset. We compared the performance of our RCoD method against four state-of-the-art methods, and the results justify its superiority.
- Open Access
HPC Application Parameter Autotuning on Edge Devices: A Bandit Learning Approach
The growing necessity for enhanced processing capabilities in edge devices with limited resources has led us to develop effective methods for improving high-performance computing (HPC) applications. In this paper, we introduce LASP (Lightweight Autotuning of Scientific Application Parameters), a novel strategy designed to address the parameter search space challenge in edge devices. Our strategy employs a multi-armed bandit (MAB) technique focused on online exploration and exploitation. Notably, LASP takes a dynamic approach, adapting seamlessly to changing environments. We tested LASP with four HPC applications: Lulesh, Kripke, Clomp, and Hypre. Its lightweight nature makes it particularly well-suited for resource-constrained edge devices. By employing the MAB framework to efficiently navigate the search space, we achieved significant performance improvements while adhering to the stringent computational limits of edge devices. Our experimental results demonstrate the effectiveness of LASP in optimizing parameter search on edge devices.
Open AccessHPC Application Parameter Autotuning on Edge Devices: A Bandit Learning Approach
The growing necessity for enhanced processing capabilities in edge devices with limited resources has led us to develop effective methods for improving high-performance computing (HPC) applications. In this paper, we introduce LASP (Lightweight Autotuning of Scientific Application Parameters), a novel strategy designed to address the parameter search space challenge in edge devices. Our strategy employs a multi-armed bandit (MAB) technique focused on online exploration and exploitation. Notably, LASP takes a dynamic approach, adapting seamlessly to changing environments. We tested LASP with four HPC applications: Lulesh, Kripke, Clomp, and Hypre. Its lightweight nature makes it particularly well-suited for resource-constrained edge devices. By employing the MAB framework to efficiently navigate the search space, we achieved significant performance improvements while adhering to the stringent computational limits of edge devices. Our experimental results demonstrate the effectiveness of LASP in optimizing parameter search on edge devices.
- Open Access
- 17 May 2019
- Published by Florida International University
Energy Demand Response for High-Performance Computing Systems
The growing computational demand of scientific applications has greatly motivated the development of large-scale high-performance computing (HPC) systems in the past decade. To accommodate the increasing demand of applications, HPC systems have been going through dramatic architectural changes (e.g., introduction of many-core and multi-core systems, rapid growth of complex interconnection network for efficient communication between thousands of nodes), as well as significant increase in size (e.g., modern supercomputers consist of hundreds of thousands of nodes). With such changes in architecture and size, the energy consumption by these systems has increased significantly. With the advent of exascale supercomputers in the next few years, power consumption of the HPC systems will surely increase; some systems may even consume hundreds of megawatts of electricity. Demand response programs are designed to help the energy service providers to stabilize the power system by reducing the energy consumption of participating systems during the time periods of high demand power usage or temporary shortage in power supply. This dissertation focuses on developing energy-efficient demand-response models and algorithms to enable HPC system's demand response participation. In the first part, we present interconnection network models for performance prediction of large-scale HPC applications. They are based on interconnected topologies widely used in HPC systems: dragonfly, torus, and fat-tree. Our interconnect models are fully integrated with an implementation of message-passing interface (MPI) that can mimic most of its functions with packet-level accuracy. Extensive experiments show that our integrated models provide good accuracy for predicting the network behavior, while at the same time allowing for good parallel scaling performance. In the second part, we present an energy-efficient demand-response model to reduce HPC systems' energy consumption during demand response periods. We propose HPC job scheduling and resource provisioning schemes to enable HPC system's emergency demand response participation. In the final part, we propose an economic demand-response model to allow both HPC operator and HPC users to jointly reduce HPC system's energy cost. Our proposed model allows the participation of HPC systems in economic demand-response programs through a contract-based rewarding scheme that can incentivize HPC users to participate in demand response.
- 17 May 2019
- Published by Florida International University
Open AccessEnergy Demand Response for High-Performance Computing Systems
The growing computational demand of scientific applications has greatly motivated the development of large-scale high-performance computing (HPC) systems in the past decade. To accommodate the increasing demand of applications, HPC systems have been going through dramatic architectural changes (e.g., introduction of many-core and multi-core systems, rapid growth of complex interconnection network for efficient communication between thousands of nodes), as well as significant increase in size (e.g., modern supercomputers consist of hundreds of thousands of nodes). With such changes in architecture and size, the energy consumption by these systems has increased significantly. With the advent of exascale supercomputers in the next few years, power consumption of the HPC systems will surely increase; some systems may even consume hundreds of megawatts of electricity. Demand response programs are designed to help the energy service providers to stabilize the power system by reducing the energy consumption of participating systems during the time periods of high demand power usage or temporary shortage in power supply. This dissertation focuses on developing energy-efficient demand-response models and algorithms to enable HPC system's demand response participation. In the first part, we present interconnection network models for performance prediction of large-scale HPC applications. They are based on interconnected topologies widely used in HPC systems: dragonfly, torus, and fat-tree. Our interconnect models are fully integrated with an implementation of message-passing interface (MPI) that can mimic most of its functions with packet-level accuracy. Extensive experiments show that our integrated models provide good accuracy for predicting the network behavior, while at the same time allowing for good parallel scaling performance. In the second part, we present an energy-efficient demand-response model to reduce HPC systems' energy consumption during demand response periods. We propose HPC job scheduling and resource provisioning schemes to enable HPC system's emergency demand response participation. In the final part, we propose an economic demand-response model to allow both HPC operator and HPC users to jointly reduce HPC system's energy cost. Our proposed model allows the participation of HPC systems in economic demand-response programs through a contract-based rewarding scheme that can incentivize HPC users to participate in demand response.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 580-589
Contract-Based Demand Response Model for High Performance Computing Systems
High-performance computing (HPC) systems can consume substantial electricity during their operation, and consequently incur significant energy cost. Demand response is a scheme adopted by energy consumers to reduce energy use during the high load periods upon request from the power grid. In this paper, we propose a demand response model to allow both HPC operators and HPC users to jointly reduce the energy consumption. We apply the contract theory, originated from economics for studying the contractual arrangements among economic actors, and design a reward mechanism to ensure participation of both HPC operators and HPC users in the demand response program. We perform both analytical and simulation studies of our proposed approach. Our analyses show that our contract-based demand response model is both feasible (in ensuring both individual rationality and incentive compatibility) and optimal. The trace-based simulation demonstrates the practicality of the proposed approach.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 580-589
Contract-Based Demand Response Model for High Performance Computing Systems
High-performance computing (HPC) systems can consume substantial electricity during their operation, and consequently incur significant energy cost. Demand response is a scheme adopted by energy consumers to reduce energy use during the high load periods upon request from the power grid. In this paper, we propose a demand response model to allow both HPC operators and HPC users to jointly reduce the energy consumption. We apply the contract theory, originated from economics for studying the contractual arrangements among economic actors, and design a reward mechanism to ensure participation of both HPC operators and HPC users in the demand response program. We perform both analytical and simulation studies of our proposed approach. Our analyses show that our contract-based demand response model is both feasible (in ensuring both individual rationality and incentive compatibility) and optimal. The trace-based simulation demonstrates the practicality of the proposed approach.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 789-796
Enabling Demand Response for HPC Systems through Power Capping and Node Scaling
Demand response is an increasingly popular program ensuring power grid stability during a sudden surge in power demand. We expect high-performance computing (HPC) systems to be valued participants in such program for their massive power consumption. In this paper, we propose an emergency demand-response model exploiting both power capping of HPC systems and node scaling of HPC applications. First, we present power and performance prediction models for HPC systems with only power capping, upon which we propose our demand-response model. We validate the models with real-life measurements of application characteristics. Next, we present models to predict energy-to-solution for HPC applications with different numbers of nodes and power-capping values, and we validate the models. Based on the prediction models, we propose an emergency demand response participation model for HPC systems to determine optimal resource allocation based on power capping and node scaling. Finally, we demonstrate the effectiveness of our proposed demand-response model using real-life measurements and trace data. We show that our approach can reduce energy consumption with only a slight increase in the execution time for HPC applications during critical demand response periods.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 789-796
Enabling Demand Response for HPC Systems through Power Capping and Node Scaling
Demand response is an increasingly popular program ensuring power grid stability during a sudden surge in power demand. We expect high-performance computing (HPC) systems to be valued participants in such program for their massive power consumption. In this paper, we propose an emergency demand-response model exploiting both power capping of HPC systems and node scaling of HPC applications. First, we present power and performance prediction models for HPC systems with only power capping, upon which we propose our demand-response model. We validate the models with real-life measurements of application characteristics. Next, we present models to predict energy-to-solution for HPC applications with different numbers of nodes and power-capping values, and we validate the models. Based on the prediction models, we propose an emergency demand response participation model for HPC systems to determine optimal resource allocation based on power capping and node scaling. Finally, we demonstrate the effectiveness of our proposed demand-response model using real-life measurements and trace data. We show that our approach can reduce energy consumption with only a slight increase in the execution time for HPC applications during critical demand response periods.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 419-430
A brief history of HPC simulation and future challenges
High-performance Computing (HPC) systems have gone through many changes during the past two decades in their architectural design to satisfy the increasingly large-scale scientific computing demand. Accurate, fast, and scalable performance models and simulation tools are essential for evaluating alternative architecture design decisions for the massive-scale computing systems. This paper recounts some of the influential work in modeling and simulation for HPC systems and applications, identifies some of the major challenges, and outlines future research directions which we believe are critical to the HPC modeling and simulation community.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 419-430
A brief history of HPC simulation and future challenges
High-performance Computing (HPC) systems have gone through many changes during the past two decades in their architectural design to satisfy the increasingly large-scale scientific computing demand. Accurate, fast, and scalable performance models and simulation tools are essential for evaluating alternative architecture design decisions for the massive-scale computing systems. This paper recounts some of the influential work in modeling and simulation for HPC systems and applications, identifies some of the major challenges, and outlines future research directions which we believe are critical to the HPC modeling and simulation community.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 175-186
An Energy Efficient Demand-Response Model for High Performance Computing Systems
Demand response refers to reducing energy consumption of participating systems in response to transient surge in power demand or other emergency events. Demand response is particularly important for maintaining power grid transmission stability, as well as achieving overall energy saving. High Performance Computing (HPC) systems can be considered as ideal participants for demand-response programs, due to their massive energy demand. However, the potential loss of performance must be weighed against the possible gain in power system stability and energy reduction. In this paper, we explore the opportunity of demand response on HPC systems by proposing a new HPC job scheduling and resource provisioning model. More specifically, the proposed model applies power-bound energy-conservation job scheduling during the critical demand-response events, while maintaining the traditional performance-optimized job scheduling during the normal period. We expect such a model can attract willing participation of the HPC systems in the demand response programs, as it can improve both power stability and energy saving without significantly compromising application performance. We implement the proposed method in a simulator and compare it with the traditional scheduling approach. Using trace-driven simulation, we demonstrate that the HPC demand response is a viable approach toward power stability and energy savings with only marginal increase in the jobs' execution time.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 175-186
An Energy Efficient Demand-Response Model for High Performance Computing Systems
Demand response refers to reducing energy consumption of participating systems in response to transient surge in power demand or other emergency events. Demand response is particularly important for maintaining power grid transmission stability, as well as achieving overall energy saving. High Performance Computing (HPC) systems can be considered as ideal participants for demand-response programs, due to their massive energy demand. However, the potential loss of performance must be weighed against the possible gain in power system stability and energy reduction. In this paper, we explore the opportunity of demand response on HPC systems by proposing a new HPC job scheduling and resource provisioning model. More specifically, the proposed model applies power-bound energy-conservation job scheduling during the critical demand-response events, while maintaining the traditional performance-optimized job scheduling during the normal period. We expect such a model can attract willing participation of the HPC systems in the demand response programs, as it can improve both power stability and energy saving without significantly compromising application performance. We implement the proposed method in a simulator and compare it with the traditional scheduling approach. Using trace-driven simulation, we demonstrate that the HPC demand response is a viable approach toward power stability and energy savings with only marginal increase in the jobs' execution time.