• The Transactions of the Korean Institute of Electrical Engineers D
• /
• 제53권8호
• /
• pp.594-601
• /
• 2004

We analyze checkpoint strategy for multiple real-time periodic tasks with hard deadlines. Real-time tasks usually have deadlines associated with them. For multiple real-time tasks, checkpoint strategy considering deadlines of all tasks is very difficult to derive. We analyze the problem of checkpoint placement for such multiple periodic tasks. In our strategy, the interval between checkpoints is determined for each task considering its deadline. An approximated failure probability over a specified interval is derived. Then the number of checkpoints for each task is selected to minimize the approximated failure probability. To show the usefulness of our strategy, error bound between the exact and the approximated failure probability is estimated, which is revealed to be quite small.

• Journal of the Korean Society for Precision Engineering
• /
• 제13권8호
• /
• pp.175-183
• /
• 1996

This paper presents three-dimensional robot task using the vision control method. A minimum of two cameras is required to place points on end dffectors of n degree-of-freedom manipulators relative to other bodies. This is accomplished using a sequential estimation scheme that permits placement of these points in each of the two-dimensional image planes of monitoring cameras. Estimation model is developed based on a model that generalizes known three-axis manipulator kinematics to accommodate unknown relative camera position and orientation, etc. This model uses six uncertainty-of-view parameters estimated by the iteration method.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• 제26권1호
• /
• pp.50-58
• /
• 2017

This paper proposes a real-time robotic vision control scheme using the weighting matrix to efficiently process the vision data obtained during robotic movement to a target. This scheme is based on the vision system model that can actively control the camera parameter and robotic position change over previous studies. The vision control algorithm involves parameter estimation, joint angle estimation, and weighting matrix models. To demonstrate the effectiveness of the proposed control scheme, this study is divided into two parts: not applying the weighting matrix and applying the weighting matrix to the vision data obtained while the camera is moving towards the target. Finally, the position accuracy of the two cases is compared by performing the slender bar placement task experimentally.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1501-1518
• /
• 2016

This paper presents an effective management of VM (Virtual Machine) for heterogeneous cloud using Common Deployment Model (CDM) brokering mechanism. The effective utilization of VM is achieved by means of task scheduling with VM placement technique. The placements of VM for the physical machine are analyzed with respect to execution time of the task. The idle time of the VMis utilized productively in order to improve the performance. The VMs are also scheduled to maintain the state of the current VM after the task completion. CDM based algorithm maintains two directories namely Active Directory (AD) and Passive Directory (PD). These directories maintain VM with proper configuration mapping of the physical machines to perform two operations namely VM migration and VM roll back. VM migration operation is performed from AD to PD whereas VM roll back operation is performed from PD to AD. The main objectives of the proposed algorithm is to manage the VM's idle time effectively and to maximize the utilization of resources at the data center. The VM placement and VM scheduling algorithms are analyzed in various dimensions of the cloud and the results are compared with iCanCloud model.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• 제38권3호
• /
• pp.247-255
• /
• 1989

This paper proposes an error model with integral action and a pole-place-ment self-tuning controller for robot manipulators in task coordinates. The controller can reject the offset due to any load disturbance without a detailed description of the robot dynamics. The error model parameters are estimated by the recursive least square identification algorithms, and controller parameters are determined by the pole-placement method. A computer simulation study has been conducted to demonstrate the performance of the proposed control system in task coordinates for a 3-joint and 2-link spatial robot manipulator with payload.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제61권1호
• /
• pp.148-154
• /
• 2012

For a successful checkpointing strategy, we should place checkpoints so as to optimize fault-tolerance capability of real-time systems. This paper presents a novel scheme of checkpoint placement for real-time systems with periodic multi-tasks. Under the influence of transient faults, multi-tasks are scheduled by the Rate Monotonic (RM) algorithm. The optimal checkpoint intervals are derived to maximize the probability of task completion. In particular, this paper is concerned about the general case that the deadline of a task is longer than the period. Compared with the special condition that the deadline is equal to or less than the period, this general case causes a more complicate test procedure for schedulability of the RM algorithm with respect to a given set of checkpoint re-execution vectors. The probability of task completion is also derived in a more complex form. A case study is given to show the applicability of the proposed scheme.

• Journal of Electrical Engineering and information Science
• /
• 제3권3호
• /
• pp.292-299
• /
• 1998

Placement of multiple dies on an MCM or high-performance VLSI substrate is a non-trivial task in which multiple criteria need to be considered simultaneously to obtain a true multi-objective optimization. Unfortunately, the exact physical attributes of a design are not known in the placement step until entire design process is carried out. When the performance issues are considered, crosstalk noise constraints in the form of net separation and via constraint become important. In this paper, for better performance and wirability estimation during placement for MCMs, several performance constraints are taken into account simultaneously. A graph-based wirability estimation along with the Genetic placement optimization technique is proposed to minimize crosstalk, crossing, wirelength and the number of layers. Our work is significant since it is the first attempt at bringing the crosstalk and other performance issues into the placement domain.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.1998-2014
• /
• 2016

In recent years, cloud computing services based on smart phones and other mobile terminals have been a rapid development. Cloud computing has the advantages of mass storage capacity and high-speed computing power, and it can meet the needs of different types of users, and under the background, mobile cloud computing (MCC) is now booming. In this paper, we have put forward a new classification-based virtual machine placement (CBVMP) algorithm for MCC, and it aims at improving the efficiency of virtual machine (VM) allocation and the disequilibrium utilization of underlying physical resources in large cloud data center. By simulation experiments based on CloudSim cloud platform, the experimental results show that the new algorithm can improve the efficiency of the VM placement and the utilization rate of underlying physical resources.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• 제29A권9호
• /
• pp.76-84
• /
• 1992

The DSP silicon compiler consists of language compiler, module generator, placement tool, router, layout generation tools, and simulator. In this paper, The language compiler, the module generator, placement tool, and simulator were developed and provided for the system designer. The language compiler translates the designer's system description language into the intermediate form file. The intermediate form file expresses the interconnections and specifications of the cells in the cell library. The simulator was developed and provided for the behavioral verification of the DSP system. For its implementation, the event-driven technique and the C$^{++}$ task library was used. The module generator was developed for the layout of the verified DSP system, and generates the functional block to be used in the DSP chip. And then the placement tool determines the appropriate positions of the cells in the DSP chip. In this paper, the placement tool was implemented by Min-Cut and Simulated Annealing algorithm. The placement process can be controlled by the several conditions input by the system designer.

• Journal of KIISE:Databases
• /
• 제30권3호
• /
• pp.310-319
• /
• 2003

Workflow is defined as the automation of a business process, and consists of interrelated workflow tasks. Because many modem business processes nay involve activities that are geographically distributed between different departments or organizations, workflow inherently has the characteristics of distribution. In distributed workflow systems, each workflow task performs its assigned role by utilizing information resources placed at some hosts, and then transmits workflow execution control to the next tasks in a workflow definition. Hence, it is very important to appropriately allocate workflow tasks to hosts for high performance workflow processing. In this paper, we propose a multilevel workflow graph partitioning scheme for efficient placement of workflow tasks. This method can improve the performance of workflow processing by minimizing the remote communication costs occurred during workflow execution.