• 가족자원경영과 정책
• /
• 제19권1호
• /
• pp.163-180
• /
• 2015

The purpose of this study was to explore a typology of time allocation, investigate determinants of time allocation types, and analyze differences in time use satisfaction by the types of time use of the elderly. The data source for this research was the 2009 Time Use Survey conducted by the Korea National Statistical office (KNSO). The 4,699 time diaries (3,552 for weekday, 1,147 for Sunday) completed by the elderly over the age of 60 were analyzed using mean, standard deviation, chi-square, cluster analysis, ANOVA analysis, Duncan test, and multinomial logistic regression analysis. Time allocation of the elderly was classified into four types: personal care oriented, work oriented, leisure oriented, and balanced type. Gender, age, education, employment status, income, and the presence of spouse were identified as determinants for each type. According to the types of time allocation, time use satisfaction was different on week days.

• Industrial Engineering and Management Systems
• /
• 제14권4호
• /
• pp.413-419
• /
• 2015

This study solved the problem of unstable production chains by considering allocation rate conformance. We proposed two phased algorithm suitable for solving production planning that considers allocation rate conformance; the first phase was heuristic initial solution generation, and the second phase was tabu-search based solution improvement. By using three data sets which have different sizes of data and three different criteria, the results of proposed algorithm were compared with MIP results. The proposed algorithm showed the best production plan in terms of allocation rate conformance, and it was appropriate for other criteria; it solved the problem of unstable production chains by solving concentrated and unfair allocation.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 춘계학술발표대회
• /
• pp.139-142
• /
• 2015

데이터 센터에서는 물리적인 규모 증가와는 달리 별도의 처리 없이는 분산처리 프레임워크가 동일한 클러스터 내에서 복수로 동작할 수 없어 전체 환경을 정적으로 분할하여 이들을 배치하는 것이 일반적이다. 그러나 최근 연구에서는 복수의 프레임워크를 한 클러스터 내에서 동작시킴으로써 클러스터의 활용률을 높이는 방향으로 이루어지고 있다. Mesos는 복수의 분산처리 프레임워크를 한 클러스터에서 동작시키기 위한 시스템 중 하나로 각 프레임워크 스케줄러의 스케줄링을 지원하는 단일 Allocation Module을 가진다. Allocation Module은 모든 Slave와 프레임워크 스케줄러들의 요청을 처리하는데, 시스템 규모가 커질수록 Allocation Module으로 집중되는 부하가 증가하여 이에 따른 할당 속도 저하로 정상적인 동작이 불가능해진다. 이 문제를 해결하기 위해 본 논문에서는 Mesos 시스템의 Allocation Module 병렬화를 제안한다. 제안 방식을 통해 Allocation Module의 부하를 분산함과 동시에 Head-of-line Blocking으로 인한 스케줄링 지연 문제를 해결할 수 있을 것이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3566-3582
• /
• 2019

In intelligent warehouse picking system, the allocation of tasks has an important influence on the efficiency of the whole system because of the large number of robots and orders. The paper proposes a method to solve the task allocation problem that multi-robot task allocation problem is transformed into transportation problem to find a collision-free task allocation scheme and then improve the capability of task processing. The task time window and the power consumption of multi-robot (driving distance) are regarded as the utility function and the maximized utility function is the objective function. Then an integer programming formulation is constructed considering the number of task assignment on an agent according to their battery consumption restriction. The problem of task allocation is solved by table working method. Finally, simulation modeling of the methods based on table working method is carried out. Results show that the method has good performance and can improve the efficiency of the task execution.

• Communications for Statistical Applications and Methods
• /
• 제20권2호
• /
• pp.137-145
• /
• 2013

The use of pooled standard deviation can reduce the efficiency loss in optimum allocation when strata standard deviations are estimated and several of them are equal. Also shown is that the pooled standard deviation is useful in optimum allocation under a multivariate setting. In addition to theoretical development, we provide the result of simulation study to support the theory.

• 대한전자공학회논문지
• /
• 제27권8호
• /
• pp.1211-1220
• /
• 1990

This paper describes and implements a design method of register allocation as a required module of RISC compiler systems. It compiles a C program to a machine-independent intermediate language, translates each variable into symbolic register. After local allocation process for the symbolic registers, global register allocation is executed by applying the graph coloring algorithm. This register allocation phase is designed for a system with the large register file like RISC machines.

• 대한전자공학회논문지
• /
• 제27권8호
• /
• pp.1303-1310
• /
• 1990

This paper describes the design and implementation of a system for automatic data path synthesis in digital system. There are four subtasks to synthesize a digital system: scheduling, register allocation, functional unit allocation and bus allocation. In this paper, force directed algorithm is used for the scheduling while new algorithms are proposed for the allocation subtasks. Synthesis results of two experimental data paths including MC6502 have shown that our proposed algorithm out goes most of previous works.

• 전자공학회논문지B
• /
• 제31B권12호
• /
• pp.1-10
• /
• 1994

In this paper, we propose a processor allocation algorithm using the PGG(Packed Gray code Group) for the MIMD hypercube. The number of k-D subcubes in an n-cube is C(n.k) en-k. When the PGG is employed in the processor allocation, C(n, k) PGG's are required to recognize all the k-D subcubes in an n-cube. from the simulation we find that the capability of processor allocation using only 40% of C(n, k) PGG's is about the same as that of the allocation using all the PGG's.

• Communications for Statistical Applications and Methods
• /
• 제10권1호
• /
• pp.79-88
• /
• 2003

In this paper, we study the efficiency of the stratified estimator in related with the variance lower bound of Horvitz-Thompson estimator subject to the superpopulation model. Especially, we compare the variance lower bound of optimum allocation with that of power allocation subject to Dalenius-Hedges stratification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권10호
• /
• pp.2395-2410
• /
• 2013

Many telecommunication operators around the world have multiple networks. The networks run by each operator are always of different generations, such as 2G and 3G or even 4G systems. Each system has unique characters and specified requirements for optimal operation. It brings about resource allocation problem among these networks for the operator, because the budget of each operator is limited. However, the evaluation of resource allocation among various networks under each operator is missing for long, not to mention resource allocation optimization. The operators are dying for an algorithm to end their blind resource allocation, and the Resource Allocation Optimization Algorithm for Multi-network Operator (RAOAMO) proposed in this paper is what the operators want. RAOAMO evaluates and optimizes resource allocation in the view of overall cost for each operator. It outputs a resource distribution target and corresponding optimization suggestion. Evaluation results show that RAOAMO helps operator save overall cost in various cases.