A study of optimal allocation of computing resources in cloud manufacturing systems

被引：118

作者：

Laili, Yuanjun ^{[1
]}

Tao, Fei ^{[1
]}

Zhang, Lin ^{[1
]}

Sarker, Bhaba R. ^{[2
]}

机构：

[1] Beihang Univ, Sch Automat Sci & Elect Engn, Beijing 100191, Peoples R China

[2] Louisiana State Univ, Dept CM & Ind Engn, Baton Rouge, LA 70803 USA

来源：

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2012年 / 63卷 / 5-8期

关键词：

Optimal allocation; Computing resources; Cloud manufacturing (CMfg); Intelligent algorithms; GENETIC ALGORITHM; SCHEDULING PROBLEM; OPTIMIZATION; COMMUNICATION; SEARCH; CONTENTION;

D O I：

10.1007/s00170-012-3939-0

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

As a new advanced service-oriented networked manufacturing model, cloud manufacturing (CMfg) has been proposed recently. The optimal allocation of computing resources (OACR) is a core part for implementing CMfg. High heterogeneity, high dynamism, and virtualization make the OACR problem more complex than the traditional scheduling problems in grid system or cloud computing system. In this paper, a new comprehensive model for OACR is proposed in the CMfg system. In this model, all main computation, communication, and reliability constraints in the special circumstances are considered. To solve the OACR problem, a new improved niche immune algorithm was presented. Associated with the niche strategy, new heuristics are designed flexibly based on the characteristics of the problem and pheromone is added for adaptive searching. Experiments demonstrate the effectiveness of the designed heuristic information and show NIA's high performances for addressing the OACR problem compared with other intelligent algorithms.

引用

页码：671 / 690

页数：20

共 73 条

[1] COMPARISON OF LIST SCHEDULES FOR PARALLEL PROCESSING SYSTEMS [J].

ADAM, TL ;

CHANDY, KM ;

DICKSON, JR .

COMMUNICATIONS OF THE ACM, 1974, 17 (12) :685-690

[2] Artificial immune system based approach for solving resource constraint project scheduling problem [J].

Agarwal, Rina ;

Tiwari, M. K. ;

Mukherjee, S. K. .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 34 (5-6) :584-593

[3] Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms [J].

Benoit, Anne ;

Marchal, Loris ;

Pineau, Jean-Francois ;

Robert, Yves ;

Vivien, Frederic .

IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (02) :202-217

[4] Efficient collective communication in distributed heterogeneous systems [J].

Bhat, PB ;

Raghavendra, CS ;

Prasanna, VK .

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (03) :251-263

[5] DUAL PROCESSOR SCHEDULING WITH DYNAMIC REASSIGNMENT [J].

BOKHARI, SH .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (04) :341-349

[6] The Grid economy [J].

Buyya, R ;

Abramson, D ;

Venugopal, S .

PROCEEDINGS OF THE IEEE, 2005, 93 (03) :698-714

[7]

Cardoso J., 2004, J. Web Semant., V1, P281, DOI [10.1016/j.websem.2004.03.001, DOI 10.1016/J.WEBSEM.2004.03.001]

[8] Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms [J].

Chaudhry, Imran Ali ;

Drake, Paul R. .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 42 (5-6) :581-594

[9]

Chen S, 1995, PROC INT CONF PARAL, P50

[10] An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements [J].

Chen, Wei-Neng ;

Zhang, Jun .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2009, 39 (01) :29-43

← 1 2 3 4 5 6 7 8 →