检索结果-内蒙古大学图书馆

Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization

JOURNAL OF systemS AND SOFTWARE 2007年第5期80卷 724-735页

作者： Yin, Peng-Yeng Yu, Shiuh-Sheng Wang, Pei-Pei Wang, Yi-Te Natl Chi Nan Univ Dept Informat Management Puli 545 Nantou Taiwan

In a distributed computing system, a number of program modules may need to be allocated to different processors such that the reliability of executing successfully these modules is maximized and the constraints with limited resources are satisfied. The problem of finding an optimal task allocation with maximum system reliability has been shown to be NP-hard;thus, existing approaches to finding exact solutions are limited to the use in problems of small size. This paper presents a hybrid particle swarm optimization (HPSO) algorithm for finding the near-optimal task allocation within reasonable time. The experimental results show that the HPSO is robust against different problem size, task interaction density, and network topology. The proposed method is also more effective and efficient than a genetic algorithm for the test-cases studied. The convergence and the worst-case characteristics of the HPSO are addressed using both theoretical and empirical analysis. (c) 2006 Elsevier Inc. All rights reserved.

关键词： task allocation problem distributed computing systems distributed system reliability hybrid strategy particle swarm optimization genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for reliability-oriented task assignment in a distributed system

引用

COMPUTER COMMUNICATIONS 2002年第17期25卷 1622-1630页

作者： Chiu, CC Yeh, YS Chou, JS Private Takming Coll Dept Management Informat Syst Taipei Taiwan Natl Chiao Tung Univ Inst Comp Sci & Informat Engn Hsinchu Taiwan

distributed systems (DS) have become a major trend in computer systems design today because of their high speed and high reliability. reliability is an important performance parameter in DS design. The distribution of programs and data files can affect the system reliability. Usually, designers add redundant copies of software and/or hardware to increase the system's reliability. The reliability-oriented task assignment problem, which is NP-hard, is to find a task distribution such that the program reliability or system reliability is maximized. In this paper, we developed a reliability-oriented task allocation scheme, based on a heuristic algorithm, for DS to find an approximate solution. The simulation shows that, in most test cases with one copy, the algorithm finds suboptimal solutions efficiently. When the algorithm cannot obtain an optimal solution, the deviation is very small;therefore, this is a desirable approach for solving these problems. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： distributed system reliability task assignment heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for reliability-oriented task assignment in a distributed system

引用

Journal of Information & Optimization Sciences 2004年第2期25卷 385页

作者： Hsu, Chung-Hsien Chin-Ching, Chiu

The reliability-oriented task assignment problem, which is NP-hard, is to find a task distribution such that the program reliability or systom reliability is maximized. In this paper, we have developed a reliability oriented task allocation scheme, based on a genetic algorithm, for distributed systems to find an appproximate solution. The simulation shows that, in most test cases, the algorithm finds sub-optimal solutions efficiently; therefore, it is a desirable approach to solve these problems. [PUBLICATION ABSTRACT]

关键词： distributed system reliability task assignment distributed program reliability genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization

引用

APPLIED MATHEMATICS AND COMPUTATION 2007年第2期184卷 407-420页

作者： Yin, Peng-Yeng Yu, Shiuh-Sheng Wang, Pei-Pei Wang, Yi-Te Natl Chi Nan Univ Dept Informat Management Nantou 545 Taiwan

In a distributed computing system (I)CS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order to achieve various objectives, such as throughput maximization, reliability maximization, and cost minimization. There may also exist a set of system constraints related to memory and communication link capacity. The considered problem has been shown to be NP-hard. Most existing approaches for task allocation deal with a single objective only. This paper presents a multi-objective task allocation algorithm with presence of system constraints. The algorithm is based on the particle swarm optimization which is a new metaheuristic and has delivered many successful applications. We further devise a hybrid strategy for expediting the convergence process. We assess our algorithm by comparing to a genetic algorithm and a mathematical programming approach. The experimental results manifest that the proposed algorithm performs the best under different problem scales, task interaction densities, and network topologies. (C) 2006 Elsevier Inc. All rights reserved.

关键词： multi-objective task allocation problem distributed computing systems distributed system reliability hybrid strategy particle swarm optimization genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

On program and file assignment for distributed systems

引用

COMPUTER systemS SCIENCE AND ENGINEERING 2004年第1期19卷 39-48页

作者： Liu, GQ Xie, M Dai, YS Poh, KL Natl Univ Singapore Dept Ind & Syst Engn Singapore 119260 Singapore

For distributed computing system, the system reliability which is an important quality and performance metric, depends mainly on the allocation of various resources such as the assignment of executed programs and stored files. This paper first develops a general reliability based optimization model followed by an exhaustive search algorithm and a genetic algorithm to solve the model. The steps of the algorithm are described and numerical examples are used to illustrate the advantages and disadvantages of the two algorithms. The genetic algorithm can generally achieve near-optimal results within a limited amount of computational time, and hence recommended for large distributed systems.

关键词： distributed system reliability file allocation program allocation exhaustive search algorithm genetic algorithm (GA)

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for reliability-oriented task assignment with (k)over-tilde-$ duplications in distributed systems

引用

IEEE TRANSACTIONS ON reliability 2006年第1期55卷 105-117页

作者： Chiu, CC Hsu, CH Yeh, YS Private Takming Coll Dept Management Informat Syst Taipei Taiwan Natl Chiao Tung Univ Inst Comp Sci & Informat Engn Hsinchu 30050 Taiwan

A distributed system is a collection of processor-memory pairs connected by communication links. The reliability of a distributed system can be expressed using the distributed program reliability, and distributed system reliability analysis. The computing reliability of a distributed system is an NP-hard problem. The distribution of programs & data-files can affect the system reliability. The reliability-oriented task assignment problem, which is NP-hard, is to find a task distribution such that the program reliability or system reliability is maximized. For example, efficient allocation of channels to the different cells can greatly improve the overall network throughput, in terms of the number of calls successfully supported. This paper presents a genetic algorithm-based reliability-oriented task assignment methodology (GAROTA) for computing the (k) over tilde -DTA reliability problem. The proposed algorithm uses a genetic algorithm to select a program & file assignment set that is maximal, or nearly maximal, with respect to system reliability. Our numerical results show that the proposed algorithm may obtain the exact solution in most cases, and the computation time seems to be significantly shorter than that needed for the exhaustive method. When the proposed method fails to give an exact solution, the deviation from the exact solution is very small. The technique presented in this paper would be helpful for readers to understand the correlation between task assignment reliability, and distributed system topology.

关键词： distributed program reliability distributed system reliability genetic algorithm task assignment

来源：评论

学校读者我要写书评

暂无评论

Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization

引用

APPLIED MATHEMATICS AND COMPUTATION 2012年第5期219卷 2589-2600页

作者： Kang, Qinma He, Hong Deng, Rong Shandong Univ Sch Informat Engn Weihai 264209 Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100190 Peoples R China Tongji Univ Sch Elect & Informat Engn Shanghai 201804 Peoples R China

Effective task assignment is critical for achieving high performance in heterogeneous distributed computing systems. However, there is a possibility of processor and network failures and this can have an adverse impact on applications running on such systems. This paper proposes a new technique based on the honeybee mating optimization (HBMO) algorithm for static task assignment in the systems, which takes into account both minimizing the total execution and communication times and maximizing the system reliability simultaneously. The HBMO based approach combines the powers of simulated annealing, genetic algorithms, and an effective local search heuristic to search for the best possible solution to the problem under investigation within a reasonable computing time. We study the performance of the algorithm over a wide range of parameters such as the number of tasks, the number of processors, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness and efficiency of our algorithm are manifested by comparing it with recently proposed algorithms from the literature. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Bi-objective task assignment Heterogeneous computing distributed system reliability Honeybee mating optimization

来源：评论

学校读者我要写书评

暂无评论

The decision model of task allocation for constrained stochastic distributed systems

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2010年第3期58卷 344-351页

作者： Jou, Chichang Tamkang Univ Dept Informat Management Tamsui 25137 Taipei County Taiwan

In distributed systems, an application program is divided into several software modules, which need to be allocated to processors connected by communication links. The distributed system reliability (DSR) could be defined as the probability of successfully completing the distributed program. Previous studies about optimal task allocation with respect to DSR focused on the effects of the inter-connectivity of processors, the failure rates of the processors, and the failure rates of the communication links. We are the first to study the effects of module software reliabilities and module execution frequencies on the optimal task allocation. By viewing each module as a state in the Markov process, we build a task allocation decision model to maximize DSR for distributed systems with 100% reliable network. In this model, the DSR is derived from the module software reliabilities, the processor hardware reliabilities, the transition probabilities between modules, and the task allocation matrix. Resource constraints of memory space limitation and computation load limitation on each processor are considered. The constraint of total system cost, including the execution cost, the communication cost, and the failure cost, is also considered. We solve the problem by Constraint Programming using the ILOG SOLVER library. We then apply the proposed model to a case extended from previous studies. Finally, a sensitivity analysis is performed to verify the effects of module software reliabilities and processor hardware reliabilities on the DSR and on the task allocation decision. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Task allocation Decision model distributed system reliability Markov process Constraint programming

来源：评论

学校读者我要写书评

暂无评论

A GENERALIZED ALGORITHM FOR EVALUATING distributed-PROGRAM reliability

引用

IEEE TRANSACTIONS ON reliability 1993年第3期42卷 416-426页

作者： KUMAR, A AGRAWAL, DP N CAROLINA STATE UNIV DEPT ELECT & COMP ENGNRALEIGHNC 27695

Algorithm GEAR (Generalized Evaluation Algorithm for reliability) computes the reliability of a distributed computing system (DCS) which usually consists of processing element, memory unit, input/output devices, data-files, and pr as its shared resources. The probability that a task or an application can be computed successfully by sharing the required resources on the DCS is termed as the system reliability. Some of the important reliabilities defined using the above concept are terminal-pair, computer- network, distributed-program, and distributed-system. GEAR is general enough to compute all 4 of these parameters. GEAR is a 1-step algorithm and does not require any prior knowledge about multiterminal connections for computing reliability expression. Many examples are included to illustrate the usefulness of GEAR for computing reliability measures of a DCS.

关键词： distributed PROGRAM reliability distributed system reliability MULTIPROCESSOR TRANSACTION-BASED system

来源：评论

学校读者我要写书评

暂无评论

CAREL - COMPUTER-AIDED reliability EVALUATOR FOR distributed COMPUTING NETWORKS

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed systemS 1991年第2期2卷 199-213页

作者： SOH, ST RAI, SE Department of Electrical and Computer Engineering Louisiana State University Baton Rouge LA USA

This paper presents an efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a distributed computing system (DCS). We assume that the graph model G(V, E) for DCS is given. Also, it is assumed that we have path and/or cut information for the network G(V, E). Boolean algebraic concepts are used to define four operators namely, COMpare, REDuce, CoMBine, and GENerate. The proposed method, henceforth called CAREL (Computer Aided reliability evaluator), uses these four operators to generate exclusive and mutually disjoint (e.m.d.) events, and hence the terminal reliability expression. Examples illustrating the technique are given in the text. We have implemented CAREL using bit vector representation [11] on Encore MULTIMAX 320 system. CAREL solves large DCS networks (having pathset of the order of 780 and cutset of the order of 7300 or more) with reasonable memory requirement. A comparison with existing algorithms reveals the computational efficiency of the proposed method. The proof of correctness of CAREL is included in the Appendix.

关键词： BIT VECTOR REPRESENTATION BOOLEAN TECHNIQUE CAREL COMBINATIONAL AND SEQUENTIAL reliability distributed system reliability MINIMAL CONDITIONAL CUBE MINPATH MINCUT OPERATORS COM RED CMB AND GEN reliability EVALUATION TOOL

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：