Search NASA⌕ Search

SEARCH · Search NASA

Results for “Queues”

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 343 records · Page 19

Access from Space: A New Perspective on NASA's Space Transportation Technology Requirements and Opportunities

The need for robust and reliable access from space is clearly demonstrated by the recent loss of the Space Shuttle Columbia; as well as the NASA s goals to get the Shuttle re-flying and extend its life, build new vehicles for space access, produce successful robotic landers and s a q k ret~rr? ~llisrions, and maximize the science content of ambitious outer planets missions that contain nuclear reactors which must be safe for re-entry after possible launch aborts. The technology lynch pin of access from space is hypersonic entry systems such the thermal protection system, along with navigation, guidance and control (NG&C). But it also extends to descent and landing systems such as parachutes, airbags and their control systems. Current space access technology maturation programs such as NASA s Next Generation Launch Technology (NGLT) program or the In-Space Propulsion (ISP) program focus on maturing laboratory demonstrated technologies for potential adoption by specific mission applications. A key requirement for these programs success is a suitable queue of innovative technologies and advanced concepts to mature, including mission concepts enabled by innovative, cross cutting technology advancements. When considering space access, propulsion often dominates the capability requirements, as well as the attention and resources. From the perspective of access from space some new cross cutting technology drivers come into view, along with some new capability opportunities. These include new miniature vehicles (micro, nano, and picosats), advanced automated systems (providing autonomous on-orbit inspection or landing site selection), and transformable aeroshells (to maximize capabilities and minimize weight). This paper provides an assessment of the technology drivers needed to meet future access from space mission requirements, along with the mission capabilities that can be envisioned from innovative, cross cutting access from space technology developments.

Rasky, Daniel J.↗

MEANS User Documentation

MEANS is an acronym for the MIT Extensible Air Network Simulation. MIT is the Massachusetts Institute of Technology, where MEANS was developed. MEANS models the flow of aircraft in a simulation of the US National Airspace System. It can optionally follow the flow of passengers as well. The flight model takes the form of several queues through which the aircraft pass, as well as delays at certain times; the passengers can be transported via flights. MEANS is an event-based model. This means that events are scheduled at some point in the future, and once an event has executed, the simulation t h e advances to that of the next event. This is a different approach than some simulations (particularly those of physical systems), where time is advanced in fixed increments and the state of the system is updated at each step.This documentation is a "user guide" for MEANS - it describes how to USE means, not write new modules. For programming instructions, see the programming documentation, available as a separate document.This document assumse no programming knowledge. It will describe how to run MEANS, understand the data formats, and use such utility programs as already exist. For more detailed information on the internal workings of MEANS, and how to programmatically add to it, refer to the programming documentation.

Melconian, Terran↗

Following the water, the new program for Mars exploration

In the wake of the loss of Mars Climate Orbiter and Mars Polar Lander in late 1999, NASA embarked on a major review of the failures and subsequently restructured all aspects of what was then called the Mars Surveyor Program--now renamed the Mars Exploration Program. This paper presents the process and results of this reexamination and defines a new approach which we have called "Program System Engineering". Emphasis is given to the scientific, technological, and programmatic strategies that were used to shape the new Program. A scientific approach known as "follow the water" is described, as is an exploration strategy we have called "seek--in situ--sample". An overview of the mission queue from continuing Mars Global Surveyor through a possible Mars Sample Return Mission launch in 2011 is provided. In addition, key proposed international collaborations, especially those between NASA, CNES and ASI are outlined, as is an approach for a robust telecommunications infrastructure. c2002 Published by Elsevier Science Ltd.

Water↗

Improving Explicit Congestion Notification with the Mark-Front Strategy

Delivering congestion signals is essential to the performance of networks. Current TCP/IP networks use packet losses to signal congestion. Packet losses not only reduces TCP performance, but also adds large delay. Explicit Congestion Notification (ECN) delivers a faster indication of congestion and has better performance. However, current ECN implementations mark the packet from the tail of the queue. In this paper, we propose the mark-front strategy to send an even faster congestion signal. We show that mark-front strategy reduces buffer size requirement, improves link efficiency and provides better fairness among users. Simulation results that verify our analysis are also presented.

Liu, Chunlei↗

Evaluation of Swift Start TCP in Long-Delay Environment

This report presents the test results of the Swift Start algorithm in single-flow and multiple-flow testbeds under the effects of high propagation delays, various slow bottlenecks, and small queue sizes. Although this algorithm estimates capacity and implements packet pacing, the findings were that in a heavily congested link, the Swift Start algorithm will not be applicable. The reason is that the bottleneck estimation is falsely influenced by timeouts induced by retransmissions and the expiration of delayed acknowledgment (ACK) timers, thus causing the modified Swift Start code to fall back to regular transmission control protocol (TCP).

Lawas-Grodek, Frances J.↗

A NASA Strategy for Leveraging Emerging Launch Vehicles for Routine, Small Payload Missions

Orbital flight opportunities for small payloads have always been few and far between, and then on February 1, 2002, the situation got worse. In the wake of the loss of the Columbia during STS- 107, changing NASA missions and priorities led to the termination of the Shuttle Small Payloads Projects, including Get-Away Special, Hitcbker, and Space Experiment Module. In spite of the limited opportunities, long queue, and restrictions associated with flying experiments on a man-rated transportation system; the carriers provided a sustained, high quality experiment services for education, science, and technology payloads, and was one of the few games in town. Attempts to establish routine opportunities aboard existing ELVs have been unsuccessful, as the cost-per-pound on small ELVs and conflicts with primary spacecraft on larger vehicles have proven prohibitive. Ths has led to a backlog of existing NASA-sponsored payloads and no prospects or plans for fbture opportunities within the NASA community. The prospects for breaking out of this paradigm appear promising as a result of NASA s partnership with DARPA in pursuit of low-cost, responsive small ELVs under the Falcon Program. Through this partnership several new small ELVs, providing 1000 lbs. to LEO will be demonstrated in less than two years that promise costs that are reasonable enough that NASA, DoD, and other sponsors can once again invest in small payload opportunities. Within NASA, planning has already begun. NASA will be populating one or more of the Falcon demonstration flights with small payloads that are already under development. To accommodate these experiments, Goddard s Wallops Flight Facility has been tasked to develop a multi-payload ejector (MPE) to accommodate the needs of these payloads. The MPE capabilities and design is described in detail in a separately submitted abstract. Beyond use of the demonstration flights however, Goddard has already begun developing strategies to leverage these new ELVs as elements of a larger system designed to provide routine, low-cost end-to-end services for small science, Exploration, and education payloads. The plan leverages the management approaches of the successful Sounding Rocket Program and Shuttle Small Payloads Projects. The strategy consists of using a systems implementation approach of elements, including 1) Falcon ELVs, 2) advanced launch site technologies and processes, 3) suite of experiment carriers accommodating different mission requirements, 4) streamlined integration and test operations, 5 ) experiment brokering and management, and 6) standardized, distributed payload operations. The envisioned suite of carriers includes the MPE, a standard interface experiment carrier, and potentially a reentry fieeflyer experiment carrier. Key to the success of this strategy is standard experiment interfaces within the carriers to limit mission- unique tasks, establishmg and managing a program of scheduled reoccurring flights rather than discrete missions, and streamlined, centralized implementation of the elements. These individual elements are each under development and Goddard will demonstrate the overall system strategy low-cost small payload missions on the initial Falcon demonstration launches from Wallops. goal is to show that this model should be converted to a sustained NASA program supporting science, technology, and education, with annual flight opportunities. The paper will define in detail the various elements of the overall program, as well as provide status, philosophy, and strategy for the program that will hopefully once-and-for-all provide low-cost, routine access to space for the small payloads community.

Underwood, Bruce E.↗

Evolving EO-1 Sensor Web Testbed Capabilities in Pursuit of GEOSS

A viewgraph presentation to evolve sensor web capabilities in pursuit of capabilities to support Global Earth Observing System of Systems (GEOSS) is shown. The topics include: 1) Vision to Enable Sensor Webs with "Hot Spots"; 2) Vision Extended for Communication/Control Architecture for Missions to Mars; 3) Key Capabilities Implemented to Enable EO-1 Sensor Webs; 4) One of Three Experiments Conducted by UMBC Undergraduate Class 12-14-05 (1 - 3); 5) Closer Look at our Mini-Rovers and Simulated Mars Landscae at GSFC; 6) Beginning to Implement Experiments with Standards-Vision for Integrated Sensor Web Environment; 7) Goddard Mission Services Evolution Center (GMSEC); 8) GMSEC Component Catalog; 9) Core Flight System (CFS) and Extension for GMSEC for Flight SW; 10) Sensor Modeling Language; 11) Seamless Ground to Space Integrated Message Bus Demonstration (completed December 2005); 12) Other Experiments in Queue; 13) Acknowledgements; and 14) References.

Mandi, Dan↗

A model to assess the Mars Telecommunications Network relay robustness

The relatively long mission durations and compatible radio protocols of current and projected Mars orbiters have enabled the gradual development of a heterogeneous constellation providing proximity communication services for surface assets. The current and forecasted capability of this evolving network has reached the point that designers of future surface missions consider complete dependence on it. Such designers, along with those architecting network requirements, have a need to understand the robustness of projected communication service. A model has been created to identify the robustness of the Mars Network as a function of surface location and time. Due to the decade-plus time horizon considered, the network will evolve, with emerging productive nodes and nodes that cease or fail to contribute. The model is a flexible framework to holistically process node information into measures of capability robustness that can be visualized for maximum understanding. Outputs from JPL's Telecom Orbit Analysis Simulation Tool (TOAST) provide global telecom performance parameters for current and projected orbiters. Probabilistic estimates of orbiter fuel life are derived from orbit keeping burn rates, forecasted maneuver tasking, and anomaly resolution budgets. Orbiter reliability is estimated probabilistically. A flexible scheduling framework accommodates the projected mission queue as well as potential alterations.

Mars Telecommunications Orbiter (MTO)↗

CAISSON: Interconnect Network Simulator

Cray response to HPCS initiative. Model future petaflop computer interconnect. Parallel discrete event simulation techniques for large scale network simulation. Built on WarpIV engine. Run on laptop and Altix 3000. Can be sized up to 1000 simulated nodes per host node. Good parallel scaling characteristics. Flexible: multiple injectors, arbitration strategies, queue iterators, network topologies.

network simulation↗

Asynchronous Message Service for Deep Space Mission Operations

While the CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol (CFDP) provides internationally standardized file transfer functionality that can offer significant benefits for deep space mission operations, not all spacecraft communication requirements are necessarily best met by file transfer. In particular, continuous event-driven asynchronous message exchange may also be useful for communications with, among, and aboard spacecraft. CCSDS has therefore undertaken the development of a new Asynchronous Message Service (AMS) standard, designed to provide common functionality over a wide variety of underlying transport services, ranging from shared memory message queues to CCSDS telemetry systems. The present paper discusses the design concepts of AMS, their applicability to deep space mission operations problems, and the results of preliminary performance testing obtained from exercise of a prototype implementation.

asynchronous message exchanges↗

A Data Type for Efficient Representation of Other Data Types

A self-organizing, monomorphic data type denoted a sequence has been conceived to address certain concerns that arise in programming parallel computers. A sequence in the present sense can be regarded abstractly as a vector, set, bag, queue, or other construct. Heretofore, in programming a parallel computer, it has been necessary for the programmer to state explicitly, at the outset, what parts of the program and the underlying data structures must be represented in parallel form. Not only is this requirement not optimal from the perspective of implementation; it entails an additional requirement that the programmer have intimate understanding of the underlying parallel structure. The present sequence data type overcomes both the implementation and parallel structure obstacles. In so doing, the sequence data type provides unified means by which the programmer can represent a data structure for natural and automatic decomposition to a parallel computing architecture. Sequences exhibit the behavioral and structural characteristics of vectors, but the underlying representations are automatically synthesized from combinations of programmers advice and execution use metrics. Sequences can vary bidirectionally between sparseness and density, making them excellent choices for many kinds of algorithms. The novelty and benefit of this behavior lies in the fact that it can relieve programmers of the details of implementations. The creation of a sequence enables decoupling of a conceptual representation from an implementation. The underlying representation of a sequence is a hybrid of representations composed of vectors, linked lists, connected blocks, and hash tables. The internal structure of a sequence can automatically change from time to time on the basis of how it is being used. Those portions of a sequence where elements have not been added or removed can be as efficient as vectors. As elements are inserted and removed in a given portion, then different methods are utilized to provide both an access and memory strategy that is optimized for that portion and the use to which it is put.

James, Mark↗

Work Coordination Engine

The Work Coordination Engine (WCE) is a Java application integrated into the Service Management Database (SMDB), which coordinates the dispatching and monitoring of a work order system. WCE de-queues work orders from SMDB and orchestrates the dispatching of work to a registered set of software worker applications distributed over a set of local, or remote, heterogeneous computing systems. WCE monitors the execution of work orders once dispatched, and accepts the results of the work order by storing to the SMDB persistent store. The software leverages the use of a relational database, Java Messaging System (JMS), and Web Services using Simple Object Access Protocol (SOAP) technologies to implement an efficient work-order dispatching mechanism capable of coordinating the work of multiple computer servers on various platforms working concurrently on different, or similar, types of data or algorithmic processing. Existing (legacy) applications can be wrapped with a proxy object so that no changes to the application are needed to make them available for integration into the work order system as "workers." WCE automatically reschedules work orders that fail to be executed by one server to a different server if available. From initiation to completion, the system manages the execution state of work orders and workers via a well-defined set of events, states, and actions. It allows for configurable work-order execution timeouts by work-order type. This innovation eliminates a current processing bottleneck by providing a highly scalable, distributed work-order system used to quickly generate products needed by the Deep Space Network (DSN) to support space flight operations. WCE is driven by asynchronous messages delivered via JMS indicating the availability of new work or workers. It runs completely unattended in support of the lights-out operations concept in the DSN.

Zendejas, Silvino↗

AMS Prototyping Activities

This slide presentation reviews the activity around the Asynchronous Message Service (AMS) prototype. An AMS reference implementation has been available since late 2005. It is aimed at supporting message exchange both in on-board environments and over space links. The implementation incoroporates all mandatory elements of the draft recommendation from July 2007: (1) MAMS, AMS, and RAMS protocols. (2) Failover, heartbeats, resync. (3) "Hooks" for security, but no cipher suites included in the distribution. The performance is reviewed, and a Benchmark latency test over VxWorks Message Queues is shown as histograms of a count vs microseconds per 1000-byte message

AMS (Asynchronous Message Service)↗

AIRSAR Web-Based Data Processing

The AIRSAR automated, Web-based data processing and distribution system is an integrated, end-to-end synthetic aperture radar (SAR) processing system. Designed to function under limited resources and rigorous demands, AIRSAR eliminates operational errors and provides for paperless archiving. Also, it provides a yearly tune-up of the processor on flight missions, as well as quality assurance with new radar modes and anomalous data compensation. The software fully integrates a Web-based SAR data-user request subsystem, a data processing system to automatically generate co-registered multi-frequency images from both polarimetric and interferometric data collection modes in 80/40/20 MHz bandwidth, an automated verification quality assurance subsystem, and an automatic data distribution system for use in the remote-sensor community. Features include Survey Automation Processing in which the software can automatically generate a quick-look image from an entire 90-GB SAR raw data 32-MB/s tape overnight without operator intervention. Also, the software allows product ordering and distribution via a Web-based user request system. To make AIRSAR more user friendly, it has been designed to let users search by entering the desired mission flight line (Missions Searching), or to search for any mission flight line by entering the desired latitude and longitude (Map Searching). For precision image automation processing, the software generates the products according to each data processing request stored in the database via a Queue management system. Users are able to have automatic generation of coregistered multi-frequency images as the software generates polarimetric and/or interferometric SAR data processing in ground and/or slant projection according to user processing requests for one of the 12 radar modes.

Chu, Anhua↗

Soft Real-Time PID Control on a VME Computer

microPID (uPID) is a computer program for real-time proportional + integral + derivative (PID) control of a translation stage in a Fourier-transform ultraviolet spectrometer. microPID implements a PID control loop over a position profile at sampling rate of 8 kHz (sampling period 125microseconds). The software runs in a strippeddown Linux operating system on a VersaModule Eurocard (VME) computer operating in real-time priority queue using an embedded controller, a 16-bit digital-to-analog converter (D/A) board, and a laser-positioning board (LPB). microPID consists of three main parts: (1) VME device-driver routines, (2) software that administers a custom protocol for serial communication with a control computer, and (3) a loop section that obtains the current position from an LPB-driver routine, calculates the ideal position from the profile, and calculates a new voltage command by use of an embedded PID routine all within each sampling period. The voltage command is sent to the D/A board to control the stage. microPID uses special kernel headers to obtain microsecond timing resolution. Inasmuch as microPID implements a single-threaded process and all other processes are disabled, the Linux operating system acts as a soft real-time system.

Karayan, Vahag↗

Incorporating Active Runway Crossings in Airport Departure Scheduling

A mixed integer linear program is presented for deterministically scheduling departure and ar rival aircraft at airport runways. This method addresses different schemes of managing the departure queuing area by treating it as first-in-first-out queues or as a simple par king area where any available aircraft can take-off ir respective of its relative sequence with others. In addition, this method explicitly considers separation criteria between successive aircraft and also incorporates an optional prioritization scheme using time windows. Multiple objectives pertaining to throughput and system delay are used independently. Results indicate improvement over a basic first-come-first-serve rule in both system delay and throughput. Minimizing system delay results in small deviations from optimal throughput, whereas minimizing throughput results in large deviations in system delay. Enhancements for computational efficiency are also presented in the form of reformulating certain constraints and defining additional inequalities for better bounds.

Gupta, Gautam↗

Contact Graph Routing

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Burleigh, Scott C.↗

Asynchronous Message Service Reference Implementation

This software provides a library of middleware functions with a simple application programming interface, enabling implementation of distributed applications in conformance with the CCSDS AMS (Consultative Committee for Space Data Systems Asynchronous Message Service) specification. The AMS service, and its protocols, implement an architectural concept under which the modules of mission systems may be designed as if they were to operate in isolation, each one producing and consuming mission information without explicit awareness of which other modules are currently operating. Communication relationships among such modules are self-configuring; this tends to minimize complexity in the development and operations of modular data systems. A system built on this model is a society of generally autonomous, inter-operating modules that may fluctuate freely over time in response to changing mission objectives, modules functional upgrades, and recovery from individual module failure. The purpose of AMS, then, is to reduce mission cost and risk by providing standard, reusable infrastructure for the exchange of information among data system modules in a manner that is simple to use, highly automated, flexible, robust, scalable, and efficient. The implementation is designed to spawn multiple threads of AMS functionality under the control of an AMS application program. These threads enable all members of an AMS-based, distributed application to discover one another in real time, subscribe to messages on specific topics, and to publish messages on specific topics. The query/reply (client/server) communication model is also supported. Message exchange is optionally subject to encryption (to support confidentiality) and authorization. Fault tolerance measures in the discovery protocol minimize the likelihood of overall application failure due to any single operational error anywhere in the system. The multi-threaded design simplifies processing while enabling application nodes to operate at high speeds; linked lists protected by mutex semaphores and condition variables are used for efficient, inter-thread communication. Applications may use a variety of transport protocols underlying AMS itself, including TCP (Transmission Control Protocol), UDP (User Datagram Protocol), and message queues.

Burleigh, Scott C.↗