Deadlock is one of the most serious and complex problems concerning the reliability of concurrent Java programs. In this paper, we discuss how to dynamically detect deadlocks in concurrent Java programs at run-time, and propose a representation of synchronization waiting state in an execution of a Java program, which is named the Java thread-wait-for graph. We explicitly define all types of deadlocks in Java with this representation and present an algorithm to detect the deadlocks. Two implementation methods are also presented. We succeeded in detecting a deadlock from a concurrent program, including all types of synchronization waiting relations, using our tool.

A laser diode (LD) frequency separation locking method (called the reference pulse method) is proposed. This method has advantageous features for frequency division multiplexing (FDM) networks from the viewpoint of frequency separation stability with a strict frequency separation standard, modulation format independence, controllability over a large number of LDs, and frequency synchronization capability. Frequency locking experiments, using four and ten controlled LDs, confirmed that the control system using the method can stabilize frequency spacing for more than 100 LDs. The frequency fluctuation is suppressed to less than 10 MHz. Frequency synchronization, utilizing the reference pulse method, is proposed and demonstrated experimentally for two controlled LD groups, each consisting of three LDs. Frequency discrepancy between two LD groups was only 2.7% of the frequency separation. Required frequency-swept light power and controlled LD power at the detector input for frequency synchronization indicate that more than 50000 LD groups within a 10 km area, each having 100 LDs, can be synchronized simultaneously.>