• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1098-1104
• /
• 2015

With the widespread use of smartphones and IoT (Internet of Things), data are being generated on a large scale, and there is increased for the analysis of such data. Hence, distributed processing systems have gained much attention. Hadoop, which is a distributed processing system, saves the metadata of stored files in name nodes; in this case, the main problems are as follows: the memory becomes insufficient; load occurs because of massive small files; scheduling and file processing time increases because of the increased number of small files. In this paper, we propose a solution to address the increase in processing time because of massive small files, and thus improve the processing performance, using the Reuse JVM method provided by Hadoop. Through environment setting, the Reuse JVM method modifies the JVM produced conventionally for every task, so that multiple tasks are reused sequentially in one JVM. As a final outcome, the Reuse JVM method showed the best processing performance when used together with CombineFileInputFormat.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.62-68
• /
• 2014

This paper presents a novel user selection method based on the signal-to-interference-plus-noise ratio (SINR), which is approximated using limited feedback data at the base stations (BSs) of multiple user multiple-input multiple-output (MU-MIMO) systems. In the proposed system, the codebook vector index, the quantization error obtained from the correlation between the measured channel and the codebook vector, and the measured value of the largest singular value are fed back from each user to the BS. The proposed method not only generates precoding vectors that are orthogonal to the precoding vectors of the previously selected users and are highly correlated with the codebook vector of each user but also adopts the quantization error in approximating the SINR, which eventually provides a significantly more accurate SINR than the conventional SINR-based user selection techniques. Computer simulations show that the proposed method enhances the sum rate of the conventional SINR-based methods by at least 2.4 (2.62) bps/Hz when the number of transmit antennas and number of receive antennas per user terminal is 4 and 1(2), respectively, with 100 candidate users and an SNR of 30 dB.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.25-29
• /
• 2001

There are so many researches about the search method for the most compatible dispatching rule to a manufacturing system state. Most of researches select the dispatching rule using simulation results. This paper touches upon two research topics: the clustering method for manufacturing system states using simulation, and the search method for the most compatible dispatching rule to a manufacturing system state. The manufacturing system state variables are given to ART II neural network as input. The ART II neural network is trained to cluster the system state. After being trained, the ART II neural network classifies any system state as one state of some clustered states. The simulation results using clustered system state information and those of various dispatching rules are compared and the most compatible dispatching rule to the system state is defined. Finally there are made two knowledge bases. The simulation experiments are given to compare the proposed methods with other scheduling methods. The result shows the superiority of the proposed knowledge base.

• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.213-220
• /
• 2008

This paper analyzes a broadcasting technique for wireless multi-hop sensor networks that uses a form of cooperative diversity called opportunistic large arrays (OLAs). We propose a method for autonomous scheduling of the nodes, which limits the nodes that relay and saves as much as 32% of the transmit energy compared to other broadcast approaches, without requiring global positioning system (GPS), individual node addressing, or inter-node interaction. This energy-saving is a result of cross-layer interaction, in the sense that the medium access control (MAC) and routing functions are partially executed in the physical (PHY) layer. Our proposed method is called OLA with a transmission threshold (OLA-T), where a node compares its received power to a threshold to decide if it should forward. We also investigate OLA with variable threshold (OLA-VT), which optimizes the thresholds as a function of level. OLA-T and OLA-VT are compared with OLA broadcasting without a transmission threshold, each in their minimum energy configuration, using an analytical method under the orthogonal and continuum assumptions. The trade-off between the number of OLA levels (or hops) required to achieve successful network broadcast and transmission energy saved is investigated. The results based on the analytical assumptions are confirmed with Monte Carlo simulations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.10
• /
• pp.1809-1815
• /
• 2010

This paper presents an improved method for high-resolution rotor position estimation in the permanent magnet synchronous motor (PMSM) drives with low-resolution Hall-effect sensors. The proposed method adopts a gain-scheduled full-order speed observer. Since the quantized position signal, which is obtained from Hall-effect sensors, is basically used as the input of the observer, the sixth-order harmonics are essentially included in the estimated position. To eliminate the harmonic components, the quantized position is linearized by a linear extrapolation based on the estimated average speed and futhermore the speed-depentent observer gain scheduling strategy is developed. The observer gain is also scheduled by considering the motor acceleration to improve the dynamic performance according to the changes of the motor speed and load. Several experiments are performed for 800W PMSM drive and the results demonstrate the effectiveness of the proposed method.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.50 no.11
• /
• pp.575-582
• /
• 2001

This paper presents a calculating method of switching angle for adaptive switched reluctance motor (SRM) drive of a drill. The operation of the SRM is completely characterized by the flux linked by one phase winding which depends only on the current in that same phase winding and the rotor position. An efficiently adaptive SRM drive is possible on appropriately scheduling the commutation angles with accurate rotor position, supplied current value and speed information. An adaptive SRM drive with reduction torque ripple should be controlled by an optimized phase current control along with rotor position. Therefore, we are suggested a computing method of switching turn-on and off angles for adaptationally SRM operation with varied rotor speed and load. To probe the computing method, we have some simulation and experiment, it is shown a good result that can be computing the optimized switching angles for an electric drill motor.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2080-2089
• /
• 1997

Recent evolution in compute technology makesthe multimedia processing widely availiable. Conventional storage systems do not meet the requirements of multimedia data. Several approaches were suggested to improve disk storing methods for them. Bocheck proposed a disk partitioning technique for multiple steams assuming that all steams have same retrieval intervals with the same amount data for each access. While Bocheck's one provides a good method for same period, it does not consider the case of different periods of continous media streams. This paper proposes a new partitioning technique in which a fixed number of blocks are assigned for stresms with different retrieval periodicity. The analysis shows this problem is the same as the one scheduling the steams into a given sequence. The simulation was done to compare the proposed m-sequence merge method with the conventional Scan-EDF and Partitioning methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2A
• /
• pp.130-138
• /
• 2008

In this paper, we propose a user selection method to maximize the sum-rate of downlink over opportunistic beamforming. The throughput of an opportunistic beamforming with non-uniformly distributed or a small number of users can decrease. In order to improve the throughput, we propose a scheduling method that does not use SINR or SNR but uses the effective channel gain of each user obtained from the SINR or SNR feedback. The proposed method makes it possible to select users flexibly according to the distribution of users. In numerical results, we show that the proposed methods improve the average sum-rate about 60% when users are distributed non uniformly.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.1
• /
• pp.21-28
• /
• 2013

The paper proposes an optimal sizing method of a customer's battery energy storage system (BESS) which aims at managing the electricity demand of the customer to minimize electricity cost under the time of use(TOU) pricing. Peak load limit of the customer and charging and discharging schedules of the BESS are optimized on annual basis to minimize annual electricity cost, which consists of peak load related basic cost and actual usage cost. The optimal scheduling is used to assess the maximum cost savings for all sets of candidate capacities of BESS. An optimal size of BESS is determined from the cost saving curves via capacity of BESS. Case study uses real data from an apartment-type factory customer and shows how the proposed method can be employed to optimally design the size of BESS for customer demand management.

• Industrial Engineering and Management Systems
• /
• v.11 no.4
• /
• pp.397-405
• /
• 2012

This research proposes a framework of buffer management for multi-project systems in the critical chain project management (CCPM) method, expressed in the form of max-plus linear (MPL) representation. Since time buffers are inserted in the projects for absorbing uncertainties in task durations and protecting the completion times, the proposed method provides a procedure for frequently surveying the rates of consumed buffers and the rate of elapsed times. Their relation expresses the performance of the projects which is plotted on a chart through the completed processes. The chart presents the current performance of the projects and their interaction, which alerts managers to make necessary decisions at the right time for managing each project and the entire multi-project system. The proposed framework can analyze the complex system readily, and it enables managers to make an effective decision on scheduling. The effectiveness of the framework is demonstrated through a numerical example.