• 한국통신학회논문지
• /
• 제25권10B호
• /
• pp.1648-1664
• /
• 2000

This paper proposes a real-time dynamic storage allocation algorithm QSHF(quick-segregated-half-fit) that provides various memory allocation policies. that manages a free block list per each word size for memory requests of small size good(segregated)-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per each power of 2 size for large size requests. The proposed algorithm has the time complexit O(1) and makes us able to easily estimate the worst case execution time(WCET). This paper also suggests two algorithm that finds the proper free list for the requested memory size in predictable time and if the found list is empty then finds next available non-empty free list in fixed time. In order to confirm efficiency of the proposed algorithm we simulated the memory utilization of each memory allocation policy. The simulation result showed that each policy guarantees the constant WCET regardless of memory size but they have trade-off between memory utilization and list management overhead.

• Journal of Positioning, Navigation, and Timing
• /
• 제6권3호
• /
• pp.117-123
• /
• 2017

In this paper, we propose a performance index that can compare the position estimation performance according to the time slot allocation order, which is superior in the position estimation performance in the operation of the Link-16 based relative navigation system. In order to verify the validity of the performance index, a software-based Link-16 relative navigation system performance analysis platform composed of a signal generator, a signal reception and navigation algorithm execution unit, and a performance analysis unit was designed. Using the designed software platform, we analyzed the relationship between proposed performance index and position estimation performance according to time slot allocation order in the same position reference (PR) arrangement. The performance index of the proposed time slot allocation is expected to be utilized not only for the Link-16 system, but also for the Time Division Multiple Access (TDMA)-based navigation system.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권11호
• /
• pp.660-668
• /
• 2005

Digital communication networks have become a core technology in advanced building automation systems. BACnet (Building Automation and Control networks) is a standard data communication protocol designed specifically for building automation and control systems. BACnet adopts Master-Slave/Token-Passing (MS/TP) protocol as one of its field level networks. Tn this study, we introduce a method of implementing bandwidth allocation scheme in the MS/TP protocol. The bandwidth allocation scheme improves the capability of real-time communication of the original MS/TP protocol. The bandwidth allocation scheme introduced in this paper can be easily implemented in the existing MS/TP protocol with a slight modification. In this study, we examined the validity of bandwidth allocation scheme using simulation models. The results from the simulation experiment show that the proposed scheme satisfies the requirements of real-time communication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.2815-2839
• /
• 2020

In a cloud computing paradigm, allocation of various virtualized ICT resources is a complex problem due to the presence of heterogeneous application (MapReduce, content delivery and networks web applications) workloads having contentious allocation requirements in terms of ICT resource capacities (resource utilization, execution time, response time, etc.). This task of resource allocation becomes more challenging due to finite available resources and increasing consumer demands. Therefore, many unique models and techniques have been proposed to allocate resources efficiently. However, there is no published research available in this domain that clearly address this research problem and provides research taxonomy for classification of resource allocation techniques including strategic, target resources, optimization, scheduling and power. Hence, the main aim of this paper is to identify open challenges faced by the cloud service provider related to allocation of resource such as servers, storage and networks in cloud computing. More than 70 articles, between year 2007 and 2020, related to resource allocation in cloud computing have been shortlisted through a structured mechanism and are reviewed under clearly defined objectives. Lastly, the evolution of research in resource allocation techniques has also been discussed along with salient future directions in this area.

• 대한가정학회지
• /
• 제49권5호
• /
• pp.81-96
• /
• 2011

This study analyzed the time use of dual income paid workers. The data was selected from the '2009 Korean Time Use Survey' by the Korean National Statistical Office. There were 2799 respondents who were paid workers with dual income. There were big differences in time use between men and women. The result showed that men's time allocation focused on 'labor and leisure' and women's time allocation focused on ‘labor and housework'. This means the women among dual income paid workers faced difficulties in dual burden of work-family balance. Regression analysis on time use dividing men and women showed that age, education, income, working type and the presence of preschool children had significant effects on time allocation. We found the income effects on time use which reduced paid working time and increased housework and leisure time. Significantly, younger men who have preschool children spend more time in housework. We could find the possibility of a change in men's time allocation.

• Human Ecology Research
• /
• 제54권5호
• /
• pp.541-550
• /
• 2016

This study explored a typology (or time allocation), investigated personal and work characteristic differences among time allocation types, and identified determinants of time allocation types of married working women with a preschool child. The data source for this research was the 2014 Time Use Survey conducted by Statistics Korea. We analyzed 368 time diaries (184 for weekdays and 184 for weekends) using frequency, mean, cluster analysis, chisquare, analysis of variance (ANOVA), Duncan's test, and multinomial logistic analysis. The results of this research are as follows. Time allocation of married working women with a preschool child was classified into three different types of 'work-centered,' 'work-family balanced,' and 'family-centered.' The work-centered type accounted for 14.7% of total respondents, and compared with other types, this type of people spent more time working, and less time doing house-work, caring for family, and having leisure. The work-family balanced type represents more than half of the total, and spend more time working on weekdays and house-working, having leisure on weekends. The family-centered type represents 28.8%, and spends most of the time doing house-work and caring for family on both weekdays and weekends. Occupation, employment status, monthly income, and weekly hours of work were different for each type. Occupation, employment status, perception of lack of time, health condition, and weekly hours of work were identified as determinants for each type.

• 한국시뮬레이션학회논문지
• /
• 제17권4호
• /
• pp.89-97
• /
• 2008

무선 팬에서 좋은 채널 시간 할당(Channel time allocation) 알고리즘을 개발하는 것은 실시간 멀티미디어 서비스가 요구하는 다양하고 엄격한 QoS(Quality of service) 요구사항을 보장하는데 있어 가장 중요한 요소 중 하나이다. 본 논문에서는 IEEE 802.15.3 고속율 무선 팬에서MPEG 스트림을 전송하는데 있어 높은 품질을 제공하고 높은 채널 에러에 대해서도 품질을 유지할 수 있는 주기적인 유사 정적(Pseudo-static) 채널 시간 할당 알고리즘을 제안한다. 제안된 알고리즘은MPEG 스트림의 특성을 이용한다. 새로운 MPEG 스트림이 도착하면 DEV(Device)는 트래픽 정보(Traffic envelope)를 모델링한 후에 채널 시간 요청을 통해 PNC(Piconet coordinator)로 트래픽 정보를 전송한다. PNC는 수신한 트래픽 정보에 기반하여 DEV에게 채널 시간 할당을 수행한다. 제안된 방법의 성능은 시뮬레이션과 수치적 분석을 통하여 다른 방법과 비교 분석한다. 비교 분석결과, 제안된 방법이 일반적인 채널 에러 환경에서 좋은 성능을 보이고 매우 효과적임을 확인하였다.

• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.138-145
• /
• 2018

In the field of optimization, many studies have been performed on various types of Vehicle Routing Problem (VRP) for a long time. A variety of models have been derived to extend the basic VRP model, to consider multiple truck terminal, multiple pickup and delivery, and time windows characteristics. A lot of research has been performed to find better solutions in a reasonable time for these models with heuristic approaches. In this paper, by considering realtime traffic characteristics in Map Navigation environment, we proposed a method to manage realistic optimal path allocation for the logistics trucks and cargoes, which are dispersed, in order to realize the realistic cargo mixing allowance and time constraint enforcement which were required as the most important points for an online logistics brokerage service company. Then we developed a prototype system that can support above functionality together with delivery status monitoring on Map Navigation environment. First, through Map Navigation system, we derived information such as navigation-based travel time required for logistics allocation scheduling based on multiple terminal multiple pickup and delivery models with time constraints. Especially, the travel time can be actually obtained by using the Map Navigation system by reflecting the road situation and traffic. Second, we made a mathematical model for optimal path allocation using the derived information, and solved it using an optimization solver. Third, we constructed the prototype system to provide the proposed method together with realtime logistics monitoring by arranging the allocation results in the Map Navigation environment.

• 한국항해항만학회지
• /
• 제32권9호
• /
• pp.737-742
• /
• 2008

In this paper, we deal with an allocation model of vertical type container yard for minimizing the total ATC (Automated Transfer Crane) working time and the equivalence of ATC working load in each block on automated container terminal. Firstly, a layout of automated container terminal yard is shown The characteristic of equipment which work in the terminal and its basic assumption are given Next, an allocation model which concerns with minimizing the total working time and the equivalence of working load is proposed for effectiveness of ATC working in automated container terminal. Also, a weight values on critical function are suggested to adjust the critical values by evaluating the obtained allocation plan. For ATC allocation algorithm, we suggest a simple repeat algorithm for on-line terminal operation.

• Journal of information and communication convergence engineering
• /
• 제15권1호
• /
• pp.28-36
• /
• 2017

The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.