• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.543-544
• /
• 2009

본 논문은 Linux에서 사용되는 Shared Memory는 동일한 메모리 영역에 여러 개의 프로세스가 접근할 수 있도록 해 주는 기술이다. 본 논문에서는 Shared Memory의 큰 두 갈래 중 커널 단계에서 처리 되는 SVR(System V Release) 형식의 Shared Memory를 다룬다. 본 논문에서는 리눅스 운영체제의 공유 메모리 기능을 Dual Core 시스템에서 동작하도록 구현한다.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.32 no.4
• /
• pp.213-229
• /
• 2021

The purpose of this study is to explore the establishment and administrative strategies for shared repositories for academic libraries in Korea, using the US ReCAP (Research Collections and Preservation Consortium) Project as a case study. The US ReCAP Project was a collaboration between the New York Public Library and the university libraries of Columbia University, Harvard University, and Princeton University. In-depth interviews were conducted with librarians and administrators in charge of the ReCAP Project to understand the original vision of the project, as well as how the strategy and approach evolved over the years. The analysis results revealed that shared repositories for libraries have evolved into shared collections enabling shared use. But shared repositories require a central management system to be successful in the long-term. Additionally, findings showed that the shared repository filled more quickly than anticipated. This in turn required collaborative planning on shared collection development and selection policies to determine which materials to send to the shared repository.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.9
• /
• pp.1-8
• /
• 2019

In this paper, we propose a performance isolation of shared space for virtualized SSD based storage systems, to solve the weakness in a VSSD framework. The proposed scheme adopts a CFQ scheduler and a shared space-based FTL for the fairness and the performance isolation for multiple users on virtualized SSD based storage systems. Using the CFQ scheduler, we ensure SLOs for the storage systems such as a service time, a allocated space, and a IO latency for users on the virtualized storage systems. In addition, to improve a throughput and reduce a computational latency for garbage collection, a shared space-based FTL is adopted to maintain the information of SLOs for users and it manages shared spaces among the users. In our experiments, the proposal improved the throughput of garbage collection by 7.11%, on average, and reduced the computational latency for garbage collection by 9.63% on average, compared to the previous work.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.324-329
• /
• 2007

본 논문은 대부분의 Linux 운영체제에서 지원해 주는 System V의 IPC 중 하나인 Shared Memo의 성능을 개선하는 방안을 연구한다. Linux에서 사용되는 Shared Memory는 동일한 메모리 영역에 여러 개의 프로세스가 접근할 수 있도록 해 주는 기술이다. 본 논문에서는 Shared Memory의 큰 두 갈래 중 커널 단계에서 처리 되는 SVR 형식의 Shared Memory를 다룬다. 본 논문에서는 리눅스 운영체제의 공유 메모리 성능 개선 방안을 제안한다. 본 논문에서 제안하는 공유 메모리 성능 개선 방안은 듀얼 코어를 활용하여 기존의 단일 처리기 시스템에서보다 성능을 향상시킬 수 있도록 한다. 공유 메모리를 이용한 프로세스의 동작이 별개의 CPU에서 동작되도록 함으로써 성능 향상을 꾀한다.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.4
• /
• pp.3-14
• /
• 2019

The purpose of this study is to analyze the distribution characteristics of the agency-managed shared housings in Seoul and draw the possible implications from it. The needed data for the study was obtained from an on-line shared housing portal service which provides housing information from various shared housing management agencies. By mapping out the locations and other related data into a GIS(Geographic Information System) program, this study shows that shared housings in Seoul can be sorted into four large clusters. Each cluster has a different ratio of housing types and room capacities reflecting each regional circumstance and common causes. Women-only shared housing takes up 79% of the overall shared housing ratio and, while multi-family housing type has the most count, the apartment type has a noticeably high ratio in women-only housing compared to the apartment type ratio among the other gender-specific housings. Given the high crime rate against the single-person household of young adult women, the reason for the popularity of shared-apartment housing among young women can be deduced. However, the potential tenants' practical choices and their concern for safety are not the only causes that drive the current shared housing market. The young adults in their 20's and 30's choose to live in popular places where they can engage social activities. A new tier of shared housing market has also appeared in places where young adults could not have afforded if they lived alone. Choosing where we live is no longer about just meeting the requirements for a house based on what she/he needs but also about satisfying the preferences for a living based on what she/he desires. This paper indicates that although there is an undeniable premise that 'sharing a house' revolves around the realm of housing welfare and is not a typical topic for the upper-income households, the way we live and how we choose our place to live is shifting.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.spc
• /
• pp.68-78
• /
• 2023

Big data technology is being used in various fields followed by the development of information and communication technology. In the corporate and public sectors, diverse system platforms are built and operated due to the needs of users, but efficiency is low because they are built from an individual service perspective rather than an integrated service perspective. In this study, the relationship between presenting the characteristics of the type of shared information platform, the integration plan, and integration performance of the shared information system platform was analyzed. The results of the study will provide guidelines for the integration of shared information system platforms by the government and private companies in the future.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• Asia pacific journal of information systems
• /
• v.30 no.1
• /
• pp.214-228
• /
• 2020

Shared value enhances the competitiveness of a company while simultaneously reducing societal burdens. By allowing companies to share their resources, collaborative logistics systems provide companies with an opportunity to create shared value, namely, not only economic value by enhancing the utilization of resources, but also social value by reducing energy consumptions and greenhouse gas emissions associated with logistics and transportation. Emerging businesses, such as ES3 and Flexe, have recently demonstrated how they created shared value through collaborative logistics services, for example, ES3's collaborative warehousing and direct-to-store (D2S) program, and Flexe's on-demand warehousing platform. However, the development of collaborative logistics systems is currently at a nascent stage. There are quite a few socio-technical barriers to overcome for sharing resources (data as well as infrastructure). Drawing on the socio-technical approach, this research examines how companies create both economic and social value from collaborative logistics systems. We highlight socio-technical barriers, particularly one set of social barriers, that is, competition-oriented conservatism prevalent among companies. Using the case study methodology and interview data, we closely investigate ES3 and Flexe, which provide collaborative logistics services, and demonstrate how technical and social barriers are addressed to create shared value from collaborative logistics systems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.636-647
• /
• 2004

The objective of this paper is to provide an improved reorder decision policy for general multi-echelon distribution systems utilizing the shared stock information. It has been known that traditional reorder policies sometimes show poor performance in distribution systems. Thus, in our previous research we introduced the order risk policy which utilizes the shared stock information more accurately for the 2-echelon distribution system and proved the optimality. However, since the real world supply chain is generally composed with more than 2 echelons, we extend the order risk policy for the general multi-echelon systems. Since the calculation of the exact order risk value for general multi-echelon systems is very complex, we provide two approximation methods for the real-time calculation. Through the computational experiment comparing the order risk policy with the existing policies under various conditions, we show the performance of the order risk policy and analyze the value of the shared stock information varying with the characteristics of the supply chain.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.159-165
• /
• 2003

The objective of this paper is to provide an improved reorder decision policy for general multi-echelon distribution systems utilizing the shared stock information. Since it has been known that traditional reorder policies sometimes show poor performance in distribution systems, in our previous research we introduced the order risk policy which utilizes the shared stock information more accurately f3r the 2-echelon distribution system and proved the optimality. However, since the real world supply chain is generally composed with more than 2 echelons, we extend the order risk policy for the general multi-echelon systems. Since the calculation of the exact order risk value fur general multi-echelon systems is very complex, we provide two approximation methods. Through the computational experiment comparing the order risk policy with the existing policies under various conditions, we show the performance of the order risk policy and analyze the value of the shared stock information varying with the characteristics of the supply chain.