|
|
 |
|
|
Operating Systems Laboratory |
Minyi Guo
Assistant Professor |
Operating Systems Laboratory mainly researches in the following areas:
- Automatic parallelization of irregular scientific computing
- OS kernel/Compiler Integration on MIPS processor
- Operating system for embedded system and real-time systems.
- Solving NP-complete problem using DNA computing
Automatic parallelization of irregular scientific computing
Irregular problems arise in computational fluid dynamics, image processing, molecular dynamics simulations, galaxy simulations, climate modeling, optimization problems, and so forth. In this research, we focused on the optimization techniques of parallelism detection and implementation on compile-time for irregular problems. We used special techniques of data dependence analysis, loop transformation, data distribution for sparse matrix, communication set generation and inter-procedural analysis.
OS kernel/Compiler Integration on MIPS processor
Irregular problems arise in computational fluid dynamics, image processing, molecular dynamics simulations, galaxy simulations, climate modeling, optimization problems, and so forth. In this research, we focused on the optimization techniques of parallelism detection and implementation on compile-time for irregular problems. We used special techniques of data dependence analysis, loop transformation, data distribution for sparse matrix, communication set generation and inter-procedural analysis.
Operating system for embedded system and real-time systems
Embedded systems are dedicated to speci??c tasks, whichare widely used in cellular phone, domestic appliances and other electric. If an embedded system is using an operating system at all, it is most likely using a real-time operating system (RTOS), rather than Windows, Unix, Solaris, because embedded systems have power constraints and far fewer system resources than desktop systems, and so forth. This year (2002) we have studied an OS kernel for MIPS processor model. This project is support by 2002 University of Aizu Competitive Research Funding.
Solving NP-complete problem using DNA computing
Nowadays, producing roughly 10 8DNA strands that ??t in a test tube is possible through advances in molecular biology. Adlemanproposed the ??rst paper in which it is shown that eachDNA strand (DeoxyriboNucleic Acid) could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP) with seven vertices. Lipton demonstrated that using Adleman's experiment determines solutions to an instance of the NP-complete satis??ability (SAT) problem. Therefore, the Adleman-Lipton model seems to be another selection of solving NP-complete problem. In this research, we focused on developing DNA algorithms in the Adleman-Lipton model for resolving 3-DIMENSIONAL MATCHING (3DM), and MINIMUM SET-COVER (transformation from 3DM). Also we focused on developing simulator to simulate real DNA experiment of the proposed algorithms.
|
| [minyi-001:2001] | Minyi Guo. Denotational Semantic Descriptions of Data-Parallel Languages. Parallel Processing Letters, 11(2 & 3):363-374, 2001.
"It is important for programmers to understand the semantics of a programming language. However, little work has been done about the semantic descriptions of HPF-like data-parallel languages." In this paper, we first define a simple language D, which includes the principal facilities of a data-parallel language such as HPF. Then we present a denotational semantic model of D. It is useful for understanding the components of an HPF-like language, such as data alignment and distribution directives, forall data-parallel statements etc. |
| [minyi-002:2001] | Minyi Guo and Ikuo Nakata. A Framework for EAEcient Array Redistribution on Distributed Memory Multicomputers. The Journal of Supercomputing, 20(3):243-265, 2001.
Array redistribution is required often in programs on distributed memory parallel computers. It is essential to use eAEcient algorithms for redistribution, otherwise the performance of the programs will degrade considerably. The redistribution overheads consist of two parts: index computation and inter-processor communication. In this paper, by using a notation for the local data description called an LDD, we propose a framework to optimize the array redistribution algorithm both in index computation and inter-processor communication. That is, our work makes an effort to optimize not only the computation cost but also communication cost for array redistribution algorithms. We present an eAEcient index computation method and genetate a schedule that minimizes the number of communication steps and eliminates node contention in each communication step. Some experiments show the efficiency and flexibility of our techniques. |
| [minyi-003:2001] | Minyi Guo and Zhen Liu. Efficient Communication Optimization for Irregular Array References. The Journal of Shanghai University, 5(Suppl. Sept.):193-198, 2001.
Communication set generation signi??cantly in??uences theperformanceof parallel programs. However, seldom work gives attention to the communication generation problem for irregular applications. In this paper, we will explain how support to generate communication set for irregular array references in loops. We propose a compile-time algorithm by introducing some symbolic analysis techniques. In our symbolic analysis system, a set of symbolic solutions of a symbolic expression system is solved by limiting some restrictions. For this propose, we introduce some symbolic analysis algorithms to fix solutions in a system of equalities and inequalities. Finally, we show experimental results on a parallel computer CM-5 that validate our approach. |
| [minyi-004:2001] | Yu Meng, Wanyu Zang, Li Xie, and Minyi Guo. A Survey of Object-Oriented Parallel Languages. Journal of Software, 12(6):822-829, 2001.
Techniques of parallelizing object-oriented language have borne many fruits in recent years. We introduce these new techniques in the aspects of parallel execution model, parallel facilities, optimization and runtime support mainly based on Mentat, CC++, pC++, HPC++, ICC++. We also describe our analysis and evaluation and introduce the problems that should be resolved in the future. |
| Referred Proceeding Papers |
| [minyi-005:2001] | Zhen Liu and Minyi Guo. Symbolic Communication Set Generation for Irregular Applications. In H. R. Arabnia, editor, 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2001), pages 152{158, Las Vegas, June 2001. CSREA Press.
In this paper, we proposed a method that supports to generate communication set for irregular array references in loops. We used a compile-time algorithm by introducingsomesymbolic analysis techniques to obtain the communication set. |
| [minyi-006:2001] | Zhen Liu and Minyi Guo. Integrating Data Mining and On-Line Analytical Processing on Decision Support System. In Proceeding of International Conference on Mechatronics and Information Technology, pages 349-353, Yamaguchi, December 2001.
With the rising of the technology of Data Warehouse, the OLAP and the Data Mining, new scheme of DSS of came into being. It is an effectiveway to enhance the powerand flexiblity of datamining in datawarehouse ofDSSby integrating data mining withOLAPto offset their weaknesses. In this paper, the evolution of theDSSis reviewed firstly.Aproposal of integrating data mining andOLAPis put forward. The mechanism of the on-line analytical datamining in data warehouse of DSS is described. The aspects which is necessary to develop successful on-line analytical data mining system is also discussed. |
| [minyi-007:2001] | Zhen Liu and Minyi Guo. AProposal of Integrating Data Mining and On-Line Analytical Processing in Data Warehouse. In Zhongzhi Shi Y. X. Zhong and Hui Li, editors, Proceeding of the International Conference on Info-tech & Info-net, pages 146{151, Beijing, October 2001. IEEE Computer Society, IEEE Press.
As an analysis tool either of on-line analytical processing or data mining has its own strong points and weaknesses. In this paper, we proposed an integrating data mining andOLAPapproach. Themechanism of the on-line analytical data mining in data warehouse of DSS is described. |
| [minyi-008:2001] | Minyi Guo. Research Subsidy Program for Young Faculty Members to Conduct Research Overseas Related to Improvement of Educational Ministry of Educationand Science, 2001. |
| [minyi-009:2001] | Minyi Guo and Ikuo Nakata. Optimization for Irregular Applications in Parallelizing Compilers, Okawa Foundation for Information and Telecommunication, 2001. |
| [minyi-010:2001] | Minyi Guo, Apr. 2002.Program Committee member, The 3rd Workshop on Parallel and Distributed Scientific and Engineering Computing with Applications (PDSECA-02) . |
| [minyi-011:2001] | Minyi Guo, 2001. Member, IEEE, IEEE Computer Society |
| [minyi-012:2001] | Minyi Guo, 2001. Member, ACM |
| [minyi-013:2001] | Minyi Guo, 2001. Member, IPSJ |
| [minyi-014:2001] | Kazuyuki Saito. Simulation Method of LSI Production Facility, Registered No.2802393, Japan, March 2000. |
| [minyi-015:2001] | Hidetaka Suzuki. Graduation Thesis: Development of a visualization parallel Programming tool, University of Aizu, 2001.
Thesis Advisor: Minyi Guo. |
| [minyi-016:2001] | Takashi Hirai. Graduation Thesis: Procedure for Visualizing Data Dependence Relation, University of Aizu, 2001.
Thesis Advisor: Minyi Guo. |
| [minyi-017:2001] | Yasutoshi Ono. Graduation Thesis: Optimizing Programs through Loop Restructuring, University of Aizu, 2001.
Thesis Advisor: Minyi Guo. |
| [minyi-018:2001] | Haruhiko Kikuchi. Graduation Thesis: Parallelizing Programs using Interface, University of Aizu, 2001.
Thesis Advisor: Minyi Guo. |
| [minyi-019:2001] | Minyi Guo. Invited Talk: EAEcient Communicaiton Scheduling for Array Redistribution, March 2002.
address:Florida Atlantic University, USA |
| [minyi-020:2001] | Minyi Guo. Guest Speech: Tutorial of HPF, March 2002.
address:Georgia State University, USA |
| [minyi-021:2001] | Minyi Guo. Referee of IEICE Transactions on Information and Systems, July 2001. |
| [minyi-022:2001] | Minyi Guo. Referee of IEEE Transactions on Parallel and Distributed Systems, Sept. 2001. |
| [minyi-023:2001] | Minyi Guo. Referee of IEEE Transactions on Systems, Man, And Cybernetics, October 2001. |
| [minyi-024:2001] | Minyi Guo. Referee of Journal of Parallel and Distributed Computing Practices, December 2001. |
| [minyi-025:2001] | Minyi Guo. Referee of Parallel Computing (Elsevier Science), May 2001. |
| [minyi-026:2001] | Minyi Guo. PC member of The 3rd Workshop on Parallel and Distributed Scienti??c and Engineering Computing with Applications (PDSECA-02), September 2001. |
| [minyi-027:2001] | Minyi Guo. PC member of The 4th Workshop on High Performance Scientific and Engineering Computing with Applications (HPSECA-02), March 2002. |
|
Annual Review 2001