• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.10
• /
• pp.367-372
• /
• 2016

In a modern smart building, sensors can detect various physical conditions, such as temperature, humidity, sound, motion, and light, which can be used in medical services and security, and for energy savings. This paper presents an efficient elevator scheduling system that utilizes smart sensor technologies with radio-frequency identification, video, and floor sensors to detect the arrival of elevator users in advance. The detected information is then delivered to the elevator scheduling system via building networks. By using this information, the proposed system makes a reservation call for efficient control of the elevator's direction and time. Experiments under a spectrum of traffic conditions show that the proposed system performs better than a legacy system with respect to average wait time, maximum wait time, and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.304-310
• /
• 2009

In this paper, we evaluate the performance of VoIP in OFDMA-based relay systems with various capabilities of relays. We classify relays according to capability as "mid-capability (MC)" and "high-capability (HC)" relay. In system with HC relays, not only base station (BS) but also relay station (RS) performs scheduling at its ova whereas only BS performs scheduling in system with MC relays using the information reported by MS (i.e. the received signal-to-interference-plus-noise ratio (SINR) of mobile station (HS), the amount of MS traffic, etc). In system with MC relays, the controling overhead of BS is larger than that of system with HC relays. However, since BS has all MS information, efficient resource allocation and scheduling is possible. We derived the "average packet delay," "good packet ratio," and "cell goodput" in a VoIP environment. The simulation results demonstrate that the system with MC relays has better VoIP performance over that with HC relays.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.2
• /
• pp.141-145
• /
• 2009

A C-to-SystemC synthesizer which processes the input behavior according to high-level synthesis, and then transforms the synthesis result into SystemC module code is implemented in this paper. In the synthesis process, the input behavioral description in C source code is scheduled using list scheduling algorithm and register allocation is performed using left-edge algorithm on the result of scheduling. In the SystemC process, the output from high-level synthesis process is transformed into SystemC module code by combining it with SystemC features such as channels and ports. The operation of the implemented C-to-SystemC synthesizer is validated through simulating the synthesis of elliptic wave filter in SystemC code. C-to-SystemC synthesizer can be used as a part of tool-chain which helps to implement SystemC design methodology covering from modeling to synthesis.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.16-26
• /
• 2001

This paper proposes an extended scheduler model that is an extension of the existing model proposed already in [4, 5], which consists of upper layer task scheduler and lower layer scheduling framework. However, in order to support aperiodic task scheduling, the task scheduler has been divided into two parts, such as periodic task control component and aperiodic task control component. Thus, the proposed model can support various bandwidth-preserving servers that can service aperiodic tasks. The model distinctly separates a classic monolithic kernel scheduler into several kernel components according to their functionality. This enables system developers to implement a new scheduling algorithm or aperiodic task server independent of complex low kernel mechanism, and reconfigure the system at need. In Real-Time Linux [6], we implemented the proposed scheduling framework representative scheduling algorithms, and server bandwidth-preserving servers on purpose to test. Throughout these implementations, we confirmed that a new algorithm or server could be developed independently without updates of complex low kernel modules. In order to verify efficiency of the proposed model, we measured the performance of several aperiodic task servers. The results showed this the performance of model, which even consisted of two hierarchical components and several modules, didnt have such high run-time overhead, and could efficiently support reconfiguration and scheduler development.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.430-436
• /
• 2007

In this paper, we assume the uplink multiuser MIMO system based on FDD. Considering the implementation of practical system, Antenna selection and Transmit Beamforming scheme are suggested. System model of both two schemes are introduced and the scheduling algorithm which approaches the optimal performance with affordable computational complexity is proposed for each transmission scheme. Simulation results show that the sum-rate of the proposed low complexity scheduler approaches the performance of brute-force scheduler which is believed to be the optimal scheme.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.4
• /
• pp.371-379
• /
• 2006

Increasing requirements for the high quality of industrial robot performance made the vibration control issue very important because the vibration makes it difficult to achieve quick response of robot motion and may bring mechanical damage to the robot. This paper presents a vibration control solution for industrial robots which have flexible joints. The joint flexibility is modeled as a two-mass system. And we analyze the vibration problem of a classical P-PI controller when it used for the flexible joints of industrial robots. Then a state feedback controller is designed for vibration suppression of the two-mass system. Finally, a gain-scheduling method is designed for maintaining control performance in spite of the time-varying nature of each joint's load side inertia. Simulation and experimental results show effective vibration suppression and uniform properties in overshoot in spite of the variation of load. The result of this study can be applied to the appropriate gain manipulation of many other mechatronic devices which have the two-mass system with varying load side inertia.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.1
• /
• pp.38-46
• /
• 2011

The OPRoS (Open Platform for Robotic Service) framework provides uniform operating environment for service robots. As an OPRoS-based service robot has to support real-time as well as non-real-time applications, application of Windows NT kernel based operating system can be restrictive. On the other hand, various benefits such as rich library and device support and abundant developer pool can be enjoyed when service robots are built on Windows NT. The paper presents a user-mode component scheduler of OPRoS, which can provide near real-time scheduling service on Windows NT based on the restricted real-time features of Windows NT kernel. The component scheduler thread with the highest real-time priority in Windows NT system acquires CPU control. And then the component scheduler suspends and resumes each periodic component executors based on its priority and precedence dependency so that the component executors are scheduled in the preemptive manner. We show experiment analysis on the performance limitations of the proposed scheduling technique. The analysis and experimental results show that the proposed scheduler guarantees highly reliable timing down to the resolution of 10ms.

• Journal of The Korean Association of Information Education
• /
• v.4 no.2
• /
• pp.140-146
• /
• 2001

Scheduling strategy in the Education-on-Demand system should be designed to service the isochronous requests from several learners with single disk retrieval to improve the performance of the system. In this paper, the scheduling strategy which reduces the disk I/O and buffer consumption by utilizing the resources of the learner's system has been proposed. All the requests from the learner are not serviced from the server but forwarded to the learner's system which preserves the requested information. Therefore, the server can increase the throughput and reduces the initial latency time of the user. The proposed strategy has been compared to the conventional method by simulations and proved to be more efficient.

• IE interfaces
• /
• v.15 no.4
• /
• pp.325-337
• /
• 2002

In this study we consider the problem of production planning of TFT-LCD(Thin Film Transistor - Liquid Crystal Display) production factory. Due to the complexities of the TFT-LCD production processes, it is difficult to schedule the production planning, and the study about automated scheduler is insufficient. In addition, the existing production method is a Push-System to raise the operation rate with expensive equipment, that has the problem to satisfy the due-date. This study presents an algorithm having a concept of Pull-System that satisfies the due-date and considers specialties of TFT-LCD production process. We make MPS(Master Production Schedule) according to the sales order, and present algorithms for scheduling about In/Out plan considering factory capacity, line balancing, material requirement, and inventory level of all Array, Cell, and Module processes. These algorithms are integrated as an automated production system, and we implement them in the actual TFT-LCD factory circumstance.