• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.438-440
• /
• 2004

Energy consumption has become an increasingly important consideration in designing real-time embedded systems. In this paper, we propose a voltage scaling method to reduce energy consumption in fixed priority real-time systems using variable voltage processors. The Hyperperiod of tasks is divided into dimains. The most suitable voltage of each domain is determined off-line and stored in a table. During task execution, the voltage of processor is adjusted according to the information of the table. A simulation result shows that the proposed method can reduce 80% of power consumption in comparison to no power management. The difference to the optimal EDF based method is only 5%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.103-109
• /
• 2019

The automotive electronic system should provide a method that can be safely performed by loading a number of application programs having time constraints in several electronic control devices. In this paper, we propose a timing protection mechanism for AUTOSAR, which is a real - time operating system specification for automotive field, in order to observe the deadline of each task when scheduling real - time tasks. We propose a dynamic non-preemption algorithm to guarantee a flexible deadline for fixed priority or dynamic priority tasks, and a location where execution time can be monitored for errors, and suggest ways to implement the AUTOSAR time protection mechanism.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.2
• /
• pp.89-97
• /
• 2009

Embedded systems widely used in ubiquitous environments usually employ an event-driven programming model instead of thread-based programming model in order to create a more robust system that uses less memory. However, as the software for embedded systems becomes more complex, it becomes hard to program as a single event handler using the event-driven programming model. This paper discusses the implementation of non-preemptive real-time scheduling theory for the design of embedded systems. To this end, we present an efficient schedulability test method for a given non-preemptive task set using a sufficient condition. This paper also shows that the notion of sub-tasks in embedded systems can overcome the problem of low utilization that is a main drawback of non-preemptive scheduling.

• Management Science and Financial Engineering
• /
• v.17 no.1
• /
• pp.79-94
• /
• 2011

Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.465-482
• /
• 2015

IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.129-132
• /
• 2001

Broadband Integrated Services Digital Network(B-lSDN) supports multimedia information in real time. This can be accomplished by using Asynchronous Transfer Mode(ATM) technology. In addition, ATM networks can provide not only bandwidth reservation, but also Quality of Service(QoS) guarantees. In this paper, we propose a efficient cell scheduling algorithm considering ABR service in ATM networks. The proposed algorithm can support ABR service more efficiently than existing fixed cell slot allocation method and priority cell slot allocation method algorithm. proposed algorithm dynamically schedules cells in a real time by considering the current traffic buffer conditions. Throughout the computer simulation, evaluates the performance of the proposed algorithm.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.3 no.1
• /
• pp.25-29
• /
• 2008

In this paper, we provide an adaptive power-aware checkpointing scheme for fixed priority-based DVS scheduling in dependable real-time systems. In the provided scheme, we analyze the minimum number of tolerable faults of a task and the optimal checkpointing interval in order to meet the deadline and guarantee its specified reliability. The energy-efficient voltage level at a fault arrival is also analyzed and used in the recovery of the faulty task.

• IE interfaces
• /
• v.4 no.2
• /
• pp.25-34
• /
• 1991

The problem of scheduling the passage things with low transit priority to maximize the amonnt that can be sent during given time periods without interfering with the fixed schedule for passage things with high transit priority in a track, is treated in this paper. The problem is transformed into the Time Expanded Network without traverse time through the Ford and Fulkerson Model and the Enumeration Algorithm is developed for solutions using TENET GENerator(TENETGEN). Finally, the proposed algorithm is compared with Dinic's maximal-flow algorithm and examined for the availability of the procedures on the personal computer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.261-270
• /
• 2007

The Delay Threshold-based Priority Queueing (DTPQ) scheme has been shown useful for scheduling both real-time (RT) and non-real-time (NRT) service traffic in mobile broadband wireless access (MBWA) systems. The overall system capacity can be maximized subject to their QoS requirement by the DTPQ scheme, which takes the urgency of the RT service into account only when their head-of-line (HOL) packet delays exceed a given delay threshold. In practice, the optimum delay threshold must be configured under the varying service scenarios and a corresponding traffic load, e.g., the number of RT and NRTusers in the system. In this paper, we propose an adaptive version of DTPQ scheme, which updates the delay threshold by taking the urgency and channel conditions of RT service users into account. By evaluating the proposed approach in an orthogonal frequency division multiple access/time division duplex (OFDM/TDD)-based broadband mobile access system, it has been found that our adaptive scheme significantly improves the system capacity as compared to the existing DTPQ scheme with a fixed delay threshold.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.80-88
• /
• 2001

The existed approaches to analyzing real-time schedulability take place exponential time and space complexity of this methods, since these uses a fixed priority scheduling and/or traverse all possible state spaces. This paper judges whether it is satisfied a given deadlines for real-time processes regarding a minimum execution time of process, periodic, deadline and a synchronizion time of processes by using the transaction rules of process algebra, and proposes a retrieval algorithm for unschedulable processes based on GUI environment. And we implement and evaluate the scheduling state analyzer that displays visually the result of schedulabiliy analysis for real-time processes.