Scheduling with Constrained Preemption Points in Cloud Computing
碩士 === 國立交通大學 === 資訊管理研究所 === 107 === In this thesis, we considered the scheduling problem with constrained preemption points in cloub computing. We consider the architecture of dividing jobs for parallel computing in cloud computing theory, as a parallel machine scheduling optimization problem, and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/u9vyr3 |