• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.585-588
• /
• 2008

센서 네트워크에 사용되는 운영체제 중 TinyOS는 Event-driven 방식이며 Component 기반의 센서 네트워크 운영체제이다. 이러한 TinyOS는 일단 태스크가 시작되면 마칠 때까지 다른 태스크가 기다려야하는 비선점형(Non-preemption) 방식이다. 최근 연구에서 TinyOS의 빠른 반응성을 위해 선점(Preemption)할 수 있는 기능이 추가되었다. 그러나 프로그래밍할 때 우선순위를 미리 주어줘야 하는 단점이 있다. 본 논문에서는 좀 더 유연하게 우선순위를 변경할 수 있는 방식을 제안하고자 한다.

• Venture DIGEST
• /
• s.85
• /
• pp.30-30
• /
• 2005

• Photonics industry news
• /
• s.64
• /
• pp.4-5
• /
• 2011

• 정보화사회
• /
• s.143
• /
• pp.15-18
• /
• 2000

• JOURNAL OF ELECTRICAL WORLD
• /
• s.402
• /
• pp.32-38
• /
• 2010

• 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 the Korean Institute of Intelligent Systems
• /
• v.21 no.1
• /
• pp.120-127
• /
• 2011

Checkpointing is one of common methods of realizing fault-tolerance for real-time systems. This paper presents a scheme to determine checkpoint intervals using probabilistic optimization. The considered real-time systems comprises multiple tasks in which transient faults can happen with a Poisson distribution. Also, multi-tasks are scheduled by the non-preemptive Rate Monotonic (RM) algorithm. In this paper, we present an optimization problem where the probability of task completion is described by checkpoint numbers. The solution to this problem is the optimal set of checkpoint numbers and intervals that maximize the probability. The probability computation includes schedulability test for the non-preemptive RM algorithm with respect to given numbers of checkpoint re-execution. A case study is given to show the applicability of the proposed scheme.

• Journal of The Korean Society of Grassland and Forage Science
• /
• v.4 no.2
• /
• pp.108-114
• /
• 1983

This study was conducted to investigate the effects of existing vegetation on seedling establishment and herbage production of oversown grasses in the Pinus rigida forest. The dominant existing vegetations were Miscanthus sinensis, Festuca ovina, and Lycopodium serratum. In establishment year, seedling stands and herbage production were not affected in Miscanthus sinensis and Festuca ovina, while in Lycopodium serratum it was affected relatively seriously. The pattern of sown species response to the existing vegetations was trend to toward simplified two or three species as Dactylis glomerata, Lolium perenne, and Trifolium repens to advancing the time. Among sown species, Dactylis glomerata was a major dominant species in all existing vegetation area. The content of sown pasture grasses in the sward increased markedly, while the existing vegetations before seeding seriously decreased to advancing the cutting time. The above results shown that the improvement of forest pasture with a surface seeding was better in Miscanthus sinensis and Festuca ovina, but in Lycopodium serratum was found very difficult to improvement of pasture without surface treatment, also establishment method must favor the low herbage production potential.

• Journal of the Society of Disaster Information
• /
• v.10 no.1
• /
• pp.123-140
• /
• 2014

This paper proposes a simple and effective method for determining the dynamic characteristics of revolution shells. This is a weighted residual method in which the collocation points are taken at the roots of orthogonal polynomial. In this paper the collocation method is employed to replace a partical differential eqations by a system of ordinary differential equations in time, and the resulting equations are solved by two different numerical methods of time integration : an implicit method and an explicit method. The proposed approach is formulated in some detail. The versatility and accuracy are illustrated through several numerical examples. The method appears to be relatively easy to set up and gives satisfactory results.

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