Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Reads”

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 721 records · Page 40

Toward Large Field-of-view X-ray Spectrometers with Magnetic Microcalorimeters

A future X-ray telescope mission like Lynx, a X-ray flagship mission concept, requires a large field of view, high energy resolution, and high spatial resolution. The Magnetic Microcalorimeter (MMC) detectors we are developing for such a mission feature a 5-arcminute field of view, approximately 100,000 pixels, each spanning 0.5–1 arcsecond. These detectors require the readout of 8,000 sensors. Three different array types have been designed to meet scientific goals, two of which utilize thermal multiplexing to reduce the number of readout channels in a scheme called “Hydra.” We are currently fabricating detectors on a recently completed buried wiring wafer with connections to every sensor. The sensors are read out using a microwave multiplexer (μMUX) with flux ramp modulation. A single μMUX can read out approximately 1,000 sensors with only two feed lines. We will report on the test of the first two-dimensional μMUX chip, consisting of 78 resonators. μMUX chips that pass screening will be directly bonded to MMC array chips using indium bump bonding. In parallel, we have tested a kinetic inductance traveling wave parametric amplifier (KI-TWPA) to amplify signals at low temperatures. The KI-TWPA exhibits extremely low internal noise, approaching the standard quantum limit. Since the energy resolution of an MMC is primarily limited by the readout system, the KI-TWPA is an ideal amplifier for MMCs with μMUX readout. We recently measured the readout noise of a μMUX with a KI-TWPA, demonstrating its capability for reading out MMC arrays. We present the design and fabrication of the latest MMC detectors, along with its readout performance.

Magntic Microcalorimeters↗

Multi-Level Bitmap Indexes for Flash Memory Storage

Due to their low access latency, high read speed, and power-efficient operation, flash memory storage devices are rapidly emerging as an attractive alternative to traditional magnetic storage devices. However, tests show that the most efficient indexing methods are not able to take advantage of the flash memory storage devices. In this paper, we present a set of multi-level bitmap indexes that can effectively take advantage of flash storage devices. These indexing methods use coarsely binned indexes to answer queries approximately, and then use finely binned indexes to refine the answers. Our new methods read significantly lower volumes of data at the expense of an increased disk access count, thus taking full advantage of the improved read speed and low access latency of flash devices. To demonstrate the advantage of these new indexes, we measure their performance on a number of storage systems using a standard data warehousing benchmark called the Set Query Benchmark. We observe that multi-level strategies on flash drives are up to 3 times faster than traditional indexing strategies on magnetic disk drives.

97 MATHEMATICS AND COMPUTING↗

Reducing Concurrency Bottlenecks in Parallel I/O Workloads

To enable high performance parallel checkpointing we introduced the Parallel Log Structured File System (PLFS). PLFS is middleware interposed on the file system stack to transform concurrent writing of one application file into many non-concurrently written component files. The promising effectiveness of PLFS makes it important to examine its performance for workloads other than checkpoint capture, notably the different ways that state snapshots may be later read, to make the case for using PLFS in the Exascale I/O stack. Reading a PLFS file involved reading each of its component files. In this paper we identify performance limitations on broader workloads in an early version of PLFS, specifically the need to build and distribute an index for the overall file, and the pressure on the underlying parallel file system's metadata server, and show how PLFS's decomposed components architecture can be exploited to alleviate bottlenecks in the underlying parallel file system.

COMPUTER ARCHITECTURE↗

Data eye monitor method and apparatus

An apparatus and method for providing a data eye monitor. The data eye monitor apparatus utilizes an inverter/latch string circuit and a set of latches to save the data eye for providing an infinite persistent data eye. In operation, incoming read data signals are adjusted in the first stage individually and latched to provide the read data to the requesting unit. The data is also simultaneously fed into a balanced XOR tree to combine the transitions of all incoming read data signals into a single signal. This signal is passed along a delay chain and tapped at constant intervals. The tap points are fed into latches, capturing the transitions at a delay element interval resolution. Using XORs, differences between adjacent taps and therefore transitions are detected. The eye is defined by segments that show no transitions over a series of samples. The eye size and position can be used to readjust the delay of incoming signals and/or to control environment parameters like voltage, clock speed and temperature.

47 OTHER INSTRUMENTATION↗

Performing a local reduction operation on a parallel computer

A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

97 MATHEMATICS AND COMPUTING↗

Performing a local reduction operation on a parallel computer

A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

97 MATHEMATICS AND COMPUTING↗

Cache directory lookup reader set encoding for partial cache line speculation support

In a multiprocessor system, with conflict checking implemented in a directory lookup of a shared cache memory, a reader set encoding permits dynamic recordation of read accesses. The reader set encoding includes an indication of a portion of a line read, for instance by indicating boundaries of read accesses. Different encodings may apply to different types of speculative execution.

97 MATHEMATICS AND COMPUTING↗

Enabling Graph Appliance for Genome Assembly

In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

Big data↗

Detecting and correcting hard errors in a memory array

Hard errors in the memory array can be detected and corrected in real-time using reusable entries in an error status buffer. Data may be rewritten to a portion of a memory array and a register in response to a first error in data read from the portion of the memory array. The rewritten data may then be written from the register to an entry of an error status buffer in response to the rewritten data read from the register differing from the rewritten data read from the portion of the memory array.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Livermore Metagenomics Analysis Toolkit

LMAT is designed to take as input a collection of raw metagenomic sequencer reads, and search each read against a reference genome database and assign a taxonomic label and confidence value to each read and report a summary of the predicted taxonomic contents of the metagenomic sample.

Source record↗

Using the Model Perennial Grass Brachypodium sylvaticum to Engineer Resistance to Multiple Abiotic Stresses

We are using the perennial model grass Brachypodium sylvaticum to identify combinations of transgenes that enhance tolerance to multiple, simultaneous abiotic stresses. The most successful transgene combinations will ultimately be used to create improved switchgrass (Panicum virgatum L.) cultivars. To further develop B. sylvaticum as a perennial model grass, and facilitate our planned transcriptional profiling, we are sequencing and annotating the genome. We have generated ~40x genome coverage using PacBio sequencing of the largest possible size selected libraries (18, 22, 25 kb). Our initial assembly using only long-read sequence contained 320 Mb of sequence with an N50 contig length of 315 kb and an N95 contig length of 40 kb. This assembly consists of 2,430 contigs, the largest of which was 1.6 Mb. The estimated genome size based on c-values is 340 Mb indicating that about 20 Mb of presumably repetitive DNA remains yet unassembled. Significantly, this assembly is far superior to an assembly created from paired-end short-read sequence, ~100x genome coverage. The short-read-only assembly contained only 226 Mb of sequence in 19k contigs. To aid the assembly of the scaffolds into chromosome-scale assemblies we produced an F2 mapping population and have genotyped 480 individuals using a genotype by sequence approach. One of the reasons for using B. sylvaticum as a model system is to determine if the transgenes adversely affect perenniality and winter hardiness. Toward this goal, we examined the freezing tolerance of wild type B. sylvaticum lines to determine the optimal conditions for testing the freezing tolerance of the transgenics. A survey of seven accessions noted significant natural variation in freezing tolerance. Seedling or adult Ain-1 plants, the line used for transformation, survived an 8 hour challenge down to -6 oC and 50% survived a challenge down to -9 oC. Thus, we will be able to easily determine if the transgenes compromise freezing tolerance. In the effort to develop biotechnological tools for perennial grass improvement, we have completed the transformation of B. sylvaticum with constructs containing 20 genes shown to be associated with enhanced abiotic stress tolerance in monocots. In addition, we have transformed plants with constructs containing a combination of genes (i.e. SARK::IPT- Ubi::HSR1::Ubi::NHX1) in order to simultaneously overexpress genes associated with drought + heat tolerance + salt tolerance. We generated single copy insert T1 lines for all constructs and the generation and bulking of homozygous T2 lines is well underway. In addition to our B. sylvaticum transgenics, we transformed B. distachyon with many of the same genes. Some of the transgenic B. distachyon plants subjected to a combined stress of both drought and salinity were able to produced higher yields than wild type plants. Our results indicate a great potential for the development of grasses with improved performance and yield in water-limited areas.

Gordon, Sean↗

Checkpoint triggering in a computer system

According to an aspect, a method for triggering creation of a checkpoint in a computer system includes executing a task in a processing node of the computer system and determining whether it is time to read a monitor associated with a metric of the task. The monitor is read to determine a value of the metric based on determining that it is time to read the monitor. A threshold for triggering creation of the checkpoint is determined based on the value of the metric. Based on determining that the value of the metric has crossed the threshold, the checkpoint including state data of the task is created to enable restarting execution of the task upon a restart operation.

97 MATHEMATICS AND COMPUTING↗

Apparatus and method for implementing power saving techniques when processing floating point values

An apparatus and method are described for reducing power when reading and writing graphics data. For example, one embodiment of an apparatus comprises: a graphics processor unit (GPU) to process graphics data including floating point data; a set of registers, at least one of the registers of the set partitioned to store the floating point data; and encode/decode logic to reduce a number of binary 1 values being read from the at least one register by causing a specified set of bit positions within the floating point data to be read out as 0s rather than 1s.

97 MATHEMATICS AND COMPUTING↗

The Fermilab Test Beam Facility Data Acquisition System Based on $otsdaq$

The Real-Time Systems Engineering Department of the Scientific Computing Division at Fermilab has deployed set of customizations to our Off-The-Shelf Data Acquisition solution (otsdaq) at the Fermilab Test Beam Facility (FTBF) to read out the beamline instrumentation in support of FTBF users. In addition to reading out several detectors which use various detection technologies and readout hardware, the FTBF Data Acquisition system (DAQ) can perform basic track reconstruction through the facility in real time and provide data to facility users. An advanced prototype smart coincidence module, known as the NIM+, performs trigger distribution and throttling, allowing the beamline instrumentation to be read out at different rates. Spill data are saved to disk for studies of the facility performance, and hit data are also made available on the FTBF network for experiments' use. A web-based run control and configuration GUI are provided, and the online monitoring snapshots created after each beam spill are viewable from any computer connected to the Fermilab network. The integrated DAQ system for the facility provides users with high-precision tracking data along the beamline and a single location for obtaining data from the facility detectors, which set the baseline for testing their own detectors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Bulk force in a battery pack and its application to state of charge estimation

There is disclosed an electrical device including a battery pack, a pressure sensor for measuring a volume change of the battery pack, a voltage sensor in electrical communication with a positive terminal and a negative terminal of the battery pack, a temperature sensor positioned in a cell of the battery pack, and a battery management system. The battery management system includes a controller in electrical communication with the pressure sensor, the voltage sensor, and the temperature sensor, the controller being configured to execute a program stored in the controller to determine a state of charge percentage of the battery pack based on a pressure reading from the pressure sensor, a terminal voltage reading from the voltage sensor, and a temperature reading from the temperature sensor.

Stefanopoulou, Anna G.↗

Checkpoint triggering in a computer system

According to an aspect, a method for triggering creation of a checkpoint in a computer system includes executing a task in a processing node and determining whether it is time to read a monitor associated with a metric of the task. The monitor is read to determine a value of the metric based on determining that it is time to read the monitor. A threshold for triggering creation of the checkpoint is determined based on the metric. A monitoring block size is determined for the checkpoint. A checkpoint interval is determined based on the monitoring block size, a checkpoint bandwidth, and a failure rate of the computer system. Based on determining that the value of the metric has crossed the threshold and the checkpoint interval has elapsed, the checkpoint including state data of the task is created to enable restarting execution of the task upon a restart operation.

97 MATHEMATICS AND COMPUTING↗

Using redundant transactions to verify the correctness of program code execution

In the described embodiments, a processor core (e.g., a GPU core) receives a section of program code to be executed in a transaction from another entity in a computing device. The processor core sends the section of program code to one or more compute units in the processor core to be executed in a first transaction and concurrently executed in a second transaction, thereby creating a “redundant transaction pair.” When the first transaction and the second transaction are completed, the processor core compares a read-set of the first transaction to a read-set of the second transaction and compares a write-set of the first transaction to a write-set of the second transaction. When the read-sets and the write-sets match and no transactional error condition has occurred, the processor core allows results from the first transaction to be committed to an architectural state of the computing device.

Gurumurthi, Sudhanva↗

Error-correction coding for hot-swapping semiconductor devices

A memory read operation is directed at a group of semiconductor devices from which a first semiconductor device has been removed. An error in data for the memory read operation is detected based on error-correction coding (ECC). The error is caused at least in part by the first semiconductor device having been removed. ECC is used to determine corrected data for the memory read operation.

42 ENGINEERING↗