• Title/Summary/Keyword: processor sharing

Search Result 112, Processing Time 0.034 seconds

A Design of Authentication/Security Processor IP for Wireless USB (무선 USB 인증/보안용 프로세서 IP 설계)

  • Yang, Hyun-Chang;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.11
    • /
    • pp.2031-2038
    • /
    • 2008
  • A small-area and high-speed authentication/security processor (WUSB_Sec) IP is designed, which performs the 4-way handshake protocol for authentication between host and device, and data encryption/decryption of wireless USB system. The PRF-256 and PRF-64 are implemented by CCM (Counter mode with CBC-MAC) operation, and the CCM is designed with two AES (Advanced Encryption Standard) encryption coles working concurrently for parallel processing of CBC mode and CTR mode operations. The AES core that is an essential block of the WUSB_Sec processor is designed by applying composite field arithmetic on AF$(((2^2)^2)^2)$. Also, S-Box sharing between SubByte block and key scheduler block reduces the gate count by 10%. The designed WUSB_Sec processor has 25,000 gates and the estimated throughput rate is about 480Mbps at 120MHz clock frequency.

Minimum-Power Scheduling of Real-Time Parallel Tasks based on Load Balancing for Frequency-Sharing Multicore Processors (주파수 공유형 멀티코어 프로세서를 위한 부하균등화에 기반한 실시간 병렬 작업들의 최소 전력 스케줄링)

  • Lee, Wan Yeon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.6
    • /
    • pp.177-184
    • /
    • 2015
  • This paper proposes a minimum-power scheduling scheme of real-time parallel tasks while meeting deadlines of the real-time tasks on DVFS-enabled multicore processors. The proposed scheme first finds a floating number of processing cores to each task so that the computation load of all processing cores would be equalized. Next the scheme translates the found floating number of cores into a natural number of cores while maintaining the computation load of all cores unchanged, and allocates the translated natural number of cores to the execution of each task. The scheme is designed to minimize the power consumption of the frequency-sharing multicore processor operating with the same processing speed at an instant time. Evaluation shows that the scheme saves up to 38% power consumption of the previous method.

A Study on the Automated e-book Electronic Publishing System (자동화된 e-book 전자출판 시스템에 관한 연구)

  • Joo, Sang-woong;Kang, Hyun-jin;Kim, Kyung-hwan;Kim, Chang-su;Jung, Hoe-kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.617-619
    • /
    • 2015
  • If you are sharing a manual created in small organizations, webzine, and other publications, the original or a PDF file or a file created with a word processor to facilitate the sharing of publications and the members of the organization through the data downloaded from the mail or the web most have been used. However, users often do not want to see one online source or download the file. In this paper, If the original file of the word processor on windows-based systems, in this paper, only the upload progress in implementing e-book publishing system automatically e-book system is viewable on the Web by providing a range of information for users and small members and we propose a system construction that can be shared.

  • PDF

A Dynamic Resource Allocation scheme with a GPS algorithm in Cellular-based Hybrid and Distributed Wireless Multi-hop Systems (셀룰라 기반의 하이브리드 분산식 멀티홉 시스템에서의 GPS 알고리즘을 이용한 동적 자원할당 기법)

  • Bae, Byung-Joo;Kim, Dong-Kun;Shin, Bong-Jhin;Kang, Byoung-Ik;Hong, Dae-Hyoung;Choe, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1120-1127
    • /
    • 2007
  • In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

A Hierarchical Deficit Round-Robin Algorithm for Packet Scheduling (패킷 스케쥴링을 위한 결손 보완 계층적 라운드로빈 알고리즘)

  • Pyun Kihyun;Cho Sung-Ik;Lee Jong-Yeol
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.147-155
    • /
    • 2005
  • For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to realize a scalable implementation and high fairness simultaneously. Here high fairness means that bandwidth is distributed fairly even in short time intervals. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low fairness. In this paper, we propose a scheduling algorithm that can achieve feasible fairness without losing scalability. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR). While H-DRR requires a constant time for implementation, the achievable fairness is similar to that of Packet-by-Packet Generalized Processor Sharing(PGPS) algorithm. PGPS has worse scalability since it uses a sorted-priority queue requiring O(log N) implementation complexity where N is the number of sessions.

Implementation of An Embedded Communication Translator for Remote Control (원격 제어를 위한 임베디드 통신 변환기 구현)

  • Lee Byung-Kwon;Chon Young-Suk;Jeon Joong-Nam
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.445-454
    • /
    • 2006
  • Almost of industrial measuring instruments usually are equipped only with serial communication devices. In order to connect these instruments to internet, we implement an embedded translator. This device has the hardware components composed of one WAN port, two LAN ports, and two UARTs, and functions as a communication translator between serial and internet communication. it also provides web-based monitoring function that is absent from existing serial-to-ethernet converter. The hardware is implemented using the KS8695 network processor which s an ARM922T as processor core. We have installed the boa web server and utilized the CGI function for internet-based remote control, added the IP sharing function which allows the network with private IP addresses to access the internet, and developed a serial-to-ethernet translation program. Finally, we show an application example of the developed translator that remotely monitors the solar energy production system.

A Unified ARIA-AES Cryptographic Processor Supporting Four Modes of Operation and 128/256-bit Key Lengths (4가지 운영모드와 128/256-비트 키 길이를 지원하는 ARIA-AES 통합 암호 프로세서)

  • Kim, Ki-Bbeum;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.795-803
    • /
    • 2017
  • This paper describes a dual-standard cryptographic processor that efficiently integrates two block ciphers ARIA and AES into a unified hardware. The ARIA-AES crypto-processor was designed to support 128-b and 256-b key sizes, as well as four modes of operation including ECB, CBC, OFB, and CTR. Based on the common characteristics of ARIA and AES algorithms, our design was optimized by sharing hardware resources in substitution layer and in diffusion layer. It has on-the-fly key scheduler to process consecutive blocks of plaintext/ciphertext without reloading key. The ARIA-AES crypto-processor that was implemented with a $0.18{\mu}m$ CMOS cell library occupies 54,658 gate equivalents (GEs), and it can operate up to 95 MHz clock frequency. The estimated throughputs at 80 MHz clock frequency are 787 Mbps, 602 Mbps for ARIA with key size of 128-b, 256-b, respectively. In AES mode, it has throughputs of 930 Mbps, 682 Mbps for key size of 128-b, 256-b, respectively. The dual-standard crypto-processor was verified by FPGA implementation using Virtex5 device.

An Efficient Hardware Implementation of ARIA Block Cipher Algorithm (블록암호 알고리듬 ARIA의 효율적인 하드웨어 구현)

  • Kim, Dong-Hyeon;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.91-94
    • /
    • 2012
  • This paper describes an efficient implementation of ARIA crypto algorithm which is a KS (Korea Standards) block cipher algorithm. The ARIA crypto-processor supports three master key lengths of 128/192/256-bit specified in the standard. To reduce hardware complexity, a hardware sharing is employed, which shares round function in encryption/decryption module with key initialization module. It reduces about 20% of gate counts when compared with straightforward implementation. The ARIA crypto-processor is verified by FPGA implementation, and synthesized with a 0.13-${\mu}m$ CMOS cell library. It has 33,218 gates and the estimated throughput is about 640 Mbps at 100 MHz.

  • PDF

A Small-area Hardware Design of 128-bit Lightweight Encryption Algorithm LEA (128비트 경량 블록암호 LEA의 저면적 하드웨어 설계)

  • Sung, Mi-Ji;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.4
    • /
    • pp.888-894
    • /
    • 2015
  • This paper describes an efficient hardware design of Lightweight Encryption Algorithm (LEA) developed by National Security Research Institute(NSRI). The LEA crypto-processor supports for master key of 128-bit. To achieve small-area and low-power implementation, an efficient hardware sharing is employed, which shares hardware resources for encryption and decryption in round transformation block and key scheduler. The designed LEA crypto-processor was verified by FPGA implementation. The LEA core synthesized with Xilinx ISE has 1,498 slice elements, and the estimated throughput is 216.24 Mbps with 135.15 MHz.

Co-scheduling Technique of Dataflow Applications with Shared Processor Allocation (프로세서 공유를 이용한 데이터 플로우 어플리케이션의 동시 스케줄링 기법)

  • Kang, Duseok;Kang, Shinhaeng;Yang, Hoeseok;Ha, Soonhoi
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.1-7
    • /
    • 2016
  • When multiple applications are running concurrently on a multi-processor system, interferences between applications make it difficult to guarantee real-time constraints. We propose a novel interference analysis technique that allows sharing of share processors among dataflow applications, while satisfying real-time constraints. Based on the interference analysis, we develop a co-scheduling technique that aims to minimize the resource usage. Compared to an existent technique that involves converting application graphs to real-time tasks, the proposed technique shows better results in terms of resource usage, especially when it is applied to applications with tight time constraints.