• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.545-554
• /
• 2004

WebDAV is a protocol to support collaboration among the workers in geographically distant locations through the Internet. WebDAV extends the web communication protocol HTTP/1.1 to provide a standard infrastructure for supporting asynchronous collaboration for various contents across the Internet. To provide the WebDAV functionality in legacy applications such as web-based collaborative systems or document management systems, those systems need to be implemented additionally to handle the WebDAV methods and headers information. In this paper, we developed an Apache-based WebDAV server, named DAVinci(WebDAV Is New Collaborative web-authoring Innovation)which supports the WebDAV specification. DAVinci was implemented as a form of service provider on a mod_dav Apache module. Mod_day, which is an Apache module, is an open source module to provide WebDAV capabilities in an Apache web server. We used a file system for storing resources and the PostgreSQL database for their properties. In addition, the system provides a consistency manager to guarantee that both resources and properties are maintained without inconsistency between resources and their properties.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.8
• /
• pp.245-252
• /
• 2015

Recently, parallel processing methods with accelerator have been introduced into a high performance computing and a mobile computing. The photomosaic application can be parallelized by using inherent data parallelism and accelerator. In this paper, we propose a way to distribute the workload of the photomosaic application into a CPU and GPU heterogeneous computing environment. That is, the photomosaic application is parallelized using both CPU and GPU resource with the asynchronous mode of OpenCL, and then the optimal workload distribution rate is estimated by measuring the execution time with CPU-only and GPU-only distribution rates. The proposed approach is simple but very effective, and can be applied to parallelize other applications on a CPU and GPU heterogeneous computing environment. Based on the experimental results, we confirm that the performance is improved by 141% into a heterogeneous computing environment with the optimal workload distribution compared with using GPU-only method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.108-116
• /
• 2005

Synchronizations of intra${\cdot}$intermedia for the lecture presentation in distributed multimedia environments are difficult to guarantee accurate temporal relationship between media, due to the asynchronous errors such as the delay or loss of transferred data or the transmission characteristics of each media. The jitter phenomenon occurs when the network delay has the media arrival rate abnormal because the intra-media synchronization reflects the presentation rate. And the cumulative effective of jitters on a per media stream basis results in a skew. This phenomenon cause confusion to contents recognition of learners due to network delay and can not provide effective interaction of sender and receiver in the distance education. Therefore, this paper can be solution to problems due to network delay by maintaining the requirements of temporal relationship between more than one media. And this paper enables to suggest the inter-media synchronization method that is subject to be influenced by presentation rate, and to implement lecture presentation system for distance education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1322-1330
• /
• 1999

The major source of errors in high-speed networks such as Broadband ISDN(B-ISDN) is buffer overflow during congested conditions. These congestion errors are the dominant sources of errors in high-speed networks and result in cell losses. Conventional communication protocols use error detection and retransmission to deal with lost packets and transmission errors. As an alternative, we have presented a method to recover consecutive cell losses using forward error correction(FEC) in ATM(Asynchronous Transfer Mode) networks to reduce the problem. The method finds the lost cells by observing new cell sequence number($SN^{\ast}$). We have used the LI field together with SN and ST fields to consider the $SN^{\ast}$ which provides more correcting coverage than SN in ATM standards. The $SN^{\ast}$ based on the additive way such as the addition of LI capacity to original SN capacity is numbered a repeatedly 0-to-80 cycle. Another extension can be based on the multiplicative way such that LI capacity is multiplied by SN capacity. The multiplicative $SN^{\ast}$ is numbered in a repeatedly 0-to-1025 cycle.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1372-1382
• /
• 1999

The major source of errors in high-speed networks such as Broadband ISDN(B-lSDN) is buffer overflow during congested conditions. These congestion errors are the dominant sources of errors in 1high-speed networks and result in cell losses. Conventional communication protocols use error detection and retransmission to deal with lost packets and transmission errors. However, these conventional ARQ(Automatic Repeat Request) methods are not suitable for the high-speed networks since the transmission delay due to retransmissions becomes significantly large. As an alternative, we have presented a method to recover consecutive cell losses using forward error correction(FEC) in ATM(Asynchronous Transfer Mode)networks to reduce the problem. The performance estimation based on the cell discard process model has showed our method can reduce the cell loss rate substantially. Also, the performance estimations in ATM networks by interleaving and IP multicast service are discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.703-710
• /
• 2004

WebDAV is a protocol to support collaboration among one or more groups in geographically distant locations through the internet. WebDAV extends the web communication protocol HTTP/1.1 to provide a standard infrastructure for .supporting asynchronous collaboration for various contents across the internet. A WebDAV client uses HTTP requests to perform a renewal and update action to the resources in WebDAY servers. So, it is desirable that the client supports the ability of authoring and version management with a good concurrency control and property management. In this paper, to enhance usability, we developed a .NET-based WebDAV client with a user interface similar to the Windows Explorer. The developed WebDAV client supports easy launching of the authoring application and appropriate lock control for the server resources. In addition, through the functionality of process monitoring, it supports automatic update of the server resources when the modification of the resources are completed by the user. The WebDAY client is a .NET-based application written in the C＃ language, running on any platform supporting a .NET framework.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.4
• /
• pp.205-212
• /
• 2017

Linux Foundation has announced a real-time kernel, called Zephyr, for IoT applications recently. Zephyr kernel provides synchronous and asynchronous IPC for data communication between threads. Synchronous IPC is useful for programming multi-threads that need to be executed synchronously, since the sender thread is blocked until the data is delivered to the receiver thread and the completion of data transfer can be known to two threads. In general, 'IPC execution time' is defined as the time duration between the sender thread sends data and the receiver thread receives the data sent. Especially, it is important that 'IPC execution time' in the synchronous IPC should be fixed in real-time kernel like Zephyr. However, we have found that the execution time of the synchronous IPC in Zephyr kernel increases in proportion to the number of threads executing in the kernel. In this paper, we propose a method to implement a fixed time synchronous IPC in Zephyr kernel using Direct Thread Switching(DTS) technique. Using the technique, the receiver thread executes directly after the sender thread sends a data during the remaining time slice of the sender thread and we can archive a fixed IPC execution time even when the number of threads executing in the kernel increases. In this paper, we implemented synchronous IPC using DTS in the Zephyr kernel and found the IPC execution time of the IPC is always 389 cycle that is relatively small and fixed.

• Nuclear Engineering and Technology
• /
• v.48 no.3
• /
• pp.635-641
• /
• 2016

Because of prohibitive data storage requirements in large-scale simulations, the memory problem is an obstacle for Monte Carlo (MC) codes in accomplishing pin-wise three-dimensional (3D) full-core calculations, particularly for whole-core depletion analyses. Various kinds of data are evaluated and quantificational total memory requirements are analyzed based on the Reactor Monte Carlo (RMC) code, showing that tally data, material data, and isotope densities in depletion are three major parts of memory storage. The domain decomposition method is investigated as a means of saving memory, by dividing spatial geometry into domains that are simulated separately by parallel processors. For the validity of particle tracking during transport simulations, particles need to be communicated between domains. In consideration of efficiency, an asynchronous particle communication algorithm is designed and implemented. Furthermore, we couple the domain decomposition method with MC burnup process, under a strategy of utilizing consistent domain partition in both transport and depletion modules. A numerical test of 3D full-core burnup calculations is carried out, indicating that the RMC code, with the domain decomposition method, is capable of pin-wise full-core burnup calculations with millions of depletion regions.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2158-2170
• /
• 1999

It has been required more reliable communication on processes and improvement of system performance as distributed systems using multicast protocol became widespread. In distributed environment maintaining data consistency through asynchronous execution of processes and coordinating the activities of them would occurs. This paper proposes a total ordering algorithm, TORMP, in order to resolve these problems. TORMP takes advantage of multicast protocol and uses an effective token passing method. It reduces a process delaying time before transmitting its message by multicasting a token simultaneously to every process that initiates the request of the message. Moreover, the processes receiving the token start multicasting the message at the same time, which causes to cut down the overall transmission dely. In case that one process sends a message, TORMP hardly uses the procedure of controlling for ordering. It gives fairly the right of sending messages to all processes in a group with utilizing vector clock. In TORMP, unlike other algorithms, the number of packets generated during ordering process does not depend on the number of processes.