• Title/Summary/Keyword: 동적 자원할당

Search Result 213, Processing Time 0.022 seconds

An Adaptive Server Clustering for Terminal Service in a Thin-Client Environment (썬-클라이언트 환경에서의 터미널 서비스를 위한 적응적 서버 클러스터링)

  • Jung Yunjae;Kwak Hukeun;Chung Kyusik
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.582-594
    • /
    • 2004
  • In school PC labs or other educational purpose PC labs with a few dozens of PCs, computers are configured in a distributed architecture so that they are set up, maintained and upgraded separately. As an alternative to the distributed architecture, we can consider a thin-client computing environment. In a thin-client computing environment, client side devices provide mainly I/O functions with user friendly GUI and multimedia processing support whereas remote servers called terminal server provide computing power. In order to support many clients in the environment, a cluster of terminal servers can be configured. In this architecture, it is difficult due to the characteristics of terminal session persistence and different pattern of computing usage of users so that the utilization of terminal server resources becomes low. To overcome this disadvantage, we propose an adaptive terminal cluster where terminal servers ,ire partitioned into groups and a terminal server in a light-loaded group can be dynamically reassigned to a heavy-loaded group at run time. The proposed adaptive scheme is compared with a generic terminal service cluster and a group based non-adaptive terminal server cluster. Experimental results show the effectiveness of the proposed scheme.

A Time Slot Assignment Scheme for Sensor Data Compression (센서 데이터의 압축을 위한 시간 슬롯 할당 기법)

  • Yeo, Myung-Ho;Kim, Hak-Sin;Park, Hyoung-Soon;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.11
    • /
    • pp.846-850
    • /
    • 2009
  • Recently, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics such as environmental monitoring, smart spaces, medical applications, and precision agriculture. The sensor nodes are battery powered. Therefore, the energy is the most precious resource of a wireless sensor network since periodically replacing the battery of the nodes in large scale deployments is infeasible. Energy efficient mechanisms for gathering sensor readings are indispensable to prolong the lifetime of a sensor network as long as possible. There are two energy-efficient approaches to prolong the network lifetime in sensor networks. One is the compression scheme to reduce the size of sensor readings. When the communication conflict is occurred between two sensor nodes, the sender must try to retransmit its reading. The other is the MAC protocol to prevent the communication conflict. In this paper, we propose a novel approaches to reduce the size of the sensor readings in the MAC layer. The proposed scheme compresses sensor readings by allocating the time slots of the TDMA schedule to them dynamically. We also present a mathematical model to predict latency from collecting the sensor readings as the compression ratio is changed. In the simulation result, our proposed scheme reduces the communication cost by about 52% over the existing scheme.

Core-aware Cache Replacement Policy for Reconfigurable Last Level Cache (재구성 가능한 라스트 레벨 캐쉬 구조를 위한 코어 인지 캐쉬 교체 기법)

  • Son, Dong-Oh;Choi, Hong-Jun;Kim, Jong-Myon;Kim, Cheol-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.1-12
    • /
    • 2013
  • In multi-core processors, Last Level Cache(LLC) can reduce the speed gap between the memory and the core. For this reason, LLC has big impact on the performance of processors. LLC is composed of shared cache and private cache. In computer architecture community, most researchers have mainly focused on the management techniques for shared cache, while management techniques for private cache have not been widely researched. In conventional private LLC, memory is statically assigned to each core, resulting in serious performance degradation when the workloads are not fairly distributed. To overcome this problem, this paper proposes the replacement policy for managing private cache of LLC efficiently. As proposed core-aware cache replacement policy can reconfigure LLC dynamically, hit rate of LLC is increases drastically. Moreover, proposed policy uses 2-bit saturating counters to improve the performance. According to our simulation results, the proposed method can improve hit rates by 9.23% and reduce the access time by 12.85% compared to the conventional method.