• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.437-442
• /
• 2009

For multiprocessor systems, Earliest Deadline First (EDF) based on deadline and Least Laxity First (LLF) based on laxity are not suitable for practical environment since EDF has low schedulability and LLF has high context switching overhead. As a combining of EDF and LLF to improve the performance, Earliest Deadline Zero Laxity (EDZL) was proposed. EDZL is basically the same as EDF. But if the laxity of a task becomes zero, its priority is promoted to the highest level. In this paper, we propose Least Laxity Zero Laxity (LLZL) which is based on LLF. But context switching is allowed only if the laxity of a task on rady queue becomes zero. Simulation results show that LLZL has high schedulability approaching to LLF and low context switching overhead similar to EDF. In comparison with EDZL, LLZL has better performance in both of schedulability and context switching overhead.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.368-376
• /
• 2005

Multiprocessor architecture becomes increasingly common on real-time systems as computer hardware technology rapidly progresses and the workload of real-time systems increases. However, efficient solutions for many real-time multiprocessor scheduling problems are not known. Hence many researchers apply uniprocessor scheduling algorithms to multiprocessor scheduling or devise new algorithms based on these algorithms. Such algorithms are EDF (Earliest Deadline First), LLF (Least Laxity First), EDF-US[m/(2m-1)], and EDZL (Earliest Deadline Zero Laxity), and comparative studies on them are necessary. In this paper, we show the dominance relation of these algorithms with respect to schedulability, and we prove EDZL strictly dominates EDF. The simulation results show that EDZL has high processor utilization and it causes a small number of preemptions.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1999.10a
• /
• pp.399-402
• /
• 1999

This study is about seismic performance of the EDF(Electricite De France) system, that is among various base isolator. We get solutions of equation of motion of this system for displacement, velocity, acceleration and compared with solutions using finite element program. And, through shaking table tests we will prove seismic performance

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.31-36
• /
• 2005

EDF에 근거한 Cramer-von Mises 형태의 통계량을 합교원리를 이용하여 다변량으로 일반화한다. 그리고 제안된 통계량의 귀무가설에서의 극한분포를 적절한 공분산함수를 가진 가우스 과정의 적분의 형태로 표현하고 통계량의 근사적인 계산방법을 고려한다.

• ETRI Journal
• /
• v.29 no.6
• /
• pp.779-784
• /
• 2007

In this paper, we report the experimental results of a hybrid wideband fiber amplifier. The amplifying medium is a concatenated hybrid fiber consisting of Er-doped fiber (EDF) and dispersion compensating fiber (DCF). The gain mechanisms are based on stimulated emission in the EDF and stimulated Raman scattering (SRS) in the DCF. Since we simultaneously use optical amplification by the two processes, the gain bandwidth is easily expanded over 105 nm by a two-tone pumping scheme. Using an experimental setup constructed with a hybrid structure of EDF-DCF-EDF, we analyzed the spectral behavior of amplified spontaneous emission for pumping powers. We achieved an optical gain of over 20 dB in the wavelength range from 1,500 to 1,600 nm under optimized pumping conditions to make the spectral gain shape flat.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1273-1281
• /
• 2004

There have been a number of researches on real-time packet scheduling based on EDF algorithm to support end-to-end delay bound guarantees for real-time traffic transmission. However, EDF-based packet scheduler could not guarantee the real-time requirements of real-time traffic if there exist non-real-time traffic. In this paper, we propose a new admission control algorithm and packet scheduling scheme considering non-real-time traffic in the real -time packet scheduler based on EDF policy. Proposed admission control algorithm has pseudo-polynomial time complexity, but we show through simulation that it can be used with little run-time overhead.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.9 no.3
• /
• pp.143-154
• /
• 2001

An algorithm for estimating the lane departure of a vehicle is derived and implemented based on an EDF(edge distribution function) obtained from gray-level images taken by a CCD camera mounted on a vehicle. As the function of edge direction, the EDF is aimed to show the distribution of edge direction and to estimate the possibility of lane departure with respect to its symmetric axis and local mamma. The EDF plays important roles: 1) It reduces noisy effects caused by dynamic road scene. 2) It makes possible lane identification without camera modeling. 3) It also leads LDW(lane departure warning) problem to a mathematical approach. When the situations of lane departure such that the vehicle approaches to lane marks or runs in the vicinity of the lane marks are occurred, the orientation of lane marks in images is changed, and then the situations are immediately reflected to the EDF. Accordingly, the lane departure is estimated by studying the shape of the EDF. The proposed EDF-based algorithm enhanced the adaptability to cope with the random and dynamic road environments, and eventually led to the reliable LDW system.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.625-633
• /
• 2012

Extended Depth of Focus (EDF) algorithms for extracting three-dimensional (3D) information from a set of optical image slices are studied by many researches recently. Due to the limited depth of focus of the microscope, only a small portion of the image slices are in focus. Most of the EDF algorithms try to find the in-focus area to generate a single focused image and a 3D depth image. Inherent to most image processing algorithms, the EDF algorithms need parameters to be properly initialized to perform successfully. In this paper, we select three popular transform-based EDF algorithms which are each based on pyramid, wavelet transform, and complex wavelet transform, and study the performance of the algorithms according to the initialization of its parameters. The parameters we considered consist of the number of levels used in the transform, the selection of the lowest level image, the window size used in high frequency filter, the noise reduction method, etc. Through extended simulation, we find a good relationship between the initialization of the parameters and the properties of both the texture and 3D ground truth images. Typically, we find that a proper initialization of the parameters improve the algorithm performance 3dB ~ 19dB over a default initialization in recovering the 3D information.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2543-2554
• /
• 2000

Packet schedulers for real-time communication must provide bounded delay and efficient use of network resources such as bandwidth, buffers and so on. In order to satisfy them, a large number of packet scheduling methods have been proposed. Among packet scheduling methods, an EDF (Earliest Deadline First) scheduling is the optimal one for a bounded delay service. A disadvantage of EDF scheduling is that queued packets must be sorted according to their deadlines, requiring a search operation whenever a new packet arrives at the scheduler. Although an RPQ (Rotating Priority Queue) scheduler, requiring large size of buffers, does not use such operation, it can closely approximate the schedulability of an EDF scheduler. To overcome the buffer size problem of an RPQ scheduler, this paper proposes a new scheduler named MRPQ (Multiple Rotating Priority Queue). In a MRPQ scheduler, there are several layers with a set of Queues. In a layer, Queues are configured by using a new strategy named block Queue. A MRPQ scheduler needs nearly half of buffer size required in an RPQ scheduler and produces schedulability as good as an RPQ scheduler.