• Journal of Korean Society for Quality Management
• /
• v.28 no.3
• /
• pp.91-103
• /
• 2000

It is very important to rationally allocate manufacturing processes because customer's needs are being various, and product life cycle in the market Is being shortened. The process allocation is needed before making process control plan and is mostly being done by the field experience or intuition of machine operator, process engineer and/or maintenance technician. Therefore, a modified allocation method using the process variation is proposed. This paper presents the result of comparative studies between current method and the proposed one.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.1
• /
• pp.24-32
• /
• 2023

The current Private 5G use procedure goes through the step of application examination, use and usage inspection, and can be divided in to application, examination step as a procedure before frequency allocation, and use, usage inspection step as a procedure after frequency allocation. Various types of documents are required to apply for a Private 5G, and due to the document screening process and radio station inspection for using Private 5G frequencies, the procedure for Private 5G applicants to use Private 5G is complicated and takes a considerable amount of time. In this paper, we proposed Frequency Allocation Process for Private 5G using a blockchain platform, which is fast and simplified than the current procedure. Through the use of a blockchain platform and NFT (Non-Fungible Token), reliability and integrity of the data required in the frequency allocation process were secured, and security of frequency usage information was maintained and a reliable Private 5G frequency allocation process was established. Also by applying the RPA system that minimizes human intervention, fairness was secured in the process of allocating Private 5G. Finally, the frequency allocation process of Private 5G based on the Ethereum blockchain was performed though a simulation.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.199-206
• /
• 2004

Under the multiprogrammed situation, the performance of multiprocessor system is affected by the process allocation policy of the operating systems. The lowest communication cost can be achieved when the related processes positioned to the adjacent processors. While the effective allocation is quite difficult to the real situation, and the processing of the allocation policy consumes some computation time. The dual-ring CC-NUMA systems exhibit a quite performance difference according to the process a1location policy due to a lot of unbalanced memory transactions on the interconnection networks. In this paper, I propose a load balanced dual-link CC-NUMA system that does not requires the processes allocation policy. By the program-driven simulation results. the proposed system shows no remarkable difference according to the allocation policy while the dual-ring systems shows 10％ performance improvement by the process allocation. In addition, the proposed system outperforms the dual~ring systems about 1.5 times.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.8
• /
• pp.1913-1925
• /
• 2012

In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.5 no.6
• /
• pp.1-6
• /
• 1982

The objective of this thesis to Provide a better insight into the effect of the amount of in-process storage has on the efficiency of production line with variable operation times. It is assumed that the material enters the line at the first work station and is then processed progressively through the line until it exits at the last work station, a finite amount of in-process storage is provided before all but the first work station of the line and the operation time of the work stations are statistically independent and follow exponential distribution. Under the above assumption, optimum allocation model is developed and following two approaches are used : 1) Given the available storage capacity, optimum allocation which minimizes the number of items in the line. 2) Given the available storage capacity, optimum allocation which. maximizes the utilization factor of the line. In a balanced three stage line, the production line efficiency is maximized under both categories when the second in-process storage is larger than the first.

• ETRI Journal
• /
• v.26 no.2
• /
• pp.185-188
• /
• 2004

In this paper, we design a two-step scheduling algorithm to support multiple bandwidth allocation policies for upstream channel access in an Ethernet passive optical network. The proposed scheduling algorithm allows us a simultaneous approach for multiple access control policies: static bandwidth allocation for guaranteed bandwidth service and dynamic bandwidth allocation for on-demand, dynamic traffic services. In order to reduce the scheduling complexity, we separate the process of the transmission start- time decision from the process of grant generation. This technique does not require the timing information of other bandwidth allocation modules, so respective modules are free from a heavy amount of timing information or complex processing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.27-36
• /
• 1993

This paper proposes a shortest path allocation algorithm over the processors on the hypercube system based on the message passing techniques with the optimized module allocation. On multiprocessor systems, how to divide one task into multiple tasks efficiently is an important issue due to the hardness of the life cycle estimation of each process. To solve the life cycle discrepancies, the appropriate task assignment to each processor and the flexible communications among the processors are indispensible. With the concurrent program execution on hypercube systems, each process communicaties to others with the method of message passing. And, each processor has its own memory. The proposed algorithm generates a callable tree out of the module, assigns the weight factors, constructs the allocation graph, finds the shortest path allocation tree, and maps them with hypercube.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.2
• /
• pp.37-49
• /
• 2023

In this study, we proposed resource allocation methodologies to improve the productivity of steel bridge manufacturing plants based on the constraint theory which is very popular in the area of manufacturing industries. To this end, after defining the painting process as a bottleneck, three resource allocation methodologies were developed: Operation Specific Resource Allocation (OSRA), Product Specific Resource Allocation (PSRA), and General Resource Allocation (GRA). As a result of experiments for performance evaluation using a simulation model of the steel bridge supply chain, GRA showed the best performance in terms of the Number of Work-In-Process (NWIP) and Waiting Time (WT), in particular, as workload itself and its variability were increased, the performance gap with the specific resource allocation became further deepened. On average, GRA reduced NWIP by 36.2% and WT by 34.6% compared to OSRA, and reduced NWIP by 71.0% and WT by 70.4% compared to PSRA. The reduction of NWIP and WT means alleviating the bottleneck of the painting process, which eventually means that the productivity of the steel bridge manufacturing plant has improved.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1211-1220
• /
• 1990

This paper describes and implements a design method of register allocation as a required module of RISC compiler systems. It compiles a C program to a machine-independent intermediate language, translates each variable into symbolic register. After local allocation process for the symbolic registers, global register allocation is executed by applying the graph coloring algorithm. This register allocation phase is designed for a system with the large register file like RISC machines.

• Journal of Information Processing Systems
• /
• v.17 no.4
• /
• pp.721-736
• /
• 2021

For the mobile edge computing (MEC) system supporting dense network, a joint allocation algorithm of computing and communication resources based on reinforcement learning is proposed. The energy consumption of task execution is defined as the maximum energy consumption of each user's task execution in the system. Considering the constraints of task unloading, power allocation, transmission rate and calculation resource allocation, the problem of joint task unloading and resource allocation is modeled as a problem of maximum task execution energy consumption minimization. As a mixed integer nonlinear programming problem, it is difficult to be directly solve by traditional optimization methods. This paper uses reinforcement learning algorithm to solve this problem. Then, the Markov decision-making process and the theoretical basis of reinforcement learning are introduced to provide a theoretical basis for the algorithm simulation experiment. Based on the algorithm of reinforcement learning and joint allocation of communication resources, the joint optimization of data task unloading and power control strategy is carried out for each terminal device, and the local computing model and task unloading model are built. The simulation results show that the total task computation cost of the proposed algorithm is 5%-10% less than that of the two comparison algorithms under the same task input. At the same time, the total task computation cost of the proposed algorithm is more than 5% less than that of the two new comparison algorithms.