• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.277-280
• /
• 2004

최근 디지털 가전과 모바일 컴퓨팅이 화두로 떠오르면서 내장형 기술이 전성기를 맞이하고 있으며, 다양한 내장형 시스템들간의 상호 운용성, 플랫폼 독립성과 이식성을 지원할 수 있는 환경을 제공하는 내장형 미들웨어의 중요성이 부각되고 있다. 미들웨어는 신뢰성, 안전성, 보안성, 실시간성 등과 같은 기능에 직접 포함되지 않는 비기능적 요구를 응용 분야에 따라 요구할 수 있으며, 그 때마다 다양한 비기능적 요구에 맞는 미들웨어를 각기 따로 개발하는 것은 지극히 어려운 일이다. 따라서, 비기능적 요구에 적합하게 미들웨어를 동적으로 재구성하는 컴포넌트 개발 방법이 주목 받고 있으며, 이를 통해 재구성된 내장형 미들웨어에서는 비기능적 요구인 실시간성이 요구되므로, deadline 만족 여부를 확인하는 스케쥴링 분석이 중요하다. 많은 최적의 스케쥴링 분석 알고리즘이 존재하나 그들 중 어느 것도 동적 재구성이 될 때 태스크 집합상의 가정(assumption)이 변경되는 내장형 미들웨어를 만족 시킬 수 없다. 가정에 적합한 스케쥴링 알고리즘으로 대체하기 위한 제안들은 대부분 정적 조립 환경에서 새로운 버전에 의해 기존 클래스를 교체하는 코드 수정에 기반하나, 동적 재구성을 통해 행위를 변경하는 내장형 미들웨어에서는 응용하기 어렵다. 따라서, 본 논문에서는 동적 재구성 환경에서 수행되는 내장형 미들웨어를 위해, 적합한 스케쥴링 알고리즘으로 대체 할 수 있는 스케쥴러를 런타임 컴포넌트 개조 기술 중 하나인 Type-safe delegation이 적용된 strategy 패턴을 기반으로 설계하였으며, 이를 통해 내장형 미들웨어 스케쥴러의 유연성과 확장성을 증가하는 방안을 제시하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.57-64
• /
• 2012

Multiplayer, real-time games are a kind of soft real-time systems because a game server has to respond to requests from many clients within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to different priorities on CPU processing. Events can be divided into different groups, depending on their consistency degree and priority. To handle these events with different priority and meet their timing constraints, we propose a priority-based group task scheduling policy in this paper. The number of clients or events requested by each client may be increased temporarily. In the presence of transient overloading, the game server needs to allocate more CPU bandwidth to serve an event with the higher priority level preferentially. The proposed scheduling policy is capable of enhancing real-time performance of the entire system by maximizing the number of events with higher priority completed successfully within their deadlines. The performance of this policy is evaluated through extensive simulation experiments.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.324-329
• /
• 2004

This paper presents a coordination method to allocate and schedule tasks for multiagent systems of which agents have fuzzy processing time for their operations earlier on and their processing times are determined at the time the task operations are carried out later on. The proposed method is organized in a two-level genetic algorithm in which the upper level genetic algorithm plays the role of finding efficient task allocation and the lower level genetic algorithm takes charge of searching for efficient schedules corresponding to the task allocation proposed by the upper level genetic algorithm. It presents a strategy to deal with agent failures in the considered multiagent system. It also shows some experiment results for the proposed method.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.483-488
• /
• 2004

For real-time applications, the underlying operating system (0S) should support timeliness guarantees of real-time tasks. However, most of current operating systems do not provide timely management facilities in an efficient way. There could be two approaches to support timely management facilities for real-time applications: (1) by modifying 0S kernel and (2) by Providing a middleware without modifying 0S. In our approach, we adopted the middleware approach based on the TMO (Time-triggerred Message-triggered Object) model which is a well-known real-tine object model. The middleware, named TMSOM (TMO Support Middleware) has been implemented on various OSes such as Linux and Windows XP/NT/98. In this paper, we mainly consider TMOSM implemented on Linux(TMOS/Linux). Although the real-time schedul-ing aIgorithm used in current TMOSM/Linux can produce an efficient real-time schedule, it can be improved for periodic real-time tasks by considering several factors. In this paper, we discuss those factors and propose an improved real-time scheduling algorithm for periodic real-time tasks, In order to simulate the performance of our algorithm, we measure timeliness guarantee rate for periodic real-time tasks. The result shows that the performance of our algorithm is superior to that of existing algorithm. Additionally, the proposed algorithm can improve system performance by making the structure of real-time middleware simpler.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.30-37
• /
• 2010

Many embedded real - lime systems have adopted processors supported with dynamic voltage scal-ing(DVS) recently. Power is one of the important metrics for Optimization in the design and operation of embedded real-time systems. We can save considerable energy by using slowdown of processor sup-ported with DVS. In this paper, we improved the previous algorithm at a point of view of time complexity to calculate task slowdown factors for an efficient energy consumption in embedded real-time systems with task synchronization. We grasped the properties of the previous algorithm having $O(n^{2})$ time complexity through mathematical analysis and s simulation. Using its properties we proposed the improved algorithms with O(nlogn) and O(n) time complexity which have the same performance as the previous algorithm has.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.273-283
• /
• 2008

Many embedded real-time systems have adopted processors supported with dynamic voltage scaling(DVS) recently. Power is one of the important metrics for optimization in the design and operation of embedded real-time systems. We can save considerable energy by using slowdown of processor supported with DVS. In this paper, we propose heuristic algorithms to calculate task slowdown factors for an efficient energy consumption in embedded real-time systems with task synchronization. The previous algorithm has a following constraint : given the tasks are ordered in a nondecreasing order of their relative deadline, the task slowdown factors computed are in a nonincreasing order. In this paper, we relax the constraint and propose heuristic algorithms which have the same time complexity that previous algorithm has and can save more energy. Experimental results show that the proposed algorithms are energy efficient.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.8
• /
• pp.343-348
• /
• 2013

We proposes a power-aware fixed-priority real-time scheduling algorithm for multimedia service, called static voltage scaling algorithm with multi-granularity resource reservation (STATIC-MULTIRSV). The multi-granularity resource reservation was introduced to deliver higher system utilization and better temporal isolation than the traditional approaches in [2]. Based on this, our STATIC-MULTIRSV is designed to reduce the power consumptions while guaranteeing that all I-frames of each video stream meet their deadlines. We implemented the proposed algorithm on top of ChronOS Real-time Linux [6]. We experimentally compared STATIC-MULTIRSV with other existing methods which showed that STATIC-MULTIRSV reduce power consumption by maximum 15% compared to its experimental counterparts.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.179-181
• /
• 1999

본 논문에서는 내장 실시간 시스템(real-time embedded system)에서의 성능 재조정(re-engineering) 문제를 다룬다. 성능 재조정 문제는 하드웨어와 소프트웨어가 이미 구현된 상태에서 새로운 성능조건이 요구될 때 이를 만족시키도록 시스템을 수정하는 문제이다. 본 논문에서의 성능 요구조건은 시간당 처리량(throughput)이나 입출력 지연시간(input-output latency)등이 고려된다. 제안된 방법은 병목점 분석(bottleneck analysis)과 비선형 최적화를 이용한다. 이를 위해 프로세스 네트워크(process network)로 표현된 시스템 디자인과 태스크 그래프, 태스크 할당(allocation)과 스케쥴링, 그리고 새로운 성능조건인 실시간 처리량을 입력으로 사용한다. 제안된 방법은 두 단계로 구성된다. 첫째, 프로세스 네트워크에서 프로세스의 지연시간을 계산하여 병목이 되는 프로세스를 찾아낸다. 둘째, 프로세싱 요소의 성능 개선율(performance scaling factor)을 변수로 하여 주어진 성능을 만족시키기 위한 시스템 제약조건을 유도한다. 이를 사용하여 하드웨어의 업그레이드 비용을 최소화하도록 제약조건을 풀고 각 프로세싱 요소(processing element)에 필요한 성능개선율을 구한다. 제안된 방법은 기존에 구성된 소프트웨어의 구조를 고치기 않기 때문에 재조정의 시간을 줄일 수 있게 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.290-293
• /
• 2014

모바일 디바이스의 보급으로 사람들의 생활에 많은 변화를 가져왔으며, 이러한 변화에 따라 점차 수요에 따른 모바일 콘텐츠 시장 또한 확산 되었다. 사람들의 수요에 의해 모바일 애플리케이션은 문서작성, 게임, 사진, 은행 업무, 영화, 벨소리 뿐 아니라 HD 비디오 재생, 스트리밍 AV 서비스 등 하드웨어적 고성능을 요구하는 애플리케이션까지 등장하게 되었다. 이러한 추세에 더불어 모바일 디바이스는 멀티코어의 성능에 이르는 디바이스까지 출시 되었다. 하지만 멀티코어의 효율성은 스케쥴러가 코어에 작업을 할당하는 방법에 따라 달라진다. 이종 멀티 코어 플랫폼에서 애플리케이션의 실행 시간은 실행되는 코어에 의존한다. 본 논문에서는 프로파일에 의해 각 태스크의 실행 시간을 분석하여 태스크 스케쥴링 기법을 제안한다.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.79-85
• /
• 2008

Our paper deals with a method for supporting multiple call/sessions in a mobile terminal. The different identifier for each protocol layer is assigned to each session when a mobile terminal sets SDP for multimedia services. In particular, QoS based tasks are used for managing the traffics in radio interface. Also, queuing, admission control, load control, resource allocation and scheduling are done based on the priority of sessions. The various multimedia services which is different in the requirement of resource allocation are able to be serviced simultaneously because a mobile terminal can provide the various services based on this scheme.