• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.395-400
• /
• 2004

Being aware of growing needs for wireless communication led to the development of UWB systems, this study proposed an impulse for single band UWB systems which does not count a carrier; analyzed the characteristics and the problems of pulses suggested by the existing poise of the Un system; finally, proposed TDMG(Time Delay Multiple Gaussian) pulse that generates signals of UWB without attenuation of pulse width. The hardware structure of the TDMC pulse for the single band UWB system was modelled after describing the pulse in a mathematical method in an attempt to compare with performances of the existing pulses through computer simulation. The outcome of the test unveiled the fact that each center frequency of the TDMG pulse rose approximately 1GHz, and also each l0dB fractional bandwidth of the TDMG pulse was widened over 1GHz. In the case of derivative, center frequencies of the TDMG pulse rose over 1GHz each. As a consequence, the TDMG pulse appeared to have better quality frequency, satisfying the characteristics of spectrum and the band of frequency recommended by the FCC and decreasing interference with other wireless communication systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.6
• /
• pp.306-313
• /
• 2005

Conditional branch prediction is an important technique for improving processor performance. Branch mispredictions, however, waste a large number of cycles, inhibit out-of-order execution, and waste electric power on mis-speculated instructions. Hence, the branch predictor with higher accuracy is necessary for good processor performance. In global-history-based predictors like gshare and GAg, many mispredictions come from commit update of the history. Some works on this subject have discussed the need for speculative update of the history and recovery mechanisms for branch mispredictions. In this paper, we present a simple mechanism for recovering the branch history after a misprediction. The proposed mechanism adds an age_counter to the original predictor and doubles the size of the branch history register. The age_counter counts the number of outstanding branches and uses it to recover the branch history register. Simulation results on the Simplescalar 3.0/PISA tool set and the SPECINTgS benchmarks show that gshare and GAg with the proposed recovery mechanism improved the average prediction accuracy by 2.14$\%$ and 9.21$\%$, respectively and the average IPC by 8.75$\%$ and 18.08$\%$, respectively over the original predictor.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.230-245
• /
• 2002

Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and is represented as a priority to be used by schedulers. Recently, security has become another important issue in many real-time applications. In many systems, sensitive information is shared by multiple users with different levees of security clearance. As more advanced database systems are being used in applications that need to support timeliness while managing sensitive information, there is an urgent need to develop concurrency control protocols in transaction management that satisfy both timing and security requirements. In this paper, we propose two concurrence control protocols that ensure both security and real-time requirements. The proposed protocols are primarily based on multiversion locking. However, in order to satisfy timing constraint and security requirements, a new method, called the FREEZE, is proposed. In addition, we show that our protocols work correctly and they provide a higher degree of concurrency than existing multiversion protocols. We Present several examples to illustrate the behavior of our protocols, along with performance comparisons with other protocols. The simulation results show that the proposed protocols can achieve significant performance improvement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.5
• /
• pp.213-217
• /
• 2001

Excessive memory buffer requirement in continuous media playback is a serious impediment of wide spread usage of on-line multimedia service. Skewed access frequency of available video files provides an opportunity of re-using the date blocks which has been loaded by one session for later usage. We present novel algorithm which minimizes the buffer requirement in multiple sessions of multimedia playbacks. In continuous media playback originated from the disk, a certain amount of memory buffer is required to synchronize asynchronous disk. Read operation and synchronous playback operation. As aggregate playback bandwodth increases, larger amount of buffer needs to be allocated for this synchronization purpose. The focus of this work is to study the asymptotic behavior of the synchronization buffer requirement and to develop an algorithm coping with this excessive buffer requirement under bandwidth congestioon. We argue that in a large scale continuous media server, it may not be necessary to read the blocks for each session directly from the disk. The beauty of our work lies in the fact that it dynamically adapts to disk utilization of the server and finds the optimal way of servicinh the individual sessions while minimizing the overall buffer space requirement. Optimality of the proposed algorithm is shown by proof. The effectiveness and performance of the proposed scheme is examined via simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.867-879
• /
• 2006

This paper concerns fast and time accurate HW/SW cosimulation for MPSoC(Multi-Processor System-on-chip) architecture where multiple software and/or hardware components exist. It is becoming more and more common to use MPSoC architecture to design complex embedded systems. In cosimulation of such architecture, as the number of the component simulators participating in the cosimulation increases, the time synchronization overhead among simulators increases, thereby resulting in low overall cosimulation performance. Although SystemC cosimulation frameworks show high cosimulation performance, it is in inverse proportion to the number of simulators. In this paper, we extend the novel technique, called virtual synchronization, which boosts cosimulation speed by reducing time synchronization overhead: (1) SystemC simulation is supported seamlessly in the virtual synchronization framework without requiring the modification on SystemC kernel (2) Parallel execution of component simulators with virtual synchronization is supported. We compared the performance and accuracy of the proposed parallel SystemC cosimulation framework with MaxSim, a well-known commercial SystemC cosimulation framework, and the proposed one showed 11 times faster performance for H.263 decoder example, while the accuracy was maintained below 5%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.341-348
• /
• 2009

In this paper, we propose a grouping technique for the SDD(Synchronous Digital Duplexing) based on OFDMA(Orthogonal Frequency Division Multiple Access). The SDD has advantages of increasing data efficiency and flexibility of resource since SDD can transmit uplink signals and downlink signals simultaneously by using mutual time information and mutual channel information, obtained during mutual ranging process. However, the SDD has a disadvantage of requiring additional CS to maintain orthogonality of OFDMA symbols when the sum of mutual time difference and mutual channel length between AP(access point) and SS(subscriber station) or among SSs are larger than CP length. In order to minimize the length of CS for the case of requiring additional CS in SDD, we proposes a grouping technique which controls transmit timing and receive timing of AP and SS in a cell by classifying them into groups. Performances of the proposed grouping technique are evaluated by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8C
• /
• pp.742-749
• /
• 2009

In this paper, we propose mitigation techniques using time-domain shortening filter (TSF) and frequency-domain shortening filter (FSF) to overcome inter-block interference (IBn and inter-carrier interference (ICn due to the time difference of arrival (TDoA) and carrier frequency offset (CFO) between downlink and uplink signals from access point (AP) and subscriber station (SS) in synchronous digital duplexing (SDD)/orthogonal frequency division multiple access (OFDMA) systems for indoor wireless communication. The proposed TSF and FSF maximize SIR for shortening in time (SIRST) and SINR for shortening in frequency (SINRSF), respectively, by using channel impulse responses and timing information among stations, obtained from mutual ranging procedure. It is verified by computer simulation that the proposed TSF and FSF reduce effectively the effects of IBI and ICI in the SDD/OFDMA systems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.12
• /
• pp.502-512
• /
• 2019

To examine the problem structure of balanced regional development policy and identify the causes of the gap between the capital and non-capital areas, this study examined the causal structure in terms of the concentration and distribution of functions in the metropolitan area and non-capital area and explored the policy leverage. As a research method, the causal map was drawn using System Dynamics techniques and policy leverage was derived through an exploration of the feedback structure. In particular, the causes of the problems in balanced regional development policies were approached by system accidents rather than by single-circuit accidents, and causality analysis was performed among the variables constituting balanced regional development policies based on system accidents. In particular, it singled out 31 variables, developed 13 feedback loops, and confirmed four major policy leverages, including relocation of the capital function, local decentralization policies, consistent development, and investment practices centered on the Non­Capital Area. Subsequently, a follow-up study by computer simulation is needed by modeling the structure of the system to identify the ripple effect of the policies of the Capital Area on the Non­Capital Area.