• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.35-53
• /
• 1997

This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.03a
• /
• pp.235-246
• /
• 1997

Hybrid fuzzy gain scheduling controller is composed of a PD control and a fuzzy control for taking the advantage of each scheme. The key structure of the hybrid fuzzy gain scheduling control scheme is so called a switch which calculates weighting values between the fuzzy controller and the PD controller. However, due to the requirement of the switch , the hybrid fuzzy gain scheduling control scheme needs extra fuzzy logic processing, thus the structure is complicated. and requires more calculation time. To eliminate the drawbacks, a new hybrid fuzzy gain scheduling control scheme is proposed in this paper. In the proposed scheme, the membership function, for calculating of weithting value, and the input and output membership functions are combined. Thus the proposed hybrid scheme does not require switch for calculation of weighting value, and as a result, the calculation time is faster and the structure is more simple than the existing hybrid controller. Computer simulation results for an inverted pendulum model under Pole-Placement PID controller, fuzzy gain scheduling controller,existing hybrid controller , and proposed hybrid controller are compared to demonstrate the good property of the proposed hybrid controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4429-4445
• /
• 2019

As low-power and low-rate WSNs are being widely used for industrial applications, the scheduling of such applications becomes a critical issue to guarantee meeting the stringent requirements of determinism and tight latencies. This paper studies the link scheduling problem for real-time industrial applications in time-slotted channel hopping (TSCH) networks. We propose a heuristic algorithm for centralized link scheduling referred to as path-collision aware least laxity first (PC-LLF) algorithm, which dynamically prioritizes the packets based on the laxity time to the end-to-end deadlines and the amount of collisions that messages might deal with along their designated paths to the destination device. We propose schedulability analysis of real-time applications scheduled under our prioritization approach over TSCH networks, based on the literature on real-time schedulability analysis of multiprocessors and distributed systems. We show that our methodology provides an improved schedulability condition with respect to the existing approaches. Performance evaluation studies quantify to quantify the performance of our proposed approach under a variety of scenarios.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.1-8
• /
• 2022

Supporting real-time flows with delay and throughput constraints is an important challenge for future wireless networks. In this paper, we develop an optimal scheduling scheme to optimally choose the packets to transmit. The optimal transmission strategy is based on an observable Markov decision process. The novelty of the work focuses on a priority-based probabilistic packet scheduling strategy for efficient packet transmission. This helps in providing guaranteed services to real time traffic in Heterogeneous Wireless Networks. The proposed scheduling mechanism is able to optimize the desired performance. The proposed scheduler improves the overall end-to-end delay, decreases the packet loss ratio, and reduces blocking probability even in the case of congested network.

• Annual Conference on Human and Language Technology
• /
• 2020.10a
• /
• pp.37-41
• /
• 2020

본 논문에서는 Joint CTC/Attention 모델에 CTC ratio scheduling을 이용한 end-to-end 한국어 음성인식을 연구하였다. Joint CTC/Attention은 CTC와 attention의 장점을 결합한 모델로서 attention, CTC 단일 모델보다 좋은 성능을 보여주지만, 학습이 진행될수록 CTC가 attention의 학습을 저해하는 요인이 된다. 본 논문에서는 이러한 문제를 해결하기 위해, 학습 진행에 따라 CTC의 비율(ratio)를 줄여나가는 CTC ratio scheduling 방법을 제안한다. CTC ratio scheduling를 이용하여 학습한 결과물은 기존 Joint CTC/Attention, 단일 attention 모델 대비 좋은 성능을 보여주는 것을 확인하였다.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2021.11a
• /
• pp.248-249
• /
• 2021

Planning and Scheduling in Korean has been developed from Bar Chart to CPM, integrated management and EVM were attempted. As growing of overseas projects, Scheduler was also recognized as important one. However, the reality is that most Korean construction projects still remain in the preparation of construction plan and construction schedule in 1990s. The global Planning and Scheduling trend is EOT claims. I would like to understand the global trend of EOT claims and EOT analysis, and to find out Planning and Scheduling measures to successfully promote EOT claims.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.166-168
• /
• 2015

Line of Balance (LOB) method is suitable to schedule construction projects composed of repetitive activities. Since existing LOB based repetitive project scheduling methods are deterministic, they do not lend themselves to handle uncertainties involved in repetitive construction process. Indeed, existing LOB scheduling dose not handle variability of project performance indicators. In order to bridge the gap between reality and estimation, this study provides a stochastic LOB based scheduling method that allows schedulers for effectively dealing with the uncertainties of a construction project performance. The proposed method retrieves an appropriate probability distribution function (PDF) concerning project completion times, and determines favorable start times of activities. A case study is demonstrated to verify and validate the capability of the proposed method in a repetitive construction project planning.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2607-2625
• /
• 2014

Previous studies on multiuser multiple-input multiple-output (MIMO) mostly assume a homogeneous signal-to-noise ratio (SNR), where each user has the same average SNR. However, real networks are more likely to feature heterogeneous SNRs (a random-valued average SNR). Motivated by this fact, we analyze a multiuser MIMO downlink with a zero-forcing (ZF) receiver in a heterogeneous SNR environment. A transmitter with Mantennas constructs M orthonormal beams and performs the SNR-based proportional fairness (S-PF) scheduling where data are transmitted to users each with the highest ratio of the SNR to the average SNR per beam. We develop a new analytical expression for the sum throughput of the multiuser MIMO system. Furthermore, simply modifying the expression provides the sum throughput for important special cases such as homogeneous SNR, max-rate scheduling, or high SNR. From the analysis, we obtain new insights (lemmas): i) S-PF scheduling maximizes the sum throughput in the homogeneous SNR and ii) under high SNR and a large number of users, S-PF scheduling yields the same multiuser diversity for both heterogeneous SNRs and homogeneous SNRs. Numerical simulation shows the interesting result that the sum throughput is not always proportional to M for a small number of users.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.11
• /
• pp.9-14
• /
• 2008

In this paper, we propose a collision avoidance scheduling to increase the multiuser diversity gains in the adaptive orthogonal frequency division multiple access (OFDMA) system. The scheduling policy is based on the minimum collision criterion which investigates the differences of user channels. The paper includes the derivation of capacity expressions for the adaptive OFDMA system with the proposed scheduling. The analysis shows that the capacity of the system depends on the number of collisions between the selected users to be simultaneously served. Numerical results show that the proposed scheduling provides improved capacity performance over existing ones.