• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.516-526
• /
• 2004

Main-Memory DataBase(MMDB) system where all the data reside on the main memory shows tremendous performance boost since it does not need any disk access during the transaction processing. Since MMDB still needs disk logging for transaction commit, it has become another bottleneck for the transaction throughput and the commit protocol should be examined carefully. There have been several attempts to reduce the logging overhead. The pre-commit and group commit are two well known techniques which do not require additional hardware. However, there has not been any research to analyze their effect on MMDB system. In this paper, we identify the possibility of deadlock resulting from the group commit and propose the disk group commit protocol which can be readily deployed. Using extensive simulation, we have shown that the group commit is effective on improving the MMDB transaction performance and the proposed disk group commit almost always outperform carefully tuned group commit. Also, we note that the pre-commit does not have any effect when used alone but shows some improvement if used in conjunction with the group commit.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.104-113
• /
• 2000

In this paper, we propose a protocol that makes use of a concept of a meta-group based on propagation trees to deal with duplicated members of the same multicast group. It is shown that, if multicast tree is composed ofthese meta-groups, the depth of the tree can be shortened and the ordering of the multicast that communicatesbetween multiple senders and receivers can be easier. In the protocol, we assign a Designated Manager(DM) toeach meta-group and make each DM do the role of the representative receiver of the meta group. In this Paper,the DM's are supposed to handle ACK and retransmission for the members in the same meta group. Hence, theDM's distribute the ACK from senders, and they can reduce the burden of senders by shortening commit delaytime. We also show, through a simulation analysis, that the new multicast protocol outperforms the existing onesnot only in message costs but also in commit delay times.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.40-42
• /
• 2001

트랜잭션 로그 정보를 안전한 저장장치에 저장하는 것은 트랜잭션의 완료를 위한 필수 불가결한 요소이지만 시스템 성능에 커다란 저해 요인이 되고 있다. 이에 대한 개선책으로 선-완료(pre-commit), 그룹 완료(group commit)와 같은 방식들의 제안이 있었으나, 이 방식들을 시스템에 적용했을 경우, 특히 로깅이 평상시 트랜잭션 수행시간의 거의 대부분을 차지하는 메인 메모리 데이터베이스(MMDB) 시스템과 같은 환경에서의 구체적이고 다양한 논의가 아직 이루어지지 안고 있다. 본 논문에서는 MMDB시스템에 그를 완료를 적용할 때 발생할 수 있는 교착 상태에 대한 설명과 해결책을 제시하였고, 다각적인 모의실험을 실시하여 이전 논문들의 우려와는 달리 그룹 완료 방식이 전체 시 9853;메 성능뿐만 아니라 트랜잭션 수행시간 단축을 위해서도 매우 우수한 해결 방식이며, 선-완료 방식은 예상과 달리 그룹 완료 방식의 보조수단으로 병행될 때에만 시스템 성능에 추가적인 도움을 준다는 것을 보였다.다.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.315-325
• /
• 2005

In mobile computing environments, a mobile host caches the data items to use the bandwidth efficiently and improve the response time of transactions. If the data items cached in mobile host are updated in the server, the server broadcasts an invalidation report for maintaining the cache consistency of mobile hosts. However, this method has a problem that the response time of mobile transactions can be long since their commit decision is delayed until receiving the invalidation report from the server In this paper, we propose the USR-MT method for improving the response time of mobile transactions. As the UGR-MT method can make a commit decision by using the data group information before receiving the invalidation report, the response time of mobile transactions can be improved. Also our method can improve the cache's efficiency since it prevents all the contents of a cache from being invalidated in the case that the disconnection of a mobile host is longer than the broadcast period of invalidation report.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.9
• /
• pp.251-260
• /
• 2018

The purpose of this study was to determine the association of the Body Shape Index (ABSI) with suicide ideation and suicide attempts by controlling the body mass index (BMI), as well as general characteristics that may affect suicide. The study has used The Sixth Korea National Health and Nutrition Examination Survey conducted by the Korea Centers for Disease Control and Prevention from 2013 to 2015. A total of 13,155 participants were studied, excluding those who had no information on variables that could affect suicidal ideations and suicidal attempts. The chi-squared test and the multivariate logistic regression analysis were performed. The results of the analysis showed that those who had obesity in BMI were more likely to commit suicide and suicide than those who were in 'standard' in BMI. In ABSI, Q3 group was more likely to commit suicide than Q1 group. The number of suicide attempt was significantly higher in the group with Q3 in ABSI than in Q1 group (3.623 times (95% CI 1.027-12.772)). The results of this study suggest that a higher ABSI compared to BMI means that it is possible to make a more extreme choice of suicide attempt rather than suicide ideation.

• Journal of the Society of Disaster Information
• /
• v.4 no.1
• /
• pp.10-31
• /
• 2008

Recently, 'Juvenile' is associated with the 'Misconduct', for it becomes an object of public concern. Therefore in this study, we suggest counterplan about the group traits connected juvenile-life intimately. First, parents promote conversation among the family and are concerned about their children. And they find out the problems in the bud to educate beforehand Second, the counterplan by school attaches great importance to individual contact. Third, in the counterplan on social aspects, adults' unwholesome ideas, bad effects of the mass communication, the lack of teenager's association, negative activity, leisure facilities and lack of opportunity for juveniles bring about negative facts for education of teenagers. Therefore we need positive counterplan to enlighten the young and purify the social environment. And the nation establish righteous values for the younger generation to not commit a crime and punish severely as well as must prepare the realistic and clear policy for the young to bear the responsibility for their role.

• Journal of Families and Better Life
• /
• v.22 no.2
• /
• pp.37-57
• /
• 2004

Online games are very popular among adolescents in Korea. They sometimes lead to cyber delinquency. An ethnographic analysis was conducted in this study to address the social significance of online games. The results showed that the adolescents who were addicted to or indulged in the games were likely to commit delinquency online and/or offline. Delinquency in an information society is typically individualistic, whereas deviant behaviors in an industrial society are more social and collective, such as group violence. Parenting style, student-teacher relationship, peer pressure, game environment, and recreational facilities for the adolescents were intertwined with such adolescent delinquency. Finally, some implications of the online games from the perspective of social welfare practice were discussed to prevent online game indulgence and addiction and adolescent delinquency.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.53-62
• /
• 2008

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile ad hoc computing environment. Mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems. This solution is based on the Group Membership Detection algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4554-4561
• /
• 2014

In recent years, several paradigms have been identified to simplify the design of fault-tolerant distributed applications in a conventional static system. Leader Election is among the most noticeable, particularly because it is closely related to group communication, which provides a powerful basis for implementing active replications among other uses. On the other hand, despite its usefulness, to our knowledge, no study has focused on this problem in a mobile computing environment. The aim of this paper was to propose an algorithm for the leader election protocol in a fixed station based wireless networks environment. The election algorithm is much more efficient than other election algorithms in terms of the fault tolerance.