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

Load balancing to adjust for proximity in some network topologies

PARALLEL computing 1997年第14期22卷 2007-2023页

作者： Billard, EA Pasquale, JC UNIV CALIF SAN DIEGO DEPT COMP SCI & ENGNLA JOLLACA 92093

Each job scheduler in large decentralized load balancing systems generally must consider whether it is advantageous to offload jobs to remote computation servers when the local load is too high. Although processing power may appear to be available at a very distant server, two problems arise due to the transmission delay between the scheduler and server. Predictably, the response time of the job is adversely affected as the job spends valuable time in transit, but a more subtle problem involves the value, or reliability, of the state information regarding job queues. The longer the delay between scheduler and server, the less a scheduler should value the state information of the server (given that the state changes over time). We examine the performance of schedulers in topologies with different average proximity and show a probabilistic algorithm that allows schedulers to dynamically form efficient clusters in the network.

关键词： distributed computing system dynamic load balancing clustering queueing network communication delays simulation study

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT TASK MIGRATION ALGORITHM FOR distributed systemS

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed systemS 1992年第4期3卷 488-499页

作者： SUEN, TTY WONG, JSK Department of Computer Science Iowa State University Ames IA USA

It is desirable for the workload in a distributed computing system to be evenly distributed. The objective of this paper is to achieve balanced load among the processors and to reduce the communication overhead of the load balancing algorithm. By balancing the load among processors, resource utilization can be improved and, in general, result in better average response time. A communication protocol and a fully distributed algorithm for dynamic load balancing through task migration in a connected N-processor network are proposed. Each processor communicates its load directly with only a subset (of size square-root N) of processors, reducing communication traffic and average response time. We prove that the given algorithm will perform task migration even if there is only one light load processor and one heavy load processor in the system. Simulation results show that the proposed scheme can save up to 60% of the protocol messages used by the broadcast algorithms and can reduce the average response time.

关键词： COMMUNICATION PROTOCOL COMPUTER NETWORK distributed ALGORITHM distributed computing system DYNAMIC LOAD BALANCING TASK MIGRATION

来源：评论

学校读者我要写书评

暂无评论

The distributed program reliability analysis on star topologies

引用

COMPUTERS & OPERATIONS RESEARCH 2000年第2期27卷 129-142页

作者： Chang, MS Chen, DJ Lin, MS Ku, KL Natl Chiao Tung Univ Inst Comp Sci & Informat Engn Hsinchu 30050 Taiwan Tamsui Oxford Univ Coll Dept Informat Management Taipei Taiwan Chung Shan Inst Sci & Technol Tao Yuan Taiwan

A distributed computing system consists of processing elements, communication links, memory units, data files, and programs. These resources are interconnected via a communication network and controlled by a distributed operating system. The distributed program reliability in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to retrieve data files from other processing elements will be executed successfully. This reliability varies according to (1) the topology of the distributed computing system, (2) the reliability of the communication edges, (3) the data files and programs distribution among processing elements, and (4) the data files required to execute a program. In this paper, we show that computing the distributed program reliability on the star distributed computing systems is NP-hard. We also develop an efficiently solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology.

关键词： distributed program reliability distributed computing system algorithms

来源：评论

学校读者我要写书评

暂无评论

Markov-chain based reliability analysis for distributed systems

引用

COMPUTERS & ELECTRICAL ENGINEERING 2004年第3期30卷 183-205页

作者： Wang, JL Ming Chuan Univ Informat & Telecommun Engn Dept Taipei 11120 Taiwan

In a typical distributed computing system (DCS), nodes consist of processing elements, memory units, shared resources, data files, and programs. For a distributed application, programs and data files are distributed among many processing elements that may exchange data and control information via communication link. The reliability of DCS can be expressed by the analysis of distributed program reliability (DPR) and distributed system reliability (DSR). In this paper, two reliability measures are introduced which are Markov-chain distributed program reliability (MDPR) and Markov-chain distributed system reliability (MDSR) to accurately model the reliability of DCS. A discrete time Markov chain with one absorbing state is constructed for this problem. The transition probability matrix is employed to represent the transition probability from one state to another state in a unit of time. In addition to mathematical method to evaluate the MDPR and MDSR, a simulation result is also presented to prove its correction. (C) 2004 Elsevier Ltd. All rights reserved.

关键词： distributed computing system distributed systems reliability

来源：评论

学校读者我要写书评

暂无评论

Optimal task allocation in distributed systems by graph matching and state space search

引用

JOURNAL OF systemS AND SOFTWARE 1999年第1期46卷 59-75页

作者： Tom, A Murthy, CSR Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India Motorola India Elect Ltd Bangalore 560042 Karnataka India

We consider the problem of finding an optimal allocation of tasks onto processors of a distributed computing system. The processors need not have any particular inter-connection structure. We consider two models, one in which no precedence relations exist between tasks, and another in which there are precedence relations between tasks. Each task causes two types of costs to be incurred by the processor to which it is allocated - the execution cost of the task (which varies from processor to processor in a heterogeneous system), and communication cost when the task has to communicate with other tasks which are not allocated to the same processor. The aim of the task allocation (problem) is to minimize the total turnaround time of ail tasks put together. This problem is known to be NP-hard when there are more than three processors. We use a state space search technique - the A* algorithm to obtain an optimal allocation. We propose a method to reduce the number of nodes generated in the state space search tree. We compare our algorithm for the optimal task allocation problem with that of similar existing algorithms, and show its effectiveness by performing extensive simulations over a wide range of parameters. (C) 1999 Elsevier Science Inc. Air rights reserved.

关键词： distributed computing system task graph precedence relations task allocation state space search A* algorithm

来源：评论

学校读者我要写书评

暂无评论

Reliability of distributed computing systems with Virus Epidemics

Reliability of Distributed Computing Systems with Virus Epid...

引用

中国运筹学会可靠性分会第九届可靠性学术会议

作者： Rui Peng Wenbin Wang Fei Zhao Xuejuan Liu Dongling School of Economics and Management University of Science & Technology BeijingBeijingChina 100083

This paper studies a distributed computing (DC) system under virus epidemics,the reliability of which is defined as the probability of fulfilling a task before a specified ***,the DC system architecture is modeled by an undirected graph whose nodes (***) have a continuous-state model representing its computational *** a set of epidemic differential equations are formulated and solved to obtain the state dynamics of each node under the virus epidemics,based on which the reliability of DC system can be *** results show the effectiveness of the proposed method.

关键词： reliability distributed computing system virus epidemics continuous-state model differential equations

来源：评论

学校读者我要写书评

暂无评论

An Extenics-based Load Balancing Mechanism for distributed computing systems

An Extenics-based Load Balancing Mechanism for Distributed C...

引用

2002年IEEE十区计算机、通信、控制和电机工程会议

作者： Liang-Teh Lee Der-Fu Tao Chia-Ying Tseng Ming-Tsung Wu Department of Computer Science and Engineering Tatung University Department of Electronical Engineering Kuang Wu Institute of Technology 40 Chung-Shan North Road 3rd Sec.Taipei 104 Taiwan China Department of Computer Science and Engineering Tatung University Department of Computer Science and Engineering Tatung University

In distributed computing systems, load balancing is one of the mostimportant factors that affect the system performance. This paper presentsa sender-mitiated dynamic load balancing policies in a distributedcomputing system. There are four policies consisted in the proposedExtenics-based Load Balancing Mechanism (ELBM). For the transferpolicy, instead of defining a fixed threshold value in the traditional loadbalancing policies, we are applying the extension set theory and usingthe average response time of jobs as a factor to create an adaptivethreshold value which is calculated by relational function of averageresponse time, for determining that a new arriving job should bemigrated or not In addition to the transfer policy, bypass-transfer methodis used in the location *** that need to be migrated do not needto be transferred to central node first, but are transferred to destinationnode directly, so as to reduce the communication costs. In order to makethe system more reliable, a template queue is added at the master node ofthe system to reduce the job arrival failure. A simulation model has beenbuilt for evaluating the performance of the system. Comparing with otherload balancing mechanisms, such as RT and ALBCII algorithms, thesimulation results show that a better performance can be achieved by theproposed mechanism.

关键词： distributed computing system extenics-based load balancing mechanism extension theory response time bypass-transfer

来源：评论

学校读者我要写书评

暂无评论

An effective game theoretic static load balancing applied to distributed computing

引用

CLUSTER computing-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2015年第4期18卷 1609-1623页

作者： Siar, Hajar Kiani, Kourosh Chronopoulos, Anthony T. Semnan Univ Fac Elect & Comp Engn Semnan Iran Univ Texas San Antonio Dept Comp Sci San Antonio TX USA

In this paper an algorithm has been proposed to balance the loads in a distributed computing system based on game theory which models the load balancing problem as a non-cooperative game among the users. The proposed load balancing game, which is infinite and with perfect information, aims to establish fairness both in system and user level. The optimal or near-optimal solution of the game is approximated by a genetic algorithm and an introduced hybrid population-based simulated annealing algorithm, using the concept of Nash equilibrium. Since all users responses are shown to converge to their near-optimal solution, distribution of users' jobs is "fair". Simulations demonstrate near-optimality of the proposed algorithms in terms of makespan and fairness for the proposed load balancing scheme.

关键词： distributed computing system Static load balancing Non-cooperative games Nash equilibrium Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Genetic programming for photovoltaic plant output forecasting

引用

SOLAR ENERGY 2014年 105卷 264-273页

作者： Russo, M. Leotta, G. Pugliatti, P. M. Gigliucci, G. Univ Catania Dept Phys & Astron I-95125 Catania Italy Enel Ingn & Ric SpA I-95121 Catania Italy Enel Ingn & Ric SpA I-56122 Pisa Italy

In this paper we have identified several mathematical models for predicting the solar power output of a 1.05 kWp Monocrystalline Silicon high-efficiency photovoltaic string located at the ENEL Catania site, Italy. The data we used corresponds to 15 min of averaged power generated over a whole year (2010). A tool named the Brain Project was used. It follows a distributed genetic programming approach. Seventy-four inputs were investigated for our purposes, but no cloud information was considered. The accuracy of all the models was evaluated and compared to other approaches. Among these, the simpler models, that foresee only two inputs perform similarly to our more complex models and to several others in literature. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Artificial intelligence Genetic programming Artificial neural network distributed computing system Hybrid models

来源：评论

学校读者我要写书评

暂无评论

Optimal time-varying load sharing for divisible loads

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC systemS 1998年第3期34卷 907-923页

作者： Sohn, J Robertazzi, TG SUNY Stony Brook Dept Elect Engn Stony Brook NY 11794 USA

A load sharing problem involving the optimal load allocation of divisible loads in a distributed computing system consisting of N processors interconnected through a bus-oriented network is investigated, For a divisible load, the workload is infinitely divisible so that each fraction of the workload can be distributed and independently computed on each processor. For the first time in divisible load theory, an analysis is provided in the case when the processor speed and the channel speed are time varying due to background jobs submitted to the distributed system with nonnegligible communication delays. A numerical method to calculate the average of the time-varying processor speed and the channel speed and an algorithm to find the optimal allocation of the workload to minimize the total processing finish time are proposed via a deterministic analysis. A stochastic analysis which makes use of Markovian queueing theory is introduced for the case when arrival and departure times of the background jobs are not known.

关键词： PROCESSOR Departure time load sharing time varying average time Divisible distributed computing system LOAD Workload distributed systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：