• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.809-810
• /
• 2006

An H.264 algorithm is commonly used for video compression applications. This algorithm requires a large number of data computations, for example, the sum of absolute difference (SAD) operation. We analyzed H.264 reference encoding workloads. The H.264 encoding program has 8.78% SAD operation. The SAD operation is to sum up 16 difference-values in H.264 $4{\times}4$ sub-blocks. In order to accelerate SAD operations, we implemented an application specific instruction-set processor (ASIP) that can execute SAD and data transfer instructions. The proposed coprocessor has an absolute value generator and a carry save adder (CSA) unit to sum up 8 difference-values per one clock cycle. We completed SAD operation in 2 clock cycles. Experimental results show that the performance is improved by 34% of total execution time.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.11
• /
• pp.671-679
• /
• 2004

This paper presents the on-line current controller tuning method of grid-connected inverter using PSO(particle swarm optimization) technique for minimizing the harmonic current. Synchronous frame PI current regulator is commonly used in most distributed generation. However, due to the source voltage distortion, specially in weak AC power system, current may contain large harmonic components, which increase THD(total harmonic distortion) and deteriorates power quality. Therefore, some tuning method is necessary to improve response of current controller. This paper used the PSO technique to tune the current regulator and through simulation and experiments, usefulness of the tuning method has been verified. Especially in simulating the tuning process, ASM(average switching model) of inverter is used to shorten execution time.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.471-474
• /
• 2011

In parallel job scheduling, each job can be executed simultaneously on multiple machines at a time. Thus in the input instance, a job $J_i$ requires the number $m_i$ of machines on which it shall be processed. The algorithm should determine not only the execution order of jobs but also the machines on which the jobs are executed. In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem. We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.606-614
• /
• 2005

This paper deals with new realizations of research, scientific development, managerial and economic optimizations for prefabricated building systems. In the literature, all scientific fields are worked out based on the efficiencies, costs, benefits, choice of execution design, technical demands, aesthetical point of view, as well as the total economics. In the present example of a school-building for communities in the third world, the following criteria have been regarded: The optimal superstructure of prefabricated concrete building systems; the particularity of countries of the Third World (e.g. the climate, the political and the economic conditions); the time for construction and necessary innovative developments for an economically optimized superstructure. Added to this are alternative construction-methods and costs for a simple but variable system which can be adapted to changing functions, where variability should be the main point. For example, a school building that is to be adapted by varying number of rooms to cater for the growing number of pupils.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.681-691
• /
• 1986

To represent the relations of the data dependency and resource conflict among micro-operations(MOP's) in the compaction process of microprograms, we propose a DDM (data dependent matrix) representation method instead of the DAG (conventional directed acyclic graph). Also, we propose a global compaction algorithm of microprograms to prevent a kind of block copying by cutting the trace at a junction block. The DDM method and compaction algoristhm have been applied to the Lah's example. The results shows that the proposed algorithm is more efficient than the conventional algorithms in reducing in reducing the total execution time and control memory space.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2020.11a
• /
• pp.151-152
• /
• 2020

There is a possibility of failure as a result of field application in the planning and execution process to change the operating policy for operating terminals, so a lot of time and effort are required to reduce trial and error. In the planning stage to change the terminal operation policy, simulation technology can be used to support decision making. This study introduces a case of using a virtual terminal system among simulation technologies.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.111-113
• /
• 2015

Floats are used by the parties involved in a construction project. The owner may use float by changing order(s) or by executing risk avoidance plan; the contractor may use it for leveling resources or substituting activities' construction methods to reduce costs. Floats are accepted either just as by-product obtained by critical path method(CPM) scheduling or as asset having significant value. Succinctly, existing studies involved in float value does not consider its' changes on project time domain. It is important to identify float ownership and to quantify its' corresponding values. This paper presents a method that quantifies float value of money that changes over project execution. The method which accurately computes the monetary value of float may contributes to resolve conflicts relative to float ownership and/or delay issues among project participants. It compares the difference between the monetary value of total float - on non-critical path in each and every schedule update. It makes use of critical path method (CPM) and commercial software with which practitioners are already familiar.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.181-188
• /
• 2004

PDF(Parallel/Distributed Processing) is an internet-based parallel/distributed processing system that utilizes resources from hosts on the internet in idle state to perform large scale application through parallel processing, thus decreasing the total execution time. In this paper. do propose an adaptive method to be changed network environment at any time using realtime monitoring of host. It is found from experiments that parallel/distributed processing has better performance than its without monitoring as an adaptive strategy, which copy with task delay factor by overload and fault of network, be applicable to the cockpits of task allocation algorithm in PDP.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.36-45
• /
• 2002

This paper introduces the design and implementation of a flash memory simulator to emulate a real flash memory. Since this simulator provides exact execution time information and parameter testing functions as well as the type, total capacity, block size, and page size of flash memory, it can be used as a real flash memory as viewed by the operating system. Furthermore, the simulator provides time logging functions of the internal routines of the flash memory management software allowing the monitoring of bottlenecks within the software. Finally, we show the performance measurements of applications under the Linux operating systems on both the simulator and a test board verifying the simulator's use as a replacement for real flash memory.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.111-120
• /
• 2004

In order to increase the productivity of software, the research to reduce the total cost in software development environments is working, Considerable time is wasted waiting for a changed program in program development, however smell the change, to be edited and compiled and executed. In case of partial change, we need incremental interpreter for reexecuting the changed parts and its affected parts, In this paper, we implement the incremental interpreter by using analyzing dynamic semantics at execution time, We define a new IMPLO(IMPerative Language with Object) language using EBNF(Extended Backus Naur Form) notation and then, design and implement the incremental interpreter of this language by using action equations to describe the dynamic semantics.