• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.592-607
• /
• 2006

This paper proposes a technique to select processors and hardware IPs and to map the tasks into the selected processing elements, aming to achieve high performance with minimal system cost when multitask applications with real-time constraints are run on a multicore SoC. Such technique is called to 'Hardware-Software Cosynthesis Technique'. A cosynthesis technique was already presented in our early work [1] where we divide the complex cosynthesis problem into three subproblems and conquer each subproblem separately: selection of appropriate processing components, mapping and scheduling of function blocks to the selected processing component, and schedulability analysis. Despite good features, our previous technique has a serious limitation that a task monopolizes the entire system resource to get the minimum schedule length. But in general we may obtain higher performance in multitask multicore system if independent multiple tasks are running concurrently on different processor cores. In this paper, we present two mapping techniques, task mapping avoidance technique(TMA) and task mapping pinning technique(TMP), which are applicable for general cases with diverse operating policies in a multicore environment. We could obtain significant performance improvement for a multimedia real-time application, multi-channel Digital Video Recorder system and for randomly generated multitask graphs obtained from the related works.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.820-824
• /
• 2004

Personal Robot System in developing, have a module architecture, each module are connected through heterogeneors network systems like Ethernet, WLAN (802.11), IEEE1394 (Firewire), Bluetooth, USB, CAN, or RS-232C. In developing personal robot system we think that the key of robot performance is interoperability among modules. Each network protocol are well connected in the view of network system for the interoperability. So we make a bridging architecture that can routing, converting, transporting data packets with matcing each network's properties. Furthermore we suggest a advanced design scheme for realtime / non-realtime and control signal (short, requiring hard-realtime) / multimedia data (large, requiring soft-realtime). By some application systems, we could test performance, interoperability and stability. In this paper, we show our design concept, middleware architecture, and some applications systems using this middleware.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.41-50
• /
• 2001

With growth of Internet, real time multimedia application services require guarantee of QoS (Quality of Service). However, the existing Internet based on best-effort service is not enough to support those services, so MARS model to support IP multicast over ATM networks and RSVP to provide heterogeneous QoS by resource reservation scheme are proposed. As a simulation result, it is proved that processing delay of MARS is increased and success of resource reservation is decreased as a number of QoS change request of a receiver is increased. Therefore, it is important to provide heterogeneous QoS that distribute a load of MARS caused by convergence of messages and efficiently manage the resource of network as to find out scale of receivers and frequency of QoS change request.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.331-341
• /
• 2002

Traditional slicing techniques make slices through dependence graph and improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated. We propose the representation of a dynamic system dependence graph so as to process the slicing of a software system that is composed of related programs in order to process certain jobs. We also propose programs on efficient slicing algorithm using relations of relative tables in order to compute dynamic slices of a software system. Using a marking table from results of the proposed algorithm can make dynamic system dependence graph for dynamic slice generation. Tracing this graph can generate final slices. We have illustrated our example with C program environment. Consequently, the efficiency of the proposed dynamic system dependence graph technique is also compared with the dependence graph techniques discussed previously. As the results, this is certifying that the dynamic system dependence graph is more efficient in comparison with system dependence graph.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.200-208
• /
• 2009

JBIG2, as the next generation standard for binary image compression, must be designed in hardware modules for the JBIG2 FAX to be implemented in an embedded equipment. This paper proposes a hardware module of the high-speed Huffman coder for JBIG2. The Huffman coder of JBIG2 uses selectively 15 Huffman tables. As the Huffman coder is designed to use minimal data and have an efficient memory usage, high speed processing is possible. The designed Huffman coder is ported to Virtex-4 FPGA and co-operating with a software modules on the embedded development board using Microblaze core. The designed IP was successfully verified using the simulation function test and hardware-software co-operating test. Experimental results shows the processing time is 10 times faster than that of software only on embedded system, because of hardware design using an efficient memory usage.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.23-29
• /
• 2015

The baby-step giant-step algorithm seeks b in a discrete logarithm problem when a,c,p of $a^b{\equiv}c$(mod p) are already given. It does so by dividing p by m block of $m={\lceil}{\sqrt{p}}{\rceil}$ length and letting one giant walk straight toward $a^0$ with constant m strides in search for b. In this paper, I basically reduce $m={\lceil}{\sqrt{p}}{\rceil}$ to p/l, $a^l$ > p and replace a giant with an adult who is designed to walk straight with constant l strides. I also extend the algorithm to allow $2^k$ adults to walk simultaneously. As a consequence, the proposed algorithm quarters the execution time of the basic adult-walk method when applied to $2^k$, (k=2) in the range of $1{\leq}b{\leq}p-1$. In conclusion, the proposed algorithm greatly shorten the step number of baby-step giant-step.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.125-132
• /
• 2023

To NP-complete 3-SAT problem, this paper proposes a O(nm) polynomial time algorithm, where n is the number of literals and m is the total frequency of all literals in equation f. Conventionally well-known DPLLs should perform O(2^𝑙) in the worst case by performing backtracking if they fail to find a solution in a brute-force search of a branch-and-bound for the number of literals 𝑙. DPLL forms the core of the SAT Solver by substituting true(T) or false(F) for a literal so that a clause containing the least frequency literal is true(T) and removing a clause containing that literal. Contrary to DPLL, the proposed algorithm selects a literal _max𝑙 with the maximum frequency and sets $_{\max}({\mid}l{\mid},{\mid}{\bar{l}}{\mid})=1$. It then deletes 𝑙∈c_i clause in addition to ${\bar{l}}$ from ${\bar{l}}{\in}c_i$ clause. Its test results on various k-SAT problems not only show that it performs less than existing DPLL algorithm, but prove its simplicity in satisfiability verification.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.60-67
• /
• 2001

Multicast Protocol for multimedia service on the Internet can be classified into two types, e.g., source based tree and shared tree according to difference of tree construction method. Shared tree based multicast is known to show outstanding results in the aspect of scalability than source based tree. Generally, There have been lots of researches on the method to satisfy QoS constraints through proper Rendezvous Point (RP) in the shared tree. In addition, as the multicast group members join and leave dynamically in the service time, RP of the shared tree should b be reselected for guranteeing Qos to new member, But, RP reselection method has not been considered generally as the solution to satisfy QoS C constraints. In this paper, new initial RP selection and RP reselection method are proposed, which utilize RTCP (Real Time Control Protocol) report packet fields. Proposed initial RP selection and RP reselection method use RTCP protocol which underlying multimedia application service So, the proposed method does not need any special process for collecting network information to calculate RP. New initial RP selection method s shows better performance than random and topology based one by 40-50% in simulation. Also, RP reselection method improves delay p performance by 50% after initial RP selection according to the member’s dynamicity.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.471-480
• /
• 2006

Recently, multimedia communication services, such as video conferencing and voice over IP, have been rapidly spread. H.323 is an international standard that specifies the components, protocols and procedures that provide multimedia communication services of real-time audio, video, and data communications over packet networks, including IP based networks. H.323 is applied to many commercial services because it supports various network environments and has a good performance. But communication services based on H.323 may have some problem because of current network trouble or mis-implementation of H.323. The understanding of this problem is a critical issue because it improves the quality of service and is easy to service maintenance. In this paper, we implement the analysis system for H.323 protocol wihch includes H.245, H.225.0, RTP, RTCP, and so on. Tills system is able to capture, parse, and present the H.323 protocol in real-time. Through the operation test and performance evaluation, we prove that our system is a useful to analyze and understand the problems for communication services based on H.323.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.127-134
• /
• 2022

Steganography is a hidden technique in which secret messages are hidden in various multimedia files, and it is widely exploited for cyber crime and attacks because it is very difficult for third parties other than senders and receivers to identify the presence of hidden information in communication messages. Botnet typically consists of botmasters, bots, and C&C (Command & Control) servers, and is a botmasters-controlled network with various structures such as centralized, distributed (P2P), and hybrid. Recently, in order to enhance the concealment of botnets, research on Stego Botnet, which uses SNS platforms instead of C&C servers and performs C&C communication by applying steganography techniques, has been actively conducted, but image or video media-oriented stego botnet techniques have been studied. On the other hand, audio files such as various sound sources and recording files are also actively shared on SNS, so research on stego botnet based on audio steganography is needed. Therefore, in this study, we present the results of comparative analysis on hidden capacity by file type and tool through experiments, using a stego botnet that performs C&C hidden communication using audio files as a cover medium in Telegram Messenger.