Analysis and optimization of a queueing model of a real-time computer control system
Real time computer control system queueing model to optimize preemptible and nonpreemptible job priority assignment
Schrage, L.↗
SEARCH · Engineering Papers
Results for “priority queue”
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.
Preliminary Findings: Issues in Surface Movement
The final report for the grant is presented. The recent goals for this project have been: (1) To identify common surface movement challenges which affect the airlines and Air Traffic Control; (2) To map out possible solutions to these challenges; (3) To start generalizing about the information we are receiving so that major, abstract categories of challenges and potential solutions will begin to emerge. In particular, there are several areas of opportunity which are beginning to emerge from the data, dealing with the need for: (1) Tools to support information exchange regarding priorities (both within an individual airline and between the ATC tower and airlines). Such priorities include both concerns affecting departure throughput as well as the ordering of departures to accommodate other airline considerations; (2) Planning tools to help ATC and airline Ramp staff deal with information about priorities; (3) Implementation of strategies to enable greater flexibility in queueing flights for departures; (4) Tools to provide better coordination and situation awareness during taxiing (within an airline as well as between airlines and between the airlines); (5) Tools to support planning and to deal with the interactions between departures and arrivals. Thus far, the initial interviews and observations at three airlines and two ATC facilities have been completed.
Smith, Philip J.↗
Queueing models for token and slotted ring networks
Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.
Peden, Jeffery H.↗
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.↗
Scheduling revisited workstations in integrated-circuit fabrication
The cost of building new semiconductor wafer fabrication factories has grown rapidly, and a state-of-the-art fab may cost 250 million dollars or more. Obtaining an acceptable return on this investment requires high productivity from the fabrication facilities. This paper describes the Photo Dispatcher system which was developed to make machine-loading recommendations on a set of key fab machines. Dispatching policies that generally perform well in job shops (e.g., Shortest Remaining Processing Time) perform poorly for workstations such as photolithography which are visited several times by the same lot of silicon wafers. The Photo Dispatcher evaluates the history of workloads throughout the fab and identifies bottleneck areas. The scheduler then assigns priorities to lots depending on where they are headed after photolithography. These priorities are designed to avoid starving bottleneck workstations and to give preference to lots that are headed to areas where they can be processed with minimal waiting. Other factors considered by the scheduler to establish priorities are the nearness of a lot to the end of its process flow and the time that the lot has already been waiting in queue. Simulations that model the equipment and products in one of Texas Instrument's wafer fabs show the Photo Dispatcher can produce a 10 percent improvement in the time required to fabricate integrated circuits.
Kline, Paul 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.↗
Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system
The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications scheduling.
Short, Nick, Jr.↗
Delay Banking for Managing Air Traffic
Delay banking has been invented to enhance air-traffic management in a way that would increase the degree of fairness in assigning arrival, departure, and en-route delays and trajectory deviations to aircraft impacted by congestion in the national airspace system. In delay banking, an aircraft operator (airline, military, general aviation, etc.) would be assigned a numerical credit when any of their flights are delayed because of an air-traffic flow restriction. The operator could subsequently bid against other operators competing for access to congested airspace to utilize part or all of its accumulated credit. Operators utilize credits to obtain higher priority for the same flight, or other flights operating at the same time, or later, in the same airspace, or elsewhere. Operators could also trade delay credits, according to market rules that would be determined by stakeholders in the national airspace system. Delay banking would be administered by an independent third party who would use delay banking automation to continually monitor flights, allocate delay credits, maintain accounts of delay credits for participating airlines, mediate bidding and the consumption of credits of winning bidders, analyze potential transfers of credits within and between operators, implement accepted transfers, and ensure fair treatment of all participating operators. A flow restriction can manifest itself in the form of a delay in assigned takeoff time, a reduction in assigned airspeed, a change in the position for the aircraft in a queue of all aircraft in a common stream of traffic (e.g., similar route), a change in the planned altitude profile for an aircraft, or change in the planned route for the aircraft. Flow restrictions are typically imposed to mitigate traffic congestion at an airport or in a region of airspace, particularly congestion due to inclement weather, or the unavailability of a runway or region of airspace. A delay credit would be allocated to an operator of a flight that has accepted, or upon which was imposed, a flow restriction. The amount of the credit would increase with the amount of delay caused by the flow restriction, the exact amount depending on which of several candidate formulas is eventually chosen. For example, according to one formula, there would be no credit for a delay smaller than some threshold value (e.g., 30 seconds) and the amount of the credit for a longer delay would be set at the amount of the delay minus the threshold value. Optionally, the value of a delay credit could be made to decay with time according to a suitable formula (e.g., an exponential decay). Also, optionally, a transaction charge could be assessed against the value of a delay credit that an operator used on a flight different from the one for which the delay originated or that was traded with a different operator. The delay credits accumulated by a given airline could be utilized in various ways. For example, an operator could enter a bid for priority handling in a new flow restriction that impacts one or more of the operator s flights; if the bid were unsuccessful, all or a portion of the credit would be returned to the bidder. If the bid pertained to a single aircraft that was in a queue, delay credits could be consumed in moving the aircraft to an earlier position within the queue. In the case of a flow restriction involving a choice of alternate routes, planned altitude profile, aircraft spacing, or other non-queue flow restrictions, delay credits could be used to bid for an alternative assignment.
Green, Steve↗
International Ultraviolet Explorer Final Archive
CSC processed IUE images through the Final Archive Data Processing System. Raw images were obtained from both NDADS and the IUEGTC optical disk platters for processing on the Alpha cluster, and from the IUEGTC optical disk platters for DECstation processing. Input parameters were obtained from the IUE database. Backup tapes of data to send to VILSPA were routinely made on the Alpha cluster. IPC handled more than 263 requests for priority NEWSIPS processing during the contract. Staff members also answered various questions and requests for information and sent copies of IUE documents to requesters. CSC implemented new processing capabilities into the NEWSIPS processing systems as they became available. In addition, steps were taken to improve efficiency and throughput whenever possible. The node TORTE was reconfigured as the I/O server for Alpha processing in May. The number of Alpha nodes used for the NEWSIPS processing queue was increased to a maximum of six in measured fashion in order to understand the dependence of throughput on the number of nodes and to be able to recognize when a point of diminishing returns was reached. With Project approval, generation of the VD FITS files was dropped in July. This action not only saved processing time but, even more significantly, also reduced the archive storage media requirements, and the time required to perform the archiving, drastically. The throughput of images verified through CDIVS and processed through NEWSIPS for the contract period is summarized below. The number of images of a given dispersion type and camera that were processed in any given month reflects several factors, including the availability of the required NEWSIPS software system, the availability of the corresponding required calibrations (e.g., the LWR high-dispersion ripple correction and absolute calibration), and the occurrence of reprocessing efforts such as that conducted to incorporate the updated SWP sensitivity-degradation correction in May.
Source record↗
Evaluating scheduling algorithms for traffic with heterogeneous performance objectives
Two types of network traffic are considered: traffic with deadlines, for which the most important performance objective is based on loss rate, and packets without deadlines, for which the most important performance objective is based on mean delay. An optimal scheduling algorithm is presented to minimize weighted loss rate and weighted mean delay in the queues that form at the switches and at the network access points of a packet-switched network, where weights reflect the relative importance of packets. Although not practical for implementation, the algorithm is intended as a standard for the comparison of the performance of other scheduling algorithms. The algorithm is more general and lower computational complexity than previously published algorithms, enabling performance evaluation of some important scenarios that could not previously have been considered. Using the optimal performance results of this algorithm, the performance of the first-come-first-served, static priority, and earliest deadline first scheduling algorithms is evaluated. The results suggest that network efficiency could be improved by using a more sophisticated heuristic scheduling algorithm rather than one of the aforementioned algorithms.
Peha, Jon M.↗