• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.59-61
• /
• 2004

Researches about scheduling distributed real-time systems have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. This paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system. It is shown that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints. So this paper proposes an end-to-end laxity-based priority assignment algorithm which considers the practical laxity of a task and allocates a proper priority to a task.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1201-1210
• /
• 2000

In order to tolerate faults which may occur during the execution of distributed tasks in high-performance parallel computer systems, tasks are duplicated on different processors. In this paper, by utilizing the task duplication based scheduling algorithm, a new task scheduling algorithm which duplicates each task on more than two different processors with the minimum schedule length is presented, and the number of processors required for the duplication is analyzed with the ratio of communication cost to computation time and the workload of the system. A simulation with various task graphs reveals that the number of processors required for the full-duplex fault-tolerant task scheduling with the obtainable minimum schedule length increases about 30% to 75% when compared with that of the task duplication based scheduling algorithm.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.34-38
• /
• 2007

Load redistribution is a critical resource in computer system. In sender-initiated load redistribution algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated load redistribution in distributed systems. Compared with the conventional sender-initiated algorithms, the proposed algorithm decreases the response time and task processing time.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.330-340
• /
• 2012

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.72-75
• /
• 2004

In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

• Journal of the Korean Home Economics Association
• /
• v.29 no.3
• /
• pp.131-152
• /
• 1991

The purposes of this study are to investigate the socialization of household task service area and the satisfaction with it, and to find out the factors affecting on them. For these purposes the data are collected by using questionnaire distributed to 450 housewives living in Seoul. The data are analyzed using frequency, percentile, one way anova, pearson's correlation analysis, simple regression analysis, multiple regression analysis. The results of this research are as follow : 1. There are significant differences in the socialization of household task service area according to housewives's education and employment family income, the type of housing the number of household equipment sex role attitude, attitude about household task, and task performance competency. 2. The factors showing significant relation to the satisfaction about socialization of household task service areas are found to be housewife's education and employment family income sex role attitude and task performance competancy. 3. In the result of the independent contribution of the factors, the most influencial factor is the socialization of household task service area and the next is sex role attitude. 4. Housewives are generally satisfacted on the socialization of household task because of the overweight of household task and because they are unable to those household tasks, and on the other hand they are generally dissatisfacted on the socialization of household tasks because of economic weight, because they couldn't know the ability of service export before employing and because the housework practiced by service expert is different from their expects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.27-32
• /
• 2003

This paper presents the Genetic Algorithm based Task Scheduling (GATS) method for the scheduling of programs with diverse embedded parallelism types in Distributed Parallel Systems, which consist of a set of loosely coupled parallel and vector machines connected via high speed networks The distributed parallel processing tries to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. When scheduling in distributed parallel systems, the matching of the parallelism characteristics between tasks and parallel machines rather than load balancing should be carefully handled with the minimization of communication cost in order to obtain more speedup. This paper proposes the based initialization methods for an initial population and the knowledge-based mutation methods to accommodate the parallelism type matching in genetic algorithms.

• Journal of Information Processing Systems
• /
• v.17 no.3
• /
• pp.615-629
• /
• 2021

With the development of mobile edge computing, how to utilize the computing power of edge computing to effectively and efficiently offload data and to compute offloading is of great research value. This paper studies the computation offloading problem of multi-user and multi-server in mobile edge computing. Firstly, in order to minimize system energy consumption, the problem is modeled by considering the joint optimization of the offloading strategy and the wireless and computing resource allocation in a multi-user and multi-server scenario. Additionally, this paper explores the computation offloading scheme to optimize the overall cost. As the centralized optimization method is an NP problem, the game method is used to achieve effective computation offloading in a distributed manner. The decision problem of distributed computation offloading between the mobile equipment is modeled as a multi-user computation offloading game. There is a Nash equilibrium in this game, and it can be achieved by a limited number of iterations. Then, we propose a distributed computation offloading algorithm, which first calculates offloading weights, and then distributedly iterates by the time slot to update the computation offloading decision. Finally, the algorithm is verified by simulation experiments. Simulation results show that our proposed algorithm can achieve the balance by a limited number of iterations. At the same time, the algorithm outperforms several other advanced computation offloading algorithms in terms of the number of users and overall overheads for beneficial decision-making.

• The Journal of Korean Physical Therapy
• /
• v.26 no.4
• /
• pp.234-239
• /
• 2014

Purpose: The purpose of this study is to use P300 latency to determine whether methods of motor learning in terms of massed and distributed practice can affect motor sequential learning in healthy adults. Methods: Twenty-four healthy subjects participated in this study. They were randomly allocated into three groups: a 10 minute, a 12 hour, and a 24 hour group. In the SRT task, eight numbers were adopted as auditory stimuli. During an experiment, participants were instructed to press the matching key as quickly and accurately as possible when one of the eight numbers was presented randomly. The subjects practiced for three sessions, each of which comprised five blocks of 40 serial reaction time tasks. While they practiced during these three sessions, P300 latency was measured. The data were analyzed using ANCOVA. Results: The P300 latency of Fz, Cz, and Pz decreased in all groups except for the Fz area of the 10 min group. Overall, the P300 latency of the 10 min group showed a smaller decrease compared with the 12 hr and 24 hr groups. Statistically, no significant differences in the Fz and Cz areas were observed among the three groups. The P300 latency in the Pz area of the 10 min group showed a significantly smaller decrease compared with the other groups. Conclusion: These findings suggest that short-term sequential motor training can alter brain functions such as the P300 latency. We also found that better acquisition of a motor skill was obtained with distributed practice of a task than with massed practice.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.3
• /
• pp.311-322
• /
• 2020

This study aims to examine curvilinearly moderating effects of task interdependence on the relationship between demographic faultlines and group performance. It posits that the degree of task interdependence has an impact on the effects of demographic faultlines. It was conducted in six organizations in Korea, their industries including heavy industries, hospital, construction, petrochemical, fine chemicals, and system integration. The survey was distributed to 1330 individuals in 162 teams and 1082 individuals in 137 teams responded to the questionnaire. To test the hypotheses including nonlinear interactions, we conducted a hierarchical regression analysis to the survey data from 82 groups within six firms in Korea. The results show that for groups that experience a high level of task interdependence, the slope for the regression of demographic faultlines on group performance is comparatively low and, at the low level of task interdependence, insignificant. However, at intermediate levels of task interdependence, the association was strongly negative and significant. This study finds that the negative relationship between demographic faultlines and group performance is stronger when task interdependence is moderate than when task interdependence is high or low. Therefore, managers should pay attention to optimal group design by carefully assigning tasks in diverse and divided groups.