WEKO3
アイテム
Efficient algorithms for memory and processor allocation in parallel processing systems
http://hdl.handle.net/2241/6283
http://hdl.handle.net/2241/6283323a1a0f-6100-4b29-879e-282741968822
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
A1549.pdf (158.8 kB)
|
|
| Item type | Thesis or Dissertation(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2007-07-25 | |||||
| タイトル | ||||||
| タイトル | Efficient algorithms for memory and processor allocation in parallel processing systems | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | jpn | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_db06 | |||||
| 資源タイプ | doctoral thesis | |||||
| 著者 |
陳, 幸
× 陳, 幸 |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | In this dissertation,optimal memory and processor allocation algorithms for parallel database processing are presented. Optimal memory allocation is one of the most important factors for preforming effective database query processing. In this dissertation, we discuss the memory resource allocation problem for the parallel database processing in the shared memory and distributed environments. We first introduce a stream-oriented parallel database processing scheme. This scheme has been designed for supporting advanced database applications in general purpose parallel processing environments. Then, we present formulas to describe the memory allocation problem for the stream-oriented parallel processing. After that, we prove two theorems for the optimal memory allocation problem. Finally, we present two new memory allocation algorithms for the stream-oriented parallel processing. By our algorithms, the optimal memory allocation is obtained for various databese queries in shared memory parallel processig environments and distributed processing environments. Another important factor for efficient parallel database processing is to allocate processors optimaly. In general, the optimal processor allocation of the parallel processing is NP-complete for distributed memory multiprocessor systems in which their communication network architectures are fixed. In order to reduce the complexity of the optimal processor allocatin, a reconfigurable multiprocessor system architecture PCVT is proposed. In the PCVT multiprocessor system, each processing element consists of a processor and a private memory. The processing elements are connected by a reconfigurable communication network. The significant characteristic of the PCVT system is that a physical communication path can be established dynamically between any two processing elements by the topology reconfiguration of the communication network. The architecture of the PCVT system, the topology reconfigration method of the communication network and a topology structure generation algorithm are presented in this dissertation. Finally, a processor allocation algorithm is presented. | |||||
| 言語 | en | |||||
| 書誌情報 |
発行日 1996 |
|||||
| アクセス権 | ||||||
| アクセス権 | open access | |||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
| 関係URI | ||||||
| 関連タイプ | hasFormat | |||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://www.tulips.tsukuba.ac.jp/opac/volume/732718 | |||||
| 言語 | ja | |||||
| 関連名称 | 全文はOPACにあり | |||||
| 取得学位 | ||||||
| 学位名 | 博士（工学） | |||||
| 取得学位 | ||||||
| 学位名 | Doctor of Philosophy in Engineering | |||||
| 学位授与大学 | ||||||
| 学位授与機関識別子Scheme | kakenhi | |||||
| 学位授与機関識別子 | 12102 | |||||
| 言語 | ja | |||||
| 学位授与機関名 | 筑波大学 | |||||
| 言語 | en | |||||
| 学位授与機関名 | University of Tsukuba | |||||
| 学位授与年度 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | 1995 | |||||
| 学位授与年月日 | ||||||
| 学位授与年月日 | 1996-03-25 | |||||
| 報告番号 | ||||||
| 学位授与番号 | 甲第1549号 | |||||
