• The Journal of the Acoustical Society of Korea
• /
• v.15 no.5
• /
• pp.73-81
• /
• 1996

In multiprocessor systems with multiple processors and memories, efficient communication between processors and memories is critical for high performance. Various types of multistage networks have been proposed. The economic feasibility and the improvements in both computing throughput and fault tolerance/diagnosis have been some of the most important factors in the development of these computer systems. In this paper, we present an efficient algorithm for the diagnosis of generalized cube interconnection networks with a fan-in/fan-out of 2. Also, using the assumed fault model present total fault diagnosis by generating suitable fault-detection and fault-location test sets for link stuck fault, switching element fault in direct/cross states, including broadcast diagnosis methods based on some basic properties or generalized cube interconnection networks. Finally, we illustrate some example.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.654-662
• /
• 2005

Mobile portable devices for wireless network solely depend on a limited battery power. Therefore, we need to design for wireless communication protocols with an energy efficiency. TCP-Westwood is one of the most important approaches on TCP performance improvement in wireless environments that estimates the available bandwidth by using the sampling mechanism. The advantage is that data can be transmitted efficiently using the estimation of available bandwidth. However, when the sender with TCP-Westwood is in a wireless environment, it does not consider of the sampling mechanism operation. In this thesis, a new energy saving transport protocol, called E2TP(Energy Efficient Transport Protocol), is proposed to solve problems which occur when the sender with TCP-Westwood is in a wireless environment. Also, when there are packet loss while doing frequent link error in a wireless environment, E2TP provides the instantaneous segment size adjustment for a more efficient data retransmission. The simulation result proves that the proposed E2TP has better performance in energy efficiency and throughput than both TCP and TCP-Westwood.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4343-4355
• /
• 2014

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD（Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.696-702
• /
• 2001

In this paper, we design IDEA cipher algorithm which is cryptographically superior to DES. To improve the encryption throughput, we propose an efficient design methodology for high-speed implementation of multiplicative inverse modulo $2^{15}$+1 which requires the most computing powers in IDEA. The efficient hardware architecture for the multiplicative inverse in derived from applying of Fermat's Theorem. The computing powers for multiplicative inverse in our proposal is a decrease 50% compared with the existing method based on Extended Euclid Algorithm. We implement IDEA by applying a single iterative round method and our proposal for multiplicative inverse. With a system clock frequency 20MGz, the designed hardware permits a data conversion rate of more than 116 Mbit/s. This result show that the designed device operates about 2 times than the result of the paper by H. Bonnenberg et al. From a speed point of view, out proposal for multiplicative inverse is proved to be efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4865-4885
• /
• 2019

We propose a FPGA based design that performs real-time power-efficient analysis of heterogeneous sensor data using adaptive ANN on edge gateway of smart military wearables. In this work, four independent ANN classifiers are developed with optimum topologies. Out of which human activity, BP and toxic gas classifier are multiclass and ECG classifier is binary. These classifiers are later integrated into a single adaptive ANN hardware with a select line(s) that switches the hardware architecture as per the sensor type. Five versions of adaptive ANN with different precisions have been synthesized into IP cores. These IP cores are implemented and tested on Xilinx Artix-7 FPGA using Microblaze test system and LabVIEW based sensor simulators. The hardware analysis shows that the adaptive ANN even with 8-bit precision is the most efficient IP core in terms of hardware resource utilization and power consumption without compromising much on classification accuracy. This IP core requires only 31 microseconds for classification by consuming only 12 milliwatts of power. The proposed adaptive ANN design saves 61% to 97% of different FPGA resources and 44% of power as compared with the independent implementations. In addition, 96.87% to 98.75% of data throughput reduction is achieved by this edge gateway.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.146-153
• /
• 2006

It is required to have researches on efficient resource allocation schemes in an integrated voice and data CDMA system with the spreading of high-speed wireless internets. In this paper, we proposed a efficient resouce allocation scheme for providing a high speed data service in an integrated CDMA system. In an integrated voice/data CDMA system, resources for voice users are allocated with high priority and residual resources are allocated to the data service. In this case, it is necessary to use a resource allocation scheme for minimizing interference. In this paper, we first explain about a interference minimizing method and define QoS requirements. Based on the method, we proposed a efficient resource allocation scheme which satisfy the QoS requirements. The proposed scheme controls the transmission rate and delay of data users with a priority information such as the number of packets in a queue. From the simulation results, we show that the proposed scheme reduce the blocking probability and delay and improve the performance.

• Horticultural Science & Technology
• /
• v.35 no.2
• /
• pp.232-242
• /
• 2017

The goal of marker-assisted backcrossing (MAB) is to significantly reduce the number of breeding generations required by using genome-based molecular markers to select for a particular trait; however, MAB systems have only been developed for a few vegetable crops to date. Among the types of molecular markers, SNPs (single-nucleotide polymorphisms) are primarily used in the analysis of genetic diversity due to their abundance throughout most genomes. To develop a MAB system in Chinese cabbage, a high-throughput (HT) marker system was used, based on a previously developed set of 468 SNP probes (BraMAB1, Brassica Marker Assisted Backcrossing SNP 1). We selected a broad-spectrum TuMV (Turnip mosaic virus) resistance (trs) Chinese cabbage line (SB22) as a donor plant, constructing a $BC_1F_1$ population by crossing it with the TuMV-susceptible 12mo-682-1 elite line. Foreground selection was performed using the previously developed trsSCAR marker. Background selection was performed using 119 SNP markers that showed clear polymorphism between donor and recipient plants. The background genome recovery rate (% recurrent parent genome recovery; RPG) was good, with three of 75 $BC_1F_1$ plants showing a high RPG rate of over 80%. The background genotyping result and the phenotypic similarity between the recurrent parent and $BC_1F_1$ showed a correlation. The plant with the highest RPG recovery rate was backcrossed to construct the $BC_2F_1$ population. Foreground selection and background selection were performed using 169 $BC_2F_1$ plants. This study shows that, using MAB, we can recover over 90% of the background genome in only two generations, highlighting the MAB system using HT markers as a highly efficient Brassica rapa backcross breeding system. This is the first report of the application of a SNP marker set to the background selection of Chinese cabbage using HT SNP genotyping technology.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.997-1005
• /
• 2010

Recently, there has been a growing interest in the use of WLAN technology due to its easy deployment, flexibility and so on. Examples of WLAN applications range from standard internet services such as Web access to real-time services with strict latency/throughput requirements such as multimedia video and voice over IP on wireless network environments. Fair and efficient distribution of the traffic loads among APs(Access Points) has become an important issue for improved utilization of WLAN. This paper focuses on an AP selection scheme for achieving better load balance, and hence increasing network resource utilization for each user on wireless network environments. This scheme makes use of active scan patterns and the network delay as main parameters of load measurement and AP selection. This scheme attempts to estimate the AP traffic loads by observing the up/down delay and utilize the results to maximize the link resource efficiency through load balancing. We compared the proposed scheme with the original SNR(Signal to Noise Ratio)-based scheme using the NS-2(Network Simulation.2). We found that the proposed scheme improves the throughput by 12.5% and lower the network up/down link delay by 36.84% and 60.42%, respectively. All in all, the new scheme can significantly increase overall network throughput and reduce up/down delay while providing excellent quality for voice and video services.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.4
• /
• pp.231-239
• /
• 2007

This paper presents the trade-off relationship between area and performance in the hardware design space exploration for the Korean national standard 128-bit block cipher algorithm SEED. In this paper, we compare the following four hardware design types of SEED algorithm : (1) Design 1 that is 16 round fully pipelining approach, (2) Design 2 that is a one round looping approach, (3) Design 3 that is a G function sharing and looping approach, and (4) Design 4 that is one round with internal 3 stage pipelining approach. The Design 1, Design 2, and Design 3 are the existing design approaches while the Design 4 is the newly proposed design in this paper. Our new design employs the pipeline between three G-functions and adders consisting of a F function, which results in the less area requirement than Design 2 and achieves the higher performance than Design 2 and Design 3 due to pipelining and module sharing techniques. We design and implement all the comparing four approaches with real hardware targeting FPGA for the purpose of exact performance and area analysis. The experimental results show that Design 4 has the highest performance except Design 1 which pursues very aggressive parallelism at the expanse of area. Our proposed design (Design 4) shows the best throughput/area ratio among all the alternatives by 2.8 times. Therefore, our new design for SEED is the most efficient design comparing with the existing designs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.12
• /
• pp.660-673
• /
• 2001

In Video-on-Demand (VoD) servers, disk throughput is an important system design parameter because it is directly related to the number of user requests that can be served simultaneously. In this paper, we propose an efficient periodic request grouping scheme for disk array-based VoD servers that reduces the disk seek time, thus improving the disk throughput of VoD disk arrays. To reduce the disk seek time, the proposed scheme groups the periodic requests that access data blocks stored in adjacent regions into one, and arranges these groups in a pre-determined order (e.g., in left-symmetric or right-symmetric fashion). Our simulation result shows that the proposed scheme reduces the average disk bandwidth required by a single video stream and can serve more user requests than existing schemes. For a data block size of 192KB, the number of simultaneously served user requests is increased by 8% while the average waiting time for a user request is decreased by 20%. We also propose an adaptation technique that conforms the proposed scheme to the user preference changes for video streams.