• ETRI Journal
• /
• v.42 no.3
• /
• pp.376-387
• /
• 2020

Massive computation of the reconstruction algorithm for compressive sensing (CS) has been a major concern for its real-time application. In this paper, we propose a novel high-speed architecture for the orthogonal matching pursuit (OMP) algorithm, which is the most frequently used to reconstruct compressively sensed signals. The proposed design offers a very high throughput and includes an innovative pipeline architecture and scheduling algorithm. Least-squares problem solving, which requires a huge amount of computations in the OMP, is implemented by using systolic arrays with four new processing elements. In addition, a distributed-arithmetic-based circuit for matrix multiplication is proposed to counterbalance the area overhead caused by the multi-stage pipelining. The results of logic synthesis show that the proposed design reconstructs signals nearly 19 times faster while occupying an only 1.06 times larger area than the existing designs for N = 256, M = 64, and m = 16, where N is the number of the original samples, M is the length of the measurement vector, and m is the sparsity level of the signal.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.173-178
• /
• 2004

A network of Asynchronous Transfer Mode (ATM) will be required to carry the traffics(CVR, VBR, UBR. ABR) generated by a wide range of services ATM services the Quality-of-Service (QoS) management of traffice sources and bandwidth. Besides efficiency and throughput, the security services are achieved in the traffic sent in ATM network. In this paper, the scheduler evaluate and the packets sent in ATM security group. The scheduler transmits the safty packet, drop the unsafty packet and evaluate mark packet as the requirement of the delay. In this paper, we propose the scheduling algorithm of mark packet which evaluates the packet. The suggested model performance of the firewall switch is estimate simulation in terms of the delay by computer.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.129-146
• /
• 1997

In traditional approaches to scheduling problems, a single dispatching rule was used by all machines in a system. However, since the situation of each machine generally differs from those of other machines, it is reasonable to apply a different dispatching rule to each machine responding to its given situation. In this regard, we introduce the concept of spatial adaptation and examine its effectiveness by simulation. In the spatial adaptation, each machine in a system selects an appropriate dispatching rule in order to improve productivity while it strives to be in harmony with other machines. This study proposes an adaptive procedure which produces a reliable dispatching rule for each machine beginning with the bottleneck machine. The dispatching rule is composed of several criteria of which priorities are adaptively weighted. The weights are learned for each machine through systematic simulations. The simulations are conducted according to a Taguchi experimental design in order to find appropriate sets of criteria weights in an efficient and robust way in the context of environmental variations. The proposed method was evaluated in an application to a semiconductor wafer fabrication system. The method achieved reliable performance compared to traditional dispatching rules, and the performance quickly approached the peak after learning for only a few bottleneck machines.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.501-502
• /
• 2015

매년 증가되는 전력소비량에 대응하여 스마트그리드 기술을 기반으로 수용가 측의 에너지관리 중요성이 부각되고 있으며, 홈 에너지관리시스템(HEMS, Home Energy Management System)은 전기요금 절감과 효율적인 전력소비의 중요한 체계로써 기대되고 있다. 일반적으로, 가정에서 높은 전력소비를 가진 가전제품은 계절성 부하로 전기온수기, 냉/난방기를 일컫는다. 즉, 계절성 부하에 적절한 에너지관리, '최적부하 스케줄링'은 전기요금 절감과 직결되는 것을 의미한다. 본 논문은 Modified Branch-and-Bound 기법을 사용하여 사용자의 편의성을 고려한 전기온수기(EWH, Electric Water Heater)의 스케줄링을 실시하겠다. 여기서 사용자의 편의성이란, 외부의 온도변화 또는 습관에 따라 그 부하를 사용하는 것을 의미한다. 온수사용량, 수온 설정온도 변화의 편의성 제약조건을 고려하여 온수기를 효과적으로 운영하는 스케줄링을 실시한다. 이러한 편의성 내에서 온수기를 운영하며, 작동모드는 3가지(정지, 일반/급속가열) 모드가 존재하며, 다양한 요금제도에서의 스케줄링 결과를 절감된 전기요금으로 비교하겠다.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.333-336
• /
• 2005

The implementation of cellular phone based applications have been growing very fast because of WIPI which is a hardware independent platform. In this paper, we design and Implement a system to combine the animation avatar and e-mail service by using WIPI platform. Also, this system manages scheduling at the same time. This system uses SMS service in order to notify scheduled time and it synchronizes the schedule data with Outlook Express on the computer.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.189-206
• /
• 2010

It is generally accepted that dynamic voltage scaling (DVS) is one of the most effective techniques of energy minimization for real-time applications in embedded system design. The effectiveness comes from the fact that the amount of energy consumption is quadractically proportional to the voltage applied to the processor. The penalty is the execution delay, which is linearly and inversely proportional to the voltage. According to the granularity of tasks to which voltage scaling is applied, the DVS problem is divided into two subproblems: inter-task DVS problem, in which the determination of the voltage is carried out on a task-by-task basis and the voltage assigned to the task is unchanged during the whole execution of the task, and intra-task DVS problem, in which the operating voltage of a task is dynamically adjusted according to the execution behavior to reflect the changes of the required number of cycles to finish the task before the deadline. Frequent voltage transitions may cause an adverse effect on energy minimization due to the increase of the overhead of transition time and energy. In addition, DVS needs to be carefully applied so that the dynamically varying chip temperature should not exceed a certain threshold because a drastic increase of chip temperature is highly likely to cause system function failure. This paper reviews representative works on the theoretical solutions to DVS problems regarding inter-task DVS, intra-task DVS, voltage transition, and thermal-aware DVS.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.23-36
• /
• 2001

To support real-time multicast, the existing DS network may use the EF PHB for transmission, However, because of the dynamic characteristics of the multicast flow and the features of the EF PHB. it is very difficult to make a provision of resources or to manage the network when EF multicast flows increase, Also, the existing LBE PHB can not guarantee the transmission delay bounds required for the real-time multicast traffic, In this paper. a new concept of PHB. namely, low-delay multicast PHB, that may guarantee approximately the per-hop delay is proposed, For the low-delay multicast PHB, router architectures are devised, The queue management algorithm on a low-delay multicast queue and a scheduling method are also devised. This new architecture of the LDM AF class is simple to be implemented.

• Korean Journal of Child Studies
• /
• v.15 no.1
• /
• pp.5-21
• /
• 1994

The purpose of this study was to develop a scale for evaluation of early childhood programs in Korea. The procedures included content validation and a pilot test. A total of 192 items in 10 major areas was developed based on the review of literature and discussions with professionals in early childhood education. The 10 areas include: scheduling, curriculum, interation, physical environment, materials, nutrition, health and safety, administration, staff qualifications, relationships with parents, and evaluation. The pilot scale was administered to 428 classroom teachers and directors, and 47 college professors in early childhood education. The items were rated on a 3-point scale in terms of importance as evaluation criteria. The methods for data analysis included item means and standard deviations for content validation, Cronbach ${\alpha}$ for reliability, and factor analysis for construct validity. Most items in 10 areas were rated as moderate to highly important (average 2.3), especially items in curriculum and staff qualifications. Two factors emerged from the data: institutional management, and curricular planning and implementation. The Cronbach ${\alpha}$ levels were .70 or higher in most areas, but the range covers from .48 to .91. Based on the pilot data, 143 items were selected for the second year study.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2006

This paper proposes a real-time resource allocation algorithm for minimizing the completion time of overall workflow process. The jobs in a workflow process are interrelated through the precedence graph including Sequence, AND, OR and Loop control structure. A resource should be allocated for the processing of each job, and the required processing time of the job can be varied by the resource allocation decision. Each resource has several inherent restrictions such as the functional, geographical, positional and other operational characteristics. The algorithm suggested in this paper selects an effective resource for each job by considering the precedence constraint and the resource characteristics such as processing time and the inherent restrictions. To investigate the performance of the proposed algorithm, several numerical tests are performed for four different workflow graphs including standard, parallel and two series-parallel structures. In the tests, the solutions by the proposed algorithm are compared with random and optimal solutions which are obtained by a random selection rule and a full enumeration method respectively.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.313-316
• /
• 2004

This paper presents a new dynamically adaptable polling scheme for efficient support of real-time traffic over an IEEE 802.11 wireless LAN network. The poll scheduling plays an important role in IEEE 802.11 PCF. However, the current version of the polling list management scheme proposed in the IEEE802.11 standard is inefficient when a variable number of mobile stations have variable packets to transmit. If Point Coordinator(PC) has an exact information on the station status, it is possible to efficiently perform polling. In this thesis. we suggest an adaptable polling scheme to meet requirements of the stations. In our scheme, each station transmits packets including a piggyback information to inform that it wants to receive a poll in the next polling duration. Simulation results indicate that our scheme may reduces the packet discard ratio and real-time packet transfer delay.