• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.229-239
• /
• 2008

A Distributed File System (DFS) provides a mechanism in which a file can be stored across several physical computer nodes ensuring replication transparency and failure transparency. Applications that process large volumes of data (such as, search engines, grid computing applications, data mining applications, etc.) require a backend infrastructure for storing data. And the distributed file system is the central component for such storing data infrastructure. There have been many projects focused on network computing that have designed and implemented distributed file systems with a variety of architectures and functionalities. In this paper, we describe a complete distributed file system which can be used in large-scale search-oriented systems.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.199-201
• /
• 2005

USB has arguably become the most successful PC peripheral interconnect ever defined. As appearing UWB, wireless USB (WUSB) emerges very popular technology. However, the distributed Medium Access Control (MAC) does not harmonize with the topology of WUSB. In this paper, we address a novel MAC protocol for conformity with WUSB. The protocol is to handle negotiation on Distributed Reservation Protocol (DRP) including the channel time slot of WUSB.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.461-468
• /
• 2001

Large-scale distributed applications based on Internet and client/server applications have to deal with series of problems such as load balancing, unpredictable communication delays, partial errors, and networking failures. Therefore, sophisticated applications such as teleconferencing, video-on-demand, and concurrent software engineering require an abstracted communication. In this paper, we present our design, implementation and performance analysis of group communication using the CORBA ORB, JAVA RMI, Socket based on distributed computing. We anticipate our study may apply to the various field of applications such as fault-tolerant client/server system, groupware, scalable text retrieval system, and financial information systems.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.293-296
• /
• 2002

This paper discusses a software reliability model for the distributed s-PCT algorithm fur remote sensing applications. The distributed algorithm is designed based on a Manager-Worker threading concept and goes further to use redundancy to achieve fault tolerance. The paper provides a status report on our progress in developing the reliability concept and applying it to create a model for the distributed s-PCT In particular, we are interested ill the algorithm performance versus reliability.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1129-1132
• /
• 1987

This paper introduces distributed processes- a new language concept for concurrent programming. It is proposed for real-time applications controlled by computer network with distributed storage. These processes communicate and syschronize by means of procedure calls and guarded regions. The paper gives several examples of distributed processes.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.3
• /
• pp.221-230
• /
• 2004

In general, remote monitoring systems monitor the status of distributed hosts and/or applications in real-time for diverse managerial purposes. However, most of the extant systems have a few undesirable problems. First of all, they are platform-dependent and are not resilient to network and/or host failures. Moreover, they normally focus on the resource usage trends in monitored hosts, rather than on the status change of the applications running on them. We strongly believe that the latter has more direct and profound effect on the resource usage patterns on each host. In this paper, we present the design and implementation of the Remote Applications Monitoring System (RAMS) that enables us to effectively manage distributed applications through a real-time monitoring of their respective resource usages. The RAMS is a centralized system that consists of many distributed agents and a single centralized manager. An agent on each host is in charge of collecting and reporting the status of local applications. The manager handles agent registration and provides a central access point to the selection and monitoring of distributed applications. The salient features of the system include robustness and portability The adoption of JINI greatly facilitates an automatic recovery from partial network failure and host failure.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.5
• /
• pp.257-264
• /
• 2002

In this paper, we give a detailed description of KDSM(KAIST Distributed Shared Memory) system. KDSM is implemented as a user-level library running on Linux 2.2.13, and TCP/IP is used for communication. KDSM uses page-based invalidation protocol, multiple-writer protocol, and supports HLRC(Home-based Lazy Release Consistency) memory consistency model. To evaluate performance of KDSM, we executed 4 scientific applications and compared the result to JLAJLA. The results showed that performance of KDSM almost equal to JIAJIA for 2 applications and performance of KDSM is better than JIAJIA for 2 applications.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.378-390
• /
• 2006

Many distributed applications build overlays on top of the Internet. Several unsolved issues at the network layer can explain this trend to implement network services such as multicast, mobility, and security at the application layer. On one hand, overlays creating basic topologies are usually limited in flexibility and scalability. On the other hand, overlays creating complex topologies require some form of application level addressing, routing, and naming mechanisms. Our aim is to design an efficient and robust addressing, routing, and naming infrastructure for these complex overlays. Our only assumption is that they are deployed over the Internet topology. Applications that use our middleware will be relieved from managing their own overlay topologies. Our infrastructure is based on the separation of the naming and the addressing planes and provides a convergence plane for the current heterogeneous Internet environment. To implement this property, we have designed a scalable distributed k-resilient name to address binding system. This paper describes the design of our overlay infrastructure and presents performance results concerning its routing scalability, its path inflation efficiency and its resilience to network dynamics.

• ETRI Journal
• /
• v.39 no.2
• /
• pp.202-212
• /
• 2017

With the advent of the Internet-of-Things paradigm, the amount of data production has grown exponentially and the user demand for responsive consumption of data has increased significantly. Herein, we present DART, a fast and lightweight stream processing framework for the IoT environment. Because the DART framework targets a geospatially distributed environment of heterogeneous devices, the framework provides (1) an end-user tool for device registration and application authoring, (2) automatic worker node monitoring and task allocations, and (3) runtime management of user applications with fault tolerance. To maximize performance, the DART framework adopts an actor model in which applications are segmented into microtasks and assigned to an actor following a single responsibility. To prove the feasibility of the proposed framework, we implemented the DART system. We also conducted experiments to show that the system can significantly reduce computing burdens and alleviate network load by utilizing the idle resources of intermediate edge devices.

• Journal of Digital Contents Society
• /
• v.8 no.1
• /
• pp.27-33
• /
• 2007

Grid is a distributed computing model for next to the WWW computing model. Java language is developed for distributed computing and is being commonly used for WWW applications. Java can also be used for designing and implementing Grid systems. We introduced the basic concepts of Grid and implemented a new computing grid system. We test proper distributed applications on the multimedia grid system and analyzed the execution results. The execution results showed that the grid performance was much better than the legacy systems.