• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.1-7
• /
• 2010

Detecting data races is important for debugging programs with OpenMP directives, because races result in unintended non-deterministic executions of the program. It is especially important to detect the first data races to occur for effective debugging, because the removal of such races may make other affected races disappear or appear. The previous tools for race detecting can not guarantee that detected races are the first races to occur. This paper suggests a tool what detects the first races to occur on the program with nested parallelism using the two-pass on-the-fly technique. To show functionality of this tool, we empirically compare with the previous tools using a set of the synthetic programs with OpenMP directives.

• Korean Journal Plant Pathology
• /
• v.13 no.2
• /
• pp.90-94
• /
• 1997

Interaction of races of rice blast fungus and cultivars has been evaluated. Dongjinbyeo was infected by four KJ races and two KI races, while other varieties were susceptible to four to six KJ or KI races. Among the single spores reisolated from the leaf blast lesion of Dongjinbyeo after mixed inoculation of 10 races, 63% was race KJ-301 which produced a small number and small size lesions, while 30% was race KI-313 which produced a large number of lesions. However, 93% of single spores reisolated from Palgongbyeo was a highly virulent race KJ-105. On the other hand, all the races were equally reisolated from the susceptible cultivar Jinmibyeo. Frequency of races isolated from the naturally infected leaf blast lesions in the field was similar to that of reisolated races from the cultivars inoculated with 10 mixed races in the greenhouse. However, 30% of single spores isolated from the naturally infected Dongjinbyeo was race KI-329 ut ace KI-313 was not detected. Genetic relationship of the isolates collected from leaf and neck blast fungus of Jinmibyeo and Nakdongbyeo showed specific bands on RFLP-P64, However, their genetic similarity was 80%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.41-50
• /
• 2004

Detecting races is important for debugging shared-memory Parallel programs, because races result in unintended nondeterministic executions of the programs. Particularly, the first races to occur in an execution of a program must be detected because they can potentially affect other races that occur later. Previous on-the-fly techniques that detect such first races based on candidate events that are likely to participate in the first races monitor access events in order to collect the candidate events during a program execution, and try to report the races only from determining the concurrency relationships of the candidates. Such races reported in this way. however, are not guaranteed to be first races, because they are not determined by taking into account how they are affected with each other. This paper presents a new post-mortem technique that analyzes, on each nesting level, candidate events collected from an execution of a shared-memory program with nested parallelism in order to report only first races. This technique is efficient, because it guarantees that first races reported by analyzing a nesting level are the races that occur first at the level, and does not require more analyses to the higher nesting levels than the current level. The Proposed technique facilitates more practical and effective debugging than the previous techniques, because it guarantees to detect first races if candidate events are collected from an execution instance of the program with nested parallelism.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.17-24
• /
• 2014

Detecting data races is important for debugging shared-memory programs with nested parallelism, because races result in unintended non-deterministic executions of the program. It is especially important to detect the first occurred data races for effective debugging, because the removal of such races may make other affected races disappear or appear. Previous dynamic detection tools for first race detecting can not guarantee that detected races are unaffected races. Also, the tools does not consider the nesting levels or need support of other techniques. This paper suggests a post-mortem tool which collects candidate accesses during program execution and then detects the first races to occur on the program after execution. This technique is efficient, because it guarantees that first races reported by analyzing a nesting level are the races that occur first at the level, and does not require more analyses to the higher nesting levels than the current level.

• International Journal of Industrial Entomology and Biomaterials
• /
• v.43 no.2
• /
• pp.99-103
• /
• 2021

In the present study, twelve bivoltine silkworm races were evaluated for its performance based on quantitative and qualitative traits. Seven oval and five peanut cocoon shaped races were reared in different seasons of the year. By using evaluation index method, the results showed that six races were identified as potential parental races. Among oval races, 75xin, KoC, KoZ and among peanut races An 902, 7532 and QD7 were selected as base material. The identified high yielding races will be used in various breeding programs as initial parents for the production of superior bivoltine breeds/hybrids in Vietnam

• Korean Journal Plant Pathology
• /
• v.11 no.3
• /
• pp.238-244
• /
• 1995

Severity of panicle blast disease on the leading cultivars of rice was investigated at nine locations of Korea during summer in 1993 with frequent raining and low temperature conditions. Incidence of panicle blast was 26% on Jinmibyeo, 23% on Chuncheongbyeo and 40% on Odaebyeo. Race distribution of Pyricularia grisea was examined from 1993 to 1994. A total of 1,098 isolates of the fungus obtained from the blast nurseries and framers; fields were screened using Korean differential varieties. Twenty one races were identified in 1993 and 19 races in 1994. KI-181, KJ-103, KJ-104, KI-241 and KI-209 were identified as new races, and KJ-301 (15%), KJ-201 (13%), KJ-105 (12%) and KI-409 (12%) were major races during 1993 and 1994. Race KI-197, which has a wide spectrum of virulence on rice cultivars, was isolated in a ratio of 8.3% and evenly distributed in the whole country. Some of the major and newly identified races during 1993∼1994 were used for spray-inoculation on leading cultivars and differential varieties in a greenhouse. We found that most of the cultivars were resistant to the major races, KJ-301 and KI-409, but were very susceptible to the new races, KI-241, KI-209, KI-181 and KJ-103.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.884-894
• /
• 1999

순서적 동기화 및 내포 병렬성을 포함하는 공유메모리 병렬 프로그램에서의 경합(race)은 프로그램 수행에서 원하지 않은 비결정성(nondeterminism)을 야기할 수 있기 때문에 반드시 탐지되어져야 한다. 특히 프로그램 수행에서 최초경합(first race)을 탐지하는 것은 중요한데, 그 이유는 이 경합을 제거하면 다른 경합이 나타나지 않을 수도 있기 때문이다. 본 논문에서는 결정적 공유메모리 병렬프로그램을 위한 2단계 수행중 (two-pass on-the-fly) 최초경합 탐지 기법을 제시하며, 이것은 공유메모리 병렬 프로그램의 특정 수행에서 "최초로 발생되는" 경합들을 탐지하는 기법이다. 그리고 HPF 컴파일러를 이용하여 본 탐지 프로토콜을 공인된 벤치마크 프로그램에 적용하여, 병렬 프로그램 디버깅 시 고려하여야 할 파라미터들에 대한 실험으로부터 본 기법의 효율성을 보였다.Abstract Detecting races is important in debugging shared-memory parallel programs which have ordered synchronization and nested parallelism, because the races result in unintended non- deterministic executions of the programs. The first races are important in debugging, because the removal of such races may make other races disappear. It is even possible that all races reported would disappear once the first races are removed. This paper presents a new two-pass on-the-fly algorithm to detect the first races in such parallel programs. The algorithm reported in this paper is an on-the-fly algorithm that detects the races that "occur first" in a particular execution of shared-memory parallel programs. The experiment has accomplished, where two certified benchmark programs which can be executed under High Performance Fortran environments to get some parameters which improve debugging performance with our algorithm. with our algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1042-1054
• /
• 1999

공유메모리 병렬프로그램의 오류수정에서 경합의 탐지는 중요하다. 왜냐하면 경합은 잘못된 수행 결과를 초래할 뿐만 아니라, 의도하지 않은 프로그램의 비결정적인 수행을 유발하여 오류수정을 어렵게 하기 때문이다. 특히 최초경합의 탐지는 더욱 중요하다. 그 이유는 최초경합을 제거함으로써 나머지 경합들을 방지할 수도 있기 때문이다. 기존의 수행중 경합 탐지기법들은 접근별 보고방식을 기반으로 하는데, 이 기법들은 임의 공유변수에 대한 병행 쓰레드들의 모든 접근사건들을 검사하기 위해서 접근역사라는 유일한 공유정보를 이용하므로 탐지과정에 심각한 병목현상을 유발시킨다. 그러나, 최초경합 탐지를 위한 경우 이러한 병목현상은 크게 개선될 수 있다. 본 논문에서는, 각 접근사건 검사를 위해 각 쓰레드에 공유되지 않는 독립적인 접근역사를 별개로 두고, 경합을 보고하는 시점인 쓰레드 합류시점에서만 공유되는 접근역사를 이용하도록 함으로써 병목현상을 개선하여 최초경합을 탐지할 수 있는 새로운 수행중 탐지기법을 제안한다. 그러므로 본 기법은 최초경합을 보다 효율적으로 탐지할 수 있기 때문에 수행중 경합 탐지를 더욱 효율적이고 실용적으로 할 수 있다. Abstract Detecting races is important for debugging shared-memory parallel programs, because the races lead to unintended nondeterministic executions of the programs as well as erroneous result and then make debugging programs difficult. Especially, detecting the first races is more important. The reason is that the removal of the first races can make other races disappear. Most existing on-the-fly techniques to detect the races are based on per- access reporting method incurring the serious central bottleneck, because the techniques use unique shared information called access history for checking all accesses of concurrent threads to a shared variable. Such bottleneck, however, can be improved considerably in case of detecting first races. This paper presents a new on-the-fly technique which detects the first races with reduced bottleneck through checking each accesses with private access histories and finally reporting races with shared access histories. Therefore, this technique makes on-the-fly race detection more efficient and practical.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.87-94
• /
• 2008

Message races should be detected for debugging effectively message-passing programs because they can cause non-deterministic executions of a program. Previous tools for detecting message races report that message races occur in every receive operation which is expected to receive any messages. However message races might not occur in the receive operation if each of messages is transmitted through a different logical communication channel so that their incorrect detection makes it a difficult task for programmers to debug programs. In this paper we suggest a tool, MPIRace-Check, which can exactly detect message races by checking the concurrency between send/receive operations, and by inspecting the logical communication channels of the messages. To detect message races, this tool uses the vector timestamp to check if send and receive operations are concurrent during an execution of a program and it also uses the message envelop to inspect if the logical communication channels of transmitted messages are the same. In our experiment, we show that our tool can exactly detect message races with efficiency using MPI_RTED and a benchmark program. By detecting message races exactly, therefore, our tool enables programmers to develop reliable parallel programs reducing the burden of debugging.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.7
• /
• pp.341-348
• /
• 2005

Detecting unaffected race conditions is important for debugging message-passing programs effectively, because such races can influence other races to occur or not. The previous technique used in detecting unaffected races detects a race by halting the execution of a process at the receive event of the race that errors first in the process. However this technique does not guarantee that all of the detected races are unaffected, because halting the execution of processes does disconnect some chains of affects-relations among those races. Tn this paper. we improved the second pass algorithm of the previous technique by producing information about affects-relations of the races that occur first in each Process. Then we effectively visualize affect-relations among the races detected in each process. This visualization is effective in detecting visually unaffected races by simplifying affects-relations among the races which occur first In each Process.