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

We propose a heuristic on-line scheduling algorithm for the IRIS (Increasing Reward with Increasing Service) tasks, which has low computation complexity and produces total reward approximated to that of previous on-line optimal algorithms. The previous on-line optimal algorithms for IRIS tasks perform scheduling on all tasks in a system to maximize total reward. Therefore, the complexities of these algorithms are too high to apply them to practical systems handling many tasks. The proposed algorithm doesn´t perform scheduling on all tasks in a system, but on (constant) W´s tasks selected by a predefined task selection policy. The proposed algorithm is based on task selection policies that define how to select tasks to be scheduled. We suggest two simple and intuitive selection policies and a generalized selection policy that integrates previous two selection policies. By narrowing down scheduling scope to only W´s selected tasks, the computation complexity of proposed algorithm can be reduced to O(Wn). However, simulation results for various cases show that it is closed to O(W) on the average.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1238-1259
• /
• 2024

Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation. To remedy this deficiency, this paper proposes a many-objective joint optimization dependency-aware task offloading and service caching model (MaJDTOSC). MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives. Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed. Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster. Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.592-607
• /
• 2006

This paper proposes a technique to select processors and hardware IPs and to map the tasks into the selected processing elements, aming to achieve high performance with minimal system cost when multitask applications with real-time constraints are run on a multicore SoC. Such technique is called to 'Hardware-Software Cosynthesis Technique'. A cosynthesis technique was already presented in our early work [1] where we divide the complex cosynthesis problem into three subproblems and conquer each subproblem separately: selection of appropriate processing components, mapping and scheduling of function blocks to the selected processing component, and schedulability analysis. Despite good features, our previous technique has a serious limitation that a task monopolizes the entire system resource to get the minimum schedule length. But in general we may obtain higher performance in multitask multicore system if independent multiple tasks are running concurrently on different processor cores. In this paper, we present two mapping techniques, task mapping avoidance technique(TMA) and task mapping pinning technique(TMP), which are applicable for general cases with diverse operating policies in a multicore environment. We could obtain significant performance improvement for a multimedia real-time application, multi-channel Digital Video Recorder system and for randomly generated multitask graphs obtained from the related works.

• Research in Community and Public Health Nursing
• /
• v.30 no.3
• /
• pp.357-367
• /
• 2019

Purpose: The aim of this study is to identify factors of Korean female workers' childbirth plans and to establish measures to improve the childbirth plan. Methods: Study subjects were selected part in the 1st, 3rd, and 5th year surveys of the Korean Longitudinal Panel Survey of Women and Families. The selection criteria were as follows: women who had a spouse; were salaried workers currently employed for the last one month; belonged to a childbearing age; and had less than 3 children. Logistic regression analysis was conducted to investigate factors associated with childbirth plans. Results: Childbirth plans by female workers decreased each year. The analysis of associated factors revealed that age, number of children were associated factors in all years. In addition, education, satisfaction about dividing household chores with the husband, and satisfaction about working environment were associated with the lack of planning for childbirth in female workers in the 1st survey year. Satisfaction about dividing household chores with the husband, family-work conflict, and satisfaction about the potential for personal development were associated factors in the 3rd survey year. Finally, family-work conflict, satisfaction about employment stability, and satisfaction about job task at work were associated factors in the 5th survey year. Conclusion: It is important to know the measures focusing on the lack of planning for childbirth, and hence these factors can be improved by assessing in general, family, and occupational characteristics. Additionally, employer policies regarding women employees who are pregnant or have children at home need to be reviewed.