• Proceedings of the Korea Society of Design Studies Conference
• /
• 2001.10a
• /
• pp.18.2-18
• /
• 2001

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.11
• /
• pp.972-978
• /
• 2012

This paper discusses the parallelization of multifrontal solution method, widely used for finite element structural analyses, for a shared memory architecture. Multifrontal method is easier than other linear solution methods because the solution procedure implies that unknowns can be eliminated simultaneously. Two innovative ideas are introduced to achieve optimal solver performance on a shared memory computer. Those are pairing two frontal matrices and splitting the frontal matrix in order to reduce the temporal memory space required by independent computing tasks. Performance comparisons between original algorithm and proposed one prove that proposed method is more computationally efficient on current multicore machines.

• Journal of Families and Better Life
• /
• v.21 no.6
• /
• pp.107-115
• /
• 2003

The purpose of this study was to Investigate the spatial composition characteristics of elderly housing facilities in USA, in order to refer them in establishing the basic plan for elderly housing in Korea. The case study performed in this study from July 23 to July 31 is based on ten housing facilities for the elderly located at California in USA. The results of this study were as follows; 1. The type of floor plan was classified into the U type, ㅁ type, L type, and ㅡ type. And they had an outside space called a garden(courtyard). 2. The kinds of common spaces could be grouped as the space for basic living, for leisure, and for convenient living. Also it was all common that the housing facility had shared livingroom, shared diningroom, activity room and garden. The type of the common spaces was categorized into two types, the centralized type where the shared space was located at the center of the housing facilities, and the distributed type, depending on the degree of separation between common spaces and units. ,3. The kinds of units was classified into studio, oneroom, one bedroom and two bedroom.

• Journal of the Korean housing association
• /
• v.15 no.1
• /
• pp.95-102
• /
• 2004

The purpose of this study is to actualize the planning method of the shared community space (SCS). For this, it analyzed the residents' needs for the SCS and grasped the composition system of the needs and estimated the factors considered in the planning of the SCS. This study focused on seeking out the user-oriented design criteria for the planning of the SCS. The results of this study are as follows: First, as the results subdividing the residents' needs to understand the various requirements for the SCS, the composition system was classified into the fundamental SCS and the individual SCS. The fundamental SCS's to be considered as basic facilities in the planning of the multi-family housing complex, and the individual SCS to be more suited to a particular group. Second, regarding the investigation of detail guidelines in the SCS planning, it was found that there was a difference in the considered factors and the preferred locations according to the kinds of each SCS, the types of facilities, the main users of facilities, and the contents of activities available in the facilities.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.341-351
• /
• 2003

For debugging effectively the shared-memory programs with nested parallelism, it is important to detect efficiently the first races which incur non-deterministic executions of the programs. Previous on-the-fly technique detects the first races in two passes, and shows inefficiencies both in execution time and memory space because the size of an access history for each shared variable depends on the maximum parallelism of program. This paper proposes a new on-the-fly technique to detect the first races in two passes, which is constant in both the number of event comparisons and the space complexity on each access to shared variable because the size of an access history for each shared variable is a small constant. This technique therefore makes on-the-fly race detection more efficient and practical for debugging shared-memory programs with nested parallelism.

• Journal of the Korean Society for Library and Information Science
• /
• v.55 no.1
• /
• pp.285-303
• /
• 2021

Efforts to establish a joint preservation facility for library collection are being discussed by some of regional representative libraries recently. In order for the efficient management and preservation of public library materials and to secure the space necessary for applying new services, there is a high demand for a cooperative shared storage for public libraries. The construction of a cooperative shared storage for public libraries is to minimize the cost of expanding the preservation space for each public library and to provide a pleasant service environment by separating the low-use materials stored in the library. Accordingly, discussions on the construction of a cooperative shared storage for public libraries are being initiated by some representative libraries. This study, in this regard, tried to propose a plan to build a cooperative shared storage for public libraries by a Seoul Metropolitan Library. To this end, it surveyed the estimate size of the collections of public libraries in Seoul and, based on this, proposed the size and strategies for the facility.

• KIEAE Journal
• /
• v.17 no.4
• /
• pp.5-12
• /
• 2017

Purpose: Recently, a sudden increase in one household in Korea has become an important social problem. Changes in lifestyles such as population change, marriage, childbirth, and divorce are becoming increasing factors for single-family households. As a result of these changes, the government has implemented policies for one accredited state. However, the policy for one domestic applicant is insufficient compared to other countries. As a measure to cope with the increase in the number of applicants, Shared House has emerged and research on Shared House is necessary. Method: First, we analyze the overall characteristics of domestic share house. And it does a spatial analysis of domestic share house. Especially, it analyzes the relationship between private space and public space. Finally, the plan characteristics are derived based on the analysis results. Result: The results are as follows. First, the type of share house is classified according to the combination of the arrangement of private space and the public space. Second, the larger the scale, the more vertical arrangement than horizontal arrangement. Finally, the character of the share house changes according to the characteristics of the resident.

• Korean Institute of Interior Design Journal
• /
• v.24 no.1
• /
• pp.34-42
• /
• 2015

This research is about shared living facilities for the solitary elderly in Gyeonggi province (so called "Carnation House"), which was opened after 2013. These facilities aim to help solving the social problems of the growing number of the solitary elderly. The research was conducted from April 2014 to October 2014 by using observation, measurement, photography, and interview methods. This research reviewed floor plan, area, accessibility, visual openness, and furniture and equipments. The results are as follows: First, considering the need for rest area and the protection of privacy, livingroom should at least be equipped with a variable wall or have a separate room. Secondly, for the kitchen plan, considering the fact that large number of people move simultaneously, kitchen entrance should be widened or LDK type is preferable. Thirdly, the bathroom entrance should be widened to at least 800mm and should have barrier free design. Fourthly, porch entrance should be planned to secure enough space and shoe cabinets for multiple users. Fifthly, to allow the users to enjoy outside view, the windows of living spaces should be placed no higher than 800mm from the floor level. Finally, for the location of the facility, people prefer the location be at the center of the village or near home. In addition, location with easy accessibility for the elderly is advisable. Therefore, establishing local guidelines for shared living facilities for the solitary elderly is advisable. When establishing local guidelines, local characters, culture and usage patterns should be considered.

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

In Distributed Shared Memory systems, false sharing occurs when two different data items, not shared but accessed by two different processors, are allocated to a single block and is an important factor in degrading system performance. The paper first analyzes shared memory allocation and reference patterns in parallel applications that allocate memory for shared data objects using a dynamic memory allocator. The shared objects are sequentially allocated and generally show different reference patterns. If the objects with the same size are requested successively as many times as the number of processors, each object is referenced by only a particular processor. If the objects with the same size are requested successively much more than the number of processors, two or more successive objects are referenced by only particular processors. On the basis of these analyses, we propose a memory allocation scheme which allocates each object requested by different processors to different pages and evaluate the existing memory allocation techniques for reducing false sharing faults. Our allocation scheme reduces a considerable amount of false sharing faults for some applications with a little additional memory space.

• 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.