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

PCB - A distributed computing system in CORBA

JOURNAL OF PARALLEL AND distributed computing 2000年第10期60卷 1293-1310页

作者： Xu, CW He, B Georgia So Univ Math & Comp Sci Statesboro GA 30460 USA

CORBA (common object request broker architecture) provides a conceptual software bus for distributed object systems, which is not only suitable for enterprise distributed computing, but also suitable for parallel-distributed scientific computations. This paper describes a distributed computing system, named PCB (parallel component bus), based on a cluster of computers with the Java/CORBA technologies. The architecture of the system supports scalability in either SPMD or MIMD models. The measured performance of a parallel computation shows that the system can reach N-fold speedup for large grain applications, (C) 2000 Academic Press.

关键词： distributed computing system CORBA parallel-distributed computing distributed objects

来源：评论

学校读者我要写书评

暂无评论

Maximizing reliability of distributed computing system with task allocation using simple genetic algorithm

引用

JOURNAL OF systemS ARCHITECTURE 2001年第6期47卷 549-554页

作者： Vidyarthi, DP Tripathi, AK Banaras Hindu Univ Dept Comp Sci Varanasi 221005 Uttar Pradesh India Banaras Hindu Univ Inst Technol Dept Comp Engn Varanasi 221005 Uttar Pradesh India

Reliability is one of the very important characteristics of the distributed computing system (DCS), and articles on task allocation (an NP-Hard problem) to maximize the reliability of DCS have appeared in the past [S. Kartik, C.S. Ram Murthy, IEEE Trans. Comput. 46 (6) (1997) 719;S.M. Shatz, Wang, Goto, IEEE Trans. Comput. 41 (90) (1992) 1156]. Genetic Algorithm (GA) has emerged as a successful tool for optimization purposes. We, in this work, have used a simple GA to optimize the reliability of DCS with task allocation. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： reliability distributed computing system task allocation genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A data transmission algorithm for distributed computing system based on maximum flow

引用

CLUSTER computing-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2015年第3期18卷 1157-1169页

作者： Zhang, Xiaolu Jiang, Jiafu Zhang, Xiaotong Wang, Xuan Univ Sci & Technol Beijing Beijing 100083 Peoples R China Univ Sci & Technol Beijing Dept Comp Sci & Technol Beijing 100083 Peoples R China

Data skew can lead to load imbalance and longer computation time in the distributed computing system. To avoid data skew and reduce the data computation time, it is necessary to transmit the data to appropriate machines, this may however take too much network resources. How to balance the computational resources and the network resources is a problem. In this paper, we introduce a computation model called distributed two-phase model, in which the process of a task can be divided into two independent phases: data transmission and data computation. Suppose an upper bound of relative computation time is given, we show how to schedule data transmission with minimum resources, such as data transmission time and occupied bandwidth, to meet the demand. In this paper, we present a novel algorithm to minimize data transmission time and network bandwidth usage in the data transmission phase, with the conditions that an upper bound of relative computation time of data computation phase is given. Moreover, the number of nodes that participate in data computation phase is also reduced, in this way, the computational resources are saved. The simulation results show that the occupied bandwidth can be reduced effectively (about 70 %) in the situation of large-scale data sets and large number of nodes. Our algorithm is also shown to be available in replication situation.

关键词： distributed computing system Minimize bandwidth usage Data transmission time

来源：评论

学校读者我要写书评

暂无评论

EVALUATING RESPONSE-TIME IN A FAULTY distributed computing system

引用

IEEE TRANSACTIONS ON COMPUTERS 1985年第2期34卷 101-109页

作者： GARCIAMOLINA, H KENT, J Department of Electrical Engineering and Computer Science Princeton University

This paper presents an evaluation technique which is useful for studying both the performance and the reliability of a distributed computing system. The distributed system is evaluated the point of view of a user who submits a request for service. Our technique computes the average time to successful completion of this request, taking into account the system failures or repairs which may occur before the request is completed. Given a model of the system and its failures, the performance-reliability measures are computed in an automatic numerical fashion. The technique is computationally intensive, so it is limited to relatively small systems. However, it can produce results for many interesting cases without an inordinate amount of computation.

关键词： Response Time distributed computing system Failure Models Graceful Degradation Performance Evaluation Reliability Evaluation

来源：评论

学校读者我要写书评

暂无评论

Simplified Swarm Optimization for Task Assignment Problem in distributed computing system 13

Simplified Swarm Optimization for Task Assignment Problem in...

引用

13th International Conference on Natural Computation, Fuzzy systems and Knowledge Discovery (ICNC-FSKD)

作者： Yeh, Wei-Chang Lai, Chyh-Ming Huang, Yen-Cheng Cheng, Tzu-Wei Huang, Hsin-Ping Jiang, Yunzhi Natl Tsing Hua Univ Dept IEEM Hsinchu Taiwan Natl Def Univ Inst Resources Management & Decis Sci Taoyuan Taiwan Taoyuan Gen Hosp Minist Hlth & Welf Taoyuan Taiwan Guangdong Polytech Normal Univ Sch Math & Syst Sci Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538621653

Task assignment is a crucial step in distributed computing system, the target of the task assignment problem in distributed computing system is to assign program tasks to processors so as to minimize overall costs made of execution and communication costs and satisfy with various limited resources constraints simultaneously within a system. The task assignment problem with more than three processors is NP-hard. In this paper, we propose an algorithm based on Simplified Swarm Optimization (SSO) as an alternative method to solve the problem. The results of the proposed method ate demonstrated by comparing with well-known methods. The experimental results show that the proposed SSO produces good quality solutions and consumes moderate time in solving task assignment problem in distributed computing system.

关键词： task assignment problem distributed computing system simplified swarm optimization

来源：评论

学校读者我要写书评

暂无评论

= Dynamic Tasks Scheduling Model for Performance Evaluation of a distributed computing system through Artificial Neural Network

= Dynamic Tasks Scheduling Model for Performance Evaluation ...

引用

International Conference on Soft computing for Problem Solving (SocProS 2011)

作者： Singh, M. P. Yadav, P. K. Kumar, Harendra Agarwal, Babita Gurkula Kangari Univ Dept Math & Stat Hardwar 249404 Uttarakhand India Cent Bldg Res Inst Res Planing & Business Dev Roorkee 247667 Uttar Pradesh India

ISBN: (纸本)9788132204862

As technology has quickly and relentlessly advanced in the field of computer hardware, distributed computing system [DCS] has become increasingly popular. Performance enhancement is one of the most important issues in distributed systems. In this paper we have proposed a dynamic task allocation model based on artificial neural network [ANN] scheduling approach to arrange the tasks to the processors. Relocating the tasks from one processor to another at certain points during the course of execution of the program that contributes to the total cost of the running program has been taken into account. Phase-wise Execution Cost [EC], Inter Task Communication Cost [ITCC], Residence Cost [RC] of each task on different processors and Relocation Cost [REC] for each task has been considered while preparing the model.

关键词： distributed computing system Artificial Neural Network Phase-wise Execution Inter-Tasks Communication Cost Execution Cost Relocation Cost

来源：评论

学校读者我要写书评

暂无评论

Comparison of Priority-Based and First Price Sealed-Bid Auction Algorithms of Job Scheduling in a Geographically-distributed computing system

Comparison of Priority-Based and First Price Sealed-Bid Auct...

引用

IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus)

作者： Shabanov, Boris M. Telegin, Pavel Aladyshev, Oleg S. Baranov, Anton V. Tikhomirov, Artem Russian Acad Sci Fed State Inst Sci Res Inst Syst Anal Joint Supercomp Ctr Moscow Russia

ISBN: (纸本)9781538643402

The paper discusses the problem of scheduling computational jobs in a geographically-distributed computing system with decentralized resource management model. Computational jobs in this model have absolute priorities, and high priority job can interrupt low priority running jobs. Straightforward approach for this problem in this kind of systems is based on the simple priority-based algorithm. Another approach is based on economic scheduling methods;authors consider the first-price sealed-bid auction. The paper presents results of experimental comparison of the two algorithms.

关键词： distributed computing system computational jobs with absolute priorities economic based scheduling auction based scheduling algorithm first-price sealed-bid auction

来源：评论

学校读者我要写书评

暂无评论

A recursively heuristic method for the reliability optimization of a distributed computing system

引用

Journal of Information and Optimization Sciences 2002年第3期23卷 489-512页

作者： Chin-ChingChiu Yi-ShiungYeh Kae-MinLiu

The reliability optimization of a distributed computing system is generally an NPhard problem. The reliability of a k–node set with capacity constraint is defined as the probability that a subset of the set of processing elements in system is connected and possesses sufficient node capacity. Relative investigations, namely an exact method and a k–tree reduction method, have examined an optimal or nearly optimal k-node set with capacity constraint. Such investigations can not effectively reduce either the computational time complexity or the deviation from an exact solution. The paper presents a recursively heuristic method to overcome these *** proposed algorithm selects reasonable k–node sets by starting at two nodes which are incident with a link of maximal reliability and a node which has either maximal capacity or maximal degree, respectively. When the starting node is taken, the recursive sub-procedure is run. The sub-procedure adds an adjacent node which connected by a link of maximal reliability to selected set and calls itself again and again until an adequate k–node set is found. By doing so, the sub-procedure finds all of the adequate k–node sets and returns an optimal k–node set to the algorithm. In addition, the sub-procedure omits the reliability computation when an adequate set that has occurred before is selected. For the reason that the reliability of a subset of a set is at least as large as the reliability of the set, the reduction processing is used for decreasing the order of the *** number of selected sets is very small, therefore the proposed algorithm can reduce execution time and complexity. Moreover, the deviation from the exact solution is improved. Compared with existing algorithms on various distributed computing system topologies, our results demonstrate that the proposed algorithm is more efficient in execution time than conventional methods.

关键词： Heuristics Reliability optimization distributed computing system

来源：评论

学校读者我要写书评

暂无评论

A task allocation model for minimising system cost and maximising reliability of distributed computing system

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND distributed systemS 2018年第2期20卷 226-243页

作者： Kumar, Harendra Chauhan, Nutan Kumari Yadav, Pradeep Kumar Gurukula Kangri Univ Haridwar Dept Math & Stat Haridwar 249404 Uttarakhand India Cent Bldg Res Inst Dept Res Planning & Business Dev Roorkee 247667 Uttarakhand India

A distributing computing system (DCS) presents a platform consisting of multiple computing nodes connected in some fashion to which various task of a parallel application could be assigned. Effective task allocation is an essential phase to obtain the optimal cost and reliability of DCS. This paper addressed a new heuristic model of allocating the tasks onto multiple processors in order to achieve optimal cost and optimal reliability of the system. Costs have been taken as fuzzy numbers, which are more realistic and general in nature. Fuzzy program is transformed into crisp one by using the method of defuzzification. A membership function is developed to transform the communication cost in unit interval [0, 1]. Clusters of tasks have been built on the basis of their membership values. To present the effect of the proposed model, it has been implemented on various numerical examples and compared with other existing method related to this field.

关键词： distributed computing system task allocation reliability failure rate system cost execution cost communication cost fuzzy number defuzzification membership values

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of Two GA Based Task Allocation Models in distributed computing system

Comparative Study of Two GA Based Task Allocation Models in ...

引用

The Fourth International Conference on Parallel and distributed computing, Applications and Technologies

作者： Deo Prakash Vidyarthi Anil Kumar Tripathi Biplab Kumer Sarker Kirti Rani Department of Computer Science Faculty of Science Department of Computer Engineering Institute of TechnologyBanaras Hindu University Department of Computer & Systems Engineering Kobe University Department of Computer Science Rani Durgavati University

＜正＞Genetic Algorithm has emerged as a successful tool for optimization problems[1].Earlier,we proposed a task allocation model to maximize the reliability of distributed computing system（DCS） using genetic algorithm[2].Our objective,in this work,is to use the same simple genetic algorithm to minimize the turnaround time of the task given to the DCS for execution and then to compare the resultant allocation with the allocation of maximal reliablity as obtained in [2].Comparisons of both the algorithms are made by illustrated examples and appropriate comments.

关键词： distributed computing system task allocation reliability turnaround genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：