• Title/Summary/Keyword: Computer data processing

Search Result 4,294, Processing Time 0.029 seconds

Software structure design for processing various tactical data

  • Kim, Jin Woo;Lee, Woo Sin;Lee, Seung Chan;Kim, Young Don;Jin, So Yeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.11
    • /
    • pp.39-47
    • /
    • 2017
  • In this paper, we propose a message transmission processing structure for efficient use of radio resources. Existing tactical data links have more data and accumulate more data than the amount of tactical data planned according to the situation. This may result in delays in operations and additional problems. To prevent this, priority is assigned to the message and transmission is performed according to the priority on a single basis. And we design a processing structure that can update duplicate messages and delete old messages in order to prevent waste of radio resources. Experiments are conducted to verify that these structures can be implemented and applied to data links.

Pre-arrangement Based Task Scheduling Scheme for Reducing MapReduce Job Processing Time (MapReduce 작업처리시간 단축을 위한 선 정렬 기반 태스크 스케줄링 기법)

  • Park, Jung Hyo;Kim, Jun Sang;Kim, Chang Hyeon;Lee, Won Joo;Jeon, Chang Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.23-30
    • /
    • 2013
  • In this paper, we propose pre-arrangement based task scheduling scheme to reduce MapReduce job processing time. If a task and data to be processed do not locate in same node, the data should be transmitted to node where the task is allocated on. In that case, a job processing time increases owing to data transmission time. To avoid that case, we schedule tasks into two steps. In the first step, tasks are sorted in the order of high data locality. In the second step, tasks are exchanged to improve their data localities based on a location information of data. In performance evaluation, we compare the proposed method based Hadoop with a default Hadoop on a small Hadoop cluster in term of the job processing time and the number of tasks sorted to node without data to be processed by them. The result shows that the proposed method lowers job processing time by around 18%. Also, we confirm that the number of tasks allocated to node without data to be processed by them decreases by around 25%.

Implementation of SIMD-based Many-Core Processor for Efficient Image Data Processing (효율적인 영상데이터 처리를 위한 SIMD기반 매니코어 프로세서 구현)

  • Choi, Byong-Kook;Kim, Cheol-Hong;Kim, Jong-Myon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.1
    • /
    • pp.1-9
    • /
    • 2011
  • Recently, as mobile multimedia devices are used more and more, the needs for high-performance and low-energy multimedia processors are increasing. Application-specific integrated circuits (ASIC) can meet the needed high performance for mobile multimedia, but they provide limited, if any, generality needed for various application requirements. DSP based systems can used for various types of applications due to their generality, but they require higher cost and energy consumption as well as less performance than ASICs. To solve this problem, this paper proposes a single instruction multiple data (SIMD) based many-core processor which supports high-performance and low-power image data processing while keeping generality. The proposed SIMD based many-core processor composed of 16 processing elements (PEs) exploits large data parallelism inherent in image data processing. Experimental results indicate that the proposed SIMD-based many-core processor higher performance (22 times better), energy efficiency (7 times better), and area efficiency (3 times better) than conversional commercial high-performance processors.

Future Trends of IoT, 5G Mobile Networks, and AI: Challenges, Opportunities, and Solutions

  • Park, Ji Su;Park, Jong Hyuk
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.743-749
    • /
    • 2020
  • Internet of Things (IoT) is a growing technology along with artificial intelligence (AI) technology. Recently, increasing cases of developing knowledge services using information collected from sensor data have been reported. Communication is required to connect the IoT and AI, and 5G mobile networks have been widely spread recently. IoT, AI services, and 5G mobile networks can be configured and used as sensor-mobile edge-server. The sensor does not send data directly to the server. Instead, the sensor sends data to the mobile edge for quick processing. Subsequently, mobile edge enables the immediate processing of data based on AI technology or by sending data to the server for processing. 5G mobile network technology is used for this data transmission. Therefore, this study examines the challenges, opportunities, and solutions used in each type of technology. To this end, this study addresses clustering, Hyperledger Fabric, data, security, machine vision, convolutional neural network, IoT technology, and resource management of 5G mobile networks.

1H*-tree: An Improved Data Cube Structure for Multi-dimensional Analysis of Data Streams (1H*-tree: 데이터 스트림의 다차원 분석을 위한 개선된 데이터 큐브 구조)

  • XiangRui Chen;YuXiang Cheng;Yan Li;Song-Sun Shin;Dong-Wook Lee;Hae-Young Bae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.332-335
    • /
    • 2008
  • In this paper, based on H-tree, which is proposed as the basic data cube structure for multi-dimensional data stream analysis, we have done some analysis. We find there are a lot of redundant nodes in H-tree, and the tree-build method can be improved for saving not only memory, but also time used for inserting tuples. Also, to facilitate more fast and large amount of data stream analysis, which is very important for stream research, H*-tree is designed and developed. Our performance study compare the proposed H*-tree and H-tree, identify that H*-tree can save more memory and time during inserting data stream tuples.

Implementation of a Real-time Data fusion Algorithm for Flight Test Computer (비행시험통제컴퓨터용 실시간 데이터 융합 알고리듬의 구현)

  • Lee, Yong-Jae;Won, Jong-Hoon;Lee, Ja-Sung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.8 no.4 s.23
    • /
    • pp.24-31
    • /
    • 2005
  • This paper presents an implementation of a real-time multi-sensor data fusion algorithm for Flight Test Computer. The sensor data consist of positional information of the target from a radar, a GPS receiver and an INS. The data fusion algorithm is designed by the 21st order distributed Kalman Filter which is based on the PVA model with sensor bias states. A fault detection and correction logics are included in the algorithm for bad measurements and sensor faults. The statistical parameters for the states are obtained from Monte Carlo simulations and covariance analysis using test tracking data. The designed filter is verified by using real data both in post processing and real-time processing.

KIM-1 microcomputer를 이용한 low-cost image processor 설계에 관하여

  • 유근호
    • 전기의세계
    • /
    • v.30 no.12
    • /
    • pp.793-796
    • /
    • 1981
  • 최근 우리나라에도 digital image processing에 대한 연구가 활발이 진행되고 있다. 또한 digital image processing의 생체공학에의 응용도 괄목할 만하다. 이러한 연구와 응용에 도움이 되고자 microcomputer를 이용한 image processor설계의 실례를 기술하고자 한다. 이 설계는 목적 image를 stationary image로 가정하여 TV카메라의 영상신호를 sample하여 computer 기억장치에 저장하므로 가격이 저렴하게 된다. 이러한 장치로서는 DMA연결 (Direct Memory Access interface)을 사용하여 빠른 data transfer를 달성할 수 있다. Digital image processing계는 기본적으로 microcomputer가 TV카메라와 TV모니터에 연결된 구조를 하고 있다. Computer가 기억장치에 저장된 data를 처리하여 필요한 정보를 얻게 된다. 이러한 data 처리를 하므로서 image를 사용자가 해석하기 쉽도록 image질을 향상시키거나 computer가 image를 인식하게 한다. 이와같이 처리된 image는 TV모니터를 통해서 볼 수 있다. 본지에서는 256x256개의 pixel들로 이루어지고, 각개의 pixel은 4개의 bit로 구성된 image processor의 설계를 기술한다.

  • PDF

Improved Statistical Language Model for Context-sensitive Spelling Error Candidates (문맥의존 철자오류 후보 생성을 위한 통계적 언어모형 개선)

  • Lee, Jung-Hun;Kim, Minho;Kwon, Hyuk-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.371-381
    • /
    • 2017
  • The performance of the statistical context-sensitive spelling error correction depends on the quality and quantity of the data for statistical language model. In general, the size and quality of data in a statistical language model are proportional. However, as the amount of data increases, the processing speed becomes slower and storage space also takes up a lot. We suggest the improved statistical language model to solve this problem. And we propose an effective spelling error candidate generation method based on a new statistical language model. The proposed statistical model and the correction method based on it improve the performance of the spelling error correction and processing speed.

Locally weighted linear regression prefetching method for hybrid memory system (하이브리드 메모리 시스템의 지역 가중 선형회귀 프리페치 방법)

  • Tang, Qian;Kim, Jeong-Geun;Kim, Shin-Dug
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.11a
    • /
    • pp.12-15
    • /
    • 2020
  • Data access characteristics can directly affect the efficiency of the system execution. This research is to design an accurate predictor by using historical memory access information, where highly accessible data can be migrated from low-speed storage (SSD/HHD) to high-speed memory (Memory/CPU Cache) in advance, thereby reducing data access latency and further improving overall performance. For this goal, we design a locally weighted linear regression prefetch scheme to cope with irregular access patterns in large graph processing applications for a DARM-PCM hybrid memory structure. By analyzing the testing result, the appropriate structural parameters can be selected, which greatly improves the cache prefetching performance, resulting in overall performance improvement.

Spatio-temporal Query Processing Systems for Ubiquitous Environments

  • Kim, Jeong Joon;Kang, Jeong Jin;Rothwell, Edward J.;Lee, Ki Young
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.5 no.2
    • /
    • pp.1-4
    • /
    • 2013
  • With the recent development of the ubiquitous computing technology, there are increasing interest and research in technologies such as sensors and RFID related to information recognition and location positioning in various ubiquitous fields. Especially, RTLS (Real-Time Locating Services) dealing with spatio-temporal data is emerging as a promising technology. For these reasons, the ISO/IEC published RTLS standard specification for compatibility and interoperability in RTLS. Therefore, in this paper, we designed and implemented Spatio-temporal Query Processing Systems for efficiently managing and searching the incoming Spatio-temporal data stream of moving objects. Spatio-temporal Query Processing Systems's spatio-temporal middleware maintains interoperability among heterogeneous devices and guarantees data integrity in query processing through real time processing of unceasing spatio-temporal data streams and two way synchronization of spatio-temporal DBMSs. Web Server uses the SOAP(Simple Object Access Protocol) message between client and server for interoperability and translates client's SOAP message into CQL(Continuous Query Language) of the spatio-temporal middleware.