Next: Office for Planning Up: Centers Previous: Center for Mathematical

Information Systems and Technology Center


/ Hidesada Kanda / Professor
/ Gennadiy Nikishkov / Visiting Professor
/ Leo Nagamatsu / Associate Professor
/ Akira Fujitsu / Assistant Professor
/ Tongjun Huang / Research Associate

ISTC consists of the Information Processing Center and the University Library. ISTC's main purpose is to provide information services through computer facilities and library services.

  1. Besides providing regular services, IPC staff provided the following new supports during FY 1997.

  2. Concerning Library services, in addition to 2,900 volumes of books with the regular budget, 3,300 special books for the graduate school were purchased in 1997. 551 foreign and 150 Japanese journals, 701 in total, were purchased.


Refereed Proceeding Papers

  1. Tongjun Huang and Zixue Cheng, A Distributed Algorithm for Optimal Allocation of Resources. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, editor: H.R.Arabnia, p.880--884, CSREA, July 1997.

    In this paper, we present a new distributed algorithm for solving the resource allocation problem with multi-types of resources, by employing a technique called multiple matching. A merit of the algorithm is that it allocates the resources to as many processes as possible concurrently, so that only minimum processes need to wait.

  2. Yutaka Wada, Zixue Cheng, and Tongjun Huang, A Distributed Algorithm for Allocation of Resources to Process Groups with Acyclic Graphs. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'97), editor: H.R.Arabnia, p.801-805, CSREA, July 1997.

    In the paper, we propose a new distributed problem as an extension of the resource allocation problem, i.e. ``Allocation of Resources to Process Group'', and its solution. In this problem, there may exist deadlocks or starvation among groups. We call them ``group deadlocks'' and ``group starvation''. Our algorithm is based on an acyclic graph approach to the Dining Philosopher problem, and can allocate resources to groups of processes without group deadlock and group starvation. Also, our algorithm can be applied to a dynamic case, where processes of a group may join/leave in/off form the network environment.

Unrefereed Papers

  1. Tongjun Huang, Akira Fujitsu, Leo Nagamatsu, and Fumio Nemoto, Education on the security and morals in the University of Aizu", Proceedings of the Workshop on Information Processing and Education, p.85--88, The Ministry of Education, Oct. 1997.

Academic Activities

  1. Tongjun Huang, Member of IEICE.


www@u-aizu.ac.jp
December 1998