• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.4
• /
• pp.18-29
• /
• 2019

A dynamic adaptive streaming server consumes high processor power because it handles a large amount of transcoding operations at a time. For this purpose, multi-processor architecture is mandatory for which effective transcoding task distribution strategies are essential. In this paper, we present the design and implementation details of the transcoding workload distribution schemes at a 2-tier (frontend node and backend node) transcoding server. For this, we implemented four schemes: 1) allocation of transcoding tasks to appropriate back-end nodes, 2) task scheduling in the back-end node and 3) the communication between front-end and back-end nodes. Experiments were conducted to compare the estimated and the actual power consumption in a real testbed to verify the efficacy of the system. It also proved that the system can reduce the load on each node to optimize the power and time used for transcoding.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.463-468
• /
• 2016

The overall performance of multiuser systems significantly depends on how effectively and fairly manage resources shared by them. The efficient resource management strategies are even more important for multimedia users since multimedia data is delay-sensitive and massive. In this paper, we focus on resource allocation based on a game-theoretic approach, referred to as Nash bargaining solution (NBS), to provide a quality of service (QoS) guarantee for each user. While the NBS has been known as a fair and optimal resource management strategy, it is challenging to find the NBS efficiently due to the computationally-intensive task. In order to reduce the computation requirements for NBS, we propose an approach that requires significantly low complexity even when networks consist of a large number of users and a large amount of resources. The proposed approach linearizes utility functions of each user and formulates the problem of finding NBS as a convex optimization, leading to nearly-optimal solution with significantly reduced computation complexity. Simulation results confirm the effectiveness of the proposed approach.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.337-347
• /
• 2007

An embedded system is called a multi-mode embedded system if it performs multiple applications by dynamically reconfiguring the system functionality. Further, the embedded system is called a multi-mode multi-task embedded system if it additionally supports multiple tasks to be executed in a mode. In this Paper, we address a HW/SW partitioning problem, that is, HW/SW partitioning of multi-mode multi-task embedded applications with timing constraints of tasks. The objective of the optimization problem is to find a minimal total system cost of allocation/mapping of processing resources to functional modules in tasks together with a schedule that satisfies the timing constraints. The key success of solving the problem is closely related to the degree of the amount of utilization of the potential parallelism among the executions of modules. However, due to an inherently excessively large search space of the parallelism, and to make the task of schedulabilty analysis easy, the prior HW/SW partitioning methods have not been able to fully exploit the potential parallel execution of modules. To overcome the limitation, we propose a set of comprehensive HW/SW partitioning techniques which solve the three subproblems of the partitioning problem simultaneously: (1) allocation of processing resources, (2) mapping the processing resources to the modules in tasks, and (3) determining an execution schedule of modules. Specifically, based on a precise measurement on the parallel execution and schedulability of modules, we develop a stepwise refinement partitioning technique for single-mode multi-task applications. The proposed techniques is then extended to solve the HW/SW partitioning problem of multi-mode multi-task applications. From experiments with a set of real-life applications, it is shown that the proposed techniques are able to reduce the implementation cost by 19.0% and 17.0% for single- and multi-mode multi-task applications over that by the conventional method, respectively.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.744-761
• /
• 2016

For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.283-290
• /
• 2016

As the development of recent science and technology, high-performance computing resources is needed to solve complex problems. To reach these requirements, it has been actively studied about grid computing that consist of a huge system which bind a heterogeneous high performance computing resources into on which are geographically dispersed. However, The current research situation which are the process to obtain the best results in the limited resources and the scheduling policy to accurately predict the total execution time of the real-time task are very poor. In this paper, in order to overcome these problems, we suggested a grid computing-based risk management system which derived from the system structure and the process for improving the efficiency of the system, grid computing-based working methodology, risk policy module which can manage efficiently the problem of the work of resources(Agent), scheduling technique and allocation method which can re-allocate the resource allocation and the resources in problem, and monitoring which can manage resources(Agent).

• Korean Medical Education Review
• /
• v.10 no.2
• /
• pp.25-44
• /
• 2008

Objectives: Through using of the strong research method like a Randomized Controlled Trial: RCT, we have to heighten quality of Medical Education study. I'd like to introduce "CONSORT", which stands for Consolidated Standards of Reporting Trials. Contents: Preventive Service Task Force(200l) in USA proposed Levels of evidence for enlarging evidence-based Practice: EBP. And the CONSORT was introduced, which encompasses various initiatives developed by the CONSORT Group to alleviate the problems arising from inadequate reporting of randomized controlled trials (RCTs). the CONSORT has 13 guides like these: 1. How participants were allocated to interventions 2. Scientific background and explanation of rationale 3. Eligibility criteria for participants. The settings and locations where the data were collected. 4. Precise details of the interventions intended for each group and how and when they were actually administered 5. Specific objectives and hypotheses 6. Clearly defined primary and secondary outcome measures, When applicable. any methods to enhance the quality of measurements (e.g., multiple observations, training of assessors) 7. How sample size was determined. When applicable, explanation of any interim analyses and stopping rules 8. Method used to generate the random allocation sequence, Details of any restriction [of randomization] 9. Method used to implement the random allocation sequence 10. Who generated the allocation sequence, who enrolled participants. and who assigned participants to their groups 11. Whether or not participants, those administering the interventions, and those assessing the outcomes were blinded to group assignment. If done, how the success of blinding was evaluated 12. Statistical methods used to compare groups for primary outcome(s), Methods for additional analyses, such as subgroup analyses and adjusted analyses 13. Flow of participants through each stage (a diagram is strongly recommended) Specifically, for each group report the numbers of participants randomly assigned. receiving intended treatment, completing the study protocol. and analyzed for the primary outcome. Results and Conclusion: Randomized Controlled Trial: RCT guided of CONSORT will contribute to do stronger evidence-based medical studies.

• Korean Journal of Cognitive Science
• /
• v.22 no.2
• /
• pp.145-172
• /
• 2011

Prospective memory (PM) is memory for activities to be performed in the future, such as remembering to purchase a piece of fruit on the way home or remembering to give someone a telephone message. Theoretically, PM retrieval can be accomplished either by controlled monitoring of intended action or by a more automatic process that spontaneously responds to the presence of intended event. The present study examined the effect of meta-cognitive awareness in PM retrieval process. In Experiment 1, we manipulated PM condition with a salient cue to stimulate participants' meta-cognitive awareness. Results showed the salient cue condition spontaneously triggered remembering to perform an intended action. In Experiment 2, we manipulated participants' meta-cognitive awareness about PM task difficulty and about the degree to which cognitive capacity is required to realize the PM task. Results showed that PM retrieval process varied with meta-cognitive awareness (i.e., more resources were allocated if the PM task was expected to be difficult). These results imply that participants' meta-cognitive awareness play an important role in PM retrieval process.

• Journal of Gifted/Talented Education
• /
• v.25 no.1
• /
• pp.77-93
• /
• 2015

The purpose of this study was to explore the problem solving strategy for Goldberg machine tasks of the gifted students in elementary science depending on the cognitive style(tendency to field-dependent and field independent). It was aimed to provide suggestions for the features and differences of the problem solving strategies of the gifted students in elementary science according to their cognitive styles. A total of 16 students, from the gifted class of P elementary school in Hwaseong were sampled for the research, cognitive styles Test was conducted to divide the students in teams, and the teams were classified according to cognitive style tendencies to five groups of field-dependent group, weak field-dependent group, mixed group, weak field-independent group and field-independent group. The Goldberg device task given was to make a Goldberg device within the angle framework of (Figure) 1, for a bead to start from the starting point and to reach the final point the last. The results are as follows: First, regarding the plan for producing the device, the stronger the field-independent tendency, they established more specific strategy-reflected plan; the stronger the field-dependent tendency, they established less specific strategy-reflected plan. Second, all cognitive style groups took a limited period of time into consideration, to fabricate the devices for the ball to arrive the last using a fine adjustment rather than many devices. Third, the field-independent group used a lot of logical reasoning; the field-dependent group used a lot of intuitive thinking. Fourth, the field independent group properly utilized strategies such as cooperation and role allocation; the field-dependent group tried to solve the task personally rather than cooperatively with poor role allocation. Fifth, the intermediate mixed group solved the problem better than the inclined groups such as field-dependent or field-independent groups.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.181-188
• /
• 2004

PDF(Parallel/Distributed Processing) is an internet-based parallel/distributed processing system that utilizes resources from hosts on the internet in idle state to perform large scale application through parallel processing, thus decreasing the total execution time. In this paper. do propose an adaptive method to be changed network environment at any time using realtime monitoring of host. It is found from experiments that parallel/distributed processing has better performance than its without monitoring as an adaptive strategy, which copy with task delay factor by overload and fault of network, be applicable to the cockpits of task allocation algorithm in PDP.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.323-330
• /
• 2002

Recently, the existing embedded real-time operating systems(RTOSs) are being developed in terms of various modified versions in every application fields. Major characteristics and difference of these OSs lie in their distinct development of mechanisms which can be used in various environment and task-scheduling function which can control time-limited contingencies. In this paper, we design and implement round/robin scheduling algorithm based on time-sharing with equal-priority for multiple tasks which are provided preemptive and priority task allocation function in $\mu{C/OS-II}$ version 2.03. We propose the most important event-ready list structure in $\mu{C/OS-II}$; kernel, and provide the running result for multiple tasks with equal priority for the proposed structure.