• 대한공업교육학회지
• /
• 제43권2호
• /
• pp.61-78
• /
• 2018

The purposes of this study are to importance and performance of performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment and compare difference of the priority for performance goal of two groups by IPA. Research problems for them are as follows. First, how about differences of the importance for performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment? Second, how about differences of the performance for performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment? Third, how about differences of the priority for performance goal of workforce training project of SMB Specialized Vocational High Schools by existence of teaching staff's assignment? Results obtained by this study are as follows. First, performance goal of workforce training project of SMB Specialized Vocational High Schools that teaching staffs recognize the most importantly regardless of the existence of assignment was 'improvement of students' adaptation to the filed' in area of 'employment competency strengthening'. Second, performance goal of workforce training project of SMB Specialized Vocational High Schools that teaching staffs recognize the degree of high performance regardless of the existence of assignment was 'expansion of SMB employment opportunity' in area of 'employment connection'. Third, regardless of the existence of teaching staff's assignment, areas of high priority in performance goal of workforce training project of SMB Specialized Vocational High Schools were 'improvement of teaching staff's understanding for SMB' and 'improvement of SMB understanding for Specialized Vocational High School' in area of 'improvement of SMB mind for Specialized Vocational high School'.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.55-60
• /
• 1992

The IEEE 802.4 priority mechanism can be used to handle multiple data access classes of traffic. Several timers are used to realize the priority mechanism. The performance and stability of a token bus network depend on the assignment of such timers. In this peper, we present a dynamic timer assignment algorithm for the token passing bus network. The presented algorithm has simple structure for real-time applications and adaptively controls the set of initial timer values according to the offered traffic load. The assignment of the set of timers becomes easy due to the presented algorithm. Based on the iterative algorithm, some solutions such as mean waiting time are derived.

• Proceedings of the Optical Society of Korea Conference
• /
• 한국광학회 2009년도 동계학술발표회 논문집
• /
• pp.307-308
• /
• 2009

To reduce delay for high priority packets in the ring-based EPON, the EPON packet classifier groups services as their priorities and frames for services are dynamically framed as their priorities. Since dynamic framing for a packet priority dynamically changes assignment spaces in the maximum framing packet size as network traffics, it makes services with high priority to improve quality of services with relative low threshold time for transmitting.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• 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.

• The Transactions of the Korea Information Processing Society
• /
• 제1권3호
• /
• pp.357-366
• /
• 1994

The IEEE 802.4 token bus has been widely accepted as the standard for factory local area networks. The priority option of the 802.4 standard supports multiple classes of traffic by using a set of timers to control information exchange. The performance of the 802.4 priority mechanism in industrial real time control is examined. A timer assignment technique is presented for such applications. The timers are set to satisfy the worst case access delay requirements of real time control applications. Other applications that are not time constrainted can be supported simultaneously. In fact under certain conditions, such applications can also be guaranteed a minimum bandwidth allocation. Simulation results are used to evaluate the timer assignment and utililization.

• Journal of Institute of Control, Robotics and Systems
• /
• 제11권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• Industrial Engineering and Management Systems
• /
• 제3권1호
• /
• pp.12-21
• /
• 2004

This paper investigates the design of a priority rule in a multi-product disassembly environment. Specifically, it is concerned with product scheduling by which the inventory control of disassembled parts can be incorporated into a priority rule to reduce part lead times. The part lead time consists of two components: flow time and supply delay. The primary focus of the paper is on the development of a disassembly priority rule that aims to reduce the supply delay. We propose a priority rule, called Minimum Distance (MD) rule, to improve the supply delay performance. Finally, we provide a comparative analysis on the performance of traditional rules and the new rule proposed in this paper via a simulation model.

• Journal of Digital Convergence
• /
• 제10권4호
• /
• pp.251-256
• /
• 2012

In this paper, we addressed the problem of upstream bandwidth in EPONs. We presented a wavelength division EPON supporting QoS in the differentiated services framework. It was shown that the bandwidth allocation by priority scheduling, under our assumptions for traffic behavior, will result in an unexpected behavior for high priority class and we suggested the use of weighted priority scheduling to alleviate this problem. Our wavelength division EPON supporting QoS allocates effectively and fairly bandwidths and wavelengths between ONUs in the differentiated services framework. Moreover, we showed better performance in terms of average and maximum end-to-end delay, as well as network throughput, utilization compared with some other algorithms. We used simulation experiments to study the performance and validate the effectiveness of the proposed network and algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.347-347
• /
• 1995