Index is all important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection, join) on this attribute will become ...
详细信息
Index is all important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection, join) on this attribute will become more efficient by utilizing the index. In this paper we focus on parallel algorithms for selections queries involving index;that is data searching on indexed attributes. In this paper, we propose two categories of parallel selection queries using index: parallel one-index search and parallel multi-index search;depending on number of attributes being searched for and whether these attributes are indexed. Our performance results show the effectiveness of the indexing schemes in supporting parallel selection queries. In the performance evaluation, We also include an interesting comparative analysis on each indexing scheme.
The architecture of a multicomputer system with switchable main memory modules (SM3) is presented. This architecture supports the efficient execution of parallel algorithms for nonnumeric processing by 1) allowing the...
详细信息
The architecture of a multicomputer system with switchable main memory modules (SM3) is presented. This architecture supports the efficient execution of parallel algorithms for nonnumeric processing by 1) allowing the sharing of switchable main memory modules between computers, 2) supporting dynamic partitioning of the system, and 3) employing global control lines to efficiently support interprocessor communication. Data transfer time is reduced to memory switching time by allowing some main memory modules to be switched between processors. Dynamic partitioning gives a common bus system the capability of an MIMD machine while performing global operations. The global control lines establish a quick and efficient high-level protocol in the system. The network is supervised by a control computer which oversees network partitioning and other global functions. The hardware involved is quite simple and the network is easily extensible. A simulation study using discrete event simulation techniques has been carried out and the results of the study are presented. The architecture of this system is compared to those of conventional local area networks and shared-memory systems in order to establish the distinct nature and characteristics of a multicomputer system based on the SM3 concept.
作者：
OHMORI, TMATSUMOTO, YMemberFaculty of Engineering
Kyoto University Kyoto Japan 606 NonmemberKoukichi Matsumoto:received his B.E. and Ph.D. degrees in 1954 and 1974
respectively from the University of Tokyo. He joined Toshiba in 1954. He became a Director at Toshiba in 1985 and a Professor at Kyoto University in 1989. He has been engaged in development of control systems for engineeringcomputers development of software productivity technology research in software development support environment etc. He received awards from Japan Electric Industry Society Invention Society Science and Technology Agency etc. He is the author ofsoftware Engineering and 12 other books. He is a lifetime member of Denki Gakkai IEEE Fellow and a member of Japan Society for Software Science and Technology and the Information Processing Society of Japan.
This paper discusses cooperative distributed planning problems using multiple agents that share a very large database. It is an important framework for planning by multiple agents with incomplete information, and for ...
详细信息
This paper discusses cooperative distributed planning problems using multiple agents that share a very large database. It is an important framework for planning by multiple agents with incomplete information, and for evaluating behavior strategies and negotiation manners. The specific issue involves distributed constraint-satisfying problems on databases. The problem is described as concurrent execution and repetitive execution of transactions, where each agent is deemed as a transaction that operates on a very large database. Therefore, we propose a highly efficient parallel database processing algorithm for these two basic operations.
暂无评论