• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.413-420
• /
• 2008

Network bandwidth is one of the major factors that impact the cost of a video service. In this paper we propose approaches to reducing the bandwidth requirement for transporting MPEG-4 video traffic over wireless LANs while guaranteeing a required level of quality of service(QoS). To support high quality video playbacks, video frames must be transported to the client prior to their playback times. A real-time transmission scheduling is used for this purpose, which transmits each frame assigned with a priority according to its importance. It addresses the challenge for a scheduling algorithm that efficiently handles the changing workloads of MPEG-4 video traffic. The goal of our research is to maximize the number of frames that are transported within their deadlines while minimizing the tardiness of frames that missed their deadlines. The performance of the proposed method is compared with that of similar service mechanisms through extensive simulation experiments.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.83-93
• /
• 2007

In this paper, we address a power-aware scheduling algorithm for a mixed real-time system which consists of periodic and sporadic tasks, each of which is characterized by its minimum period, worst-case execution requirement and deadline. We propose a dynamic voltage scaling algorithm called DVSMT(DVS for mixed tasks), which dynamically scales down the supplying voltage(and thus the frequency) using on-line distribution of the borrowed resources when jobs complete while still meeting their deadlines. With this scheme, we could reduce more energy consumption. As the proposed algorithm can be easily incorporated with RTOS(Real-Time Operating System), it is applicable for handhold devices and sensor network nodes that use a limited battery power. Simulation results show that DVSMT saves up 60% more than the existing algorithms both in the periodic-task and mixed-task systems.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.3
• /
• pp.202-207
• /
• 2016

Checkpoint placement is an effective fault tolerance technique against transient faults in which the task is re-executed from the latest checkpoint when a fault is detected. In this paper, we propose a new checkpoint placement strategy separating data saving and fault detection processes that are performed together in conventional checkpoints. Several fault detection processes are performed in one checkpoint interval in order to decrease the latency between the occurrence and detection of faults. We address the placement method of fault detection processes to maximize the probability of successful execution of a task within the given deadline. We develop the Markov chain model for a real-time task having the proposed checkpoints, and derive the optimal fault detection and checkpoint interval.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.13
• /
• pp.515-536
• /
• 2000

This study analyzes the U.S. case law which challenges the legal conclusions of the district court with respect to the applicability, and effect, of the doctrine of waiver and estoppel in addition to the doctrine of documentary cure. The impliations are as follows. First, the documentary cure requirement can not be interpreted to mean early enough to allow the beneficiary to cure and represent the documents before the presentment deadline or expiry date of letter of credit. The mere fact that the presentment period expired before the completion of bank's review and notification process does not compel any conclusion about whether the examiner spent a reasonable amount of time examining the documents. Indeed, the reasonable time requirement does not imply that banks examine a presentation out of order or hurry a decision based upon particular needs or desires of a beneficiary. Secondly, even if the doctrine of waiver can apply to letter of credit governed by the strict compliance standard, a one-time acceptance of discrepant documents by a bank does not waive the bank's right to insist upon conforming documents in all subsequent letter of credit transactions between the bank and beneficiary. Revised UCC Article 5 is highly persuasive on this point: waiver of discrepancies by issuer or an applicant in one or more presentation does not waive similar discrepancies in a future presentation. Neither the issuer nor the beneficiary can reasonably rely upon honor over past waivers as a basis for concluding that a future defective presentation will justify honor.

• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.103-113
• /
• 2010

The basic real-time scheduling algorithms based on RM or EDF approaches assume that the tasks are preemptive, but the tasks may contain nonpreemptive sections in many cases. Also the existing scheduling algorithm for reducing the power consumption of the processor is based on the task utilizations and determines the processor speed $S_H$ or $S_L$ according to the existence of the blocking intervals. In this algorithm, the $S_H$ interval that operates in high speed is the interval during which the priority inversion by blocking occurs, and the length of this interval is set to the task deadline that includes the blocking intervals. In this paper, we propose an improved algorithm that can reduce the power consumption ratio by shortening the length of the $S_H$ interval. The simulation shows that the power consumption ratio of the proposed algorithm is reduced as much as 13% compared to the existing one.

• Journal of Information Technology and Architecture
• /
• v.9 no.4
• /
• pp.443-453
• /
• 2012

In order to minimize the damage from system failures, systems over various fields are requested to contain the safety-critical features. In this paper, we deliver the considerable issues, especially, in the cyber physical systems that is recently used as a safety-critical system, as well as we propose the model driven architecture based on time as its the important factor. Based on meta-modeling approach, we introduce the time-based architecture which is associated with deadline, transition state, and threshold, and also we work out a design for this by using model driven architecture. We propose a realizable safety-critical architecture by means of showing failure handling components with safety transaction model from the meta-model. In the detailed models and the example, we design a basic safety processing state, a multiple safety processing state, and a compound safety processing state for completing the safety-critical system architecture.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1567-1576
• /
• 2015

This paper proposes a reliable real-time data dissemination protocol for mitigating transmission failure of real-time data in WSNs. The re-transmission is well-known for recovery of transmission failure, but this may violate the real-time requirement by transmission delay. To solve this problem, the proposed protocol exploits broadcasting nature and temporal opportunity allocation. In a radio-range of sending node, there may be neighbors satisfying the real-time requirement. The neighbors of specific node could receive data simultaneously by broadcasting, and decide their priority using temporal opportunity allocation method. The method uses time slot and tolerable time. The time slot specifies the priority and transmission deadline for each neighbors, and the tolerable time is the real-time requirement at the sending node. By giving the priority to the node with shorter tolerable time in each slot, we may get more opportunities to forward toward the destination. In other words, even if a node have the longer tolerable time, it still has a chance to forward with the real-time requirement. Simulation results show that the proposed protocol is superior to the existing protocols.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.115-123
• /
• 2017

A message processor is server software that receives non-realtime messages as well as realtime messages from clients that need to be processed within a deadline. With the recent advances of micro-processor technologies and Linux, the message processor is often implemented in Linux-based multi-core servers and it is important to use cores efficiently to maximize the performance of system in multi-core environments. Numerous research efforts on a real-time scheduler for the efficient utilization of the multi-core environments have been conducted. Typically, though, they have been conducted theoretically or via simulation, making a subsequent real-system application difficult. Moreover, many Linux-based real-time schedulers can only be used in a specific Linux version, or the Linux source code needs to be modified. This paper presents the design of a Linux-based message processor for multi-core environments that maps the threads to the cores at user level. The message processor is implemented through a modification of the traditional RM algorithm that consolidates the real-time messages into certain cores using a first-fit-based bin-packing algorithm; this minimizes the response-time delay of the non-real-time messages, while guaranteeing the violation rate of the real-time messages. To compare the performances, the message processor was implemented using the two multi-core-scheduling algorithms GSN-EDF and P-FP, which are provided by the LITMUS framework. The benchmarking results show that the response-time delay of non-real-time messages in the proposed system was improved up to a maximum of 17% to 18%.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.77-85
• /
• 2009

Execution times of tasks can be variable depend on input data. If we choose a high performance processor to satisfy the worst case execution times, the hard cost becomes high and the energy consumption also becomes large. To apply a lower performance processor, we have to utilize processor capacity maximally while overrunning tasks can not affect deadlines of other tasks. To be used for such systems, this paper presents SBP (Shared Bandwidth Partitioning) that a processor bandwidth is reserved and shared among all tasks. If a task needs more processor capacity, it can use a portion of the shared bandwidth. A simulation result shows that SBP provides better performance than previous algorithms. SBP reduces deadline miss ratio which is related to scheduling quality. And the number of context switches, which is related to system overhead, is also reduced.

• Korean Journal of Construction Engineering and Management
• /
• v.17 no.3
• /
• pp.43-51
• /
• 2016

Recently, the cost of construction projects has escalated due to a significant increase in size and complexity. Many construction projects have failed to meet their originally intended project deadline due to various factors such as weather, labor supply, equipment, procurement, accidents, etc. Consequently, emergency construction work scenario has to be implemented in order to shorten the duration and satisfy the original estimated schedule. However, many critical decisions in emergency scenario rely solely on the experience of a construction manager. Thus, this paper proposes TCTO optimization model to decide the most effective alternative out of various working scenarios which are generated by the combination of work group and work time. The developed TCTO model provides the optimum schedule that satisfies the practical constraints. Future research could involve the integration of resource leveling with the proposed model. This would make the model more versatile.