• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.287-307
• /
• 2018

There are two targets to schedule parallel jobs in the Cloud: (1) scheduling the jobs as many as possible, and (2) reducing the average execution time of the jobs. Most of previous work mainly focuses on the computing speed of resources without considering other attributes, such as bandwidth, memory and so on. Especially, past work does not consider the supply-demand condition from those attributes. Resources have different attributes, considering those attributes together makes the scheduling problem more difficult. This is the problem that we try to solve in this paper. First of all, we propose a new parallel job scheduling method based on a classification method of resources from different attributes, and then a scheduling method-CPLMT (Cloud parallel scheduling based on the lists of multiple attributes) is proposed for the parallel tasks. The classification method categories resources into different kinds according to the number of resources that satisfy the job from different attributes of the resource, such as the speed of the resource, memory and so on. Different kinds have different priorities in the scheduling. For the job that belongs to the same kinds, we propose CPLMT to schedule those jobs. Comparisons between our method, FIFO (First in first out), ASJS (Adaptive Scoring Job Scheduling), Fair and CMMS (Cloud-Minmin) are executed under different environments. The simulation results show that our proposed CPLMT not only reduces the number of unfinished jobs, but also reduces the average execution time.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.5
• /
• pp.67-76
• /
• 2008

Grid computing has a large scale virtual computing environment that enables a collaborative processing through sharing resources of geographically distributed organizations. In recent year, the development of wireless networks and mobile devices enables mobile devices to consider as a resource of the grids. However, there are some problems such as low performance of processors, small capacity of storages, limited capacity of battery, and low bandwidth. In this paper, to overcome these limitations occurred in mobile grid environments, we proposed a proxy-based mobile grid system. Our proposed system enables mobile devices to play roles as a resource consumer and a resource provider and to collaborate with wired grids through a mobile router. Also, we propose an adaptive job scheduling scheme to cope with context changes of mobile devices and compare our scheduling scheme with other scheduling schemes using a simulation tool, SimGrid, to verify the validity of our job scheduling scheme.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.1
• /
• pp.52-57
• /
• 2005

The adaptive multirate wideband (AMR-WB) speech coder has an extended audio bandwidth from 50 Hz to 7 kBz and operates on nine speech coding bit-rates from 6.6 to 23.85 kbit/s. In this Paper, we present the real-time implementation of AMR-WB speech coder using 16bit fixed-point TMS320C5509 that has dual MAC units. Firstly, We implemented AMR-WB speech coder in C 1anguage level using intrinsics, and then performed optimization in assembly language. The computational complexity of the implemented AMR-WB coder at 23.85 kbit/s is 42.9 Mclocks. And this coder needs the program memory of 15.1 kwords, data ROM of 9.2 kwords and data RAM of 13.9 kwords.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.899-905
• /
• 2017

This paper presents a reference-less dual loop clock and data recovery (CDR) circuit that supports a data rate of 2.496 Gb/s for the mobile industry processor interface (MIPI) M-PHY. An adaptive loop bandwidth scheme is used to implement the fast lock time maintaining a low time jitter. To this scheme, the proposed CDR consists of two loops for a frequency locked loop and a phase locked loop. The proposed 2.496 Gb/s reference-less dual loop CDR is designed using a 65 nm CMOS process with 1.2 V supply voltage. The simulated peak-to-peak jitter of output clock is 9.26 ps for the input data of 2.496 Gb/s pseudo-random binary sequence (PRBS) 15. The active area and power consumption of the implemented CDR are $470{\times}400{\mu}m^2$ and 6.49 mW, respectively.

• Journal of Power Electronics
• /
• v.16 no.5
• /
• pp.1904-1917
• /
• 2016

The moving average filter (MAF) is widely utilized to improve the disturbance rejection capability of phase-locked loops (PLLs). This is of vital significance for the grid-integration and stable operation of power electronic converters to electric power systems. However, the open-loop bandwidth is drastically reduced after incorporating a MAF into the PLL structure, which makes the dynamic response sluggish. To overcome this shortcoming, some new techniques have recently been proposed to improve the transient response of MAF-based PLLs. In this paper, a comprehensive performance comparison of advanced MAF-based PLL algorithms is presented. This comparison includes HPLL, MPLC-PLL, QT1-PLL, and DMAF-PLL. Various disturbances, such as grid voltage sag, voltage flicker, harmonics distortion, phase-angle and frequency jumps, DC offsets and noise, are considered to experimentally test the dynamic performances of these PLL algorithms. Finally, an improved positive sequence extraction method for a HPLL under the frequency jumps scenario is presented to compensate for the steady-state error caused by non-frequency adaptive DSC, and a satisfactory performance has been achieved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.181-192
• /
• 2003

Blind equalization of communication channel is important because it does not need training signal, nor does it require a priori channel information. So, we can increase the bandwidth efficiency. The linear prediction error method is perhaps the most attractive in practice due to the insensitive to blind channel equalizer length mismatch as well as for its simple adaptive implementation. Unfortunately, the previous one-step prediction error method is known to be limited in arbitrary decision delay. In this paper, we propose method for fractionally spaced blind equalizer with arbitrary decision delay using one-step forward prediction error filter from second-order statistics of the received signals for SIMO channel. Our algorithm utilizes the forward prediction error as training signal and computes the best decision delay from all possible decision delay. Simulation results are presented to demonstrate the performance of our proposed algorithm.

• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.696-706
• /
• 2008

In this paper we show the performance of the network-adaptive high-definition scalable video streaming using QWLAN board with IEEE 802.11e MAC monitoring and control. Realtime collected MAC parameters are used to determine which video data is extracted for the predicted available bandwidth. To achieve performance, extraction through R-D is proposed instead of the standard video packet extraction. It is shown through experiments that streaming video quality can be enhanced by fast adaptation to network conditions by using the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6B
• /
• pp.575-583
• /
• 2004

In this paper, we extend the multiple time scale control framework to the window-based congestion control, in particular, such as the TCP. This is performed by interfacing the TCP with a large time scale control module which adjusts the aggressiveness of the bandwidth consumption behavior exhibited by the TCP as a function of large time scale Self-Similar network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by the RTT. How to effectively utilize such an information-due to its probabilistic nature, dispersion over the multiple time scales, and affection on the top of the existing window-based congestion controls-is a non-trivial problem. The evaluation performance of the multiple time scale TCP is facilitated by a simulation of the bench-mark environment which is based on the physical modeling of a self-similar traffic. We explicate our methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under the self-similar traffic conditions. We discuss issues arising in the comparative performance evaluation under heavy-tailed workloads.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.57-64
• /
• 2009

This paper presents the hardware implementation of the pyramidal KLT(Kanade-Lucas-Tomasi) feature tracker. Because of its high computational complexity, it is not easy to implement a real-time KLT feature tracker using general-purpose processors. A hardware implementation of the pyramidal KLT feature tracker using FPGA(Field Programmable Gate Array) is described in this paper with emphasis on 1) adaptive adjustment of threshold in feature extraction under diverse lighting conditions, and 2) modification of the tracking algorithm to accomodate parallel processing and to overcome memory constraints such as capacity and bandwidth limitation. The effectiveness of the implementation was evaluated over ones produced by its software implementation. The throughput of the FPGA-based tracker was 30 frames/sec for video images with size of $720{\times}480$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.676-682
• /
• 2002

In this paper, an effective stereo image compression and reconstruction technique using a new adaptively compensated-disparity prediction scheme is proposed. That is, by adaptively predicting the mutual correlation between the stereo image using the proposed method, the bandwidth of the stereo input image can be compressed to the level of the conventional 2D image and the predicted image also can be effectively reconstructed using this transmitted reference image and disparity data in the receiver. Especially, in the proposed method, once the feature values are extracted from the input stereo image, then the matching window size for the predicted image reconstruction is adaptively selected in accordance with the magnitude of this feature values. From this adaptive disparity estimation method, reduction of the mismatching probability of the disparity vectors is expected and as a result, the image quality in the reconstructed image can be improved. In addition, from some experiments using the CCETT's stereo images of 'Fichier', 'Manege' and 'Tunnel', it is shown that the proposed method improves the PSNR of the reconstructed image to about 9.08 dB on average by comparing with that of the conventional methods. And also, it is found that there is almost no difference between the original image and the predicted image reconstructed through the proposed method by comparison to that of the conventional methods.