• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.11
• /
• pp.1029-1043
• /
• 2013

We introduce Approximate Message Passing (AMP) algorithm which is one of the efficient recovery algorithms in Compressive Sensing (CS) area. Recently, AMP algorithm has gained a lot of attention due to its good performance and yet simple structure. This paper provides not only a understanding of the AMP algorithm but its relationship with a classical (Sum-Product) Message Passing (MP) algorithm. Numerical experiments show that the AMP algorithm outperforms the classical MP algorithms in terms of time and phase transition.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.11-20
• /
• 2007

This paper designs and implements a message passing library called JMPI (Java Message Passing Interface) which complies with MPJ (Message Passing in Java), the MPI standard Specification for Java language, This library provides some graphic user interface tools to enable parallel computing environments to be configured very simply by their administrators and JMPI applications to be executed very conveniently. Also in this paper, we implement two versions of systems using Socket and RPC which are both typical distributed system communication mechanisms and with three benchmark applications, compare performance of these systems with that of an existing system JPVM depending on the increasing number of the computers. Experimental results show that our systems outperform JPVM system in terms of various aspects and that the most efficient processing speedup can be obtained by increasing the number of the computers in consideration of network traffic through processing evaluation. Finally, we can see that, as the number of computers increases, using RMI to transmit a message is more effective than using object streams attached to sockets to transmit a message.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1109-1112
• /
• 2020

This paper presents a low cost hardware message passing engine of enhanced atomic pipelined broadcast based on processing node status. In this algorithm, the previous atomic pipelined broadcast algorithm is modified to reduce the waiting time until next broadcast communication. For this, the processor change the transmission order of processing nodes based on the nodes' communication channel. Also, the hardware message passing engine architecture of the proposed algorithm is modified to be adopted to multi-core processor. The synthesized logic area of the proposed hardware message passing engine was reduced by about 16%, compared by the pre-existing hardware message passing engine.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.156-157
• /
• 2011

In this work, we study the checkpoint/restart problem for message-passing parallel applications running on cloud computing environment. This is a new direction which arises from the trend of enabling the applications to run on the cloud computing environment. The main objective is to propose an efficient checkpoint algorithm for message-passing parallel applications considering communications with external systems. We further implement the novel algorithm by modifying gSOAP and OpenMPI (the open source libraries) which support service calls and checkpoint message-passing parallel programs, especially. The simulation showed that additional costs to the executing and checkpointing application of the algorithm are negligible. Ultimately, the algorithm supports efficiently the checkpoint/restart service for message-passing parallel applications, that send requests to external services.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.403-407
• /
• 1999

In this paper we present an architecture, implementation, and performance evaluation of an adaptive communication system (ACS) for wide-area ATM clusters. Our approach capitalizes on thread-based programming model to overlap computation and communication and develop a dynamic message-passing environment with separate data and control paths. This leads to a flexible and adaptive message-passing environment that can support multiple flow control, error control, and multicasting algorithms. We show the performance of ACS applications and compare them with p4, PVM, and MPI applications.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.185-193
• /
• 2008

An MTBF(mean time between failures) of large scale parallel systems is known to be only an order of several hours, and large computations sometimes result in a waste of huge amount of CPU time, However. the MPI(Message Passing Interface), a de facto standard for message passing parallel programming, suggests no possibility to handle such a problem. In this paper, we propose an application-level fault tolerant computation system, purely on the basis of the current MPI standard without using any non-standard fault tolerant MPI library, that can be used for general scientific synchronous parallel computation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.299-304
• /
• 2008

For perpendicular magnetic recording channels, it is hard to expect improving the performance by using the PRML or NPML. Hence, we exploit LDPC code to improve the performance. In this paper, we examine a single message-passing detector/decoder matched to the combination of a perpendicular magnetic recording channel detector and an LDPC code decoder. We examine the performance of channel iteration with joint LDPC code on perpendicular magnetic recording channel, and simplify the complexity of the message-passing detector algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.476-484
• /
• 1999

Many message logging and checkpointing schemes are proposed for fault tolerance in distributed systems in which nodes communicate by message passing. Most researches for recoverable distributed shared memory (DSM) also adopt similar schemes used in message passing systems. However, schemes used in message passing systems are not always appropriate to be directly used in DSM systems because the two systems, message passing systems and DSM systems, have different natures (function shipping and data shipping). Many modified schemes have been proposed for DSM systems to resolve these differences. In this paper, an object oriented approach is proposed for recoverable DSM. We present a new dependency tracking scheme between pages instead of processes. Based on this scheme, we propose new checkpointing and recovery schemes that can reduce overhead to make DSM recoverable.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1162-1170
• /
• 1995

In this paper, we present a message transfer scheme for efficient message passing in the hierarchically structured multiprocessor computer SPAX(Scalable Parallel Architecture computer based on X-bar network). The message transfer scheme provides interface not only with operating system but also with end users. In order to transfer two types of control message and data message efficiently, it supports both of memory-mapped transfer and DMA-based transfer. Dual-port RAMs are used as message buffers, and control and status registers provide efficient programming interface. Interlaced parity scheme is adopted for error control. If any error is detected at receiving node, errored packet is resent by sender according to retry mechanism. In conjunction with retry mechanism, watchdog timers are used to protect infinite waiting and repeated retry. The proposed message transfer scheme can be applied to input/output nodes and communication connection nodes as well as processing nodes in the SPAX.

• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.279-284
• /
• 2019

This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.