計算クラスタ上で文字列の類似度を計算するための並列アルゴリズム

Material type: 文書・図像類

Author: 鈴木, 晋ほか

Publisher: 愛知工業大学

Publication date: 2005-03-31

Material Format: Digital

Capacity, size, etc.: -

NDC: -

View All

Notes on use

Note (General)：: We present a parallel algorithm to calculate the similarity of two strings on computers connected by a local area network, called a cluster of compute...

Search by Bookstore

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

AIT Associated Repository of Academic Resources
Digital
You can check the holdings of institutions and databases with which 学術機関リポジトリデータベース（IRDB）（機関リポジトリ） is linked at the site of 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）.
AIT Associated Repository of Academic Resources

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type: 文書・図像類
Title: 計算クラスタ上で文字列の類似度を計算するための並列アルゴリズム
Author/Editor: 鈴木, 晋
水野, 勝教
石井, 直宏
Author Heading: 鈴木, 晋
水野, 勝教
石井, 直宏
Publication, Distribution, etc.: 愛知工業大学
Publication Date: 2005-03-31
Publication Date (W3CDTF): 2005-03-31
Alternative Title: A Parallel Algorithm to Calculate the Similarity of Two Strings on a Cluster of Computers
Periodical title: 愛知工業大学研究報告. B, 専門関係論文集 = Bulletin of Aichi Institute of Technology. Part B
No. or year of volume/issue: 40
Volume: 40
Pages: 263-266
ISSN (Periodical Title): ISSN : 0387-0812
Text Language Code: jpn
Target Audience: 一般
Note (General): We present a parallel algorithm to calculate the similarity of two strings on computers connected by a local area network, called a cluster of computers. Let the length of each string be n and the number of the computers p. We show that the parallel algorithm can solve the problem in time [numerical formula] when [numerical formula], and, therefore, that the algorithm can do it in time [numerical formula] especially when [numerical formula], where B is (physical time for the computer to transmit one word through the network)/(physical time for the computer to execute one instruction on CPU) (&sime;100). Since the time complexity of the sequential algorithm is O(n^2), the parallel algorithm is faster than the sequential algorithm.
identifier:http://repository.aitech.ac.jp/dspace/handle/11133/1243
Format (IMT): application/pdf
Source: http://repository.aitech.ac.jp/dspace/bitstream/11133/1243/1/%e7%b4%80%e8%a6%8140%e5%8f%b7B%e3%83%8e%e3%83%bc%e3%83%88%28P263-266%29.pdf
http://repository.aitech.ac.jp/dspace/bitstream/11133/1243/1/%e7%b4%80%e8%a6%8140%e5%8f%b7B%e3%83%8e%e3%83%bc%e3%83%88%28P263-266%29.pdf
Access Restrictions: 限定公開
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 愛知工業大学 : 愛知工業大学学術情報リポジトリ