• Title/Summary/Keyword: in-memory computing

Search Result 766, Processing Time 0.027 seconds

Architecture of Software Testing Tool for Railway Signalling through Actual Use Interface Channel (실사용 인터페이스를 이용한 열차제어 소프트웨어 테스팅 도구의 구조)

  • Hwang, Jong-Gyu;Baek, Jong-Hyun;Jo, Hyun-Jeong;Lee, Kang-Mi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.9
    • /
    • pp.880-886
    • /
    • 2014
  • Many railway signalling functions have increasingly depended on computer software with recent development in computing technology, leading to evolution into more flexible and intelligent railway signalling system. Meanwhile, software programs are likely to have many errors and the cost incurred by such errors has increased. Especially, if fatal software error occurs during railway operation, it may result in loss of lives. So the software verification and validation have become more important. It is needed for software functional safety tool to support these, but most commercial tools depend on direct access to the system's memory, resulting in many difficulties in application. Owing to such difficulties and complexity, they are rarely used in railway signalling system software validation. In this study, a new testing tool for software functional testing through an external interface that can be easily used in functional testing of software was developed. Such testing tool allows development and analysis of test cases for black-box testing through analysis of actually used interface protocols, leading to increased user convenience.

Comparison of encryption algorithm performance between low-spec IoT devices (저 사양 IoT 장치간의 암호화 알고리즘 성능 비교)

  • Park, Jung Kyu;Kim, Jaeho
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.1
    • /
    • pp.79-85
    • /
    • 2022
  • Internet of Things (IoT) connects devices with various platforms, computing power, and functions. Due to the diversity of networks and the ubiquity of IoT devices, demands for security and privacy are increasing. Therefore, cryptographic mechanisms must be strong enough to meet these increased requirements, while at the same time effective enough to be implemented in devices with long-range specifications. In this paper, we present the performance and memory limitations of modern cryptographic primitives and schemes for different types of devices that can be used in IoT. In addition, detailed performance evaluation of the performance of the most commonly used encryption algorithms in low-spec devices frequently used in IoT networks is performed. To provide data protection, the binary ring uses encryption asymmetric fully homomorphic encryption and symmetric encryption AES 128-bit. As a result of the experiment, it can be seen that the IoT device had sufficient performance to implement a symmetric encryption, but the performance deteriorated in the asymmetric encryption implementation.

Parallel Implementations of Digital Focus Indices Based on Minimax Search Using Multi-Core Processors

  • HyungTae, Kim;Duk-Yeon, Lee;Dongwoon, Choi;Jaehyeon, Kang;Dong-Wook, Lee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.542-558
    • /
    • 2023
  • A digital focus index (DFI) is a value used to determine image focus in scientific apparatus and smart devices. Automatic focus (AF) is an iterative and time-consuming procedure; however, its processing time can be reduced using a general processing unit (GPU) and a multi-core processor (MCP). In this study, parallel architectures of a minimax search algorithm (MSA) are applied to two DFIs: range algorithm (RA) and image contrast (CT). The DFIs are based on a histogram; however, the parallel computation of the histogram is conventionally inefficient because of the bank conflict in shared memory. The parallel architectures of RA and CT are constructed using parallel reduction for MSA, which is performed through parallel relative rating of the image pixel pairs and halved the rating in every step. The array size is then decreased to one, and the minimax is determined at the final reduction. Kernels for the architectures are constructed using open source software to make it relatively platform independent. The kernels are tested in a hexa-core PC and an embedded device using Lenna images of various sizes based on the resolutions of industrial cameras. The performance of the kernels for the DFIs was investigated in terms of processing speed and computational acceleration; the maximum acceleration was 32.6× in the best case and the MCP exhibited a higher performance.

Implementation and Experiment of CoAP Protocol Based on IoT for Verification of Interoperability (상호 호환성 검증을 위한 IoT 기반의 CoAP 프로토콜 구현 및 실험)

  • Jin, Wen-Quan;Kim, Do-Hyeun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.7-12
    • /
    • 2014
  • IETF (Internet Engineering Task Force) CoAP (Constrained Application Protocol) protocol is supported communication between sensor or actuator nodes by in a constrained environment, such as small amount of memory, and low power. CoAP and HTTP protocol can convert easily, and can use to monitor or controll the infrastructure utility through low-power sensor and actuator networks in IoT (Internet of Thing) and M2M (Machine-to-Machine) environment. IETF CoRE(Constrained RESTful environments) Working Group proposed CoAP protocol in 2010, and began to standardize it. Recently, CoAP protocol is published RFC (Request for Comments) 7252. In this paper, we design and implement of CoAP protocol for testing the interoperability in heterogeneous operating environments. For this experiment, we developed the CoAP client program based on Windows environment and CoAP server program in Linux environment to test the interoperability.

Development of Software Education Program Using Robot for Students with Developmental Disorder

  • Kim, Jeong-Rang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.12
    • /
    • pp.209-216
    • /
    • 2019
  • In view of the educational effects and social changes of software education, equal opportunities for software education are needed regardless of general students and students with disabilities. However, studies on software education for general students have been actively conducted, but studies on software education for students with disabilities are insufficient. In this study, we developed a robot education software education program for students with developmental disabilities. Developing robot-enabled software education programs for students with developmental disabilities is meaningful in terms of expanding software education opportunities for all. In addition, the robot-based software education program is easy to motivate students with developmental disabilities with low task concentration, short-term memory, and low sociality. Significant changes will be made not only in terms of management capacity, but also in terms of self-efficacy and confidence.

A Proactive Dissemination Protocol using Residual Energy and Signal Strength for WSNs (무선 센서 네트워크에서 에너지 잔량과 신호세기를 이용한 데이터 전송 프로토콜)

  • Park, Soo-Yeon;Kim, Moon-Seong;Jeong, Eui-Hoon;Bang, Young-Cheo
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.33-39
    • /
    • 2010
  • In this paper, a data dissemination protocol that transmits data collected for Wireless Sensor Networks (WSNs) is newly proposed, and the proposed proactive protocol takes into account energy consumption minimized and delay time disseminated. The well-known SPMS (Shortest Path Mined SPIN) forms the shortest path-based routing table obtained by Bellman Ford Algorithm (BFA) and disseminates data using a multi-hop path in order to minimize energy consumption. The mentioned properties of SPMS cause memory burden to create and maintain the routing tables. In addition, whenever BFA is executed, it is necessary to suffer from the energy consumption and traffic occurred. In order to overcome this problem, a proactive dissemination protocol using Residual Energy and Signal Strength, called RESS, is proposed in this paper. Simulation results show that RESS outperforms SPMS up to 84% in terms of the number of traffic messages and the transmitted delay time of RESS is similar to that of SPMS using the shortest path.

A Brief Review on Polarization Switching Kinetics in Fluorite-structured Ferroelectrics (플루오라이트 구조 강유전체 박막의 분극 반전 동역학 리뷰)

  • Kim, Se Hyun;Park, Keun Hyeong;Lee, Eun Been;Yu, Geun Taek;Lee, Dong Hyun;Yang, Kun;Park, Ju Yong;Park, Min Hyuk
    • Journal of Surface Science and Engineering
    • /
    • v.53 no.6
    • /
    • pp.330-342
    • /
    • 2020
  • Since the original report on ferroelectricity in Si-doped HfO2 in 2011, fluorite-structured ferroelectrics have attracted increasing interest due to their scalability, established deposition techniques including atomic layer deposition, and compatibility with the complementary-metal-oxide-semiconductor technology. Especially, the emerging fluorite-structured ferroelectrics are considered promising for the next-generation semiconductor devices such as storage class memories, memory-logic hybrid devices, and neuromorphic computing devices. For achieving the practical semiconductor devices, understanding polarization switching kinetics in fluorite-structured ferroelectrics is an urgent task. To understand the polarization switching kinetics and domain dynamics in this emerging ferroelectric materials, various classical models such as Kolmogorov-Avrami-Ishibashi model, nucleation limited switching model, inhomogeneous field mechanism model, and Du-Chen model have been applied to the fluorite-structured ferroelectrics. However, the polarization switching kinetics of fluorite-structured ferroelectrics are reported to be strongly affected by various nonideal factors such as nanoscale polymorphism, strong effect of defects such as oxygen vacancies and residual impurities, and polycrystallinity with a weak texture. Moreover, some important parameters for polarization switching kinetics and domain dynamics including activation field, domain wall velocity, and switching time distribution have been reported quantitatively different from conventional ferroelectrics such as perovskite-structured ferroelectrics. In this focused review, therefore, the polarization switching kinetics of fluorite-structured ferroelectrics are comprehensively reviewed based on the available literature.

A new warp scheduling technique for improving the performance of GPUs by utilizing MSHR information (GPU 성능 향상을 위한 MSHR 정보 기반 워프 스케줄링 기법)

  • Kim, Gwang Bok;Kim, Jong Myon;Kim, Cheol Hong
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.3
    • /
    • pp.72-83
    • /
    • 2017
  • GPUs can provide high throughput with latency hiding by executing many warps in parallel. MSHR(Miss Status Holding Registers) for L1 data cache tracks cache miss requests until required data is serviced from lower level memory. In recent GPUs, excessive requests for cache resources cause underutilization problem of GPU resources due to cache resource reservation fails. In this paper, we propose a new warp scheduling technique to reduce stall cycles under MSHR resource shortage. Cache miss rates for each warp is predicted based on the observation that each warp shows similar cache miss rates for long period. The warps showing low miss rates or computation-intensive warps are given high priority to be issued when MSHR is full status. Our proposal improves GPU performance by utilizing cache resource more efficiently based on cache miss rate prediction and monitoring the MSHR entries. According to our experimental results, reservation fail cycles can be reduced by 25.7% and IPC is increased by 6.2% with the proposed scheduling technique compared to loose round robin scheduler.

Cache Performance Analysis of Multiprocessor Systems for OLTP Applications based on a Memory-Resident DBMS (메모리 상주 DBMS 기반의 OLTP 응용을 위한 다중프로세서 시스템 캐쉬 성능 분석)

  • Chung, Yong-Wha;Hahn, Woo-Jong;Yoon, Suk-Han;Park, Jin-Won;Lee, Kang-Woo;Kim, Yang-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.4
    • /
    • pp.383-392
    • /
    • 2000
  • Currently, multiprocessors are evaluated almost exclusively with scientific applications. Commercial applications are rarely explored because it is difficult to obtain the source codes of commercial DBMS. Even when the source code is available, such as for POSTGRES, understanding the source code enough to perform detailed meaningful performance evaluations is a daunting task for computer architects.To evaluate multiprocessors with commercial applications, we have developed our own DBMS, called EZDB. EZDB is a parallelized DBMS, loosely inspired from POSTGRES, and running on top of a software architecture simulator. It is capable of executing parallel programs written in SQL. Contrary to POSTGRES, EZDB is not intended as a prototype for a production-quality DBMS. Its purpose is to easily run and evaluate the performance of commercial applications on multiprocessor architectures. To illustrate the usefulness of EZDB, we showed the cache performance data collected for the TPC-B benchmark on a shared-memory multiprocessor. The simulation results showed that the data structures exhibited unique sharing characteristics and that their locality properties and working sets were very different from those in scientific applications.

  • PDF

A Practical Quality Model for Evaluation of Mobile Services Based on Mobile Internet Device (모바일 인터넷 장비에 기반한 모바일 서비스 평가를 위한 실용적인 품질모델)

  • Oh, Sang-Hun;La, Hyun-Jung;Kim, Soo-Dong
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.5
    • /
    • pp.341-353
    • /
    • 2010
  • Mobile Internet Device (MID) allows users to flexibly use various forms of wireless internet such as Wi-Fi, GSM, CDMA, and 3G. Using such Internet, MID users can utilize application services. MID usage is expected to grow due to the benefits of portability, Internet accessibility, and other convenience. However, it has resource constraints such as limited CPU power, small memory size, limited battery life, and small screen size. Consequently, MIDs are not capable to hold large-sized complex applications and to process a large amount of data in memory. An effective solution to remedy these limitations is to develop cloud services for the required application functionality, to deploy them on the server side, and to let MID users access the services through internet. A major concern on running cloud services for MIDs is the potential problems with low Quality of Service (QoS) due to the characteristics of MIDs. Even measuring the QoS of such services is more technically challenging than conventional quality measurements. In this paper, we first identify the characteristics of MIDs and cloud services for MIDs. Based on these observations, we derive a number of quality attributes and their metrics for measuring QoS of mobile services. A case study of applying the proposed quality model is presented to show its effectiveness and applicability.