• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.7
• /
• pp.501-508
• /
• 2004

In this paper, a coordinated scheduling algorithm is proposed to reduce end-to-end delay in distributed control of systems. For the algorithm, the analysis of practical end-to-end delay in the worst case is performed priory with considering implementation of the systems. The end-to-end delay is composed of the delay caused by multi-task scheduling of operating systems, the delay caused by network communications, and the delay caused by asynchronous timing between operating systems and network communications. Through some simulation tests based on CAN(Controller Area Network), the proposed worst case end-to-end delay analysis is validated. Through the simulation tests, it is also shown that a real-time distributed control system designed to existing worst case delay cannot guarantee end-to-end time constraints. With the analysis, a coordinated scheduling algorithm is proposed here. The coordinated scheduling algorithm is focused on the reduction of the delay caused by asynchronous timing between operating systems and network communications. Online deadline assignment strategy is proposed for the scheduling. The performance enhancement of the distributed control systems by the scheduling algorithm is shown through simulation tests.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.747-752
• /
• 2004

Researches about scheduling of the distributed real-time systems have been proposed. However, they have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. So this paper proposes a new scheduling method for distributed real-time systems consisting of sporadic and periodic tasks with precedence relations and sporadic and periodic messages, guaranteeing end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic (RM) scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.311-314
• /
• 2003

In recent years, distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints considering aperiodic, periodic and non-real-time message and task simultaneously. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2509-2528
• /
• 2012

Time division multiple access (TDMA) is a widely used media access control (MAC) technique that can provide collision-free and reliable communications, save energy and bound the delay of packets. In TDMA, energy saving is usually achieved by switching the nodes' radio off when such nodes are not engaged. However, the frequent switching of the radio's state not only wastes energy, but also increases end-to-end delay. To achieve high energy efficiency and low delay, as well as to further minimize the number of time slots, a multi-objective TDMA scheduling problem for industrial wireless mesh networks is presented. A hybrid algorithm that combines genetic algorithm (GA) and simulated annealing (SA) algorithm is then proposed to solve the TDMA scheduling problem effectively. A number of critical techniques are also adopted to reduce energy consumption and to shorten end-to-end delay further. Simulation results with different kinds of networks demonstrate that the proposed algorithm outperforms traditional scheduling algorithms in terms of addressing the problems of energy consumption and end-to-end delay, thus satisfying the demands of industrial wireless mesh networks.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.506-513
• /
• 2002

Distributed control systems(DCS) using fieldbus such as CAN have been applied to process systems but it is very difficult to design the DCS while guaranteeing the given end-to-end constraints such as precedence constraints, time constraints, and periods and priorities of tasks and messages. This paper presents a scheduling method to guarantee the given end-to-end constraints. The presented scheduling method is the integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to be applied to a general DCS that has multiple loops with several types of constraints, where each loop consists of sensor nodes with multiple sensors, actuator nodes with multiple actuators and controller nodes with multiple tasks. An assignment method of the optimal period of each loop and a heuristic assignment rule of each message's priority are proposed and the integrated scheduling method is developed based on them.

• 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 모델 대비 좋은 성능을 보여주는 것을 확인하였다.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.