• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.298-306
• /
• 2015

In this paper, we propose an efficient resource allocation scheme for the integrated satellite/terrestrial networks. The proposed scheme is a frequency sharing technique to mitigate the inter-component interferences which can be generated between a satellite beam and terrestrial cells that are operated in the same frequency. The proposed dynamic resource allocation scheme can mitigate the total inter-component interference by optimizing the total transmission power and it can expect a result of which can lead to an increase in capacity. In such a system, the interference situation can be affected by the distributed traffic demands or up/down link communications environments. In this point of view, we evaluate the performance of the total consumed power, the amount of inter-component interference with respect to different traffic distributions and interference environments between the satellite beam and terrestrial systems.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.374-385
• /
• 2019

This paper presents an optimal implementation of a Daubechies-based pipelined discrete wavelet packet transform (DWPT) processor using finite impulse response (FIR) filter banks. The feed-forward pipelined (FFP) architecture is exploited for implementation of the DWPT on the field-programmable gate array (FPGA). The proposed DWPT is based on an efficient transpose form structure, thereby reducing its computational complexity by half of the system. Moreover, the efficiency of the design is further improved by using a canonical-signed digit-based binary expression (CSDBE) and advanced functional sharing (AFS) methods. In this work, the AFS technique is proposed to optimize the convolution of FIR filter banks for DWPT decomposition, which reduces the hardware resource utilization by not requiring any embedded digital signal processing (DSP) blocks. The proposed AFS and CSDBE-based DWPT system is embedded on the Virtex-7 FPGA board for testing. The proposed design is implemented as an intellectual property (IP) logic core that can easily be integrated into DSP systems for sub-band analysis. The achieved results conclude that the proposed method is very efficient in improving hardware resource utilization while maintaining accuracy of the result of DWPT.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.1-13
• /
• 1994

In this study under the distributed system for efficient distribution resource completely symmetic global scheduler was designed and implemented to obtain the general global scheduler, that is load balancing as sharing objectives. To balance the system's load efficiently each node must be designed to get right decision-making. Thus we considered computing time to estimate fault such as delay on communication network, communication period and other decision-making. Load balancing mechanism which suggested in this study was implemented in the distributed system which IBM PC/AT linked to and composed with Ethernet. The target operating system was composed of IBM PC/AT as a basic construction in which proper type of UNIX operating system were ported and communication layer chose communication type implemented from Amoeba. The method of IPC employing layered multilevel access method to avoid inefficient protocol using direct communication mode guarantees rapid response due to short ready time for IPC.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.8
• /
• pp.41-46
• /
• 2017

In this paper, we investigate the D2D Transmitter(Tx) and Receiver(Rx) pair assignment problem in the cellular system where D2D users share the uplink resource of the cellular system. Sharing the uplink resource of the cellular system may cause interference to the cellular system, though it is beneficial to improve the D2D user Capacity. Therefore, to protect the cellular users, D2D transmit power should be carefully controlled. In this work, we focus on optimal Tx-Rx assignment in such a way that the total transmit power of users is minimized. First, we consider the optimum Tx-Rx assignment in general and the corresponding complexity. Then, we propose an iterative D2D Tx-Rx assignment algorithm with low complexity that can minimize total transmit power of users. Finally, we present the numerical examples that show the complexity and the convergence to the unique transmit power level.

• Journal of information and communication convergence engineering
• /
• v.10 no.2
• /
• pp.117-122
• /
• 2012

We propose a hybrid multiple access (HMA) for uplink orthogonal frequency division multiple access (OFDMA) systems, which combines two resource sharing schemes: a scheduling-based resource allocation (SBRA) scheme and a contentionbased resource allocation (CBRA) scheme. The SBRA scheme is appropriate for non-real time high data rate traffic, and, CBRA is appropriate for near-real time low/medium data rate traffic. Thus, the proposed HMA scheme supports various types of traffic. As a CBRA scheme, our proposed random frequency hopping (RFH)-OFDMA scheme was presented. Simulation results show that the proposed HMA yields the best performance among various resource allocation schemes for uplink OFDMA systems.

• Journal of Information Management
• /
• v.28 no.1
• /
• pp.1-33
• /
• 1997

Led by KIEP, this project to establish an Online Union Catalog System on Northeast Asia is the first such attempt to create a collaboration between social science libraries in Korea. This Online Union Catalog System is seen as a problem solving mechanism, as it helps to maximize efficiency in utilizing labor, finance, and data, by sharing library resources. This study focuses on the process of converting databases in a non-MARC format to a MARC format.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.422-430
• /
• 2007

WDM-PON has been receiving much attention as a key technology to FTTH. As the cost of WDM-PON heavily depends on the number of transceivers implemented at ONU, one of its shortcomings comes from the fixed provision of wavelength resource, which is tightly coupled with costly transceivers. In this paper, we propose a cost-effective WDM-PON architecture for dynamic resource provision. The proposed architecture is based on hierarchical grouping of multiple ONUs into a logical group and hierarchical sharing the resource. For high utilization of dynamic resource, the dynamic resource allocation algorithm is also proposed. We analyze the system efficiency in term of dynamism of system resource and system cost. We also verify that the proposed resource allocation algorithm achieves a high dynamism on resource allocation, and at the same time maintains the fairness between ONUs.

• Journal of Internet Computing and Services
• /
• v.2 no.1
• /
• pp.13-21
• /
• 2001

This paper studies on Multiple Ontology to share and reuse know1edge stored in every system under the Distributed Web Environment using idle resource connected the Internet. Multiple Ontology is to convert to be able know1edge sharing between ontologies constructed by one and the other. This study focuses on as follows; To compose the Distributed Web Ontology multiple system, Construction Method of the Distributed Web Environment and Composition of Multiple Ontology for Know1edge sharing and reuse. System Composed by using the jini technology has constructed extension of heterogeneous systems and effective web computing environment. Also, through 'distribution operation, practical know1edge exchange among Multiple Ontologies under the Distributed Web Environment has been processed excellently.