/ 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.
Refereed Journal Papers
Leo Nagamtsu., Statistics of User Access to the Campus Network through Dialup IP Ports. Academic Information Processing Environment Research, vol.2, pp.19--26, 1999.
In the University of Aizu, Information Sysytems and Technology Center has provided a dialup IP connection service from public telephone lines, since the opening of our university (1993). Through this service, users can access to the campus computer system for 24 hours from home and outside of the university. But, there are some problems, such as (1) The number of ports is limited, and in peak hours all ports are occupied so that any new connection would not be accepted. (2) There is no reasoning to support such service by the university, if most users mainly access to the Internet (resources of outside). In this paper, we analyze current situation of usage for the dialup IP ports of our university, and discuss on the effective and fair service policy for usage of resources managed by the information processing center.
In this paper, we consider an extended committee coordination problem in an autonomous decentralized social environment. The conventional committee coordination problem and a distributed algorithm, as a solution to this problem in distributed environment, are presented by K.M.Chandy and J.Misra. The algorithm guarantees the synchronous and exclusion properties of the problem and is fair (i.e. starvation-free) and makes progress (i.e. deadlock-free). In an autonomous decentralized social environment, besides the above mentioned properties, some social properties.
In this paper, we extend the committee coordination problem by introducing some social properties, such as individual preference and stable assignment and give a decentralized social algorithm as a solution to this extended problem. The algorithm guarantees not only the synchronous and exclusion properties but also individual preference and stable assignment properties.
Refereed Proceeding Papers
Leo Nagmatsu and Daisuke Suwa., Searching Idly Running Processes on Workstations in Classroom. Proc. of DPS Workshop of SIG on Distributed Processing and Systems, pp.209--212, Information Processing Society of Japan, Nov. 1998.
To establish an effective management system for computer cluster is important, both from educational and research viewpoint. In classroom workstations of our university, some hosts are heavyly loaded when no one has logged in. This load is mainly caused by idly running process. In educational situation, owner of these processes must be warned. In research view, tracing load behavior of each host is useful for distributed computing. The total number of classroom workstations is quite large, with many educational computer classrooms of our university. We studied to search idly running processes, and then report the result of searching experiments for those idly runnig processes.
This paper gives an overview of problems related to the method for constructing support framework for development and evolution of complex software systems. Especially for softwares which are constructed from modules, it is described from viewpoint of relation to existing software technology.
Unrefereed Papers
In our University, a dialup IP connection service from public telephone lines are supported. Users can access to the campus computer system for 24 hours from home and outside of the university. But, there are some problems of limited number of ports and no available ports in peak hours. For the basis of future facility plan, some statistics on the usage of dialup IP ports are reported and analyzed.
Grants
Academic Activities
Others