• Title/Summary/Keyword: Shared Resource

Search Result 253, Processing Time 0.036 seconds

Secure Configuration Scheme of Pre-shared Key for Lightweight Devices in Internet of Things (사물인터넷의 경량화 장치를 위한 안전한 Pre-shared Key 설정 기술)

  • Kim, Jeongin;Kang, Namhi
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.1-6
    • /
    • 2015
  • The IoT(Internet of things) technology enable objects around user to be connected with each other for sharing information. To support security is the mandatory requirement in IoT because it is related to the disclosure of private information but also directly related to the human safety. However, it is difficult to apply traditional security mechanism into lightweight devices. This is owing to the fact that many IoT devices are generally resource constrained and powered by battery. PSK(Pre-Shared Key) based approach, which share secret key in advance between communication entities thereafter operate security functions, is suitable for light-weight device. That is because PSK is costly efficient than a session key establishment approach based on public key algorithm. However, how to safely set a PSK of the lightweight device in advance is a difficult issue because input/output interfaces such as keyboard or display are constrained in general lightweight devices. To solve the problem, we propose and develop a secure PSK configuration scheme for resource constrained devices in IoT.

Two-Level Multi-Scan Scheduler Using Resource Partition Strategy by Loose Processor-Affinity

  • Sohn, Jong-Moon;Kim, Gil-Yong
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.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.

  • PDF

CADRAM - Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing

  • Abdullah, M.;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.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.

Radio Resource Sharing Among Users in Hybrid Access Femtocells

  • Becvar, Zdenek;Plachy, Jan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.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.

Resource-efficient load-balancing framework for cloud data center networks

  • Kumar, Jitendra;Singh, Ashutosh Kumar;Mohan, Anand
    • ETRI Journal
    • /
    • v.43 no.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.

Performance Analysis of Shared Stack Management for Sensor Operating Systems (센서 운영 체제를 위한 공유 스택 기법의 성능 분석)

  • Gu, Bon-Cheol;Heo, Jun-Young;Hong, Ji-Man;Cho, Yoo-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.1
    • /
    • pp.53-59
    • /
    • 2008
  • In spite of increasing complexity of wireless sensor network applications, most of the sensor node platforms still have severe resource constraints. Especially a small amount of memory and absence of a memory management unit (MMU) cause many problems in managing application thread stacks. Hence, a shared-stack was proposed, which allows several threads to share one single stack for minimizing the amount of memory wasted by fixed-size stacks. In this paper, we present the memory usage models for thread stacks by deriving the overflow probability of the fixed-size stack and the shared-stack and also show that the shared-stack is more reliable than the fixed-size stack.

Improvement Method and Performance Analysis of Shared Memory in Dual Core Embedded Linux system (듀얼코어 임베디드 리눅스 시스템에서 공유 메모리 성능 개선 방안 및 성능 분석)

  • Jung, Ji-Sung;Kim, Chang-Bong
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.95-106
    • /
    • 2010
  • Recently multiple process communicate together. They share resource and information for cooperation in complicated programming environment. Kernel provides IPC (Inter -Process Communication) for communication with each other process. Shared Memory is a technique that many processes can access to identical memory area in the Linux environment. In this paper, we propose a performance improvement method of shared memory in the dual-core embedded linux system which is consist of different core and different operating system. We construct the MPC2530F (ARM926F+ARM946E) linux system and measure the performance therein. We attempt a performance enhancement in each CPU for each process which uses a shared memory.

Process Algebra for Multiple Shared Resources (다중 공유 자원을 위한 프로세스 대수)

  • Yoo, Hee-Jun;Lee, Ki-Huen;Choi, Jin-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.3
    • /
    • pp.337-344
    • /
    • 2000
  • In this paper, we define a Process Algebra ACSMR(Algebra of Communicating Shared Multiple Resources) for system specification and verification using multiple resources. ACSMR extends a concept of multiple resources in ACSR that is a branch of formal methods based on process algebra. We'll show that two specification and verification examples. One is the specification of system behavior in multiprocessor using EDF(Earliest-Deadline-First) which is a scheduling algorithm of a real-time system. The other is the specification of describing timing analysis and resources restriction in a super scalar processor using multiple ports registers.

  • PDF

The Effect of a University Hospital Nurse's Trust in Supervisor, Organizational Trust and Perception on the Shared Value on Innovative Behavior (일개 대학병원 간호사의 상사신뢰, 조직신뢰와 공유가치 인식도가 혁신행동에 미치는 영향)

  • Min, Soon;Shin, Chul-Wha;Shin, Myeong-Gi
    • Korea Journal of Hospital Management
    • /
    • v.19 no.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.

  • PDF

Event-Driven Real-Time Simulation Based On The RM Scheduling and Lock-free Shared Objects

  • Park, Hyun Kyoo
    • Journal of the military operations research society of Korea
    • /
    • v.25 no.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.

  • PDF