• 한국인터넷방송통신학회논문지
• /
• 제15권3호
• /
• pp.1-6
• /
• 2015

사물인터넷(IoT: Internet of Thing) 기술은 사용자 주변의 사물들이 상호 연결되어 정보를 공유할 수 있도록 해준다. IoT 환경에서 보안은 민감한 개인 정보 유출뿐만 아니라 생명에 직결 된 문제가 발생 할 수 있기 때문에 반드시 지원되어야하는 핵심 기술이다. 하지만 IoT 서비스를 구성하는 소형장치의 경우 자원이 제한적이며 배터리에 의존하기 때문에 기존 보안기술을 직접 적용하기는 어렵다. PSK(Pre-Shared Key)기반 방식은 통신 주체들이 사전에 안전하게 비밀키를 설정한 뒤 보안 기능을 수행하는 방식으로 경량화 장치에 적합하다. 공개키 알고리즘을 기반으로 세션키를 설정하는 방식보다 적은 비용으로 보안 기술을 구축할 수 있기 때문이다. 그러나 경량화 된 장치는 입출력장치가 부재하기 때문에 PSK를 사전에 안전하게 설정하는 방식은 어렵다. 이를 해결하기 위해 본 논문에서는 자원이 제한적인 소형 장치들을 위한 안전한 초기 설정 기술을 제안하고 구현 결과를 보인다.

• Journal of Electrical Engineering and information Science
• /
• 제2권3호
• /
• pp.105-112
• /
• 1997

The performance of a shared memory multiprocessor system is very sensitive to process scheduling. w can enhance the performance of a whole system as well as of an individual process by taking the multiprocessor characteristics into account in the design of the process scheduler. In this paper, we proposed a general purpose scheduler for a shared memory multiprocessor, called the Two-Level Multi-Scan (TLMS) process scheduler, that considers the processor affinity loosely and decreases the interference among multiple processors greatly. The TLMS scheduler is composed of a local scheduler at each processor and a semi-global scheduler that balances the load among processors. In particular, the semi-global scheduler tries to minimize priority inversion, which is an important factor of the system performance. The TLMS scheduler also tries to reduce the number of resources to be shared and improves the processor utilization. to meet these requirements, th semi-global scheduler interacts with the operation of the local scheduler when a need arises, thus the name is loose processor-affinity. We also show that the proposed scheduling technique can be extended for other types of resources making it a general purpose resource management queue.

• International Journal of Computer Science & Network Security
• /
• 제22권3호
• /
• pp.95-100
• /
• 2022

Cloud computing platform is a shared pool of resources and services with various kind of models delivered to the customers through the Internet. The methods include an on-demand dynamically-scalable form charged using a pay-per-use model. The main problem with this model is the allocation of resource in dynamic. In this paper, we have proposed a mechanism to optimize the resource provisioning task by reducing the job completion time while, minimizing the associated cost. We present the Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing CADRAM system, which includes more than one agent in order to manage and observe resource provided by the service provider while considering the Clients' quality of service (QoS) requirements as defined in the service-level agreement (SLA). Moreover, CADRAM contains a new Virtual Machine (VM) selection algorithm called the Node Failure Discovery (NFD) algorithm. The performance of the CADRAM system is evaluated using the CloudSim tool. The results illustrated that CADRAM system increases resource utilization and decreases power consumption while avoiding SLA violations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2590-2606
• /
• 2014

A problem related to deployment of femtocells is how to manage access of users to radio resources. On one hand, all resources of the femtocell can be reserved for users belonging to a closed subscriber group (CSG), which is a set of users defined by a femtocell subscriber. This approach, known as closed access, however, increases interference to users not included in the CSG as those users do not have a permission to access this femtocell. Contrary, resources can be shared by all users with no priority in an open access mode. In this case, the femtocell subscriber shares radio as well as backhaul resources with all other users. Thus, throughput and quality of service of the subscriber and the CSG users can be deteriorated. To satisfy both the CSG as well as non-CSG users, a hybrid access is seen as a compromise. In this paper, we propose a new approach for sharing radio resources among all users. As in common cases, the CSG users have a priority for usage of a part of resources while rest of the resources is shared by all users proportionally to their requirements. As the simulation results show, the proposed resource sharing scheme significantly improves throughput of the CSG users and their satisfaction with granted bitrates. At the same time, throughput and satisfaction of the non-CSG users is still guaranteed roughly at the same level as if conventional sharing schemes are applied.

• ETRI Journal
• /
• 제43권1호
• /
• pp.53-63
• /
• 2021

Cloud computing has drastically reduced the price of computing resources through the use of virtualized resources that are shared among users. However, the established large cloud data centers have a large carbon footprint owing to their excessive power consumption. Inefficiency in resource utilization and power consumption results in the low fiscal gain of service providers. Therefore, data centers should adopt an effective resource-management approach. In this paper, we present a novel load-balancing framework with the objective of minimizing the operational cost of data centers through improved resource utilization. The framework utilizes a modified genetic algorithm for realizing the optimal allocation of virtual machines (VMs) over physical machines. The experimental results demonstrate that the proposed framework improves the resource utilization by up to 45.21%, 84.49%, 119.93%, and 113.96% over a recent and three other standard heuristics-based VM placement approaches.

• 한국정보과학회논문지:시스템및이론
• /
• 제35권1호
• /
• pp.53-59
• /
• 2008

무선 센서 네트워크의 발달에 따라 그 응용분야는 점점 더 복잡해져 가고 있음에도 불구하고, 대부분의 센서 노드 플랫폼은 여전히 심각한 자원 제약을 가지고 있다. 특히 적은 메모리 공간과 메모리 관리 유닛(MMU)의 부재는 스레드의 스택 관리에 있어 메모리 공간 낭비, 스택 오버플로우와 같은 문제를 야기해왔다. 이에 다 수의 스레드가 하나의 스택을 공유 함으로써 기존의 고정 크기 스택에 의해 낭비되는 메모리의 양을 최소화 시킬 수 있는 공유 스택 기법이 제안되었다. 본 논문에서는, 고정 크기 스택기법과 공유 스택 기법의 수학적 분석 모델을 제시하였다. 그 모델을 바탕으로 각각의 스택 오버플로우 확률을 계산하고 공유 스택 기법이 고정 크기 스택보다 더 안정적임을 확인하였다.

• 인터넷정보학회논문지
• /
• 제11권4호
• /
• pp.95-106
• /
• 2010

최근 복잡한 프로그래밍 환경에서 다수의 프로세스들은 서로 협력하기 위하여 서로 통신하고 자원과 정보를 공유한다. 커널에서는 이것이 가능한 방법으로 프로세스간 통신이라는 IPC(Inter-Process Communication)를 제공한다. 리눅스에서 사용되는 공유 메모리는 동일한 메모리 영역에 여러개의 프로세스가 접근할 수 있도록 해 주는 기술이다. 본 논문에서는 서로 다른 코어에 서로 다른 운영체제를 갖는 듀얼코어 임베디드 리눅스 시스템에서 공유 메모리 성능 개선 방안을 제시하고, MP2530F(ARM926F+ARM946E)의 임베디드 리눅스 시스템을 구축하여 성능을 측정한다. 공유 메모리를 이용한 프로세스의 동작이 별개의 CPU에서 동작되도록 함으로써 성능 향상을 꾀한다.

• 한국정보과학회논문지:시스템및이론
• /
• 제27권3호
• /
• pp.337-344
• /
• 2000

본 논문에서는 다중자원(multiple resource)을 사용하는 시스템의 명세와 검증을 위한 프로세스 대수 ACSMR(Algebra of Communicating Shared Multiple Resources)을 정의한다. ACSMR은 프로세스 대수 기반의 정형기법(formal methods)인 ACSR에 다중자원의 개념을 확장한 것이다. 명세와 검증의 예로 실시간 시스템의 스케줄링 기법의 하나인 Earliest-Deadline-First(EDF)를 멀티프로세서하에서의 시스템의 행동 명세와 다중 포트를 가진 레지스터를 이용한 수퍼스칼라 프로세서의 타이밍 특성과 자원 제한을 묘사하기 위한 명세방법을 제시한다.

• 한국병원경영학회지
• /
• 제19권2호
• /
• pp.89-98
• /
• 2014

The research was to investigate the effect of trust in supervisor, organizational trust and perception on the shared value on innovative behavior. The data were collected from 334 nurses from University hospital of G city. Data were analyzed with frequency, t-test, ANOVA, Scheffe-test, Pearson's correlation coefficient and hierarchical regression, equipped with SPSS 21.0. The results showed that there was correlation among trust in supervisor, organizational trust and perception, and innovative behavior. Therefore, it is considered that the study is the basis to improve innovative behavior of nurses by providing alternatives for achieving trust in supervisor, organizational trust and perception, for sake of efficient management of human resource of nurse of University hospital. This study was supported by research funds from Chosun Nursing College 2013.

• 한국국방경영분석학회지
• /
• 제25권1호
• /
• pp.199-214
• /
• 1999

The Constructive Battle Simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under real-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. Conventionally, scheduling and resource allocation activities which have timing constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rate monotonic scheduling.