• KIISE Transactions on Computing Practices
• /
• v.20 no.9
• /
• pp.483-491
• /
• 2014

Contemporary computer systems exploits DVFS (Dynamic Voltage/Frequency Scaling) technology for balancing performance and power consumption. The efficiency of DVFS depends on how much performance we get for larger power consumption due to elevated CPU frequency. Especially for memory-bounded applications, higher CPU frequency often does not result in higher performance. In this paper, we present an upper bound of CPU frequency scaling based on memory accesses. It is observed that the performance gain due to higher CPU frequency is limited by memory accesses (last level cache misses) per instructions by experiments. Using the results, we present the CPU frequency upper bound with little performance gain. Experimental results show that for a memory-bounded application, applying the frequency upper bound enhances the energy efficiency of the application by above 30%.

• Journal of Mechanical Science and Technology
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2001

The recent spread of scaled telemanipulation into microsurgery and the nano-world increasingly requires the identification of the possible operation region as a main system specification. A teleoperation system is a complex cascaded system since the human operator, master, slave, and communication are involved bilaterally. Hence, a small time delay inside a master and slave system can be critical to the overall system stability even without communication time delay. In this paper we derive an upper bound of the scaling product of position and force by using Llewellyns unconditional stability. This bound can be used for checking the validity of the designed bilateral controller. Time delay from the sample and hold of computer control and its effects on stability of scaled teleoperation are modeled and simulated based on the transfer function of the teleoperation system. The feasible operation region in terms of position and force scaling decreases sharply as the sampling rate decreases and time delays inside the master and slave increase.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.422-428
• /
• 2011

In this paper, we introduce system and channel modeling for an underwater ad hoc acoustic network with n regularly located nodes， and then analyze capacity scaling laws based on the model. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize in attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks having unit node density. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a power-limited network. Furthermore, we describe an achievable scheme based on the simple nearest-neighbor multi-hop (MH) transmission. It is shown under extended networks that the MH scheme is order-optimal for all the operating regimes expressed as functions of the attenuation parameter.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.491-497
• /
• 1993

In MIMO design, input and output units are different from each other. By this reason, the effect of larger units to smaller one is not trivial and there is no method of proper scaling, optimal scaling. In this paper, robust stability of MIMO LQG/LTR design are analised when the plnat inputs and outputs are scalled. The upper bound of model error to guarantee the robust stability is obtained, and gain margin and phase margins are computed with respect to scalling matrices.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.135-139
• /
• 2014

Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.1
• /
• pp.32-37
• /
• 2002

Applications of scaled telemanipulation into micro or nano world that shows many different features from directly human interfaced tools have been increased continuously. Here, we have to consider many aspects of scaling such as force, position, and impedance. For instance, what will be the possible range of force and position scaling with a specific level of performance and stability\ulcorner This knowledge of feasible staling region can be critical to human operator safety. In this paper, we show the upper bound of the product of force and position scaling and simulation results of 1DOF scaled system by using the Llewellyn's unconditional stability in continuous and discrete domain showing the effect of sampling rate.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.348-351
• /
• 1995

This note proposes a robust LQR method for systems with structured real parameter uncertainty based on Riccati equation approach. Emphasis is on the reduction of design conservatism in the sense of quadratic performance by utilizing the uncertainty structure. The class of uncertainty treated includes all the form of additive real parameter uncertainty, which has the multiple rank structure. To handle the structure of uncertainty, the scaling matrix with block diagonal structure is introduced. By changing the scaling matrix, all the possible set of uncertainty structures can be represented. Modified algebraic Riccati equation (MARE) is newly proposed to obtain a robust feedback control law, which makes the quadratic cost finite for an arbitrary scaling matrix. The remaining design freedom, that is, the scaling matrix is used for minimizing the upper bound of the quadratic cost for all possible set of uncertainties within the given bounds. A design example is shown to demonstrate the simplicity and the effectiveness of proposed method.

• Journal of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.1001-1016
• /
• 2019

We are concerned with optimization methods for the $L^2$-Wasserstein least squares problem of Gaussian measures (alternatively the n-coupling problem). Based on its equivalent form on the convex cone of positive definite matrices of fixed size and the strict convexity of the variance function, we are able to present an implementable (accelerated) gradient method for finding the unique minimizer. Its global convergence rate analysis is provided according to the derived upper bound of Lipschitz constants of the gradient function.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.1-9
• /
• 2008

In this paper, a simple and efficient three cell based clustered-cell coordination is proposed with well hewn zero-forcing beamforming (ZF-BF) with a semi-orthogonal user selection (SUS) as transmission and scheduling scheme. For a modified Wyner's channel model with two classes of user groups for a hexagonal cellular system, the upper bound of asymptotic sum rate scaling of ZF-BF in a proposed coordination is shown to be proportional to the number of transmit antennas and double logarithms of the number of users. The numerical results verify the efficiency of the proposed cell coordination. It is also numerically shown that ZF-BF with the SUS in CCCT actually achieves the upper bound of asymptotic sum rate sum rate scaling.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.18-25
• /
• 2014

In this paper, we propose a codebook-based interference alignment (IA) scheme in the constant multiple-input multiple-output (MIMO) interference channel especially for the uplink scenario. In our proposed scheme, we assume cooperation among base stations (BSs) through reliable backhaul links so that global channel knowledge is available for all BSs, which enables BS to compute he transmit precoder and inform its quantized index to the associated user via limited rate feedback link. We present an upper bound on the rate loss of the proposed scheme and derive the scaling law of the feedback load to maintain a constant rate loss relative to IA with perfect channel knowledge. Considering the impact of overhead due to training, cooperation, and feedback, we address the effective degrees of freedom (DOF) of the proposed scheme and derive the maximization of the effective DOF. From simulation results, we verify our analysis on the scaling law to preserve the multiplexing gain and confirm that the proposed scheme is more effective than the conventional IA scheme in terms of the effective DOF.