An official website of the United States government
We consider the problem of resource provisioning for real-time cyber-physical applications in an open system environment where there does not exist a global resource scheduler that has complete knowledge of the real-time performance requirements of each individual application that shares the resources with the other applications. Regularity-based Resource Partition (RRP) model is an effective strategy to hierarchically partition and assign various resource slices among the applications. However, RRP model does not consider changes in resource requests from the applications at run time. To allow for the run time adaptation to change resource requirements, we consider in this paper the issues in online resource partition reconfiguration, including semantics issues that arise in configuration transitions that may cause application failures. Based on the reconfiguration semantics, we study the online resource reconfigurability problem under the RRP model where the availability factors of resource partitions may be reconfigured during run time. We formalize the Dynamic Partition Reconfiguration (DPR) problem and provide a solution to this problem. Extensive experiments have been conducted to evaluate the performance of the proposed approach in different scenarios. We also present a case study using the autonomous F1/10 model car; the controller of the F1/10 car requires resource adaptation to satisfy the computing needs of its PID controller and vision system under different operating conditions. Our implementation demonstrates the effectiveness and benefit of online resource partition reconfiguration using the DPR approach in a real system.
more »
« less
Regular Composite Resource Partitioning and Reconfiguration in Open Systems
We consider the problem of resource provisioning for real-time cyber-physical applications in an open system environment where there does not exist a global resource scheduler that has complete knowledge of the real-time performance requirements of each individual application that shares the resources with the other applications. Regularity-based Resource Partition (RRP) model is an effective strategy to hierarchically partition and assign various resource slices among such applications. However, previous work on RRP model only discusses uniform resource environment, where resources are implicitly assumed to be synchronized and clocked at the same frequency. The challenge is that a task utilizing multiple resources may experience unexpected delays in non-uniform environments, where resources are clocked at different frequencies. This paper extends the RRP model to non-uniform multi-resource open system environments to tackle this problem. It first introduces a novel composite resource partition abstraction and then proposes algorithms to construct and reconfigure the composite resource partitions. Specifically, theAcyclic Regular Composite Resource Partition Scheduling (ARCRP-S)algorithm constructs regular composite resource partitions and theAcyclic Regular Composite Resource Partition Dynamic Reconfiguration (ARCRP-DR)algorithm reconfigures the composite resource partitions in the run time upon requests of partition configuration changes. Our experimental results show that compared with state-of-the-art methods, ARCRP-S can prevent unexpected resource supply shortfall and improve the schedulability up to 50%. On the other hand, ARCRP-DR can guarantee the resource supply during the reconfiguration with moderate computational overhead.
more »
« less
- Award ID(s):
- 2028875
- PAR ID:
- 10527314
- Publisher / Repository:
- ACM Transactions on Embedded Computing Systems
- Date Published:
- Journal Name:
- ACM Transactions on Embedded Computing Systems
- Volume:
- 22
- Issue:
- 5
- ISSN:
- 1539-9087
- Page Range / eLocation ID:
- 1 to 29
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Most of the thermal management technologies concentrate on managing airflow to achieve the desired server inlet temperature (supply air operating set point) and not to manage/improve the amount of cool air (CFM) that each computer rack (i.e. IT servers) should receive in order to remove the produced heat. However, airflow is equally important for quantifying adequate cooling to IT equipment, but it is more challenging to obtain a uniform airflow distribution at the inlet of computer racks. Therefore, as a potential option for improving airflow distribution is to eliminate the sources of non-uniformities such as maldistribution of under-floor plenum pressure field caused by vortices. Numerous researchers focus on the adverse effects of under-floor blockages. This study focused to numerically investigate the positive impact of selectively placed obstructions (on-purpose air-directors); referred as partitions; Quantitative and qualitative analysis of underfloor plenum pressure field, perforated tiles airflow rate and racks inlet temperature with and without partitions using two Computational Fluid Dynamics (CFD) models, which were built using Future Facilities 6SigmaRoom CFD tool. First, a simple data center model was used to quantify the partitions benefits for two different systems; Hot Aisle Containment (HAC) compared to an open configuration. Second, the investigation was expanded using a physics-based experimentally validated CFD model of medium size data center (more complicated data center geometry) to compare different types of proposed partitions. Both models results showed that partition type I (partitions height of $$\frac{2}{3}$$ of plenum depth measured from the subfloor) eliminates the presence of vortices in the under-floor plenum and hence, more uniform pressure differential across the perforated tiles that drives more uniform airflow rates. In addition, the influence of proposed partitions on the rack inlet temperature was reported through a comparison between open versus hot aisle containment. The results showed that the partitions have a minor effect on the rack inlet temperature for the hot aisle containment system. However, the partitions significantly improve the tiles flowrate. On the other hand, for the open system, the presence of partitions has improved the tiles airflow rate, rack inlet temperature and hence eliminate the hot spots formation at computer rack inletmore » « less
-
null (Ed.)The past decade has witnessed the rapid development of real-time wireless technologies and their wide adoption in various industrial Internet-of-Things (IIoT) applications. Among those wireless technologies, 6TiSCH is a promising candidate as the de facto standard due to its nice feature of gluing a real-time link-layer standard (802.15.4e, for offering deterministic communication performance) together with an IP-enabled upper-layer stack (for seamlessly supporting Internet services). 6TiSCH's built-in random slot selection scheduling algorithm, however, often leads to large and unbounded transmission latency, thus can hardly meet the real-time requirements of IIoT applications. This paper proposes an adaptive partition based scheduling framework, APaS, for 6TiSCH networks. APaS introduces the concept of resource partitioning into 6TiSCH network management. Instead of allocating network resources to individual devices, APaS partitions and assigns network resources to different groups of devices based on their layers in the network so as to guarantee that the transmission latency of any end-toend flow is within one slotframe length. APaS also employs a novel online partition adjustment method to further improve its adaptability to dynamic network topology changes. The effectiveness of APaS is validated through both simulation and testbed experiments on a 122-node multi-hop 6TiSCH network.more » « less
-
We prove that a polynomial fraction of the set of $$k$$-component forests in the $$m \times n$$ grid graph have equal numbers of vertices in each component, for any constant $$k$$. This resolves a conjecture of Charikar, Liu, Liu, and Vuong, and establishes the first provably polynomial-time algorithm for (exactly or approximately) sampling balanced grid graph partitions according to the spanning tree distribution, which weights each $$k$$-partition according to the product, across its $$k$$ pieces, of the number of spanning trees of each piece. Our result follows from a careful analysis of the probability a uniformly random spanning tree of the grid can be cut into balanced pieces. Beyond grids, we show that for a broad family of lattice-like graphs, we achieve balance up to any multiplicative $$(1 \pm \varepsilon)$$ constant with constant probability. More generally, we show that, with constant probability, components derived from uniform spanning trees can approximate any given partition of a planar region specified by Jordan curves. This implies polynomial-time algorithms for sampling approximately balanced tree-weighted partitions for lattice-like graphs. Our results have applications to understanding political districtings, where there is an underlying graph of indivisible geographic units that must be partitioned into $$k$$ population-balanced connected subgraphs. In this setting, tree-weighted partitions have interesting geometric properties, and this has stimulated significant effort to develop methods to sample them.more » « less
-
Abstract Downbursts pose a threat to life, property, and aviation, yet they remain challenging to predict. Prior studies have found radar-based downburst signatures such as divergent and convergent velocity signatures at the surface and midlevels, respectively; descending radar reflectivity (Z) cores (DRCs); present or descending specific differential phase (KDP) cores; and troughs of decreased differential reflectivity (ZDR) collocated with decreased copolar correlation coefficient (ρhv) below the melting layer. This research expands on those studies using the multicell identification and tracking (MCIT) algorithm to automate storm detection and analyze 53 downburst cases spanning most regions of the CONUS. Individual case analysis revealed that DRCs appeared in 83% of cases, descendingKDPcores appeared in 85% of cases, andZDRtroughs and collocatedρhvdrops appeared in 89% of cases. The magnitude of low-level divergence and midlevel convergence reached a threshold of 0.0025 s−1in 68% and 83% of cases, respectively. Composite time series revealed that divergence displayed the most prominent signature near the surface; aloft,KDPat and 1 km below the freezing level, midlevel convergence,ZDRcolumn area and volume, and VIL displayed the most prominent signatures. Differences were observed between geographic regions and thermodynamic environments, with lower velocity-related and higherKDP-related values most common in the eastern United States and environments with wind index (WINDEX) < 60; conversely, higher velocity-related and lowerKDP-related values were most common in the western United States and environments with WINDEX > 60. These findings may help inform future polarimetric downburst detection and algorithm development efforts.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1145/3609424
