skip to main content

Search for: All records

Editors contains: "Feng, B"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Kim, S. ; Feng, B. ; Smith, K. ; Masoud, S. ; Zheng, Z. ; Szabo, C. ; Loper, M. (Ed.)
    High performance computing (HPC) system runs compute-intensive parallel applications requiring large number of nodes. An HPC system consists of heterogeneous computer architecture nodes, including CPUs, GPUs, field programmable gate arrays (FPGAs), etc. Power capping is a method to improve parallel application performance subject to variable power constraints. In this paper, we propose a parallel application power and performance prediction simulator. We present prediction model to predict application power and performance for unknown power-capping values considering heterogeneous computing architecture. We develop a job scheduling simulator based on parallel discrete-event simulation engine. The simulator includes a power and performance prediction model, asmore »well as a resource allocation model. Based on real-life measurements and trace data, we show the applicability of our proposed prediction model and simulator.« less
    Free, publicly-accessible full text available December 1, 2022
  2. Bae, K.-H. ; Feng, B. ; Kim, S. ; Lazarova-Molnar, S. ; Zheng, Z. ; Roeder, T. ; Thiesing, R. (Ed.)
    In the subset-selection approach to ranking and selection, a decision-maker seeks a subset of simulated systems that contains the best with high probability. We present a new, generalized framework for constructing these subsets and demonstrate that some existing subset-selection procedures are situated within this framework. The subsets are built by calculating, for each system, a minimum standardized discrepancy between the observed performances and the space of problem instances for which that system is the best. A system’s minimum standardized discrepancy is then compared to a cutoff to determine whether the system is included in the subset. We examine the problemmore »of finding the tightest statistically valid cutoff for each system and draw connections between our approach and other subset-selection methodologies. Simulation experiments demonstrate how the screening power and subset size are affected by the choice of standardized discrepancy.« less
    Free, publicly-accessible full text available December 1, 2022
  3. Kim, S. ; Feng, B. ; Smith, K. ; Masoud, S. ; Zheng, Z. ; Szabo, C. ; Loper, M. (Ed.)
  4. Kim, S. ; Feng, B. ; Smith, K. ; Masoud, S ; Zheng, Z. ; Szabo, C. ; Loper, M. (Ed.)
  5. Bae, K.-H. ; Feng, B. ; Kim, S. ; Lazarova-Molnar, S. ; Zheng, Z. ; Roeder, T. ; Thiesing, R. (Ed.)
    When subject to disruptive events, the dynamics of human-infrastructure interactions can absorb, adapt, or, in a more abrupt manner, undergo substantial change. These changes are commonly studied when a disruptive event perturbs the physical infrastructure. Infrastructure breakdown is, thus, an indicator of the tipping point, and possible regime shift, in the human-infrastructure interactions. However, determining the likelihood of a regime shift during a global pandemic, where no infrastructure breakdown occurs, is unclear. In this study, we explore the dynamics of human-infrastructure interactions during the global COVID-19 pandemic for the entire United States and determine the likelihood of regime shifts inmore »human interactions with six different categories of infrastructure. Our results highlight the impact of state-level characteristics, executive decisions, as well as the extent of impact by the pandemic as predictors of either undergoing or surviving regime shifts in human-infrastructure interactions.« less
  6. Bae, K-H ; Feng, B ; Kim, S ; Lazarova-Molnar, S ; Zheng, Z ; Roeder, T ; Thiesing, R (Ed.)
    This paper studies computational improvement of the Gaussian Markov improvement algorithm (GMIA) whose underlying response surface model is a Gaussian Markov random field (GMRF). GMIA’s computational bottleneck lies in the sampling decision, which requires factorizing and inverting a sparse, but large precision matrix of the GMRF at every iteration. We propose smart GMIA (sGMIA) that performs expensive linear algebraic operations intermittently, while recursively updating the vectors and matrices necessary to make sampling decisions for several iterations in between. The latter iterations are much cheaper than the former at the beginning, but their costs increase as the recursion continues and ultimatelymore »surpass the cost of the former. sGMIA adaptively decides how long to continue the recursion by minimizing the average per-iteration cost. We perform a floating-point operation analysis to demonstrate the computational benefit of sGMIA. Experiment results show that sGMIA enjoys computational efficiency while achieving the same search effectiveness as GMIA.« less
  7. Bae, K-H ; Feng, B ; Kim, S ; Lazarova-Molnar, S ; Zheng, Z ; Roeder, T ; Thiesing, R (Ed.)
    The nonstationary Poisson process (NSPP) is a workhorse tool for modeling and simulating arrival processes with time-dependent rates. In many applications only a single sequence of arrival times are observed. While one sample path is sufficient for estimating the arrival rate or integrated rate function of the process—as we illustrate in this paper—we show that testing for Poissonness, in the general case, is futile. In other words, when only a single sequence of arrival data are observed then one can fit an NSPP to it, but the choice of “NSPP” can only be justified by an understanding of the underlyingmore »process physics, or a leap of faith, not by testing the data. This result suggests the need for sensitivity analysis when such a model is used to generate arrivals in a simulation.« less
  8. Bae, K-H ; Feng, B ; Kim, S ; Lazarova-Molnar, S ; Zheng, Z ; Roeder, T ; Thiesing, R (Ed.)
    The sample path generated by a stochastic simulation often exhibits significant variability within each replication, revealing periods of good and poor performance alike. As such, traditional summaries of aggregate performance measures overlook the more fine-grained insights into the operational system behavior. In this paper, we take a simulation analytics view of output analysis, turning to machine learning methods to uncover key insights from the dynamic sample path. We present a k nearest neighbors model on system state information to facilitate real-time predictions of a stochastic performance measure. This model is built on the premise of a system-specific measure of similaritymore »between observations of the state, which we inform via metric learning. An evaluation of our approach is provided on a stochastic activity network and a wafer fabrication facility, both of which give us confidence in the ability of metric learning to provide interpretation and improved predictive performance.« less
  9. Bae, K-H ; Feng, B ; Kim, S ; Lazarova-Molnar, S ; Zheng, Z ; Roeder, T ; Thiesing, R (Ed.)
    Cheap parallel computing has greatly extended the reach of ranking & selection (R&S) for simulation optimization. In this paper we present an evaluation of bi-PASS, a R&S procedure created specifically for parallel implementation and very large numbers of system designs. We compare bi-PASS to the state-ofthe- art Good Selection Procedure and an easy-to-implement subset selection procedure. This is one of the few papers to consider both computational and statistical comparison of parallel R&S procedures.
  10. Bae, K-H ; Feng, B ; Kim, S ; Lazarova-Molnar, S ; Zheng, Z ; Roeder, T ; Thiesing, R. (Ed.)
    Protest is a collective action problem and can be modeled as a coordination game in which people take an action with the potential to achieve shared mutual benefits. In game-theoretic contexts, successful coordination requires that people know each others’ willingness to participate, and that this information is common knowledge among a sufficient number of people. We develop an agent-based model of collective action that was the first to combine social structure and individual incentives. Another novel aspect of the model is that a social network increases in density (i.e., new graph edges are formed) over time. The model studies themore »formation of common knowledge through local interactions and the characterizing social network structures. We use four real-world, data-mined social networks (Facebook, Wikipedia, email, and peer-to-peer networks) and one scale-free network, and conduct computational experiments to study contagion dynamics under different conditions.« less