Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/68193
DC Field | Value | Language |
---|---|---|
dc.contributor | 應數系 | en_US |
dc.creator | 陸行 | zh_TW |
dc.creator | Luh,Hsing | en_US |
dc.creator | Lee,Ming-Chang | en_US |
dc.creator | Lyu,JrJung | en_US |
dc.date | 2004 | en_US |
dc.date.accessioned | 2014-08-05T09:33:41Z | - |
dc.date.available | 2014-08-05T09:33:41Z | - |
dc.date.issued | 2014-08-05T09:33:41Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/68193 | - |
dc.description.abstract | This study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the well-known method; including the speedup upper bound and lower bound limits; was derived. Numerical experiments are also provided in order to verify the complexity of the proposed algorithm. The empirical results demonstrate that the speedup of this parallel algorithm approaches linearity; which means that it can take full advantage of the distributed computing power as the size of the problem increases. | - |
dc.format.extent | 115 bytes | - |
dc.format.mimetype | text/html | - |
dc.language.iso | en_US | - |
dc.relation | American Journal of Applied Sciences,1(2),90-94 | en_US |
dc.title | Solving Linear Programming Problems on the Parallel Virtual Machine Environment | en_US |
dc.type | article | en |
item.cerifentitytype | Publications | - |
item.fulltext | With Fulltext | - |
item.grantfulltext | restricted | - |
item.languageiso639-1 | en_US | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
index.html | 115 B | HTML2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.