skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: ExecutionManager: A Software System to Control Execution of Third-Party Software that Performs Network Computations
Wedescribeasoftwaresystemcalled ExecutionManager (abbreviated EM) thatcontrolstheexecutionof third-party software(TPS)foranalyzingnetworks.Basedonaconfigurationfilethatcontainsaspecification for theexecutionofeachTPS,thesystemlaunchesanynumberofstand-aloneTPScodes,iftheprojected executiontimeandthegraphsizearewithinuser-imposedlimits.Asystemcapabilityistoestimate the runningtimeofaTPScodeonagivennetworkthroughregressionanalysis,tosupportexecution decision-making by EM. Wedemonstratetheusefulnessof EM in generatingnetworkstructureparameters and distributions,andinextractingmeta-datainformationfromtheseresults.Weevaluateitsperformance on directedandundirected,simpleandmulti-edgegraphsthatrangeinsizeoversevenordersofmagnitude in numbersofedges,upto1.5billionedges.Thesoftwaresystemispartofacyberinfrastructurecalled net.science for networkscience.  more » « less
Award ID(s):
1916805
PAR ID:
10376929
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
2021 Winter Simulation Conference (WSC)
Page Range / eLocation ID:
1 to 12
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We describe a software system called ExecutionManager (abbreviated EM) that controls the execution of third-party software (TPS) for analyzing networks. Based on a configuration file that contains a specification for the execution of each TPS, the system launches any number of stand-alone TPS codes, if the projected execution time and the graph size are within user-imposed limits. A system capability is to estimate the running time of a TPS code on a given network through regression analysis, to support execution decision-making by EM. We demonstrate the usefulness of EM in generating network structure parameters and distributions, and in extracting meta-data information from these results. We evaluate its performance on directed and undirected, simple and multi-edge graphs that range in size over seven orders of magnitude in numbers of edges, up to 1.5 billion edges. The software system is part of a cyberinfrastructure called net.science for network science. 
    more » « less
  2. Formulating cryptographic definitions to protect against software piracy is an important research direction that has not received much attention. Since natural definitions using classical cryptography are impossible to achieve (as classical programs can always be copied), this directs us towards using techniques from quantum computing. The seminal work of Aaronson [CCC'09] introduced the notion of quantum copy-protection precisely to address the problem of software anti-piracy. However, despite being one of the most important problems in quantum cryptography, there are no provably secure solutions of quantum copy-protection known for {\em any} class of functions. We formulate an alternative definition for tackling software piracy, called quantum secure software leasing (QSSL). While weaker than quantum copy-protection, QSSL is still meaningful and has interesting applications in software anti-piracy. We present a construction of QSSL for a subclass of evasive circuits (that includes natural implementations of point functions, conjunctions with wild cards, and affine testers) based on concrete cryptographic assumptions. Our construction is the first provably secure solution, based on concrete cryptographic assumptions, for software anti-piracy. To complement our positive result, we show, based on cryptographic assumptions, that there is a class of quantum unlearnable functions for which QSSL does not exist. In particular, our impossibility result also rules out quantum copy-protection [Aaronson CCC'09] for an arbitrary class of quantum unlearnable functions; resolving an important open problem on the possibility of constructing copy-protection for arbitrary quantum unlearnable circuits. 
    more » « less
  3. Bitslicing is a software implementation technique that treats an N-bit processor datapath as N parallel single-bit datapaths. Bitslicing is particularly useful to implement data-parallel algorithms, algorithms that apply the same operation sequence to every element of a vector. Indeed, a bit-wise processor instruction applies the same logical operation to every single-bit slice. A second benefit of bitsliced execution is that the natural spatial redundancy of bitsliced software can support countermeasures against fault attacks. A k-redundant program on an N-bit processor then runs as N/k parallel redundant slices. In this contribution, we combine these two benefits of bitslicing to implement a fault countermeasure for the number-theoretic transform (NTT). The NTT eiciently implements a polynomial multiplication. The internal symmetry of the NTT algorithm lends itself to a data-parallel implementation, and hence it is a good candidate for the redundantly bitsliced implementation. We implement a redundantly bitsliced NTT on an advanced 667MHz ARM Cortex-A9 processor, and study the fault coverage for the protected NTT under optimized electromagnetic fault injection (EMFI). Our work brings two major contributions. First, we show for the irst time how to develop a redundantly bitsliced version of the NTT. We integrate the protected NTT into a full Dilithium signature sequence. Second, we demonstrate an EMFI analysis on a prototype implementation of the Dilithium signature sequence on ARM Cortex-M9. We perform a detailed EM fault-injection parameter search to optimize the location, intensity and timing of injected EM pulses. We demonstrate that, under optimized fault injection parameters, about 10% of the injected faults become potentially exploitable. However, the redundantly bitsliced NTT design is able to catch the majority of these potentially exploitable faults, even when the remainder of the Dilithium algorithm as well as the control low is left unprotected. To our knowledge, this is the irst demonstration of a bitslice-redundant design of the NTT that offers distributed fault detection throughout the execution of the algorithm. 
    more » « less
  4. Background: In the US, obesity is an epidemiologic challenge and the population fails to comprehend this complex public health issue. To evaluate underlying obesity-impact patterns on mortality rates, we data-mined the 1999-2016 Center for Disease Control WONDER database’s vital records.Methods: Adopting SAS programming, we scrutinized the mortality and population counts. Using ICD-10 diagnosis codes connected to overweight and obesity, we obtained the obesity-related crude and age-adjusted causes of death. To understand divergent and prevalence trends we compared and contrasted the tabulated obesity-influenced mortality rates with demographic information, gender, and age-related data.Key Results: From 1999 to 2016, the obesity-related age-adjusted mortality rates increased by 142%. The ICD-10 overweight and obesity-related death-certificate coding showed clear evidence that obesity factored in the male age-adjusted mortality rate increment to 173% and the corresponding female rate to 117%. It also disproportionately affected the nation-wide minority population death rates. Furthermore, excess weight distributions are coded as contributing features in the crude death rates for all decennial age-groups.Conclusions: The 1999-2016 data from ICD-10 death certificate coding for obesity-related conditions indicate that it is affecting all segments of the US population. 
    more » « less
  5. Following the global regulation of legacy PFAS molecules, fluorotelomer molecules have been widely employed as replacements to PFOS in aqueous film-forming foam (AFFF) and PFOA in other products. Recent field studies indicate that fluorotelomer molecules are increasingly identified in environmental settings including groundwater, soil and sediments. Consequently, gaining a comprehensive understanding of the fate and transport of fluorotelomers in soils and sedimentary environments is vital. In this study, the behavior of two different fluorotelomers, 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTS and 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTC, in three common soil minerals (kaolinite, montmorillonite and illite) having quite different interfacial properties are reported using molecular dynamics simulations. The interfacial adsorption and dynamical characteristics of 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTS and 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTC vary substantially between the three minerals. Irrespective of the mineral composition, 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTS exhibits surface complexation while 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTC coordinates only with neutral and low charged clay minerals. In addition, the fundamental interactions that dictate the adsorption, interfacial structure of 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTS and 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTC are completely different for the three minerals. The large, aggregated clusters of 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTS at the surface experienced greater stability for longer periods of time and restricted mobility than 6[thin space (1/6-em)]:[thin space (1/6-em)]2 FTC for all three clay minerals. Importantly, the current study provides cluster size dependent diffusion behavior of surface adsorbed fluorotelomer molecules in each clay mineral. Such detailed mechanistic insights are necessary to understand the environmental footprint of fluorotelomers around contaminated sites. 
    more » « less