Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedule”

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 1,225 records · Page 68

Schedulers with load-store queue awareness

In one embodiment, a computer-implemented method includes tracking a size of a load-store queue (LSQ) during compile time of a program. The size of the LSQ is time-varying and indicates how many memory access instructions of the program are on the LSQ. The method further includes scheduling, by a computer processor, a plurality of memory access instructions of the program based on the size of the LSQ.

97 MATHEMATICS AND COMPUTING↗

GPU age-aware scheduling to improve the reliability of leadership jobs on Titan

In 2015, OLCF's Titan supercomputer experienced a significant increase in GPU related job failures. The impact on jobs was serious and OLCF decided to replace ~50% of the GPUs. Unfortunately, jobs using more than 20% of the machine (i.e., leadership jobs) continued to encounter higher levels of application failures. These jobs contained significant amounts of both the low-failure rate and high-failure rate GPUs. The impacts of these failures are more adversely felt by leadership jobs due to longer wait times, runtimes, and higher charge rates. In this work, we have designed techniques to increase the use of low-failure GPUs in leadership jobs through targeted resource allocation. We have employed two complementary techniques, updating both the system ordering and the allocation mechanisms. Using simulation, the application of these techniques resulted in a 33% increase in low-failure GPU hours being assigned to leadership jobs. Our GPU Age-Aware Scheduling has been used in production on Titan since July of 2017.

Zimmer, Christopher↗

System, method, and computer program product for scheduling tasks associated with continuation thread blocks

A system, method, and computer program product for scheduling tasks associated with continuation thread blocks. The method includes the steps of generating a first task metadata data structure in a memory, generating a second task metadata data structure in the memory, executing a first task corresponding to the first task metadata data structure in a processor, generating state information representing a continuation task related to the first task and storing the state information in the second task metadata data structure, executing the continuation task in the processor after the one or more child tasks have finished execution, and indicating that the first task has logically finished execution once the continuation task has finished execution. The second task metadata data structure is related to the first task metadata data structure, and at least one instruction in the first task causes one or more child tasks to be executed by the processor.

Ricketts, Scott↗

Single instruction multiple data page table walk scheduling at input output memory management unit

A data processing system includes a memory and an input output memory management unit that is connected to the memory. The input output memory management unit is adapted to receive batches of address translation requests. The input output memory management unit has instructions that identify, from among the batches of address translation requests, a later batch having a lower number of memory access requests than an earlier batch, and selectively schedules access to a page table walker for each address translation request of a batch.

Basu, Arkaprava↗

Method and apparatus for scheduling in a non-uniform compute device

A data processing apparatus, and method of operation thereof, for executing instructions. The apparatus includes one or more host processors, each having a first processing unit, and a multi-level memory system. One or more levels of the memory system are tightly coupled to a corresponding second processing unit. At least one of the host processors includes an instruction scheduler that routes instructions selectively to at least one of the first and second processing units, dependent upon the availability of the processing units and the location, within the memory system, of data to be used when executing the instructions.

97 MATHEMATICS AND COMPUTING↗

Estimating Energy Market Schedules Using Historical Price Data: Preprint

The global climate crisis is expected to reshape the energy generation landscape in the coming decades. Increasing integration of non-dispatchable renewable energy resources into energy infrastructures and markets increases uncertainty and creates new opportunities for flexible energy systems. To conduct proper economic evaluation of flexible energy systems, such as integrated energy systems (IES), advancements in modelling of market interactions, such as bidding, is crucial. This work presents a shortcut algorithm which uses two mixed integer linear programs to compute dispatch schedules (e.g., hourly power production targets) that are constrained by the resource's bid information and characteristics (e.g., minimum up and down times) based on historical locational marginal price (LMP) data. This is orders of magnitude less data than required for a market clearing calculation with a full production cost model (PCM). We find the shortcut simulator recapitulates generator dispatch signals for the Prescient PCM with approximately 4% error for the RTS-GMLC test system.

electricity generation↗

Investing in International Information Exchange Activities to Improve the Safety, Cost Effectiveness and Schedule of Cleanup - 13281

With decreasing budgets and increasing pressure on completing cleanup missions as quickly, safely and cost-effectively as possible, there is significant benefit to be gained from collaboration and joint efforts between organizations facing similar issues. With this in mind, the US Department of Energy (DOE) and the UK Nuclear Decommissioning Authority (NDA) have formally agreed to share information on lessons learned on the development and application of new technologies and approaches to improve the safety, cost effectiveness and schedule of the cleanup legacy wastes. To facilitate information exchange a range of tools and methodologies were established. These included tacit knowledge exchange through facilitated meetings, conference calls and Site visits as well as explicit knowledge exchange through document sharing and newsletters. A DOE web-based portal has been established to capture these exchanges and add to them via discussion boards. The information exchange is operating at the Government-to-Government strategic level as well as at the Site Contractor level to address both technical and managerial topic areas. This effort has resulted in opening a dialogue and building working relationships. In some areas joint programs of work have been initiated thus saving resource and enabling the parties to leverage off one another activities. The potential benefits of high quality information exchange are significant, ranging from cost avoidance through identification of an approach to a problem that has been proven elsewhere to cost sharing and joint development of a new technology to address a common problem. The benefits in outcomes significantly outweigh the costs of the process. The applicability of the tools and methods along with the lessons learned regarding some key issues is of use to any organization that wants to improve value for money. In the waste management marketplace, there are a multitude of challenges being addressed by multiple organizations and the effective pooling and exchange of knowledge and experience can only be of benefit to all participants to help complete the cleanup mission more quickly and more cost effectively. This paper examines in detail the tools and processes used to promote information exchange and the progress made to date. It also discusses the challenges and issues involved and proposes recommendations to others who are involved in similar activities. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Data migration schedule prediction using machine learning

Various embodiments provide for one or more processor instructions and memory instructions that enable a memory sub-system to predict a schedule for migrating data between memory devices, which can be part of a memory sub-system.

Roberts, David Andrew↗

Dynamic Risk-Aware Patch Scheduling

A program that defines and assesses the dynamic risk of software vulnerabilities and considers the dynamic risks into patch scheduling to reduce security risks posed by vulner­abilities and provide formal guidance to security operations at various organizations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SIMULATING AN ACCELERATION SCHEDULE FOR NDCX-II

The Virtual National Laboratory for Heavy-Ion Fusion Science is developing a physics design for NDCX-II, an experiment to study warm dense matter heated by ions. Present plans call for using 34 induction cells to accelerate 45 nC of Li+ ions to more than 3 MeV, followed by neutralized drift-compression. To heat targets to the desired temperatures, the beam must be compressed to a millimeter-scale radius and a duration of about 1 ns. A novel NDCX-II acceleration schedule has been developed using an interactive one-dimensional particle-in-cell simulation ASP to model the longitudinal physics and axisymmetric WARP simulations to validate the 1-D model and add transverse focusing. Three-dimensional Warp runs have been used recently to study the sensitivity to misalignments in the focusing solenoids.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Tri-Level Scheduling Model Considering Residential Demand Flexibility of Aggregated HVACs and EVs Under Distribution LMP

Residential loads, especially heating, ventilation and air conditioners (HVACs) and electric vehicles (EVs), have great potentials to provide demand flexibility which is an attribute of grid-interactive efficient buildings (GEB). Under this new paradigm, first, EV and HVAC aggregator models are developed in this paper to represent the fleet of GEBs, in which the aggregated parameters are obtained based on a new approach of data generation and least squares parameter estimation (DG-LSPE), which can deal with heterogeneous HVACs. Then, a tri-level bidding and dispatching framework is established based on competitive distribution operation with distribution locational marginal price (DLMP). Furthermore, the first two levels form a bilevel model to optimize the aggregators’ payment and to represent the interdependency between load aggregators and the distribution system operator (DSO) using DLMP, and the third level is to dispatch the optimal load aggregation to all residents by the proposed priority list-based demand dispatching algorithm. Finally, case studies on a modified IEEE 33-Bus system illustrate three main technical reasons of payment reduction due to demand flexibility: load shift, DLMP step changes, and power losses. They can be used as general guidelines for better decision-making for future planning and operation of demand response programs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A new database of building-space-specific internal loads and load schedules for performance based code compliance modeling of commercial buildings

Building-level loads and load profiles prescribed by current modeling rules save modelers time and avoid gaming during whole building performance modeling. However, recent studies show that they sometimes insufficiently capture the entire building performance due to the varied loads and load profiles for different space types. As a solution to this issue, this paper develops a database of building-space-specific loads and load profiles used in code compliance modeling. The existing sets of loads and load profiles are reviewed and the challenges behind using them for specific research topics are discussed. Then, the proposed method to develop the building-space-specific loads and load profiles is introduced. After that, the database for these building-space-specific loads and load profiles is presented. In addition, one case is studied to demonstrate the applications of these loads and load profiles. In this case study, three methods are used to develop building energy models: space-specific (using knowledge of the distribution and location of space types and applying the space-specific data in the developed database), building-level (assuming a lack of knowledge of the space types and using the building-level data in the developed database), and calculated-ratio (assuming knowledge of the distribution of space types but not their locations and calculating weighted average values based on the space-specific data in the developed database). Finally, the energy results simulated by using these three methods are compared, which show building-level methods can produce energy results up to 20% different than the space-specific methods. Finally, this paper discusses the application scope and maintenance of this new database.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗