• Journal of Computing Science and Engineering
• /
• v.7 no.2
• /
• pp.89-98
• /
• 2013

This paper presents a complete survey of recent techniques that are applied in the field of real-time Java computing. It focuses on the issues that are especially important for hard real-time applications, which include time predictable garbage collection, worst-case execution time analysis of Java programs, real-time Java threads scheduling and compiler techniques designed for real-time purpose. It also evaluates experimental frameworks that can be used for researching real-time Java. This overview is expected to help researchers understand the state-of-the-art and advance the research in real-time Java computing.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.3-60
• /
• 2001

Usually the static scheduling algorithms such as DMS(Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm having a solution to the priority inverstion ....

• Journal of the Korea Computer Industry Society
• /
• v.7 no.4
• /
• pp.309-320
• /
• 2006

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In the NORA algorithm, the EDF strategy is adopted in the optional scheduling.<중략> The algorithm, proposed in this paper, can be applied to some applications efficiently such as radar tracking, image processing, missile control and so on.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1580-1588
• /
• 1999

This paper evaluates the real-time performance of the Train Communication Network (TCN) that consists of WTB and MVB. A run-time scheduling algorithm for the hard-real time communication was proposed and its performance was evaluated. Also, a new addressing method and the adaptive tree algorithm were suggested to enhance performance. The overall performance was evaluated by computer simulation using Arena.

• 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.

• International journal of advanced smart convergence
• /
• v.11 no.1
• /
• pp.28-35
• /
• 2022

This paper presents a performance evaluation of real-time Linux for industrial real-time platforms. On industrial platforms, multicore processors are popular due to their work distribution efficiency and cost-effectiveness. Multicore processors, however, are not designed for applications with real-time constraints, and their performance capabilities depend on their core configurations. In order to assess the feasibility of a multicore processor for real-time applications, we conduct a performance evaluation of a general processor and a low-power processor to provide an experimental environment of real-time Linux on both Xenomai and RT-preempt considering the multicore configuration. The real-time performance is evaluated through scheduling latency and in an environment with loads on the CPU, memory, and network to consider an actual situation. The results show a difference between a low-power and a general-purpose processor, but from developer's point of view, it shows that the low-power processor is a proper solution to accommodate low power situations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.209-221
• /
• 1999

Several approaches to anlayzing real-time schedulability have been presented, but since these used a fixed priority scheduling scheme and/or traverse all possible state spaces, there take place exponential time and space complexity of these methods. Therefore it is necessary to reduce the state space and detect schedulability at earlier time. This paper proposes and implements an advanced schedulability analysis algorithm to determine that is satisfied a given deadlines for real-time processes. These use a minimum execution time of process, periodic, deadline, and a synchronization time of processes to detect schedulability at earlier time and dynamic scheduling scheme to reduce state space using the transition rules of process algebra. From a result of implementation, we demonstrated the effective performance to determine schedulability analysis.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.6
• /
• pp.177-184
• /
• 2015

This paper proposes a minimum-power scheduling scheme of real-time parallel tasks while meeting deadlines of the real-time tasks on DVFS-enabled multicore processors. The proposed scheme first finds a floating number of processing cores to each task so that the computation load of all processing cores would be equalized. Next the scheme translates the found floating number of cores into a natural number of cores while maintaining the computation load of all cores unchanged, and allocates the translated natural number of cores to the execution of each task. The scheme is designed to minimize the power consumption of the frequency-sharing multicore processor operating with the same processing speed at an instant time. Evaluation shows that the scheme saves up to 38% power consumption of the previous method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.473-494
• /
• 2020

To provide a guaranteed Quality of Service (QoS) to real-time traffic in High-Speed Downlink Packet Access (HSDPA) core network, we proposed an enhanced mechanism. For an enhanced QoS, a Class-Based Low Latency Fair Queueing (CBLLFQ) packet scheduling algorithm is introduced in this work. Packet classification, metering, queuing, and scheduling using differentiated services (DiffServ) environment was the points in focus. To classify different types of real-time voice and multimedia traffic, the QoS provisioning mechanisms use different DiffServ code points (DSCP).The proposed algorithm is based on traffic classes which efficiently require the guarantee of services and specified level of fairness. In CBLLFQ, a mapping criterion and an efficient queuing mechanism for voice, video and other traffic in separate queues are used. It is proved, that the algorithm enhances the throughput and fairness along with a reduction in the delay and packet loss factors for smooth and worst traffic conditions. The results calculated through simulation show that the proposed calculations meet the QoS prerequisites efficiently.

• The Journal of the Korea Contents Association
• /
• v.11 no.6
• /
• pp.59-66
• /
• 2011

Resource constrained project scheduling problem with multiple resource constraints as well as precedence constraints is well-known as one of the NP-hard problem. Since these problems can't be solved by the deterministic method during reasonable time, the heuristics are generally used for getting a sub-optimal during reasonable time. In this paper, we introduce an efficient genetic algorithm for resource constrained project scheduling problem using crossover which is applying schema theory and real world tournament selection strategy. Experimental results showed that the proposed algorithm is superior to conventional algorithm.