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,261 records · Page 70

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.

Communication Network Scheduling↗

Preemptible I/O Scheduling of Garbage Collection for Solid State Drives

Abstract Unlike hard disks, flash devices use out-of-update operations and they require a garbage collection (GC) process to reclaim invalid pages to create free blocks. This GC process is a major cause of performance degradation when running concurrently with other I/O operations as internal bandwidth is consumed to reclaim these invalid pages. The invocation of the GC process is generally governed by a low watermark on free blocks and other internal device metrics that different workloads meet at different intervals. This results in I/O performance that is highly dependent on workload characteristics. In this paper, we examine the GC process and propose a semi-preemptible GC scheme that allows GC processing to be preempted while pending I/O requests in the queue are serviced. Moreover, we further enhance flash performance by pipelining internal GC operations and merge them with pending I/O requests whenever possible. Our experimental evaluation of this semipreemptible GC scheme with realistic workloads demonstrate both improved performance and reduced performance variability. Write-dominant workloads show up to a 66.56% improvement in average response time with a 83.30% reduced variance in response time compared to the non-preemptible GC scheme. In addition, we explore opportunities of a new NAND flash device that supports suspend/resume commands for read, write and erase operations for fully preemptible GC. Our experiments with a fully preemptible GC enabled flash device show that request response time can be improved by up to 14.57% compared to semi-preemptible GC.

Flash Memory↗

Postmortem Cost and Schedule Analysis - Lessons Learned On NCSX

The National Compact Stellarator Experiment (NCSX) was designed to test physics principles of an innovative fusion energy confinement device developed by the Princeton Plasma Physics Laboratory (PPPL) and Oak Ridge National Laboratory (ORNL) under contract from the US Department of Energy. The project was technically very challenging, primarily due to the complex component geometries and tight tolerances that were required. As the project matured these challenges manifested themselves in significant cost overruns through all phases of the project (i.e. design, R&D, fabrication and assembly). The project was subsequently cancelled by the DOE in 2008. Although the project was not completed, several major work packages, comprising about 65% of the total estimated cost (excluding management and contingency), were completed, providing a data base of actual costs that can be analyzed to understand cost drivers. Technical factors that drove costs included the complex geometry, tight tolerances, material requirements, and performance requirements. Management factors included imposed annual funding constraints that throttled project cash flow, staff availability, and inadequate R&D. Understanding how requirements and design decisions drove cost through this top-down forensic cost analysis could provide valuable insight into the configuration and design of future state-of-the art machines and other devices.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Layout-Aware I/O Scheduling for Terabits Data Movement

Many science facilities, such as the Department of Energy s Leadership Computing Facilities and experimental facilities including the Spallation Neutron Source, Stanford Linear Accelerator Center, and Advanced Photon Source, produce massive amounts of experimental and simulation data. These data are often shared among the facilities and with collaborating institutions. Moving large datasets over the wide- area network (WAN) is a major problem inhibiting collaboration. Next- generation, terabit-networks will help alleviate the problem, however, the parallel storage systems on the end-system hosts at these institutions can become a bottleneck for terabit data movement. The parallel storage system (PFS) is shared by simulation systems, experimental systems, analysis and visualization clusters, in addition to wide-area data movers. These competing uses often induce temporary, but significant, I/O load imbalances on the storage system, which impact the performance of all the users. The problem is a serious concern because some resources are more expensive (e.g. super computers) or have time-critical deadlines (e.g. experimental data from a light source), but parallel file systems handle all requests fairly even if some storage servers are under heavy load. This paper investigates the problem of competing workloads accessing the parallel file system and how the performance of wide-area data movement can be improved in these environments. First, we study the I/O load imbalance problems using actual I/O performance data collected from the Spider storage system at the Oak Ridge Leadership Computing Facility. Second, we present I/O optimization solutions with layout-awareness on end-system hosts for bulk data movement. With our evaluation, we show that our I/O optimization techniques can avoid the I/O congested disk groups, improving storage I/O times on parallel storage systems for terabit data movement.

I/O and Storage↗

Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem

This paper addresses minimizing Tardy/Lost penalties with common due dates on a single machine. According to this penalty criterion, if tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. The problem is formulated as an integer programming model, and a heuristic algorithm is constructed. Then, using the proposed dominance rules and lower bounds, we develop two dynamic programming algorithms as well as a branch and bound. Experimental results show that the heuristic algorithm has an average optimality gap less than 2 % in all problem sizes. Instances up to 250 jobs with low variety of process times are optimally solved and for high process time varieties, the algorithms solved all instances up to 75 jobs.

97 MATHEMATICS AND COMPUTING↗

Evolutionary computation algorithms to coordinating order acceptance and batch delivery for an integrated supply chain scheduling

This paper proposes a novel approach of coordinating decisions in an integrated supply chain (ISC): coordinating order acceptance (OA) and batch delivery (BD) due to round trip transportation (RTT) and using third-party logistics (3PL) vehicles. The paper aims at trading off among accepted orders revenue, delivery costs as well as any penalties incurred in the ISC to maximize the total benefit. A novel mixed-integer programming is proposed for the problem. In addition, the paper provides a heuristic to form batches and develops a hybrid evolutionary computation algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA) to solve the problem. An information sharing mechanism is improved and applied. To explore and to locate the proposed PSO in a better neighborhood, a local search is proposed. Taguchi experimental design is utilized to set the appropriate values of the algorithms’ parameters and random instances are generated to evaluate the performance of the algorithms. The paper investigates the profitability sensitivity of the problem to parameters and analyzes the effect of the changes in the parameters on the performance of our proposed algorithms. The attained results show the appropriate performance of our algorithms.

97 MATHEMATICS AND COMPUTING↗

Effect of laser melt schedule on the microstructure of additively manufactured IN718 Superalloy

Laser powder bed fusion (L-PBF) has enabled the fabrication of geometrically complex metallic structures and components that are challenging to producing using conventional manufacturing approaches. The site-specific and far from equilibrium thermal conditions of L-PBF offer the potential to facilitate multi-length scale design of structure and properties across the atomic-through macro-levels. However, L-PBF systems face scalability challenges due to throughput constraints. Laser rotary powder bed fusion (L-RPBF) systems are being investigated as a solution to enhance the deposition rates compared to conventional L-PBF. Rotary systems also offer additional flexibility for controlling the time structure of melting through laser interleaving on alternating layers. Here, in this study, IN718 test samples were printed using single-laser or interleaved dual-laser configuration in a L-RPBF system to investigates the effect of process settings and melt-interleaving on as-fabricated microstructure. The microstructural evolution, such as grain size and crystallographic texture, was assessed by determining variations in the melt-pool shapes. Laser interleaving leads to a reduction in average grain size compared to single laser by ∼ 40 % at high power (400 W) and by ∼36 % at medium power (370 W). Results presented here identify key challenge for obtaining uniform microstructures and barriers for the broader adoption of high-deposition rate L-RPBF.

Dual-laser↗