• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1253-1262
• /
• 1999

For the efficient co-authoring of multimedia documents in a distributed systems environment, the cooperative-work management systems that can not only allow the sharing of distributed resources but also facilitate the authors' interaction, are needed. In this paper, we present a cooperative-work management system with hybrid architecture, called CW-MAN, in which the information on shared objects and co-authoring management is stored in a dedicated computer system but the shared objects distributed all over the local computer systems. The main management functions provided by the CW-MAN are those for shared objects, session, and telepointing. The shared-object use them exclusively. The session managements allows authors to dynamically create, update, and destroy sessions. Lastly, the telepointing management allows local pointing events to be synchronously presented to remote systems.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2084-2086
• /
• 2001

This study uses distributed parameter systems as the spatial discretization technique, modelling in lumped parameter systems, and applies orthogonal transform and the Picard's iteration method to high order partial differential equations and matrix partial differential equations. In exercising optimal control of distributed parameter systems, excellent consequences are found without using the existing decentralized control or hierarchical control method.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.471-482
• /
• 2021

Several code-division multiple access (CDMA)-based interconnect schemes have been recently proposed as alternatives to the conventional time-division multiplexing bus in multicore systems-on-chip. CDMA systems with a dynamic assignment of spreading codewords are particularly attractive because of their potential for higher bandwidth efficiency compared with the systems in which the codewords are statically assigned to processing elements. In this paper, we propose a novel distributed arbitration scheme for dynamic CDMA-bus-based systems, which solves the complexity and scalability issues associated with commonly used centralized arbitration schemes. The proposed arbitration unit is decomposed into multiple simple arbitration elements, which are connected in a ring. The arbitration ring implements a token-passing algorithm, which both resolves destination conflicts and assigns the codewords to processing elements. Simulation results show that the throughput reduction in an optimally configured dynamic CDMA bus due to arbitration-related overheads does not exceed 5%.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.657-659
• /
• 2004

CAN is a serial communication bus for real-time controls and automations in distributed control systems. In distributed control systems, occasionally a sensor module and a controller are not in the same node and physically separated. In order for the signal from a sensor node to reach the controller node, the signal must travel through network. CAN has a certain capabilities to deal with real-time data. However, when many nodes on the networks try to send data on the same network, the arbitration mechanism to solve the data collision problem is necessary. This situation causes the time delay which has detrimental effects on the performance of the control systems. This paper proposes a method to solve the problem due to the time delay in distributed control system using CAN. Time delay is approximated to an element with a rational transfer function using Pade approximation and Mu~synthesis method is applied. Since time delay in the network is not constant, the time delay element is considered to be an uncertainty block with a bound. The proposed method is applied to the experimental system with CAN and proved to be effective.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.11
• /
• pp.986-992
• /
• 2012

In order to support quickly increasing mobile traffic and deal with various types of users of wireless mobile systems under overlay convergent cognitive networking environments, it is highly required to improve the performance and the capability of the wireless access networks. With distributed antennas and distributed processors, it is possible for mobile terminals (MTs) to monitor interference and control system effectively to minimize mutual interference among users and cells. Virtual cell changes as the MT moves or the environment changes, so no handoff is needed in connections with base station hotelling. In this paper, the characteristics of wireless distributed systems under the overlay convergent networks will be investigated.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.5
• /
• pp.434-437
• /
• 2002

A small size and light-weight DSP board is newly designed for a real time multi-distributed control system that overcomes constraints on time and space. There are a variety of protocols for a real-time distributed control system. In this research, we selected CAN for the multi distributed control, which was developed by the BOSCH in the early 1980's. If CAN and Internet are connected together, the system attains the characteristics of a distributed control system and a remote control system simultaneously. To build such a system. The TCP/IP-CAN Gateway which converts a CAN protocol to TCP/IP protocol and vice verse, was designed. Moreover, the system is required to be small and light-weighted for the high mobility and cost effectiveness. The equipment in remote place has a TCP/IP-CAN Gateway on itself to be able to communicate with another systems. The received commands in the remote site are converted from TCP/IP protocol to CAN protocol by the TCP/IP-CAN Gateway in real time. A simulation system consists of a TCP/IP-CAN Gateway in remote place and a command PC to be connected to Ethernet.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.1
• /
• pp.1-9
• /
• 2022

The PoN (Proof of Nonce) distributed consensus algorithm basically uses a non-competitive consensus method that can guarantee an equal opportunity for all nodes to participate in the block generation process, and this method was expected to resolve the first trilemma of the blockchain, called the decentralization problem. However, the decentralization performance of the PoN distributed consensus algorithm can be greatly affected by the network transaction transmission delay characteristics of the nodes composing the block chain system. In particular, in the consensus process, differences in network node performance may significantly affect the composition of the congress and committee on a first-come, first-served basis. Therefore, in this paper, we presented a problem by analyzing the decentralization performance of the PoN distributed consensus algorithm, and suggested a fairness control algorithm using a learning-based probabilistic acceptance rule to improve it. In addition, we verified the superiority of the proposed algorithm by conducting a numerical experiment, while considering the block chain systems composed of various heterogeneous characteristic systems with different network transmission delay.

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

Researches about scheduling of the distributed real-time systems have been proposed. However, they have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. So this paper proposes a new scheduling method for distributed real-time systems consisting of sporadic and periodic tasks with precedence relations and sporadic and periodic messages, guaranteeing end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic (RM) scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.169-175
• /
• 2002

This paper is about the hardness of the Election problem in asynchronous distributed systems in which processes can crash but links are reliable. The hardness of the problem is defined with respect to the difficulty to solve it despite failures. It is shown that problems encountered in the system are classified as three classes of problems: F (fault-tolerant), NF (Not fault-tolerant) and NFC(NF-completeness). Among those, the class NFC is the hardest problems to solve. In this paper, we prove that the Election problem is the most difficult problem which belongs to the class NFC.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.6
• /
• pp.533-538
• /
• 2004

Recently, it is increasing the concern of distributed generations(DGs) that installed small power at a site near by the customer. In deregulation environment, not only distributed generation operation but also state estimation is the key function in distribution systems. This paper process to calculate the impact of distributed generation on a distribution feeder. WLAV state estimation is performed the distribution systems with DGs and bad data test including single, multiple, interacting. Simulations with test cases are performed and the results are presented, using IEEE 34 bus radial distribution systems