Search results for: Jaeho Kim

Authors: Gi-Beom Park, Hyong-Gi Park, Seong-Yong Lee, Jaeho Choi, Seok Hong Min, Tae Kwon Ha

Abstract:

The Nb silicide-based alloy has the excellent high-temperature strength and relatively lower density than the Ni-based superalloy; therefore, it has been receiving a lot of attention for the next generation high-temperature material. To enhance the high temperature creep property and oxidation resistance, Si was added to the Nb-based alloy, resulting in a multi-phase microstructure with metal solid solution and silicide phase. Since the silicide phase has a low machinability due to its brittle nature, it is necessary to fabricate components using the powder metallurgy. However, powder manufacturing techniques for the alloys have not yet been developed. In this study, we tried to fabricate Nb-based alloy powder by the hydrogenation-dehydrogenation reaction. The Nb-based alloy ingot was prepared by vacuum arc melting and it was annealed in the hydrogen atmosphere for the hydrogenation. After annealing, the hydrogen concentration was increased from 0.004wt% to 1.22wt% and Nb metal phase was transformed to Nb hydride phase. The alloy after hydrogenation could be easily pulverized into powder by ball milling due to its brittleness. For dehydrogenation, the alloy powders were annealed in the vacuum atmosphere. After vacuum annealing, the hydrogen concentration was decreased to 0.003wt% and Nb hydride phase was transformed back to Nb metal phase.

Keywords: Nb alloy, Nb metal and silicide composite, powder, hydrogenation-dehydrogenation reaction

Procedia PDF Downloads 245

Authors: Md Habibur Rahman, Jaeho Kim

Abstract:

Efficient process scheduling is a crucial factor in ensuring optimal system performance and resource utilization in computer systems. While various algorithms have been proposed over the years, there are still limitations to their effectiveness. This paper introduces a new Wait-Optimized Scheduler (WOS) algorithm that aims to minimize process waiting time by dividing them into two layers and considering both process time and waiting time. The WOS algorithm is non-preemptive and prioritizes processes with the shortest WOS. In the first layer, each process runs for a predetermined duration, and any unfinished process is subsequently moved to the second layer, resulting in a decrease in response time. Whenever the first layer is free or the number of processes in the second layer is twice that of the first layer, the algorithm sorts all the processes in the second layer based on their remaining time minus waiting time and sends one process to the first layer to run. This ensures that all processes eventually run, optimizing waiting time. To evaluate the performance of the WOS algorithm, we conducted experiments comparing its performance with traditional scheduling algorithms such as First-Come-First-Serve (FCFS) and Shortest-Job-First (SJF). The results showed that the WOS algorithm outperformed the traditional algorithms in reducing the waiting time of processes, particularly in scenarios with a large number of short tasks with long wait times. Our study highlights the effectiveness of the WOS algorithm in improving process scheduling efficiency in computer systems. By reducing process waiting time, the WOS algorithm can improve system performance and resource utilization. The findings of this study provide valuable insights for researchers and practitioners in developing and implementing efficient process scheduling algorithms.

Keywords: process scheduling, wait-optimized scheduler, response time, non-preemptive, waiting time, traditional scheduling algorithms, first-come-first-serve, shortest-job-first, system performance, resource utilization

Procedia PDF Downloads 93