Search NASA⌕ Search

SEARCH · Search NASA

Results for “garbage”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

Stakeholder-Engaged Structured Decision Making for the Los Alamos Legacy Cleanup Mission - 20501

The Los Alamos National Laboratory (LANL) environmental legacy cleanup program requires decisions to be made for environmental remediation, decommissioning and disposal or management of radioactive waste. This legacy cleanup program was established to address groundwater contamination, material disposal areas (MDAs) that have been used to dispose of radioactive and other waste material, and 'aggregate areas' that might produce radioactive or other chemical waste as a result of remediation activities. The LANL site is regulated for environmental concerns under the Resource Conservation and Recovery Act (RCRA). However, some parts of LANL, such as material disposal area G (MDA G), have disposed of radioactive waste under DOE Order 435.1, and are subject to other regulations. For example, decommissioning the remote-handled TRU material stored in 33 shafts at MDA G falls under EPA's 40 CFR 191. Collectively, the regulations are all aimed in the same direction of finding the best solution, either through constructs such as 'as low as reasonably achievable' (ALARA), considering balancing factors as opposed to only cost and human health risk, and, under EPA regulations such as RCRA and NEPA, evaluating impact from all chemicals and both human health and ecological endpoints. Despite the basic goals and objectives of the regulations or their guidance, the main challenge is in their implementation. Arguably perhaps, but really in principle, all of these (and similar) regulations are asking for a decision analysis to be performed. Implementation challenges encountered have included lack of understanding of decision analysis in the industry, lack of effective stakeholder engagement in the decision analysis process, and lack of appreciation of the need to separate value judgments from science, the latter leading to developing conservative, or protective, science-based models. Conservative models lead to poor solutions, lack of effective stakeholder engagement leads to long drawn out protracted approaches to finding a solution (which also might never be found with this approach), and lack of understanding of decision analysis and Bayesian statistics causes poor models to be built, which creates unfortunate situations of 'garbage in, garbage out' becoming the basis for decision making. Stakeholder-engaged structured decision making (SDM) is an approach to solving problems that relies on the theory of decision science to involve stakeholders in the decision-making process. This approach incorporates stakeholder values using a scientifically rigorous methodology that separates value judgments from science in a way that helps avoid the pitfalls of biased, protective, or conservative modeling. This approach has its foundation in Keeney's 1992 treatise on value-focused thinking [1]. Keeney advocated a paradigm shift in decision making based on the idea that the standard way of thinking about decisions is backwards. The standard approach of focusing first on identifying alternatives rather than on articulating values results in a reactive approach with the emphasis on mechanics and fixed choices instead of the core values that have meaning to stakeholders. This paradigm shift effectively engages all stakeholders in the decision-making process while using a values focused thinking approach that can lead to the identification of decision opportunities and the creation of better alternatives. The intent is to be proactive and generate solutions that are related directly to values and objectives as identified by stakeholders. There are, perhaps, two overarching reasons why SDM can be used to benefit LANL's environmental legacy cleanup. Some of LANL's remaining waste management and environmental management problems are challenging and complex (for example, the Cr and RDX plumes, and MDAs) and while the traditional approach has, arguably, worked well for relatively simple risk-based problems, it cannot, or should not, be applied to more complex problems if the most effective and efficient solutions are desired. The second reason is cost. This has perhaps become more critical since publication of the Government Accountability Office (GAO) reports that DoE's environmental liability is considered a high-risk concern for the nation [2]. The focus of SDM is on structuring solutions to decision risk problems by first addressing stakeholder and decision maker values and subsequently developing decision objectives and ways to measure those objectives, preference weighting across objectives, identifying decision alternatives that best achieve those values, and characterizing uncertainty in predictions of the measures. Because a complete decision model is created using SDM, it can be evaluated to find the main elements of the model that drive, or predict, the best solution. This approach creates complete decision models that are transparent, traceable, reproducible and technically defensible. The science behind SDM, or decision analysis, is well founded, yet it is not unusual to see ad hoc approaches to decision making implemented under various environmental regulations that are pertinent to the LANL site, including NEPA, RCRA and DOE Order 435.1. Such ad hoc approaches are often not transparent or traceable, and lack reproducibility and technical defensibility. The LANL legacy cleanup program has embarked on using SDM to address the complex problems that remain. Stakeholder meetings have been held, and a prototype version of the stakeholder value system has been developed. Further meetings are expected in the future to address specific project needs. This is a long-term endeavor considering the complex environmental problems faced by DOE EM in Los Alamos (EM-LA), and careful planning, consideration of stakeholder value systems, and engagement with stakeholders throughout the SDM process is expected to lead to a successful endpoint. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Sanitary Waste Landfill Effects on an Invasive Wild Pig Population

Being opportunistic omnivores, wild pigs (Sus scrofa) readily feed on edible garbage. Given the presence of substantial volumes of edible food waste, large multi-county and regional municipal sanitary waste landfills constitute attractive forage resources for pigs, providing a year-round anthropogenic source of potentially high-quality forage. Our objective was to assess the effects that a large regional landfill has on the local pigs foraging in that facility's waste disposal cells. The landfill, located on the United States Department of Energy's Savannah River Site (SRS) in South Carolina, USA, became operational in 1998 and pigs began foraging there in 2001. By 2009 >100 pigs/night were observed foraging in the landfill, suggesting landfill establishment may have important consequences for population dynamics, public safety, and disease transmission. We evaluated changes in body mass, fetal litter size, numbers of pigs removed, and wild pig-vehicle collisions (WPVCs) before (1980–2000) and after (2001–2019) pigs began foraging in the landfill on SRS. Body mass during the after period increased to a greater extent for pigs in the vicinity of the landfill compared to pigs on the rest of SRS. Fetal litter size increased for pigs in the vicinity of the landfill, whereas it remained unchanged on the rest of SRS. Our density surrogate (number of pigs harvested) increased around the landfill during the after period by 2.9 times, whereas on the rest of the site it only increased by 53%. No WPVCs occurred adjacent to the landfill before 2001, but WPVCs increased along the 2 major roads bordering the landfill after 2001. Effects of sanitary waste landfills on wild pig populations scavenging there can present unique challenges to population management, control, public safety, and disease transmission. Potential approaches to address these challenges could be exclusion fencing to prevent access to the landfill's waste disposal cells or enhanced placement of waste cell covers to reduce access.

60 APPLIED LIFE SCIENCES↗

An empirical study of I/O separation for burst buffers in HPC systems

To meet the exascale I/O requirements for the High-Performance Computing (HPC), a new I/O subsystem, Burst Buffer, based on solid state drives (SSD), has been developed. However, the diverse HPC workloads and the bursty I/O pattern cause severe data fragmentation that requires costly garbage collection (GC) and increases the number of bytes written to the SSD. To address this data fragmentation challenge, a new multi-stream feature has been developed for SSDs. In this work, we develop an I/O Separation scheme called BIOS to leverage this multi-stream feature to group the I/O streams based on the user IDs. We propose a stream-aware scheduling policy based on burst buffer pools in the workload manager, and integrate the BIOS with the workload manager to optimize the I/O separation scheme in burst buffer. We evaluate the proposed framework with a burst buffer I/O traces from Cori Supercomputer including a diverse set of applications. Experimental results show that the BIOS could improve the performance by 1.44x on average and reduce the Write Amplification Factor (WAF) by up to 1.20x. Finally, these demonstrate the potential benefits of the I/O separation scheme for solid state storage systems.

97 MATHEMATICS AND COMPUTING↗

Classically verifiable quantum advantage from a computational Bell test

Existing experimental demonstrations of quantum computational advantage have had the limitation that verifying the correctness of the quantum device requires exponentially costly classical computations. Here we propose and analyse an interactive protocol for demonstrating quantum computational advantage, which is efficiently classically verifiable. Our protocol relies on a class of cryptographic tools called trapdoor claw-free functions. Although this type of function has been applied to quantum advantage protocols before, our protocol employs a surprising connection to Bell’s inequality to avoid the need for a demanding cryptographic property called the adaptive hardcore bit, while maintaining essentially no increase in the quantum circuit complexity and no extra assumptions. Leveraging the relaxed cryptographic requirements of the protocol, we present two trapdoor claw-free function constructions, based on Rabin’s function and the Diffie–Hellman problem, which have not been used in this context before. We also present two independent innovations that improve the efficiency of our implementation and can be applied to other quantum cryptographic protocols. First, we give a scheme to discard so-called garbage bits, removing the need for reversibility in the quantum circuits. Second, we show a natural way of performing postselection that reduces the fidelity needed to demonstrate quantum advantage. Combining these results, we describe a blueprint for implementing our protocol on Rydberg atom-based quantum devices, using hardware-native operations that have already been demonstrated experimentally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SlimIO: Lightweight I/O Path Design for Write Isolation in FDP-backed In-Memory Databases

In-Memory Databases (IMDBs) are widely used with HPC applications to manage transient data, often using snapshot-based persistence for backups. Redis, a representative IMDB, employs both snapshot and Write-Ahead Log (WAL) mechanisms, storing data on persistent devices via the traditional kernel I/O path. This method incurs syscall overhead, I/O contention between processes, and SSD garbage collection (GC) delays. To address these issues, we propose SlimIO, which adopts I/O passthru to minimize syscall overhead and inter-process I/O interference. Additionally, it leverages Flexible Data Placement (FDP) SSDs as backup storage to avoid performance degradation from SSD GC. Experimental results show that SlimIO reduces snapshot time by up to 25%, increases query throughput by up to 30% during non-snapshot periods, and lowers 99.9%-ile latency by up to 50%. Furthermore, it achieves a write amplification factor (WAF) of 1.00, indicating no redundant internal writes, thus extending SSD lifespan.

Lee, Sangyun [Sogang University]↗

T-FSM: A Scalable Distributed Task-Based System for Frequent Subgraph Pattern Mining from a Big Graph

Finding frequent subgraph patterns in a big graph is an important problem with many applications such as classifying chemical compounds and building indexes to speed up graph queries. Since this problem is NP-hard, some recent parallel and distributed systems have been developed to accelerate the mining. However, they often have a huge memory cost, very long running time, suboptimal load balancing, poor scale-out capability, and possibly inaccurate results. In this article, we propose an efficient system called T-FSM for parallel mining of frequent subgraph patterns in a big graph. T-FSM supports a new anti-monotonic frequentness measure called Fraction-Score, which is more accurate than the widely used MNI measure. The execution engine of T-FSM supports both intra-machine parallelism and inter-machine parallelism. For intra-machine parallelism, T-FSM adopts a novel task-based execution model to ensure high multithreading concurrency, bounded memory consumption, and effective load balancing. For inter-machine parallelism, T-FSM ensures good scale-out performance with a lightweight pattern rebalancing approach that reduces workload skewness of pattern evaluations among machines. To avoid recomputing the contexts for migrated patterns, we design a novel context cache table to support concurrent and asynchronous requesting and caching of remote context data, which can timely evict and garbage collect used pattern contexts that are no longer needed to keep memory consumption bounded. Extensive experiments show that T-FSM is orders of magnitude faster than existing state-of-the-art parallel systems (more than 10×, 51×, 131×, 55× speedup over ScaleMine, DistGraph, Pangolin and Peregrine, respectively) and distributed systems (more than 42× and 88× over ScaleMine and DistGraph, respectively) for frequent subgraph pattern mining, and it scales out satisfactorily to 512 CPU cores on the Polaris supercomputer at Argonne National Laboratory.

97 MATHEMATICS AND COMPUTING↗

Watermarks in stream processing systems: semantics and comparative analysis of Apache Flink and Google cloud dataflow

Streaming data processing is an exercise in taming disorder: from oftentimes huge torrents of information, we hope to extract powerful and timely analyses. But when dealing with streaming data, the unbounded and temporally disordered nature of real-world streams introduces a critical challenge: how does one reason about the completeness of a stream that never ends? In this paper, we present a comprehensive definition and analysis of watermarks, a key tool for reasoning about temporal completeness in infinite streams.First, we describe what watermarks are and why they are important, highlighting how they address a suite of stream processing needs that are poorly served by eventually-consistent approaches:• Computing a single correct answer, as in notifications.• Reasoning about a lack of data, as in dip detection.• Performing non-incremental processing over temporal subsets of an infinite stream, as in statistical anomaly detection with cubic spline models.• Safely and punctually garbage collecting obsolete inputs and intermediate state.• Surfacing a reliable signal of overall pipeline health.Second, we describe, evaluate, and compare the semantically equivalent, but starkly different, watermark implementations in two modern stream processing engines: Apache Flink and Google Cloud Dataflow.

Akidau, Tyler↗

Data representations in PDP-10 MacLISP

The internal representations of the various MacLISP data types are presented and discussed. Certain implementation tradeoffs are considered. The ultimate decisions on these tradeoffs are discussed in the light of MacLISP's prime objective of being an efficient high-level language for the implementation of large systems such as MACSYMA. The basic strategy of garbage collection is outlined, with reference to the specific representations involved. Certain clever tricks are explained and justified. The address space crunch is explained and some alternative solutions explored.

Steele, G. L., Jr.↗

Fast arithmetic in MacLISP

MacLISP provides a compiler which produces numerical code competitive in speed with some FORTRAN implementations and yet compatible with the rest of the MacLISP system. All numerical programs can be run under the MacLISP interpreter. Additional declarations to the compiler specify type information which allows the generation of optimized numerical code which generally does not require the garbage collection of temporary numerical results. Array accesses are almost as fast as in FORTRAN, and permit the use of dynamically allocated arrays of varying dimensions. The implementation decisions regarding user interface, data representations, and interfacing conventions are discussed which allow the generation of fast numerical LISP code.

Steele, G. L., Jr.↗

Bio-isolation analysis of plants and humans in a piloted Mars sprint

The bioisolation dynamics of humans and plants in a piloted Mars sprint is discussed. The bioisolation requirements for a crew of six and two food crops, lettuce, and winged beans in this type of space mission were studied and found to be within technological reach. It was found that the garbage problem of the shorter missions increases in magnitude in proportion with the mission duration and poses problems of launch mass, storage space availability, and microbial growth.

Novara, M.↗

ICE System: Interruptible control expert system

The Interruptible Control Expert (ICE) System is based on an architecture designed to provide a strong foundation for real-time production rule expert systems. Three principles are adopted to guide the development of ICE. A practical delivery platform must be provided, no specialized hardware can be used to solve deficiencies in the software design. Knowledge of the environment and the rule-base is exploited to improve the performance of a delivered system. The third principle of ICE is to respond to the most critical event, at the expense of the more trivial tasks. Minimal time is spent on classifying the potential importance of environmental events with the majority of the time used for finding the responses. A feature of the system, derived from all three principles, is the lack of working memory. By using a priori information, a fixed amount of memory can be specified for the hardware platform. The absence of working memory removes the dangers of garbage collection during the continuous operation of the controller.

Vezina, James M.↗

Geography of cretaceous extinctions: Data base development

Data bases built from the source literature are plagued by problems of data quality. Unless the data acquisition is done by experts, working slowly, the data base may contain so much garbage that true signals and patterns cannot be detected. On the other hand, high quality data bases develop so slowly that satisfactory statistical analysis may never be possible due to the small sample sizes. Results of a test are presented of the opposite strategy: rapid data acquisition by non-experts with minimal control on data quality. A published list of 186 species and genera of fossil invertibrates of the latest Cretaceous Age (Maestrichtian) were located through a random search of the paleobiological and geological literature. The geographic location for each faunal list was then transformed electronically to Maestrichtian latitude and longitude and the lists were further digested to identify the genera occurring in each ten-degree, latitude-longitude block. The geographical lists were clustered using the Otsuka similarity coefficient and a standard unweight-pair-group method. The resulting clusters are remarkably consistent geographically, indicating that a strong biogeographic signal is visible despite low-quality data. A further test evaluated the geographic pattern of end-Cretaceaous extinctions. All genera in the data base were compared with Sepkoski's compendium of time ranges of genera to determine which of the reported genera survived the Cretaceous mass extinction. In turn, extinction rates for the ten-degree, latitude-longitude blocks were mapped. The resulting distribution is readily interpretable as a robust pattern of the geography of the mass extinction. The study demonstrates that a low-quality data base, built rapidly, can provide a basis for meaningful analysis of past biotic events.

Raup, D. M.↗

Hypervelocity impact effects on solar cells

One of the space hazards of concern is the problem of natural matter and space debris impacting spacecraft. In addition to mechanical damage, impact velocities greater than 5 km/sec can produce shock induced ionization effects with resultant surface charging and complex chemical interactions. The upper limit of the velocity distribution for these particles is on the order of 70 km/sec. The second source of particulate matter is due to the presence of man and the machinery needed to place satellites in orbit. This 'man made' component of the space debris consists of waste, rocket exhaust, and debris caused by satellite break-up. Most of the particles are small. However as the size increases, debris purposefully thrown overboard such as garbage and human waste, combined with paint chips, plastic, wire fragments, bolts, etc., become formidable hazards which completely dominate the distribution function for some orbits. These larger fragments can produce penetration and spalling of the thick metallic structures associated with spacecraft. The particles most often encountered are aluminum oxide, associated with fuel residue, and paint chips. These debris types can have a wide range of particle sizes. It has been stated that the design of spacecraft will have to take the debris evolution into account and provide additional suitable armor for key components in the near future. The purpose of this work was to subject samples from solar power arrays, one of the key components of any spacecraft, to a debris flux typical of what might be found in space, and measure the degradation of the power panels after impact.

Rose, M. Frank↗

Optimal message log reclamation for independent checkpointing

Independent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.

Wang, Yi-Min↗

Optimal message log reclamation for independent checkpointing

Independent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.

Wang, Yi-Min↗

Organizing and Typing Persistent Objects Within an Object-Oriented Framework

Conventional operating systems provide little or no direct support for the services required for an efficient persistent object system implementation. We have built a persistent object scheme using a customization and extension of an object-oriented operating system called Choices. Choices includes a framework for the storage of persistent data that is suited to the construction of both conventional file system and persistent object system. In this paper we describe three areas in which persistent object support differs from file system support: storage organization, storage management, and typing. Persistent object systems must support various sizes of objects efficiently. Customizable containers, which are themselves persistent objects and can be nested, support a wide range of object sizes in Choices. Collections of persistent objects that are accessed as an aggregate and collections of light-weight persistent objects can be clustered in containers that are nested within containers for larger objects. Automated garbage collection schemes are added to storage management and have a major impact on persistent object applications. The Choices persistent object store provides extensible sets of persistent object types. The store contains not only the data for persistent objects but also the names of the classes to which they belong and the code for the operation of the classes. Besides presenting persistent object storage organization, storage management, and typing, this paper discusses how persistent objects are named and used within the Choices persistent data/file system framework.

Madany, Peter W.↗

JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms

A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.

Globus, Al↗

Model Checking Real Time Java Using Java PathFinder

The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real time threads; user defined schedulers; asynchronous events, handlers, and control transfers; a priority inheritance based default scheduler; non-heap memory areas such as immortal and scoped, and non-heap real time threads whose execution is not impeded by garbage collection. The Robust Software Systems group at NASA Ames Research Center has JAVA PATHFINDER (JPF) under development, a Java model checker. JPF at its core is a state exploring JVM which can examine alternative paths in a Java program (e.g., via backtracking) by trying all nondeterministic choices, including thread scheduling order. This paper describes our implementation of an RTSJ profile (subset) in JPF, including requirements, design decisions, and current implementation status. Two examples are analyzed: jobs on a multiprogramming operating system, and a complex resource contention example involving autonomous vehicles crossing an intersection. The utility of JPF in finding logic and timing errors is illustrated, and the remaining challenges in supporting all of RTSJ are assessed.

Lindstrom, Gary↗