• Title/Summary/Keyword: memory load

Search Result 342, Processing Time 0.024 seconds

A 32-bit Microprocessor with enhanced digital signal process functionality (디지털 신호처리 기능을 강화한 32비트 마이크로프로세서)

  • Moon, Sang-ook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.820-822
    • /
    • 2005
  • We have designed a 32-bit microprocessor with fixed point digital signal processing functionality. This processor, combines both general-purpose microprocessor and digital signal processor functionality using the reduced instruction set computer design principles. It has functional units for arithmetic operation, digital signal processing and memory access. They operate in parallel in order to remove stall cycles after DSP or load/store instructions, which usually need one or more issue latency cycles in addition to the first issue cycle. High performance was achieved with these parallel functional units while adopting a sophisticated five-stage pipeline stucture.

  • PDF

Study of Small and Medium-Sized VDR Device with Camera and Data Control Method for Efficiency Garantee of Ship Navigation System (선박 네비게이션 시스템의 효율성 보장을 위한 카메라 장착 중소형 VDR장치 및 데이터 제어방법 연구)

  • Min, Byung Guk;Ha, Tae Jin;Kim, Young Soo;Park, Jung Min;Cha, Jun Sub
    • Smart Media Journal
    • /
    • v.2 no.1
    • /
    • pp.42-47
    • /
    • 2013
  • The paper presents VDR system for efficiency of ocean navigation device and how to output and to save data using this system as well as compressed digital data and analog video output from the camera are utilized at the same time. The compressed digital data is used to store video for VDR device while analog video is used to display on screen in real-time so that VDR system saves the load on SD memory card without navigation terminal and output it with real-time video. Also, the control method using VDR system are proposed for saving and outputting data.

  • PDF

A Load Balancing Scheme for Distributed SDN Based on Harmony Search with K-means Clustering (K-means 군집화 및 Harmony Search 알고리즘을 이용한 분산 SDN의 부하 분산 기법)

  • Kim, Se-Jun;Yoo, Seung-Eon;Lee, Byung-Jun;Kim, Kyung-Tae;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.01a
    • /
    • pp.29-30
    • /
    • 2019
  • 본 논문에서는 다중 컨트롤러가 존재하는 분산 SDN 환경에서 과도한 제어 메시지로 인한 과부하된 컨트롤러의 부하를 줄이기 위하여 이주할 스위치를 K-means 군집화와 Harmony Search(HS)를 기반으로 선정 하는 기법을 제안하였다. 기존에 HS를 이용하여 이주할 스위치를 선택하는 기법이 제시되었으나, 시간 소모에 비하여 정확도가 부족한 단점이 있다. 또한 Harmony Memory(HM) 구축을 위해 메모리 소모 또한 크다. 이를 해결하기 위하여 본 논문에서는 유클리드 거리를 기반으로 하는 K-means 군집화를 이용하여 이주할 스위치를 골라내어 HM의 크기를 줄이고 이주 효율을 향상 시킨다.

  • PDF

Multi-disciplinary Optimization of Composite Sandwich Structure for an Aircraft Wing Skin Using Proper Orthogonal Decomposition (적합직교분해법을 이용한 항공기 날개 스킨 복합재 샌드위치 구조의 다분야 최적화)

  • Park, Chanwoo;Kim, Young Sang
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.7
    • /
    • pp.535-540
    • /
    • 2019
  • The coupling between different models for MDO (Multi-disciplinary Optimization) greatly increases the complexity of the computational framework, while at the same time increasing CPU time and memory usage. To overcome these difficulties, POD (Proper Orthogonal Decomposition) and RBF (Radial Basis Function) are used to solve the optimization problem of determining the thickness of composites and sandwich cores when composite sandwich structures are used as aircraft wing skin materials. POD and RBF are used to construct surrogate models for the wing shape and the load data. Optimization is performed using the objective function and constraint function values which are obtained from the surrogate models.

Deep Learning based Human Recognition using Integration of GAN and Spatial Domain Techniques

  • Sharath, S;Rangaraju, HG
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.8
    • /
    • pp.127-136
    • /
    • 2021
  • Real-time human recognition is a challenging task, as the images are captured in an unconstrained environment with different poses, makeups, and styles. This limitation is addressed by generating several facial images with poses, makeup, and styles with a single reference image of a person using Generative Adversarial Networks (GAN). In this paper, we propose deep learning-based human recognition using integration of GAN and Spatial Domain Techniques. A novel concept of human recognition based on face depiction approach by generating several dissimilar face images from single reference face image using Domain Transfer Generative Adversarial Networks (DT-GAN) combined with feature extraction techniques such as Local Binary Pattern (LBP) and Histogram is deliberated. The Euclidean Distance (ED) is used in the matching section for comparison of features to test the performance of the method. A database of millions of people with a single reference face image per person, instead of multiple reference face images, is created and saved on the centralized server, which helps to reduce memory load on the centralized server. It is noticed that the recognition accuracy is 100% for smaller size datasets and a little less accuracy for larger size datasets and also, results are compared with present methods to show the superiority of proposed method.

Implementing Firewall to Mitigate YOYO Attack on Multi Master Cluster Nodes Using Fail2Ban

  • Muhammad Faraz Hyder;Muhammad Umer Farooq;Mustafa Latif;Faizan Razi Khan;Abdul Hameed;Noor Qayyum Khan;M. Ahsan Siddiqui
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.2
    • /
    • pp.126-132
    • /
    • 2023
  • Web technology is evolving with the passage of time, from a single node server to high availability and then in the form of Kubernetes. In recent years, the research community have been trying to provide high availability in the form of multi master cluster with a solid election algorithm. This is helpful in increasing the resources in the form of pods inside the worker node. There are new impact of known DDoS attack, which is utilizing the resources at its peak, known as Yoyo attack. It is kind of burst attack that can utilize CPU and memory to its limit and provide legit visitors with a bad experience. In this research, we tried to mitigate the Yoyo attack by introducing a firewall at load-balancer level to prevent the attack from going to the cluster network.

A Resource Planning Policy to Support Variable Real-time Tasks in IoT Systems (사물인터넷 시스템에서 가변적인 실시간 태스크를 지원하는 자원 플래닝 정책)

  • Hyokyung Bahn;Sunhwa Annie Nam
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.4
    • /
    • pp.47-52
    • /
    • 2023
  • With the growing data size and the increased computing load in machine learning, energy-efficient resource planning in IoT systems is becoming increasingly important. In this paper, we suggest a new resource planning policy for real-time workloads that can be fluctuated over time in IoT systems. To handle such situations, we categorize real-time tasks into fixed tasks and variable tasks, and optimize the resource planning for various workload conditions. Based on this, we initiate the IoT system with the configuration for the fixed tasks, and when variable tasks are activated, we update the resource planning promptly for the situation. Simulation experiments show that the proposed policy saves the processor and memory energy significantly.

Selecting the Optimal Loading Location through Prediction of Required Amount for Goods based on Bi-LSTM (Bi-LSTM 기반 물품 소요량 예측을 통한 최적의 적재 위치 선정)

  • Sein Jang;Yeojin Kim;Geuntae Kim;Jonghwan Lee
    • Journal of the Semiconductor & Display Technology
    • /
    • v.22 no.3
    • /
    • pp.41-45
    • /
    • 2023
  • Currently, the method of loading items in the warehouse, the worker directly decides the loading location, and the most used method is to load the product at the location closest to the entrance. This can be effective when there is no difference in the required amount for goods, but when there is a difference in the required amount for goods, it is inefficient because items with a small required amount are loaded near the entrance and occupy the corresponding space for a long time. Therefore, in order to minimize the release time of goods, it is essential to select an appropriate location when loading goods. In this study, a method for determining the loading location by predicting the required amount of goods was studied to select the optimal loading location. Deep learning based bidirectional long-term memory networks (Bi-LSTM) was used to predict the required amount for goods. This study compares and analyzes the release time of goods in the conventional method of loading close to the entrance and in the loading method using the required amount for goods using the Bi-LSTM model.

  • PDF

Retail-Store Type Digital Signage Solution Development And Usability Test Using Android Mini PC (안드로이드 미니PC를 이용한 Retail-Store형 디지털사이니지 솔루션 개발 및 사용성 테스트)

  • Lim, Jungtaek;Shin, Dong-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.4
    • /
    • pp.29-44
    • /
    • 2015
  • Digital Signage, a way of advertising or delivering information to viewers through digital displays, has expanded from being just an advertising channel in public places. Recently, it has become widely prevalent in restaurants and retail stores. Despite its wide expansion, digital signage is limited to specific usages and services and the devices it uses are also quite expensive. This study introduces a stick-type digital signage product that operates on Android OS, which addresses all the weaknesses of digital signage with much more reasonable pricing and stable operation. For stability, performance tests were executed on the hardware and applications. The results for hardware performance were extremely promising, as each scenario's maximum performance results, measured by Load Runner programs, reached target indexes. Also, as a result of the usability test, all participants, including non-digital signage system users (novices), were able to easily learn all the tasks. As a result of user satisfaction survey, positive responses were exhibited for ease of learning and usability (LEU), helpfulness and problem solving capabilities (HPSC), affective aspect and multimedia properties (AAMP), commands and minimal memory load (CMML), and control and efficiency (CE).

Utilizing Channel Bonding-based M-n and Interval Cache on a Distributed VOD Server (효율적인 분산 VOD 서버를 위한 Channel Bonding 기반 M-VIA 및 인터벌 캐쉬의 활용)

  • Chung, Sang-Hwa;Oh, Soo-Cheol;Yoon, Won-Ju;kim, Hyun-Pil;Choi, Young-In
    • The KIPS Transactions:PartA
    • /
    • v.12A no.7 s.97
    • /
    • pp.627-636
    • /
    • 2005
  • This paper presents a PC cluster-based distributed video on demand (VOD) server that minimizes the load of the interconnection network by adopting channel bonding-based MVIA and the interval cache algorithm Video data is distributed to the disks of each server node of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large volume of video data transferred. We adopt two techniques to reduce the load of the interconnection network. First, an Msupporting channel bonding technique is adopted for the interconnection network. n which is a user-level communication protocol that reduces the overhead of the TCP/IP protocol in cluster systems, minimizes the time spent in communicating. We increase the bandwidth of the interconnection network using the channel bonding technique with MThe channel bonding technique expands the bandwidth by sending data concurrently through multiple network cards. Second, the interval cache reduces traffic on the interconnection network by caching the video data transferred from the remote disks in main memory Experiments using the distributed VOD server of this paper showed a maximum performance improvement of $30\%$ compared with a distributed VOD server without channel bonding-based MVIA and the interval cache, when used with a four-node PC cluster.