• Journal of the Korea Society of Computer and Information
• /
• v.22 no.6
• /
• pp.9-16
• /
• 2017

In this paper, we proposed a novel user-level scheduling scheme that monitors applications characteristics on-line using PMU and allocates applications into cpu cores. We utilize PMU (Performance Monitoring Unit) to analyze which shared resource has the strongest relation with the influence. Using the proposed scheduling method, it is possible to reduce the contention of shared resources. The key idea of this scheme is separating high-influential applications into different processors. The evaluation results have shown that the proposed scheduling scheme can enhance the performance up to 12% for a 8 core system and up to 25% for a 28 core system, respectively.

• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.303-310
• /
• 2016

Due to the ossification of the Internet, it is difficult to accommodate variety services. One of the efficient solution to this problem is network virtualization. It allows multiple parallel virtual networks to run on the shared physical infrastructure. It needs new resource allocation mechanism to share efficient physical resources. In this paper, we present efficient bandwidth allocation algorithm for virtual network request with high service priority. Our proposed algorithm can withdraw allocated bandwidth from low-level priority virtual network and maintain low-level virtual network service. We evaluated the performance of our proposed algorithm using simulation and found the improvement of approximately 8% acceptance rate.

• Journal of Family Resource Management and Policy Review
• /
• v.11 no.4
• /
• pp.115-135
• /
• 2007

The purpose of this study was to investigate the complementary gender division of housework in the Yangban ruling class of the Choson period. During the Choson period, genders were distinctly divided. It was generally regarded that women had to stay indoors and take care of household matters, while men, on the other hand, did not need to be concerned with housework because of the Confucian practice of "Naeoe". But homes in traditional society were considered as being at the center of production, so the study explores if women and men complemented each other through reviewed literature. As the results indicate, women and men in the Choson period complemented each other in some housework, even in the Yangban ruling class who maintained their authority by following the Confucian practice. From the findings, it can be concluded that the complementary relations between women and men in the Choson period should be emphasized as the origin of shared housework.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12A
• /
• pp.1111-1119
• /
• 2005

A single fiber cut can potentially influence a total of 1.6 Tbps of traffic and is surprisingly frequent and results in significant loss of traffic. The survivability as we as the resource utilization of the connection in optical networks is important. Existing protection mechanisms to rapidly recover the failures allocate the backup path just SRLG-disjointed with working path. Those did not consider the unbalanced resource share of backup paths. The backup paths can be centralized on the specific link so that the idle resource is not used. As a result, as those do not efficiently use the resource the whole resource utilization is not so good. So we propose the mechanism to enhance the resources utilization as settling down the unbalanced resource share. Our purpose is to improve the link utilization as distributing the maximum link load.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.329-336
• /
• 2006

This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.3
• /
• pp.609-618
• /
• 2024

The escalating demand for organized information resource management within organizations necessitates increased investment in information security (IS), as a single error can lead to information exposure incidents, underscoring the importance of IS compliance by insiders. The research aims to elevate IS compliance within the organization by examining the influence of the shared goal of information security policy (ISP), perceived ISP value and individual's fits on an insider's intention to comply with the ISP. Antecedent research in organizational behavior and IS led to a proposed hypothesis, tested using 366 obtained samples. The ISP shared goal's positive influence on ISP compliance intentions was evident from the test results, primarily through the perceived ISP value. Furthermore, the person-organization and demand-ability fit moderated the antecedent factors associated with ISP compliance intentions. Our findings suggest the methods for sustaining organizational IS levels by examining the requisite conditions from the viewpoints of the organizational environment, ISP values, and fits.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.484-503
• /
• 2016

Mobile cloud computing has recently become a new paradigm for the utilization of a variety of shared mobile resources via wireless network environments. However, due to the inherent characteristics of mobile devices, a limited battery life, and a network access requirement, it is necessary for mobile servers to provide a dynamic approach for managing mobile resources efficiently in mobile cloud computing environments. Since on-demand job requests occur frequently and the number of mobile devices is drastically increased in mobile cloud computing environments, a different mobile resource management method is required to maximize the computational power. In this paper, we therefore propose a cooperative, mobile resource sharing method that considers both the inherent properties and the number of mobile devices in mobile cloud environments. The proposed method is composed of four main components: mobile resource monitor, job handler, resource handler, and results consolidator. In contrast with conventional mobile cloud computing, each mobile device under the proposed method can be either a service consumer or a service provider in the cloud. Even though each device is resource-poor when a job is processed independently, the computational power is dramatically increased under the proposed method, as the devices cooperate simultaneously for a job. Therefore, the mobile computing power throughput is dynamically increased, while the computation time for a given job is reduced. We conduct case-based experiments to validate the proposed method, whereby the feasibility of the method for the purpose of cooperative computation is shown.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.34-36
• /
• 2002

Statecharts는 복잡한 Reactive System의 행위적인 부분을 가시적으로 명세하는데 효과적이다. CCS에 근간을 둔 ACSR은 실시간 시스템을 명세하기 위하여 시간, 우선순위, 자원의 개념을 추가하여 엄격한 명세가 가능하다. 본 논문에서는 Statecharts와 ACSR의 공통점과 차이점을 보이고, 동기적인 시간을 적용한 Statecharts를 ACSR로 변환할 수 있음을 보인다. 또한, 변환된 ACSR에 공유자원에 대한 명세를 추가함을 보인다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.20-29
• /
• 1990

In this paper, we propose the \ulcorner/G algorithm that is an efficient distributed process coordination algorithm. It controls mutually exclusive access to a shared resource in a distributed system. We show that the \ulcorner/G algorithm satisfies the properties of distributed systems. In performnace, the algorithm is more efficient than existing algorithms because it sends only 3(K-1)/G meassages.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.596-598
• /
• 1999

본 논문은 UML-RT 도구로서 GCSR(Graphical Communicating Shared Resource)를 제안하는데 있어UML의 기본 다이아그램 중 하나인 Statechart와 비교 분석함으로 그 기능과 장.단점을 제시한다. 기존의 정형 명세 언어인 Statechart에서는 실시간 시스템이 명세에 있어 필수적인 시간적인 개념과 우선순위 개념이 제한적이다. 그러나 정형명세의 또 다른 언어인 GCSR이 가진 시간적 개념과 우선순위 개념의 효용을 보이고 이를 Statechart의 실시간 시스템의 명세와 비교함으로 UML-RT로서의 GCSR을 제안한다.