Search NASA⌕ Search

SEARCH · Search NASA

Results for “Lightweight threads”

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 55 records · Page 3

The structure of the clouds distributed operating system

A novel system architecture, based on the object model, is the central structuring concept used in the Clouds distributed operating system. This architecture makes Clouds attractive over a wide class of machines and environments. Clouds is a native operating system, designed and implemented at Georgia Tech. and runs on a set of generated purpose computers connected via a local area network. The system architecture of Clouds is composed of a system-wide global set of persistent (long-lived) virtual address spaces, called objects that contain persistent data and code. The object concept is implemented at the operating system level, thus presenting a single level storage view to the user. Lightweight treads carry computational activity through the code stored in the objects. The persistent objects and threads gives rise to a programming environment composed of shared permanent memory, dispensing with the need for hardware-derived concepts such as the file systems and message systems. Though the hardware may be distributed and may have disks and networks, the Clouds provides the applications with a logically centralized system, based on a shared, structured, single level store. The current design of Clouds uses a minimalist philosophy with respect to both the kernel and the operating system. That is, the kernel and the operating system support a bare minimum of functionality. Clouds also adheres to the concept of separation of policy and mechanism. Most low-level operating system services are implemented above the kernel and most high level services are implemented at the user level. From the measured performance of using the kernel mechanisms, we are able to demonstrate that efficient implementations are feasible for the object model on commercially available hardware. Clouds provides a rich environment for conducting research in distributed systems. Some of the topics addressed in this paper include distributed programming environments, consistency of persistent data and fault-tolerance.

Dasgupta, Partha↗

Scaling Irregular Applications through Data Aggregation and Software Multithreading

Bioinformatics, data analytics, semantic databases, knowledge discovery are emerging high performance application areas that exploit dynamic, linked data structures such as graphs, unbalanced trees or unstructured grids. These data structures usually are very large, requiring significantly more memory than available on single shared memory systems. Additionally, these data structures are difficult to partition on distributed memory systems. They also present poor spatial and temporal locality, thus generating unpredictable memory and network accesses. The Partitioned Global Address Space (PGAS) programming model seems suitable for these applications, because it allows using a shared memory abstraction across distributed-memory clusters. However, current PGAS languages and libraries are built to target regular remote data accesses and block transfers. Furthermore, they usually rely on the Single Program Multiple Data (SPMD) parallel control model, which is not well suited to the fine grained, dynamic and unbalanced parallelism of irregular applications. In this paper we present {\bf GMT} (Global Memory and Threading library), a custom runtime library that enables efficient execution of irregular applications on commodity clusters. GMT integrates a PGAS data substrate with simple fork/join parallelism and provides automatic load balancing on a per node basis. It implements multi-level aggregation and lightweight multithreading to maximize memory and network bandwidth with fine-grained data accesses and tolerate long data access latencies. A key innovation in the GMT runtime is its thread specialization (workers, helpers and communication threads) that realize the overall functionality. We compare our approach with other PGAS models, such as UPC running using GASNet, and hand-optimized MPI code on a set of typical large-scale irregular applications, demonstrating speedups of an order of magnitude.

Aggregation↗

Silicon carbide sewing thread

Composite flexible multilayer insulation systems (MLI) were evaluated for thermal performance and compared with currently used fibrous silica (baseline) insulation system. The systems described are multilayer insulations consisting of alternating layers of metal foil and scrim ceramic cloth or vacuum metallized polymeric films quilted together using ceramic thread. A silicon carbide thread for use in the quilting and the method of making it are also described. These systems provide lightweight thermal insulation for a variety of uses, particularly on the surface of aerospace vehicles subject to very high temperatures during flight.

Sawko, Paul M.↗

Composite Flexible Blanket Insulation

Composite flexible multilayer insulation systems (MLI) were evaluated for thermal performance and compared with the currently used fibrous silica (baseline) insulation system. The systems described are multilayer insulations consisting of alternating layers of metal foil and scrim ceramic cloth or vacuum metallized polymeric films quilted together using ceramic thread. A silicon carbide thread for use in the quilting and the method of making it are also described. These systems are useful in providing lightweight insulation for a variety of uses, particularly on the surface of aerospace vehicles subject to very high temperatures during flight.

Kourtides, Demetrius A.↗

Fault Diagnosis of Hybrid Computing Systems Using Chaotic-Map Method

Computing systems are becoming increasingly complex with nodes consisting of a combination of multi-core central processing units (CPUs), many integrated core (MIC) and graphics processing unit (GPU) accelerators. These computing units and their interconnections are subject to different classes of hardware and software faults, which should be detected to support mitigation measures. We present the chaotic-map method that uses the exponential divergence and wide Fourier properties of the trajectories, combined with memory allocations and assignments to diagnose component-level faults in these hybrid computing systems. We propose lightweight codes that utilize highly parallel chaotic-map computations tailored to isolate faults in arithmetic units, memory elements and interconnects. The diagnosis module on a node utilizes pthreads to place chaotic-map threads on CPU and MIC cores, and CUDA C and OpenCL kernels on GPU blocks. We present experimental diagnosis results on five multi-core CPUs; one MIC; and, seven GPUs with typical diagnosis run-times under a minute.

Rao, Nageswara↗

Pivot Attachment for Prefabricated Beams

Assembly of prefabricated structural beams for roof trusses, bleachers, or other lightweight structures made easier by use of flexural pivot at one or both ends. When pivot is attached, joint is flexible, thus simplifying alinement; joint is subsequently rigidized by threaded collar that completes attachment.

Stroll, H. W. J.↗

Heterogeneous concurrent computing with exportable services

Heterogeneous concurrent computing, based on the traditional process-oriented model, is approaching its functionality and performance limits. An alternative paradigm, based on the concept of services, supporting data driven computation, and built on a lightweight process infrastructure, is proposed to enhance the functional capabilities and the operational efficiency of heterogeneous network-based concurrent computing. TPVM is an experimental prototype system supporting exportable services, thread-based computation, and remote memory operations that is built as an extension of and an enhancement to the PVM concurrent computing system. TPVM offers a significantly different computing paradigm for network-based computing, while maintaining a close resemblance to the conventional PVM model in the interest of compatibility and ease of transition Preliminary experiences have demonstrated that the TPVM framework presents a natural yet powerful concurrent programming interface, while being capable of delivering performance improvements of upto thirty percent.

Sunderam, Vaidy↗

A simple 5-DOF walking robot for space station application

Robots on the NASA space station have a potential range of applications from assisting astronauts during EVA (extravehicular activity), to replacing astronauts in the performance of simple, dangerous, and tedious tasks; and to performing routine tasks such as inspections of structures and utilities. To provide a vehicle for demonstrating the pertinent technologies, a simple robot is being developed for locomotion and basic manipulation on the proposed space station. In addition to the robot, an experimental testbed was developed, including a 1/3 scale (1.67 meter modules) truss and a gravity compensation system to simulate a zero-gravity environment. The robot comprises two flexible links connected by a rotary joint, with a 2 degree of freedom wrist joints and grippers at each end. The grippers screw into threaded holes in the nodes of the space station truss, and enable it to walk by alternately shifting the base of support from one foot (gripper) to the other. Present efforts are focused on mechanical design, application of sensors, and development of control algorithms for lightweight, flexible structures. Long-range research will emphasize development of human interfaces to permit a range of control modes from teleoperated to semiautonomous, and coordination of robot/astronaut and multiple-robot teams.

Brown, H. Benjamin, Jr.↗

Initial Kernel Timing Using a Simple PIM Performance Model

This presentation will describe some initial results of paper-and-pencil studies of 4 or 5 application kernels applied to a processor-in-memory (PIM) system roughly similar to the Cascade Lightweight Processor (LWP). The application kernels are: * Linked list traversal * Sun of leaf nodes on a tree * Bitonic sort * Vector sum * Gaussian elimination The intent of this work is to guide and validate work on the Cascade project in the areas of compilers, simulators, and languages. We will first discuss the generic PIM structure. Then, we will explain the concepts needed to program a parallel PIM system (locality, threads, parcels). Next, we will present a simple PIM performance model that will be used in the remainder of the presentation. For each kernel, we will then present a set of codes, including codes for a single PIM node, and codes for multiple PIM nodes that move data to threads and move threads to data. These codes are written at a fairly low level, between assembly and C, but much closer to C than to assembly. For each code, we will present some hand-drafted timing forecasts, based on the simple PIM performance model. Finally, we will conclude by discussing what we have learned from this work, including what programming styles seem to work best, from the point-of-view of both expressiveness and performance.

BRIEFING CHARTS↗

Large Deployable Shroud

Preliminary design proposed for large, lightweight telescope shroud or light shield carried to orbit in single Space Shuttle cargo load. Shroud concept applied on Earth in portable, compactly storable displays or projection screens. Large telescope shroud includes four deployable masts erecting eight walls of hinged panels of polyimide film. Panels stored fanfolded before deployment and threaded on guide wires unwinding from spools and remain taut during deployment.

Jacquemin, G. G.↗

Crunching Large Graphs with Commodity Processors

Crunching large graphs is the basis of many emerging appli- cations, such as social network analysis and bioinformatics. Graph analytics algorithms exhibit little locality and therefore present significant performance challenges. Hardware multi- threading systems (e.g, Cray XMT) show that with enough concurrency, we can tolerate long latencies. Unfortunately, this solution is not available with commodity parts. Our goal is to develop a latency-tolerant system built out of commodity parts and mostly in software. The proposed system includes a runtime that supports a large number of lightweight contexts, full-bit synchronization and a memory manager that provides a high-latency but high-bandwidth global shared memory. This paper lays out the vision for our system, and justifies its feasibility with a performance analysis of the run- time for latency tolerance.

99 GENERAL AND MISCELLANEOUS↗

Deployable Wide-Aperture Array Antennas

Inexpensive, lightweight array antennas on flexible substrates are under development to satisfy a need for large-aperture antennas that can be stored compactly during transport and deployed to full size in the field. Conceived for use aboard spacecraft, antennas of this type also have potential terrestrial uses . most likely, as means to extend the ranges of cellular telephones in rural settings. Several simple deployment mechanisms are envisioned. One example is shown in the figure, where the deployment mechanism, a springlike material contained in a sleeve around the perimeter of a flexible membrane, is based on a common automobile window shade. The array can be formed of antenna elements that are printed on small sections of semi-flexible laminates, or preferably, elements that are constructed of conducting fabric. Likewise, a distribution network connecting the elements can be created from conventional technologies such as lightweight, flexible coaxial cable and a surface mount power divider, or preferably, from elements formed from conductive fabrics. Conventional technologies may be stitched onto a supporting flexible membrane or contained within pockets that are stitched onto a flexible membrane. Components created from conductive fabrics may be attached by stitching conductive strips to a nonconductive membrane, embroidering conductive threads into a nonconductive membrane, or weaving predetermined patterns directly into the membrane. The deployable antenna may comprise multiple types of antenna elements. For example, thin profile antenna elements above a ground plane, both attached to the supporting flexible membrane, can be used to create a unidirectional boresight radiation pattern. Or, antenna elements without a ground plane, such as bow-tie dipoles, can be attached to the membrane to create a bidirectional array such as that shown in the figure. For either type of antenna element, the dual configuration, i.e., elements formed of slots in a conductive membrane, can also be used. Finally, wide bandwidth antennas or arrays can be formed in which the principal direction of radiation is in the plane of the membrane. For this embodiment, the set of elements on the membrane is arranged to form one or more traveling wave antennas. In this case, a nonconductive form of the perimeter springlike material is required to provide the deploying force.

Fink, Patrick W.↗

Diagnosing the Causes and Severity of One-sided Message Contention

Two trends suggest network contention for one-sided messages is poised to become a performance problem that concerns application developers: an increased interest in one-sided programming models and a rising ratio of hardware threads to network injection bandwidth. Unfortunately, it is difficult to reason about network contention and one-sided messages because one-sided tasks can either decrease or increase contention. We present effective and portable techniques for diagnosing the causes and severity of one-sided message contention. To detect that a message is affected by contention, we maintain statistics representing instantaneous (non-local) network resource demand. Using lightweight measurement and modeling, we identify the portion of a message's latency that is due to contention and whether contention occurs at the initiator or target. We attribute these metrics to program statements in their full static and dynamic context. We characterize contention for an important computational chemistry benchmark on InfiniBand, Cray Aries, and IBM Blue Gene/Q interconnects. We pinpoint the sources of contention, estimate their severity, and show that when message delivery time deviates from an ideal model, there are other messages contending for the same network links. With a small change to the benchmark, we reduce contention up to 50% and improve total runtime as much as 20%.

Network Contention, Performance Analysis, Dynamic ↗

PRIMA-X Final Report

The PRIMA-X (Performance Retargeting of Instrumentation, Measurement, and Analysis Technologies for Exascale Computing) project is the successor of the DOE PRIMA (Performance Refactoring of Instrumentation, Measurement, and Analysis Technologies for Petascale Computing) project, which addressed the challenge of creating a core measurement infrastructure that would serve as a common platform for both integrating leading parallel performance systems (notably TAU and Scalasca) and developing next-generation scalable performance tools. The PRIMA-X project shifts the focus away from refactorization of robust performance tools towards a re-targeting of the parallel performance measurement and analysis architecture for extreme scales. The massive concurrency, asynchronous execution dynamics, hardware heterogeneity, and multi-objective prerequisites (performance, power, resilience) that identify exascale systems introduce fundamental constraints on the ability to carry forward existing performance methodologies. In particular, there must be a deemphasis of per-thread observation techniques to significantly reduce the otherwise unsustainable flood of redundant performance data. Instead, it will be necessary to assimilate multi-level resource observations into macroscopic performance views, from which resilient performance metrics can be attributed to the computational features of the application. This requires a scalable framework for node-level and system-wide monitoring and runtime analyses of dynamic performance information. Also, the interest in optimizing parallelism parameters with respect to performance and energy drives the integration of tool capabilities in the exascale environment further. Initially, PRIMA-X was a collaborative project between the University of Oregon (lead institution) and the German Research School for Simulation Sciences (GRS). Because Prof. Wolf, the PI at GRS, accepted a position as full professor at Technische Universität Darmstadt (TU Darmstadt) starting February 1st, 2015, the project ended at GRS on January 31st, 2015. This report reflects the work accomplished at GRS until then. The work of GRS is expected to be continued at TU Darmstadt. The first main accomplishment of GRS is the design of different thread-level aggregation techniques. We created a prototype capable of aggregating the thread-level information in performance profiles using these techniques. The next step will be the integration of the most promising techniques into the Score-P measurement system and their evaluation. The second main accomplishment is a substantial increase of Score-P’s scalability, achieved by improving the design of the system-tree representation in Score-P’s profile format. We developed a new representation and a distributed algorithm to create the scalable system tree representation. Finally, we developed a lightweight approach to MPI wait-state profiling. Former algorithms either needed piggy-backing, which can cause significant runtime overhead, or tracing, which comes with its own set of scaling challenges. Our approach works with local data only and, thus, is scalable and has very little overhead.

97 MATHEMATICS AND COMPUTING↗

Miniature Piezoelectric Shaker for Distribution of Unconsolidated Samples to Instrument Cells

The planned Mars Science Laboratory mission requires inlet funnels for channeling unconsolidated powdered samples from the sampling and sieving mechanisms into instrument test cells, which are required to reduce cross-contamination of the samples and to minimize residue left in the funnels after each sample transport. To these ends, a solid-state shaking mechanism has been created that requires low power and is lightweight, but is sturdy enough to survive launch vibration. The funnel mechanism is driven by asymmetrically mounted, piezoelectric flexure actuators that are out of the load path so that they do not support the funnel mass. Each actuator is a titanium, flextensional piezoelectric device driven by a piezoelectric stack. The stack has Invar endcaps with a half-spherical recess. The Invar is used to counteract the change in stress as the actuators are cooled to Mars ambient temperatures. A ball screw is threaded through the actuator frame into the recess to apply pre-stress, and to trap the piezoelectric stack and endcaps in flexure. During the vibration cycle of the flextensional actuator frame, the compression in the piezoelectric stack may decrease to the point that it is unstressed; however, because the ball joint cannot pull, tension in the piezoelectric stack cannot be produced. The actuators are offset at 120 . In this flight design, redundancy is required, so three actuators are used though only one is needed to assist in the movement. The funnel is supported at three contact points offset to the hexapod support contacts. The actuator surface that does not contact the ring is free to expand. Two other configurations can be used to mechanically tune the vibration. The free end can be designed to drive a fixed mass, or can be used to drive a free mass to excite impacts (see figure). Tests on this funnel mechanism show a high density of resonance modes between 1 and 20 kHz. A subset of these between 9 and 12 kHz was used to drive the CheMin actuators at 7 V peak to peak. These actuators could be driven by a single resonance, or swept through a frequency range to decrease the possibility that a portion of the funnel surface was not coincident with a nodal line (line of no displacement). The frequency of actuation can be electrically controlled and monitored and can also be mechanically tuned by the addition of tuning mass on the free end of the actuator. The devices are solid-state and can be designed with no macroscopically moving parts. This design has been tested in a vacuum at both Mars and Earth ambient temperatures ranging from 30 to 25 C

Sherrit, Stewart↗

Lightweight and Statistical Techniques for Petascale PetaScale Debugging

This project investigated novel techniques for debugging scientific applications on petascale architectures. In particular, we developed lightweight tools that narrow the problem space when bugs are encountered. We also developed techniques that either limit the number of tasks and the code regions to which a developer must apply a traditional debugger or that apply statistical techniques to provide direct suggestions of the location and type of error. We extend previous work on the Stack Trace Analysis Tool (STAT), that has already demonstrated scalability to over one hundred thousand MPI tasks. We also extended statistical techniques developed to isolate programming errors in widely used sequential or threaded applications in the Cooperative Bug Isolation (CBI) project to large scale parallel applications. Overall, our research substantially improved productivity on petascale platforms through a tool set for debugging that complements existing commercial tools.

97 MATHEMATICS AND COMPUTING↗

High voltage power chip module

A power die module using a compression connection to a power die in a small package with corona extenders positioned around short efficient path exterior electrical connections. The module is built from a baseplate with connected sidewalls forming an interior compartment holding a power substrate with attached threaded inserts. A printed circuit board bolted to the power substrate with high voltage power die compressively held between the board and the substrate. The compressive hold enhances the electrical connections between the contacts on the top and bottom of the power die and either the power substrate or the printed circuit board. Exterior blade connectors extend upward from the printed circuit board through blade apertures in a lid that covers the interior compartment. The lid includes corona extenders positioned around the blade apertures to allow for high voltage applications while maintaining a small size lightweight package. The sidewall has a perimeter that also includes one or more corona extenders.

42 ENGINEERING↗

RDataFrame: Easy Parallel ROOT Analysis at 100 Threads

The Physics programmes of LHC Run III and HL-LHC challenge the HEP community. The volume of data to be handled is unprecedented at every step of the data processing chain: analysis is no exception. Physicists must be provided with first-class analysis tools which are easy to use, exploit bleeding edge hardware technologies and allow to seamlessly express parallelism. This document discusses the declarative analysis engine of ROOT, RDataFrame, and gives details about how it allows to profitably exploit commodity hardware as well as high-end servers and manycore accelerators thanks to the synergy with the existing parallelised ROOT components. Real-life analyses of LHC experiments’ data expressed in terms of RDataFrame are presented, highlighting the programming model provided to express them in a concise and powerful way. The recent developments which make RDataFrame a lightweight data processing framework are described, such as callbacks and I/O capabilities. Finally, the flexibility of RDataFrame and its ability to read data formats other than ROOT’s are characterised, as an example it is discussed how RDataFrame can directly read and analyse LHCb’s raw data format MDF.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗