• Korean Journal of Childcare and Education
• /
• v.6 no.2
• /
• pp.1-15
• /
• 2010

The purpose of this study is to investigate the difference between using computers for an Information Literacy Abilities of Young Children(ILAYC) and development of the ILAYC, with regard to following factors: computer use at home, learning in educational facilities for early childhood, and parents' recognition toward computer-assisted education. The data were obtained from random sampling of 4-year old children in educational facilities for early childhood located in J city. The research was conducted in order to measure ILAYC, using the questionnaire for teachers from September 3 to 27, 2009. The t-test to investigate computer utilization ability and information literacy ability for young children revealed that the ILAYC was not significantly influenced by their computer use at home, while the ILAYC varied with learning in educational facilities and parents' recognition toward computer-assisted education. These are resulted from parents' different recognition toward computer-assisted education when they select an educational facility for early childhood.

• Journal of Computing Science and Engineering
• /
• v.8 no.1
• /
• pp.43-56
• /
• 2014

Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SS-DRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2213-2221
• /
• 2015

The ondemand governor used in android-based smartphone platforms is a CPU frequency scaling technique. The ondemand governor sets the CPU operating frequency depending on the CPU utilization rate. Job scheduling affects the CPU utilization rate. The power consumption is proportional to the value of operating frequency. Consequently, CPU frequency scaling and CPU utilization rate have an effect on power consumption in a smartphone. In this paper, we evaluated the performance of job scheduling techniques incorporating the ondemand governor in terms of CPU utilization, power consumption, and job deadline miss ratio.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.30-43
• /
• 2013

Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This work proposes an energy aware, offline, probability-based unified scheduling and mapping algorithm for multiprocessor systems, to minimize the number of processors used, maximize the utilization of the processors, and optimize the energy consumption of the multiprocessor system. The proposed algorithm is implemented, simulated and evaluated with synthetic task graphs, and compared with classical scheduling algorithms for the number of processors required, utilization of processors, and energy consumed by the processors for execution of the application task graphs.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.105-108
• /
• 2013

The commercialization of UCC was already initiated, and there are some successful cases like 'YouTube.' However, the development level of UCC is not mature, stable yet. It's because most of the UCC users are young people and the contents are mainly about humor, funny, minor story. In other words, the practical use of UCC is not totally popularized but partly active. Therefore we want to think out 'how UCC can be utilized by many people and applicable to many industries.' UCC has enough possibility to be advanced, and it will greatly influence the society. In this paper, we will first explain Web 2.0 and the present conditions of online movies. After analyzing the problems and limitation of today, we will propose some suggestions for plans for practical utilization of UCC.

• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.4
• /
• pp.401-404
• /
• 2003

In most resource reservation strategies, which give higher priorities to handoff calls over new calls, new calls are often blocked even though there is plenty of available reserved resource. This causes inefficient resource utilization, especially when there are not so many handoff attempts. In this paper, we propose a new reservationstrategy called soft reservation in which new calls can be allocated to the reserved resource while maintaining the QoS of handoff acceptable. Using an M/M/c/c queuing model, we can see that the proposed strategy provides better performance than the conventional reservation strategy in terms of blocking probability of new call and dropping probability of handoff calls.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.117-135
• /
• 2016

Performance enhancement is one of the most important issues in high performance distributed computing systems. In such computing systems, online users submit their jobs anytime and anywhere to a set of dynamic resources. Jobs arrival and processes execution times are stochastic. The performance of a distributed computing system can be improved by using an effective load balancing strategy to redistribute the user tasks among computing resources for efficient utilization. This paper presents a multi-class load balancing strategy that balances different classes of user tasks on multiple heterogeneous computing nodes to minimize the per-class mean response time. For a wide range of system parameters, the performance of the proposed multi-class load balancing strategy is compared with that of the random distribution load balancing, and uniform distribution load balancing strategies using simulation. The results show that, the proposed strategy outperforms the other two studied strategies in terms of average task response time, and average computing nodes utilization.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.258-265
• /
• 2003

Transmission of continuous media streams has been a challenging problem of multimedia service. Lots of works have been done trying to figure out the best solution for this problem, and some works presented the optimal solution for transmitting the stored video using smoothing schemes applied to each individual stream. But those smoothing schemes considered only one stream, not the whole streams being serviced, to apply themselves, which could only achieve local optimum not the global optimum. Most of all, they did not exploit statistical multiplexing gain that can be obtained before smoothing. In this paper, we propose a new smoothing scheme that deals with not an individual stream but the whole streams being serviced simultaneously to achieve the optimal network bandwidth utilization and maximize the number of streams that can be serviced simultaneously. We formally proved that the proposed scheme not only provides deterministic QoS for each client but also maximizes number of clients that can be serviced simultaneously and hence achieves maximum utilization of transmission bandwidth.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.2
• /
• pp.84-89
• /
• 2001

In this paper, an improved protocol of Multi-Link Switching Method is proposed by supplementing a concurrent processing function. This protocol is proposed to complement the shortcomings of the conventional Multi-Link Switching Method which is used for the medium access in LAN. We analyzed the improved protocol in channel utilization viewpoint and compared the result with that of the conventional protocol From this result, we showed that the channel utilization of the improved protocol is superior to that of the conventional protocol when the maximum normalized propagation delay is increased.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.84-89
• /
• 2003

In this Paper, an improved protocol is proposed by supplementing a control station for transmission cycle management. This protocol is proposed to complement the shortcomings of the conventional L-Expressnet protocol which is used for round robin process in bus topology. We analyzed the improved protocol in channel utilization viewpoint and compared the result with that of the conventional protocol. From this result, we showed that the channel utilization of the improved protocol is superior to that of the conventional protocol when a maximum normalized propagation delay is increased.