• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.433-440
• /
• 2003

According as the real economic activities are carried out in the cyber world and the identity problem of a trade counterpart emerges, digital signature has been diffused. Due to the weakness for real-time validation using the validation method of digital signature, Certificate Revocation List, On-line Certificate Status Protocol was introduced. In this case, every transaction workload requested to verify digital signature is concentrated of a validation server node. Currently this method has been utilized on domestic financial transactions, but sooner or later the limitation will be revealed. In this paper, the validation method will be introduced which not only it can guarantee real-time validation but also the requesting node of certificate validation can maintain real-time certificate status information. This method makes the revocation management node update the certificate status information in real-time to the validation node while revoking certificate. The characteristic of this method is that the revocation management node should memorize the validation nodes which a certificate holder uses. If a certificate holder connects a validation node for the first time, the validation node should request its certificate status information to the above revocation management node and the revocation management node memorizes the validation node at the time. After that, the revocation management node inform the revocation information in real-time to all the validation node registered when a request of revocation happens. The benefits of this method are the fact that we can reduce the validation time because the certificate validation can be completed at the validation node and that we can avoid the concentration of requesting certificate status information to a revocation node.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3148-3154
• /
• 2000

In this paper. the design and implementationof the on-line registration system for the school affairs is described. The environments for the system configurations include a PC server under Linux Iperating System. Apache Web-server, and MySQL as database engine. In addition, PHP, which becomes a popular Internet server-based script language lately, is used to implement a real-time database. In order to avoid overload problems during short-term registration period, which deconstraces the typical surge of traffics, the proposed system is designed to minimize the unnecessary interfacing tasks. On administrator side task, the sytem is designed to have environments by separating the dechcated server that restricts the scope of specific database thasks. In doing so, it become possibal to build an optical system by distributing, balancing the transaction load, maintainimg the security and efficient administrative tasks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.35-38
• /
• 2001

본 논문에서는 이동 컴퓨팅 환경에서 발생하는 실시간 이동 트랜잭션을 효율적으로 처리하기 위한 트랜잭션 관리자를 제안한다. 제안된 트랜잭션 관리자는 기존의 종료시한만 고려하던 방법과는 달리 이동 호스트 때문에 발생하는 실시간 데이터의 유효성도 함께 고려하여 트랜잭션의 실행여부를 판단한다. 그 후, 트랜잭션의 중요도와 종료시한을 고려한 우선순위 큐에 최적의 실행 윈도우를 생성하여 스케줄링하고, 실행될 트랜잭션을 선택할 때는 이동 호스트와의 접속 단절을 고려한다. 따라서, 제안된 기법은 실시간 데이터의 유효성 제약조건 위반에 따른 트랜잭션의 철회 후 재시작을 감소시키며, 종료시한을 만족시키는 실시간 이동 트랜잭션의 중요도의 합을 최대로 하는 장점을 가진다. 이 기법은 이동 통신, 응급 재난 구조 시스템 등에서 발생하는 실시간 이동 트랜잭션의 관리자로 적합하다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.5
• /
• pp.125-133
• /
• 2016

Data processing capacity and speed are rapidly increasing due to the development of hardware and software in recent time. As a result, data usage is geometrically increasing and the amount of data which computers have to process has already exceeded five-thousand transaction per second. That is, the importance of Big Data is due to its 'real-time' and this makes it possible to analyze all the data in order to obtain accurate data at right time under any circumstances. Moreover, there are many researches about this as construction of smart factory with the application of Big Data is expected to have reduction in development, production, and quality management cost. In this paper, system using In-Memory Data Grid for high speed processing is implemented in semiconductor process which numerous data occur and improved performance is proven with experiments. Implemented system is expected to be possible to apply on not only the semiconductor but also any fields using Big Data and further researches will be made for possible application on other fields.

• Journal of Distribution Science
• /
• v.8 no.1
• /
• pp.21-33
• /
• 2010

The ICT(information & communication technology) led to a dramatic change of floral distribution service, a phase of competition between wholesales and retail stores, and distribution channels in floral industry. It was expected that a role of the intermediaries in this industry would have reduced due to the improvement of transaction process by ICT. However, the ICT made to overcome a regional limit of the floral retail distribution service leading to an increase in sales and enlargement of the stores. And even it made possible to bring out another type of intermediaries such as private associations. This case study focuses on what kinds of efforts the floral wholesale distributors have made to enable a distribution process more smoothly between the wholesale distributors and retail stores through the information system, and what the failure factors in adopting the information system have been. This paper is also to examine how the wholesale distributors have changed themselves to gain dominant positions in distribution channels. As a result of the study, it was found that the intermediaries mostly failed in successfully achieving the distribution channel innovation through the information system because of several main reasons. FLOMARKET Inc. tried to innovate a distribution channel to obtain high quality goods through consolidating a wholesale distribution market in that segregated both floral joint market from free markets. after implementing the information system with consideration of the failure factors, FLOMARKET Inc. was able to minimize goods in stock and make a major purchase of various goods. In addition, it made a possible pre-ordering process and an exact calculation of purchasing goods so they could provide their products with market price in real time, which helped for the company to gain credits from their customers. Also, FLOMARKET Inc. established the information system which well suited to its business stage in order to deal with a rapidly changing distribution environment. It's so obvious that the transaction processing system of FLOMARKET Inc. definitely helped to share information among traders more seamlessly and smoothly in realtime, standardize goods, and make a transaction process clearer. Besides, the transaction information helped the wholesale distributors and retail stores to make more strategic decisions in their business because through the system they enabled to gather the marketing intelligence information more easily and convenient. If we understand that the floral distribution market is characterized by the low IT- based industry, it's worth to examine a case study proving that the information system actually increases the productivity of the transaction process in the floral industry.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.5
• /
• pp.251-258
• /
• 2014

This paper proposes an efficient token flow design methodology for a decoder in the MPEG Reconfigurable Media Coding (RMC) framework. The MPEG RMC framework facilitates a decoder to be configured with a set of modules called functional units (FUs) that are connected by tokens. Such a modular design philosophy of the MPEG RMC framework enables the reusability and reconfigurability of FUs. One drawback of the MPEG RMC framework is that the decoder performance can be affected by increasing the token transmissions between FUs. The proposed method improves the design of the FU network in the RMC framework toward real-time decoder implementation. In the proposed method, the merging of FU, the separation of token flow, and the merging of token transactions are applied to minimize the token traffic between FUs. The experimental results of the MPEG-4 SP decoder show that the proposed method reduces the total decoding time by up to 77 percent compared to the design of the RMC simulation model.

• The Journal of Bigdata
• /
• v.1 no.2
• /
• pp.1-8
• /
• 2016

User activity log includes lots of hidden information, however it is not structured and too massive to process data, so there are lots of parts uncovered yet. Especially, it includes time series data. We can reveal lots of parts using it. But we cannot use log data directly to analyze users' behaviors. In order to analyze user activity model, it needs transformation process through extra framework. Due to these things, we need to figure out user activity model analysis framework first and access to data. In this paper, we suggest a novel framework model in order to analyze user activity model effectively. This model includes MapReduce process for analyzing massive data quickly in the distributed environment and data architecture design for analyzing user activity model. Also we explained data model in detail based on real online service log design. Through this process, we describe which analysis model is fit for specific data model. It raises understanding of processing massive log and designing analysis model.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.413-423
• /
• 2014

Recently, cloud computing has been affecting academic information system buildup. When university academic affairs information system is designed with cloud computing, it is very important to estimate the adequate processing capacity for the cloud computer taking into account a waste of resources and the quality of service. Cloud computer's processing capacity to meet the quality of service expected by users should be predicted based on users' transaction patterns and resource requirements characteristics. In this paper, we analyze actual traffic patterns occurring in university academic affairs business and propose a method to calculate the optimal processing capacity for cloud computer to satisfy the given average response time. To justify our research, we apply the research results to a real university academic affairs business case and obtain the optimal processing capacity for the integrated academic affairs business.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1196-1210
• /
• 1997

Timestamp-Ordering Prltocol among trancaction scheduling alforithms can cause the priority teversion that a transaction with higher priority is processed after the teansaction the trancaction withe lower priority by assigning timestamp to transactions entering system and scheduling them based on the timestamp.To prevent this reversion,we suggest a data priority-based timestamp ordering prioity within the same timestamp group after grouping teansactions into constant time interval based on entering points.To evaluate the performance of this protocol,we compared the performance of this protocol with that of others after constructing the simulation environment with real time database system.We verified that the performance of proposed protocol is supweior to that of timestamp ordering protocol under the comdition of high load and high data conflicts.