Distributed algorithm is a procedure for information processing for computers that are interconnected by communication network. As the size of computer network grows, it becomes more unlikely that all of its components are functional at the same time, in other words, it becomes more likely that some components are fail at any time. In addition, join and remove of new computers to network is frequent. Centralized controls are inadequate to cope with such dynamics of computer network, because a network is too large to be handled by a single centralized controler, and new events such as failures occur even when a centralized control is in progress. One of my research topics is the design of self-organizing and self-adaptive distributed algorithm for huge network of computers from theoretical aspect. Another research topics is the design and implementation of learning-support systems for computer science education in universities. Especially, my research group is developing a learning-support systems for algorithms design.
1990 Received B.E. degree in electronic engineering from Yamaguchi University
1992 Received M.E. degree in information engineering from Hiroshima University
1993 Assistant Professor of Faculty of Engineering, Hiroshima University
1995 Received Ph.D in information engineering from Hiroshima University
1996 Lecturer of Faculty of Integrated Arts and Science, Hiroshima University
1998 Associate Professor of Faculty of Engineering, Hiroshima University
2005 Associate Professor of Graduate School of Information Science and Technology, Osaka University
The four-digit phone numbers are extensions at Osaka University. To call directly from outside Osaka University, dial a phone number marked S after (area code 06) 6850 or a phone number marked T after (area code 06) 6879. For a phone number marked S (extension), however, first dial the main phone number (06) 6879-5111.
The e-mail addresses are given without the suffix "osaka-u.ac.jp"; add "osaka-u.ac.jp" to each e-mail address.