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 条

[11] Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling [J].

Chen, Yu-Wang ;

Lu, Yong-Zai ;

Yang, Gen-Ke .

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 36 (9-10) :959-968

[12] Scheduling multiprocessor tasks with genetic algorithms [J].

Correa, RC ;

Ferreira, A ;

Rebreyend, P .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (08) :825-837

[13] Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays [J].

Davidovic, T ;

Hansen, P ;

Mladenovic, N .

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2005, 22 (03) :297-326

[14]

Ernemann C., 2002, International Conference on Architecture of Computing Systems. ARCS 2002. Trends in Network and Pervasive Computing. Workshop Proceedings, P169

[15] Application service providers: Challenges and opportunities [J].

Flammia, G .

IEEE INTELLIGENT SYSTEMS & THEIR APPLICATIONS, 2001, 16 (01) :22-23

[16]

Gawiejnowics S, 2008, TIME DEPENDENT SCHED

[17] PERFORMANCE BOUNDS FOR COLUMN-BLOCK PARTITIONING OF PARALLEL GAUSSIAN-ELIMINATION AND GAUSS-JORDAN METHODS [J].

GERASOULIS, A ;

YANG, T .

APPLIED NUMERICAL MATHEMATICS, 1994, 16 (1-2) :283-297

[18] ON THE GRANULARITY AND CLUSTERING OF DIRECTED ACYCLIC TASK GRAPHS [J].

GERASOULIS, A ;

YANG, T .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (06) :686-701

[19]

Hamscher V, 2004, GRID COMP 7 INT C HI, P191

[20]

He Kun, 2005, Journal of Wuhan University of Technology (Information & Management Engineering), V27, P1

← 1 2 3 4 5 6 7 8 →