• Title/Summary/Keyword: Shared Space Performance

Search Result 53, Processing Time 0.021 seconds

Development ofn Sharing Space Access Management System based on Mobile Key and RCU(Room Control Unit) (모바일 키 및 RCU에 기반한 공유공간 출입관리 시스템 개발)

  • Jung, Sang-Joong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.21 no.4
    • /
    • pp.202-208
    • /
    • 2020
  • Recently, the importance of non-face-to-face has been emphasized due to COVID-19, and the use of sharing spaces is also expanding. The use of uncontact check-in technology for access control of sharing spaces reduces waiting time and optimizes workers' efficiency, resulting in operational cost savings. In this paper, we propose a sharing space access management system based on a mobile key and RCU (Room Control Unit), access to the facility using a mobile key, and monitor the facility using an RCU. Proposal system is for shared accommodation, rental field (residence, sale-selling hotel), shared office, etc. when there is a one-time visitor on a specific day and time, the corresponding password is delivered to the mobile platform to expose and key the existing password. It is supported by a field-adaptive system that can reduce discomfort such as delivery. In order to test the operation of the proposed integrated system, tests were conducted according to scenarios to understand the overall status of the user's reservation, check-in, and check-out, and a 100% success rate was derived for each item by setting performance indicators to prove test reliability.

Load Balancing for CFD Applicationsin Grid Computing Environment

  • Ko, Soon-Heum;Kim, Chong-Am;Rho, Oh-Hyun
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.5 no.1
    • /
    • pp.64-74
    • /
    • 2004
  • The Grid is a communication service that collaborates dispersed highperformance computers so that those can be shared and worked together. It enablesthe analysis of large-scale problem with the reduction of computation time bycollaborating high performance computing resources in dispersed organizations. Thus,the present paper focuses on the efficient flow calculation using the Grid. To increaseparallel efficiency, a simple load balance algorithm for the Grid computing is proposedand applied to various aerodynamic problems.

Performance of DS-CDMA Using Space-Time Beamformers (시공간 빔포머를 사용한 DS-CDMA 시스템의 성능 해석)

  • 김성곤;이성신;변건식
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.167-171
    • /
    • 2002
  • As a channel of a DS-CDMA system is shared among several users, the receivers face the problem of MAI. Also the multipath scenario leads to ISI. Both components are undesired, but unlike the additive noise process, which is usually completely unpredictable, their space-time structure helps to estimate and remove them. This paper investigates a DS-CDMA system with a fading multipath channel. The investigations have been separated into a channel estimation part and a reception part. In the first part, the estimation of multipath parameters(DOA, TOA) are considered, space-time beamformers(Decorrelating, Match-Filter, Wiener-Hopf) are performed in the second part. To assess many different estimation techniques and beamformers, the simulation compared with theoretical values is performed.

  • PDF

A New Buffer Management Scheme using Weighted Dynamic Threshold for QoS Support in Fast Packet Switches with Shared Memories (공유 메모리형 패킷 교환기의 QoS 기능 지원을 위한 가중형 동적 임계치를 이용한 버퍼 관리기법에 관한 연구)

  • Kim Chang-Won;Kim Young-Beom
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.3
    • /
    • pp.136-142
    • /
    • 2006
  • Existing buffer management schemes for shared-memory output queueing switches can be classified into two types: In the first type, some constant amount of memory space is guaranteed to each virtual queue using static queue thresholds. The static threshold method (ST) belongs to this type. On the other hand, the second type of approach tries to maximize the buffer utilization in 머 locating buffer memories. The complete sharing (CS) method is classified into this type. In the case of CS, it is very hard to protect regular traffic from mis-behaving traffic flows while in the case of ST the thresholds can not be adjusted according to varying traffic conditions. In this paper, we propose a new buffer management method called weighted dynamic thresholds (WDT) which can process packet flows based on loss priorities for quality-of-service (QoS) functionalities with fairly high memory utilization factors. We verified the performance of the proposed scheme through computer simulations.

  • PDF

A Design of AXI hybrid on-chip Bus Architecture for the Interconnection of MPSoC (MPSoC 인터커넥션을 위한 AXI 하이브리드 온-칩 버스구조 설계)

  • Lee, Kyung-Ho;Kong, Jin-Hyeung
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.8
    • /
    • pp.33-44
    • /
    • 2011
  • In this paper, we presents a hybrid on-chip bus architecture based on the AMBA 3.0 AXI protocol for MPSoC with high performance and low power. Among AXI channels, data channels with a lot of traffic are designed by crossbar-switch architecture for massively parallel processing. On the other hand, addressing and write-response channels having a few of traffic is handled by shared-bus architecture due to the overheads of (areas, interconnection wires and power consumption) reduction. In experiments, the comparisons are carried out in terms of time, space and power domains for the verification of proposed hybrid on-chip bus architecture. For $16{\times}16$ bus configuration, the hybrid on-chip bus architecture has almost similar performance in time domain with respect to crossbar on-chip bus architecture, as the masters's latency is differenced about 9% and the total execution time is only about 4%. Furthermore, the hybrid on-chip bus architecture is very effective on the overhead reduction, such as it reduced about 47% of areas, and about 52% of interconnection wires, as well as about 66% of dynamic power consumption. Thus, the presented hybrid on-chip bus architecture is shown to be very effective for the MPSoC interconnection design aiming at high performance and low power.

Efficient Exploration of On-chip Bus Architectures and Memory Allocation (온 칩 버스 구조와 메모리 할당에 대한 효율적인 설계 공간 탐색)

  • Kim Sungcham;Im Chaeseok;Ha Soonhoi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.2
    • /
    • pp.55-67
    • /
    • 2005
  • Separation between computation and communication in system design allows the system designer to explore the communication architecture independently of component selection and mapping. In this paper we present an iterative two-step exploration methodology for bus-based on-chip communication architecture and memory allocation, assuming that memory traces from the processing elements are given from the mapping stage. The proposed method uses a static performance estimation technique to reduce the large design space drastically and quickly, and applies a trace-driven simulation technique to the reduced set of design candidates for accurate Performance estimation. Since local memory traffics as well as shared memory traffics are involved in bus contention, memory allocation is considered as an important axis of the design space in our technique. The viability and efficiency of the proposed methodology arc validated by two real -life examples, 4-channel digital video recorder (DVR) and an equalizer for OFDM DVB-T receiver.

Sphere Decoding Algorithm and VLSI Implementation Using Two-Level Search (2 레벨 탐색을 이용한 스피어 디코딩 알고리즘과 VLSI 구현)

  • Huynh, Tronganh;Cho, Jong-Min;Kim, Jin-Sang;Cho, Won-Kyung
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.6
    • /
    • pp.104-110
    • /
    • 2008
  • In this paper, a novel 2-level-search sphere decoding algorithm for multiple-input multiple-output (MIMO) detection and its VLSI implementation are presented. The proposed algorithm extends the search space by concurrently performing symbol detection on 2 level of the tree search. Therefore, the possibility of discarding good candidates can be avoided. Simulation results demonstrate the good performance of the proposed algorithm in terms of bit-error-rate (BER). From the proposed algorithm, an efficient very large scale integration (VLSI) architecture which incorporates low-complexity and fixed throughput features is proposed. The proposed architecture supports many modulation techniques such as BPSK, QPSK, 16-QAM and 64-QAM. The sorting block, which occupies a large portion of hardware utilization, is shared for different operating modes to reduce the area. The proposed hardware implementation results show the improvement in terms of area and BER performance compared with existing architectures.

Design of a Height Adjustable Bunker Bed Using a Gas Spring (가스 스프링을 이용한 높이조절 벙커침대 설계)

  • Jung, Gyuhong
    • Journal of Drive and Control
    • /
    • v.18 no.4
    • /
    • pp.19-27
    • /
    • 2021
  • A bunker bed is a type of furniture that efficiently utilizes a narrow indoor space by having a high bed and using the empty space below as a living and storage space. The demand for multi-purpose furniture is increasing due to the recent increase in single-person households and wide-spread shared accommodation. According to the consumer research, one of the major drawbacks of a bunker bed was to get on and off the bed through a ladder or stairs. In order to overcome these problems, it was confirmed that the height adjustment function that can easily adjust the minimum and maximum heights of the bed was necessary. In this study, a height adjustable bunker bed was designed by using a gas spring that generates a repulsive force by the compressed gas inside. The design process consisted of the following three steps: Firstly, the hysteresis characteristics due to a friction and spring constant of a commercial gas spring were confirmed by measuring the repulsive force vs. compressed displacement. Secondly, requirements of the vertical lifting force exerted on the bed against gravity force were derived. Finally, the height-adjustable bed using the four-bar link mechanism was designed with 4 parameters so that the bed weight of 60-70 kgf could be adjusted to 800 mm in height by an affordable initial operation force. The performance was verified through prototype production and the results of vertical displacement and force to move were nearly the same as designed. In addition, an electrically operated height-adjustable bed was also designed with linear actuators and the performance was proved with the prototype.

Exploring the Relationship between Shared Space and Performance in Multi-Task Learning (Multi-Task Learning에서 공유 공간과 성능과의 관계 탐구)

  • Seong, Su-Jin;Park, Seong-Jae;Jeong, In-Gyu;Cha, Jeong-Won
    • Annual Conference on Human and Language Technology
    • /
    • 2018.10a
    • /
    • pp.305-309
    • /
    • 2018
  • 딥러닝에서 층을 공유하여 작업에 따라 변하지 않는 정보를 사용하는 multi-task learning이 다양한 자연어 처리 문제에 훌륭하게 사용되었다. 그렇지만 우리가 아는 한 공유 공간의 상태와 성능과의 관계를 조사한 연구는 없었다. 본 연구에서는 공유 공간과 task 의존 공간의 자질의 수와 오염 정도가 성능에 미치는 영향도 조사하여 공유 공간과 성능 관계에 대해서 탐구한다. 이 결과는 multi-task를 진행하는 실험에서 공유 공간의 역할과 성능의 관계를 밝혀서 시스템의 성능 향상에 도움이 될 것이다.

  • PDF

A Simulation Model of Object Movement for Evaluating the Communication Load in Networked Virtual Environments

  • Lim, Mingyu;Lee, Yunjin
    • Journal of Information Processing Systems
    • /
    • v.9 no.3
    • /
    • pp.489-498
    • /
    • 2013
  • In this paper, we propose a common simulation model that can be reused for different performance evaluations of networked virtual environments. To this end, we analyzed the common features of NVEs, in which multiple regions compose a shared space, and where a user has his/her own interest area. Communication architecture can be client-server or peer-server models. In usual simulations, users move around the world while the number of users varies with the system. Our model provides various simulation parameters to customize the region configuration and user movement pattern. Furthermore, our model introduces a way to mimic a lot of users in a minimal experiment environment. The proposed model is integrated with our network framework, which supports various scalability approaches. We specifically applied our model to the interest management and load distribution schemes to evaluate communication overhead. With the proposed simulation model, a new simulation can be easily designed in a large-scale environment.