• Title/Summary/Keyword: Commit Information

Search Result 105, Processing Time 0.023 seconds

A Technique to Link Bug and Commit Report based on Commit History (커밋 히스토리에 기반한 버그 및 커밋 연결 기법)

  • Chae, Youngjae;Lee, Eunjoo
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.5
    • /
    • pp.235-239
    • /
    • 2016
  • 'Commit-bug link', the link between commit history and bug reports, is used for software maintenance and defect prediction in bug tracking systems. Previous studies have shown that the links are automatically detected based on text similarity, time interval, and keyword. Existing approaches depend on the quality of commit history and could thus miss several links. In this paper, we proposed a technique to link commit and bug report using not only messages of commit history, but also the similarity of files in the commit history coupled with bug reports. The experimental results demonstrated the applicability of the suggested approach.

A Disk Group Commit Protocol for Main-Memory Database Systems (주기억 장치 데이타베이스 시스템을 위한 디스크 그룹 완료 프로토콜)

  • 이인선;염헌영
    • 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.

Efficient EPC(Enhanced Presumed Commit) Protocol in Distributed Database System (분산 데이터베이스 시스템에서 효율적인 EPC 규약)

  • 안인순;김경창
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10a
    • /
    • pp.349-351
    • /
    • 1999
  • 분산 데이텁이스 시스템에서 원자성 완료 규약으로 2PC(Two Phase Commit) 규약을 사용한다. 2PC 규약의 단점은 규약 수행시 조정자의 고장으로 인하여 참여자들이 블록킹이 될 수 있다. 참여자들이 블록킹 되는 것은 자신들의 자원을 풀지 못하고 조정자가 고장에 복구될 때 까지 기다려야 한다. 블록킹을 해결하기 위해 제안된 방법은 3PC(Three Phase Commit Protocol)규약이 대표적이다. 이 규약은 블록킹은 해결하지만 2PC 규약보다 많은 메시지 교환과 로그 기록을 하게 되고 규약을 수행하는데 걸리는 시간이 증가된다. 본 논문에서는 2PC 규약을 향상시킨 EPC(Enhanced Presumed Commit)규약에 블록킹을 해결할 수 있는 기법을 제안하므로써 기존의 3PC 규약보다 수행시간을 향상시킨다.

  • PDF

Restoration control of optical network and delay time analysis based on deferred commit scheme (Deferred commit 방식에 의한 광통신망의 복구제어 및 지연시간 분석)

  • Cho, Pyung-Dong;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4B
    • /
    • pp.306-315
    • /
    • 2003
  • On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization signal management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various scheme is performed.

Non-Blocking Two Phase Commit Protocol using Cascade Coordinator in Distributed Database System (분산데이터베이스 시스템에서 연쇄 조정자를 이용한 2단계 완료 규약)

  • 안인순;김경창
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.275-277
    • /
    • 2000
  • 분산 데이터베이스 시스템에서 데이터의 일치성을 유지하기 위해 원자성 완료 규약을 수행한다. 2PC 규약은 규약 수행시 조정자의 고장으로 인하여 참여자들이 블록킹이 될 수 있다. 참여자들이 블록킹되는 것은 자신들의 자원을 풀지 못하고 조정자가 고장에서 복구될 때까지 기다려야 한다. 블록킹을 해결하기 위해 제안된 방법은 3PC(Three Phase Commit Protocol)규약이 대표적이다. 이 규약은 블록킹은 해결하지만 2PC(Two Phase Commit) 규약보다 많은 메시기 교환과 로그 기록을 하게 되고 따라서 규약을 수행하는 데 걸리는 시간이 증가된다. 본 논문에서는 2PC 규약의 변형으로 블록킹을 해결할 수 있는 기법을 제안하므로써 기존의 3PC 규약보다 수행시간을 향상시킨다. 제안하는 완료규약의 특징은 새로운 조정자를 규약 전에 미리 선출하여 조정자 고장 발생시 종료규약을 수행하게 함으로써 블록킹을 해결하였다.

  • PDF

A Study of Group Commit Policy in main Memory Database System (메인 메모리 데이터베이스 시스템에서의 그룹 완료 방식에 관한 연구)

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

  • PDF

Implementation of Git's Commit Message Complex Classification Model for Software Maintenance

  • Choi, Ji-Hoon;Kim, Joon-Yong;Park, Seong-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.11
    • /
    • pp.131-138
    • /
    • 2022
  • Git's commit message is closely related to the project life cycle, and by this characteristic, it can greatly contribute to cost reduction and improvement of work efficiency by identifying risk factors and project status of project operation activities. Among these related fields, there are many studies that classify commit messages as types of software maintenance, and the maximum accuracy among the studies is 87%. In this paper, the purpose of using a solution using the commit classification model is to design and implement a complex classification model that combines several models to increase the accuracy of the previously published models and increase the reliability of the model. In this paper, a dataset was constructed by extracting automated labeling and source changes and trained using the DistillBERT model. As a result of verification, reliability was secured by obtaining an F1 score of 95%, which is 8% higher than the maximum of 87% reported in previous studies. Using the results of this study, it is expected that the reliability of the model will be increased and it will be possible to apply it to solutions such as software and project management.

Enhancing Model-based Fault Traceability by Using Similarity between Bug and Commit Information

  • Jung, Dongju;Min, Kyeongsic;Lee, Jung-Won;Lee, Byungjeong
    • Journal of Internet Computing and Services
    • /
    • v.20 no.2
    • /
    • pp.29-37
    • /
    • 2019
  • As software development technology evolves, the quality of software has increased. But software created through sophisticated technology is still defective. The developer will be aware of the defect through a bug report and the reported defect must be fixed as soon as possible for the software to function correctly. It is important to know which component of the program is related to the reported defect and should be fixed. However, even though the developer understands the developed software, the task of tracing faults is a time-consuming task and requires effort. Therefore, if there is a way for developers to support tracing faults, they could fix defects more quickly. Because fixing defects rapidly is a factor of software reliability, fault traceability is essential and an effective method is needed. Therefore, in this paper, we propose a model-based fault traceability enhancement technique by using bug report and commit information and verify the effectiveness of the proposed technique.

Backup path restoration scheme and delay time analysis in GMPLS network (GMPLS 망의 백업경로 복구구조 및 지연시간 분석)

  • Cho, Pyung-Dong;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.603-610
    • /
    • 2003
  • On the optical network, it is important to build restoration scheme capable to network survivability in preparation of potential failure on communication route. This paper analyze the existing schemes on restoration of failure on the optical network, and propose deferred commit scheme to improve resource utilization and management efficiency. Also, the transfer flow of messages needed for transferring restoration signal are presented in a concrete way and delay time required by shared mesh restoration scheme is explained in a substantial way. Simulation-based comparative analysis of various schemes is performed.

Efficient Method of Processing Long-term Transactions for Distributed Environment (분산 환경에서 장기 트랜잭션의 효율적인 처리 방안)

  • 정지호;엄기환
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.1007-1014
    • /
    • 2003
  • It is important to integrate an enterprise application for automating of the business profess, which is responded by a flow of market environment. There are two categories of method that integrate enterprise applications. One is Synchronous Integration, and the other is Asynchronous Integration. EAI(Enterprise Application Integration) and Web service which of the asynchronous integration is focused in the automating method of the business process. After we construct the application integration for automating of the business process, we have to concern about managing of the business transaction. Many Organizations have proposed the process method of business transaction based on 2-phase commit protocol. But this method can′t supply the phase that classify the transaction by transaction weight. In this paper, we propose an efficient method of transaction process for business transactions, which is composed by ′Classify Phase′ that classify transactions. We called this model "3-Phase Commit Method Applied by Classify Phase", we design this model to manage an resource of enterprise efficiently. The proposed method is compared by the method based on 2-Phase commit that could be a problem of management the resource of enterprise, and the advantage of this method is certified to propose the solution of that problem.

  • PDF