• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.493-501
• /
• 2013

A key challenge in massively multiplayer on-line game(MMOG) systems is providing real-time response latencies to the large number of concurrent game players. MMOG systems are a kind of soft real-time systems because requests from many players should be responded within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In order to meet their timing constraints, we propose priority scheduling methods that attempt to allocate preferentially more CPU bandwidth to serve an task with the higher priority level in the presence of transient overloading. The proposed scheduling methods are capable of enhancing real-time performance of MMOG system by maximizing the number of tasks with higher priority completed successfully within their deadlines while minimizing total average latency of tasks finished after given deadlines. The performance of these scheduling methods is evaluated through extensive simulation experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2581-2595
• /
• 1997

In this paper, the real-time facility of the operating system for a VOD(Video On Demand) server have been analyzed and implemented. The requirements of the real-time scheduling have been gathered by analyzing the model of the video-data-transfer-path. Particularly, the influence of the bottleneck subsystem have been analyzed. Thus, we have implemented the real-time scheduler and primitives which is proper for processing the digital video. In performance measurements, the degree of the guarantee of the real-time scheduler have been experimented. The measured data show that the most time constraints of the process is satisfied. But, the network protocol processing by the interrupt is a major obstacle of the real-time scheduling. We also have compared the difference between the real-time scheduler and the non-real-time scheduler by measuring the inter-execution time. According to the measured results, the real-time scheduler should be used for efficient video service because the processor time allocated to the process can't be estimated when the non-real-time scheduler is used.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.111-121
• /
• 2004

In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1418-1432
• /
• 1996

In addition t improved availability, replication of data can enhance performance of distributed real-time transaction processing system by allowing transactions initiated at multiple node to be processed concurrently. To satisfy both the consistency and real-time constraints, it is necessary to integrate concurrency control and atomic commitment protocols with time-driven scheduling methods. blocking caused by existing concurrency control protocols is incompatible with time-driven scheduling because they cannot schedule transactions to meet given deadlines. To maintain consistency of replicated data and to provide a high degree of schedulability and predictability , the proposed time-driven scheduling methods integrate optimistic concurrency control protocols that minimize the duration of blocking and produce the serialization by reflecting the priority transactions. The atomicity of transactions is maintained to ensure successful commitment in distributed environment. Specific time-driven scheduling techniqueare discussed, together with an analysis of the performance of this scheduling.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.223-223
• /
• 2000

Embedded system area has brought an innovation and has been spread rapidly by the growth of the Internet, wireless telephony and multimedia recently. Many embedded systems are required to be real-time systems in that it needs multi-tasking and priority based scheduling. This paper introduces a real-time system that was developed with web server ability for control and monitoring system employing a real-time operating system. It discusses the design model, structure, and applications of web server system. We used SNDS100 board which has a 32-bit RISC microcontroller of ARM7TDMI core as a hardware platform. MicroC/OS kernel was used as Real-time operating system that supports a preemptive and multitasking functions. We developed a hierarhchical control and monitoring system that not only reduced system and management costs, but also enhanced reusability and portability.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.467-475
• /
• 1999

This paper presents an algorithm for scheduling jobs in soft real-time systems. To simplify the scheduling for soft real-time systems, we introduce two-level deadline scheme. Each job in the system has two deadlines, which we call first-level and second-level deadlines, respectively. The first-level deadline is the same as the deadline in traditional real-time systems. The second-level deadline is later than the first-level deadline, and defines the latest point in time when the result is still acceptable. Partial-credit is given for jobs meeting the second-level deadline but missing the first-level deadline, whereas jobs meeting the latter are given full credit. We heuristically compute priorities of jobs in a dynamic way by combining the first-level adn second-level deadlines with the partial-credit. Simulation results indicate that our two-level scheduling algorithm is a viable approach for dealing with both soft real-time systems and temporary overloaded hard real-time systems.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.76-84
• /
• 2011

Embedded Systems need to ensure real-time of the task response time depending on the applied fields of it. And task could be faulty due to various reasons in real time systems. Therefore in this paper, we design a task scheduler that guarantees deadlines of periodic tasks and considers a fault tolerance of defective task in embedded system with a single processor. In order to provide real-time, we classify tasks with periodic/aperiodic tasks and applies RMS(Rate Monotonic Scheduling) method to schedule periodic tasks and can guarantees execution of aperiodic tasks by managing surplus times obtained after analyzing the execution time of periodic tasks. In order to provide fault tolerance, we manage backup times and reexecute a fault task to restore it's conditions.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.158-163
• /
• 1986

This article surveys techniques and issues related to real time process control system developed for industrial control applications. It covers the system architecture and software engineering issues such as the design of data structures, scheduling of asynchronous task activities, management of shared resources, handling of interrupt and implementing an user friendly man-machine interface. Also problems associated with implementing a real-time system that supports dynamic configuration of data base is addressed.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.296-303
• /
• 2016

Mobile real-time systems with limited system resources and a limited power source need to fully utilize the system resources when the workload is heavy and reduce energy consumption when the workload is light. EDZL (Earliest Deadline until Zero Laxity), a multiprocessor real-time scheduling algorithm, can provide high system utilization, but little work has been done aimed at reducing its energy consumption. This paper tackles the problem of DVFS (Dynamic Voltage/Frequency Scaling) in EDZL scheduling. It proposes a technique to compute a uniform speed on full-chip DVFS platforms and individual speeds of tasks on per-core DVFS platforms. This technique, which is based on the EDZL schedulability test, is a simple but effective one for determining the speeds of tasks offline. We also show through simulation that the proposed technique is useful in reducing energy consumption.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.119-127
• /
• 1990

This paper deals with the production scheduling problems of a dedicated Flexible Manufacturing System. In this work, a new mathematical formulation is proposed and two heuristic algorithms which can generate real-time schedules are suggested. Example problems to demonstrate the good performance and the validity of these two proposed algorithms are also included.