| 查看: 524 | 回复: 1 | |||
[交流]
急，能查询EI检索的帮下忙，看是否被检索了，谢谢！ 已有1人参与
|
|
题目：An improved Min-Min algorithm in Cloud Computing 作者：Gang Liu, Jing Li, Jianchao Xu 不胜感激！ |
回复此楼» 猜你喜欢
售SCI一区T0P文章，我:8O.55.1.O.54,科目全,可伽急
已经有3人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有3人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有3人回复
-
售SCI一区T0P文章，我:8O.55.1.O.54,科目全,可伽急
已经有3人回复
-
售SCI一区T0P文章，我:8O.55.1.O.5.4,科目齐全,可+急
已经有5人回复
-
售SCI一区T0P文章，我:8.O55.1.O.54,科目全,可十急
已经有3人回复
-
售SCI一区文章，我:8O5.5.1.O5.4,科目全,可伽急
已经有5人回复
-
售SCI一区文章，我:8O5.5.1.O5.4,科目全,可伽急
已经有4人回复
-
售SCI一区文章，我:8.O.551.O.5.4,科目全,可伽急
已经有3人回复
-
售SCI一区文章，我:8.O.551.O.5.4,科目全,可伽急
已经有5人回复
» 本主题相关价值贴推荐，对您同样有帮助:
- 帮忙查两篇EI检索信息，谢谢
已经有4人回复
- 哪位好心人帮助查询一下论文是否被ei和istp检索，多谢
已经有6人回复
- 急求文章的EI检索号(1篇含SCI号），
已经有6人回复
★ ★
小木虫: 金币+0.5, 给个红包，谢谢回帖
静安jingan: 金币+1, 鼓励应助，速度好快啊 2013-03-11 15:54:41
小木虫: 金币+0.5, 给个红包，谢谢回帖
静安jingan: 金币+1, 鼓励应助，速度好快啊 2013-03-11 15:54:41
|
Accession number: 20124515646993 Title: An improved min-min algorithm in cloud computing Authors: Liu, Gang; Li, Jing; Xu, Jianchao Author affiliation: Department of Computer Science and Engineering, Changchun University of Technology, Changchun, China Corresponding author: Liu, G. Source title: Advances in Intelligent Systems and Computing Abbreviated source title: Adv. Intell. Sys. Comput. Volume: 191 AISC Monograph title: Proceedings of the 2012 International Conference of Modern Computer Science and Applications Issue date: 2013 Publication year: 2013 Pages: 47-52 Language: English ISSN: 21945357 ISBN-13: 9783642330292 Document type: Conference article (CA) Conference name: International Conference of Modern Computer Science and Applications, MCSA 2012 Conference date: September 8, 2012 - September 8, 2012 Conference location: Wuhan, China Conference code: 93504 Sponsor: Information Technology and Industrial Engineering Research Center Publisher: Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany Abstract: Scheduling of user tasks is a very complicated process in cloud computing environment. Min-min algorithm shortcoming is the long tasks may not be scheduled. Therefore, this paper puts forward an improved min-min algorithm that not only based on the min-min algorithm but also the three constraints. The three constraints are quality of service, the dynamic priority model and the cost of service. By using the software CloudSim to run the simulation experiment. Compared with the traditional min-min algorithm, the experimental results show it can make long tasks execute at reasonable time, increase resource utilization rate and meet users' requirements. © 2013 Springer-Verlag. Number of references: 13 Main heading: Algorithms Controlled terms: Cloud computing - Computer science - Computer software - Computer systems - Quality of service - Scheduling algorithms Uncontrolled terms: Computing environments - Cost of service - Dynamic priority - Resource utilizations Classification code: 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications DOI: 10.1007/978-3-642-33030-8_8 Database: Compendex Compilation and indexing terms, © 2013 Elsevier Inc. |
2楼2013-03-11 12:46:51
