MF研究者総覧

教員活動データベース

Transaction sequencing problems for maximal parallelism

発表形態:
原著論文
主要業績:
主要業績
単著・共著:
共著
発表年月:
1992年02月
DOI:
10.1109/RIDE.1992.227402
会議属性:
国際会議(国内開催を含む)
査読:
有り
リンク情報:

日本語フィールド

著者:
T. Kakeshita, H-Y. Xu
題名:
Transaction sequencing problems for maximal parallelism
発表情報:
Proc. RIDE-TQP'92, pp.215-216 (平成4年2月). ページ: pp. 215 - 216
キーワード:
概要:
抄録:
The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve approximation using it.

英語フィールド

Author:
T. Kakeshita, H-Y. Xu
Title:
Transaction sequencing problems for maximal parallelism
Announcement information:
Proc. RIDE-TQP'92, pp.215-216 (平成4年2月). Page: pp. 215 - 216
An abstract:
The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve approximation using it.


Copyright © MEDIA FUSION Co.,Ltd. All rights reserved.