• Journal of the Korean Solar Energy Society
• /
• v.33 no.3
• /
• pp.1-8
• /
• 2013

In order to identify positive or negative effect of seawall on wind turbine, a wind tunnel experiment has been conducted with a 1/100 scaled-down model of Goonsan wind farm which is located in West coast along seawall. Wind speedup due to the slope of seawall contributed to about 3% increment of area-averaged wind speed on rotor-plane of a wind turbine which is anticipated to augment wind power generation. From the turbulence measurement and flow visualization, it was confirmed that there would be no negative effect due to flow separation because its influence is confined below wind turbine blades' sweeping height.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.1-16
• /
• 1995

The performance of a computer system depends on the system architecture and workload, and the high performance required in many applications can be achieved by the scalability of the system architecture and workload. This paper presents scalable workload, a performance metric of scalable speedup and hierarchical modeling for the scalable computer system as well as the development of the object-oriented simulator spmplC++ Which is an advanced C++ version of the discrete event-driven simulation environment smplE. In addition, this paper presents two examples of applying scalable speedup, hierarchical modeling and simulator smplC++ to analyze the performance effect of the sclcbility in a multiprocessor system and a network-based client/server system.

• Nuclear Engineering and Technology
• /
• v.48 no.2
• /
• pp.339-350
• /
• 2016

Based on the resonance integral (RI) tables produced by the NJOY program, the conventional subgroup method usually ignores both the resonance elastic scattering and the resonance interference effects. In this paper, on one hand, to correct the resonance elastic scattering effect, RI tables are regenerated by using the Monte Carlo code, OpenMC, which employs the Doppler broadening rejection correction method for the resonance elastic scattering. On the other hand, a fast resonance interference factor method is proposed to efficiently handle the resonance interference effect. Encouraging conclusions have been indicated by the numerical results. (1) For a hot full power pressurized water reactor fuel pin-cell, an error of about +200 percent mille could be introduced by neglecting the resonance elastic scattering effect. By contrast, the approach employed in this paper can eliminate the error. (2) The fast resonance interference factor method possesses higher precision and higher efficiency than the conventional Bondarenko iteration method. Correspondingly, if the fast resonance interference factor method proposed in this paper is employed, the $k_{inf}$ can be improved by ~100 percent mille with a speedup of about 4.56.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.35-53
• /
• 1997

This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

• New & Renewable Energy
• /
• v.9 no.1
• /
• pp.6-11
• /
• 2013

Jeollabuk-do has announced a future plan for the Saemangeum Wind Farm which includes the installation of fourteen wind turbines in a single line, located 500m back from the Saemangeum Seawall. It is anticipated as a positive effect that, for sea breeze blowing toward land, the average wind speed could be accelerated and the wind speed distribution could be uniformized by dint of the seawall, an upstream structure of the turbines. At the same time it is also anticipated as a negative effect that the strength of wind turbulence could be increased due to the flow separation generated at the back end of the seawall. According to the results of the computational fluid dynamics analysis of this paper, it has been observed that, at the 50m zone on the road surface located at the uppermost part of the Saemangeum Seawall, the average wind speed has been accelerated by approximately 6~7% and that wind shear has been decreased by 70%, but this positive effect disappears in the zone situated beyond the 100m from the back end of the seawall. It has also been observed that flow separation exists to a limited extent only below the bottom of the blade-sweeping circle and, furthermore, does not extend very far downstream of the wind. As a conclusion, it can be said that the seawall neither positively nor negatively affects the proposed Saemangeum Seawall Wind Farm layout.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.116-126
• /
• 2015

In a distributed heterogeneous computing system, the performance of a parallel application greatly depends on its task scheduling algorithm. Therefore, in order to improve the performance, it is essential to consider some factors that can have effect on the performance of the parallel application in a given environment. One of the most important factors that affects the total execution time is a critical path. In this paper, we propose the CLTS algorithm for a task scheduling. The CLTS sets the priorities of all nodes to improve overall performance by applying leveling method to improve parallelism of task execution and by reducing the delay caused by waiting for execution of critical nodes in priority phase. After that, it conditionally uses insertion based policy or duplication based policy in processor allocation phase to reduce total schedule time. To evaluate the performance of the CLTS, we compared the CLTS with the DCPD and the HCPFD in our simulation. The results of the simulations show that the CLTS is better than the HCPFD by 7.29% and the DCPD by 8.93%. with respect to the average SLR, and also better than the HCPFD by 9.21% and the DCPD by 7.66% with respect to the average speedup.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.4
• /
• pp.21-29
• /
• 1998

As silicon geometry shrinks into deep submicron and the operating speed icreases, higher accuracy is required in the analysis of the propagation delays of the gates and interconnects in an ASIC. In this paper, the driving characteristics of a CMOS gate is represented by a gatedriver model, consisting of a linear resistor $R_{dr}$ and an independent ramp voltage source $V_{dr}$ . We drivered $R_{dr}$ and $V_{dr}$ as the functions of the timing data representing gate driving capability and an effective capacitance $C_{eff}$ reflecting resistance shielding effect by interconnet circuits. Through iterative applications of these equations and AWE algorithm, $R_{dr}$ , $V_{dr}$ and $C_{eff}$ are comuted simulataneously. then, the gate delay is decided by $C_{eff}$ and the interconnect circuit delay is determined by $R_{dr}$ and $V_{dr}$ . this process has been implemented as an ASIC timing analysis program written in C language and four real circuits were analyzed. In all cases, we found less than 5% of errors for both of gate andinterconnect circuit delays with a speedup factor ranging from a few tens to a few hundreds, compared to SPICE.SPICE.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4467-4486
• /
• 2016

Discrete cosine transform (DCT) based JPEG standard significantly improves the coding efficiency of image compression, but it is unacceptable event in serious blocking artifacts at low bit rate and low efficiency of high-definition image. In the light of all phase digital filtering theory, this paper proposes a novel transform based on discrete sine transform (DST), which is called all phase discrete sine biorthogonal transform (APDSBT). Applying APDSBT to JPEG scheme, the blocking artifacts are reduced significantly. The reconstructed image of APDSBT-JPEG is better than that of DCT-JPEG in terms of objective quality and subjective effect. For improving the efficiency of JPEG coding, the structure of JPEG is analyzed. We analyze key factors in design and evaluation of JPEG compression on the massive parallel graphics processing units (GPUs) using the compute unified device architecture (CUDA) programming model. Experimental results show that the maximum speedup ratio of parallel algorithm of APDSBT-JPEG can reach more than 100 times with a very low version GPU. Some new parallel strategies are illustrated in this paper for improving the performance of parallel algorithm. With the optimal strategy, the efficiency can be improved over 10%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1649-1665
• /
• 2021

In view of the low accuracy of the traditional FunkSVD algorithm, and in order to improve the computational efficiency of the algorithm, this paper proposes a parallel algorithm of improved FunkSVD based on Spark (SP-FD). Using RMSProp algorithm to improve the traditional FunkSVD algorithm. The improved FunkSVD algorithm can not only solve the problem of decreased accuracy caused by iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, thereby achieving the effect of improving the accuracy of the algorithm. And using the Spark big data computing framework to realize the parallelization of the improved algorithm, to use RDD for iterative calculation, and to store calculation data in the iterative process in distributed memory to speed up the iteration. The Cartesian product operation in the improved FunkSVD algorithm is divided into blocks to realize parallel calculation, thereby improving the calculation speed of the algorithm. Experiments on three standard data sets in terms of accuracy, execution time, and speedup show that the SP-FD algorithm not only improves the recommendation accuracy, shortens the calculation interval compared to the traditional FunkSVD and several other algorithms but also shows good parallel performance in a cluster environment with multiple nodes. The analysis of experimental results shows that the SP-FD algorithm improves the accuracy and parallel computing capability of the algorithm, which is better than the traditional FunkSVD algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1457-1470
• /
• 2015

In wireless multimedia sensor networks (WMSN), the latency of transmission is an increasingly problem. With the improvement of resolution, the time cost in image and video compression is more and more, which seriously affects the real-time of WMSN. In JPEG system, the core of the system is DCT, but DCT-JPEG is not the best choice. Block-based DCT transform coding has serious blocking artifacts when the image is highly compressed at low bit rates. APBT is used in this paper to solve that problem, but APBT does not have a fast algorithm. In this paper, we analyze the structure in JPEG and propose a parallel framework to speed up the algorithm of JPEG on GPU. And we use all phase biorthogonal transform (APBT) to replace the discrete cosine transform (DCT) for the better performance of reconstructed image. Therefore, parallel APBT-JPEG is proposed to solve the real-time of WMSN and the blocking artifacts in DCT-JPEG in this paper. We use the CUDA toolkit based on GPU which is released by NVIDIA to design the parallel algorithm of APBT-JPEG. Experimental results show that the maximum speedup ratio of parallel algorithm of APBT-JPEG can reach more than 100 times with a very low version GPU, compared with conventional serial APBT-JPEG. And the reconstructed image using the proposed algorithm has better performance than the DCT-JPEG in terms of objective quality and subjective effect. The proposed parallel algorithm based on GPU of APBT also can be used in image compression, video compression, the edge detection and some other fields of image processing.