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

Linear-time algorithms for computing the reliability of bipartite and (# ≤ 2) star distributed computing systems

COMPUTERS & OPERATIONS RESEARCH 2003年第11期30卷 1697-1712页

作者： Lin, MS Natl Taipei Univ Technol Dept Elect Engn Taipei 106 Taiwan

Let S = (V,F) denote a distributed computing system with star topology, where V is the set of nodes of S and F is the set of files distributed in V. The problem of computing the reliability of S has been shown to be #P-complete. Therefore, all known exact algorithms for this problem have exponential time complexity. This study presents two linear-time algorithms to compute the reliability of two restricted subclasses of S. The first algorithm runs in O(\F\) when the file distribution is limited to being bipartite and non-separable. The second algorithm runs in O(\V\), when each file is allocated to at most two distinct nodes and each node contains at most two distinct records. If the failure and working probabilities of every node are identical, then the computation can be accelerated to O(log(\V\)) time by means of the Fibonacci number and the Lucas number.

关键词： reliability distributed computing systems #P-complete linear-time algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

TAXONOMY OF DYNAMIC TASK-SCHEDULING SCHEMES IN distributed computing systems

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1994年第1期141卷 1-10页

作者： ROTITHOR, HG Dept. of Electr. & Comput. Eng. Worcester Polytech. Inst. MA USA

System state estimation and decision making are the two major components of dynamic task scheduling in a distributed computing system. Combinations of solutions to each individual component constitute solutions to the dynamic task scheduling problem. It is important to consider a solution to the state estimation problem separate from a solution to the decision making problem to understand the similarities and differences between different solutions to dynamic task scheduling. Also, a solution to the state estimation problem has a significant impact on the scalability of a task scheduling solution in large scale distributed systems. In this paper we present a taxonomy of dynamic task scheduling schemes that is synthesised by treating state estimation and decision making as orthogonal problems. Solutions to estimation and decision making are analysed in detail and the resulting solution space of dynamic task scheduling is clearly shown. The proposed taxonomy is regular, easily understood, compact, and its wide applicability is demonstrated by means of examples that encompass solutions proposed in the literature. The taxonomy illustrates possible solutions that have not been evaluated and those solutions that may have potential in future research.

关键词： distributed computing systems TAXONOMY DYNAMIC TASK SCHEDULING STATE ESTIMATION DECISION MAKING

来源：评论

学校读者我要写书评

暂无评论

AN OBJECT-BASED TAXONOMY FOR distributed computing systems

引用

COMPUTER 1991年第8期24卷 17-27页

作者： MARTIN, BE PEDERSEN, CH BEDFORDROBERTS, J HEWLETT PACKARD CO TECH STAFFBRISTOLENGLAND

A hierarchy of questions and answers about the features of distributed computing systems (DCSs) leads to an overall system description that facilitates system comparisons. The taxonomy uses terminology from an object-based model of DCSs and emphasizes the runtime services the DCS provides to applications. It is based on the division of DCS issues into three distinct categories: threads object properties and separation. The threads subtree explores the creation, the number, and the control of threads in the DCS. The object properties subtree explores DCS features that are defined for objects in isolation. The separation subtree explores issues that arise because there are many objects in the DCS. To describe a specific DCS, a taxonomy user traces paths through the hierarchy

关键词： DCS distributed computing systems distributed processing object properties subtree object-based model object-oriented programming runtime services separation subtree threads subtree

来源：评论

学校读者我要写书评

暂无评论

SPSRG: a prediction approach for correlated failures in distributed computing systems

引用

CLUSTER computing-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2016年第4期19卷 1703-1721页

作者： Zheng, Weiwei Wang, Zhili Huang, Haoqiu Meng, Luoming Qiu, Xuesong Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

Failure instances in distributed computing systems (DCSs) have exhibited temporal and spatial correlations, where a single failure instance can trigger a set of failure instances simultaneously or successively within a short time interval. In this work, we propose a correlated failure prediction approach (CFPA) to predict correlated failures of computing elements in DCSs. The approach models correlated-failure patterns using the concept of probabilistic shared risk groups and makes a prediction for correlated failures by exploiting an association rule mining approach in a parallel way. We conduct extensive experiments to evaluate the feasibility and effectiveness of CFPA using both failure traces from Los Alamos National Lab and simulated datasets. The experimental results show that the proposed approach outperforms other approaches in both the failure prediction performance and the execution time, and can potentially provide better prediction performance in a larger system.

关键词： Correlated failures Failure prediction Probabilistic shared risk groups distributed computing systems

来源：评论

学校读者我要写书评

暂无评论

DOMAIN-BASED ACCESS-CONTROL FOR distributed computing systems

引用

SOFTWARE ENGINEERING JOURNAL 1988年第5期3卷 161-170页

作者： ROBINSON, DC SLOMAN, MS GEC RES LTD MARCONI RES CTRCHELMSFORD CM2 8HNESSEXENGLAND UNIV LONDON IMPERIAL COLL SCI & TECHNOL DEPT COMPLONDON SW7 2BZENGLAND

Advances in communications technology allow the construction of very large distributed computing systems (VLDCSs) containing thousands of computers and spanning several organisational boundaries. Existing management tools and approaches are not appropriate to the size and multiple-organisation nature of these VLDCSs. This paper describes a new approach to the management of VLDCSs based on a domain model. While this model is applicable to most aspects of management, the paper describes an implementation of the domain model for management of access rights. Domains provide a flexible means for specifying access control policies, which reflect organisational structure, and permit secure inter-organisation interactions, while giving users transparent access to resources. The paper describes an implementation of domains in terms of capability-based access rights, which meets the flexibility and security requirements for managing VLDCSs. Security is enhanced by physically preventing programs from directly accessing capabilities.

关键词： Computer installation management domain model distributed computing systems transparent access access rights organisational structure Operating systems inter-organisation interactions computer networks network operating systems access control distributed processing capability-based access rights security of data Computer networks and techniques security requirements Computer communications

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL NODUP ALL-TO-ALL BROADCAST SCHEMES IN distributed computing systems

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed systems 1994年第12期5卷 1275-1285页

作者： CHEN, MS YU, PS WU, KL IBM Thomas J. Watson Research Center Yorktown Heights NY USA

Broadcast, referring to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcast means the process by which every node broadcasts its certain piece of information to all other nodes. In this paper, we first develop the optimal all-to-all broadcast scheme for the case of one-port communication, which means that each node can only send out one message in one communication step, and then, extend our results to the case of multi-port communication, i.e., k-port communication, meaning that each node can send out k messages in one communication step. We prove that the proposed schemes are optimal for the model considered in the sense that they not only require the minimal number of communication steps, but also incur the minimal number of messages.

关键词： distributed computing systems ALL-TO-ALL BROADCAST NODUP PARTITIONING TREES MINIMAL COMPLETE SETS MULTIPORT COMMUNICATION

来源：评论

学校读者我要写书评

暂无评论

A task migration algorithm for heterogeneous distributed computing systems

引用

JOURNAL OF systems AND SOFTWARE 1998年第3期41卷 175-188页

作者： Tiemeyer, MP Wong, JSK Iowa State Univ Dept Comp Sci Ames IA 50011 USA

Most load balancing schemes are based on the assumption that all processors in a distributed computing system (DCS) have similar processing power and workload. However, as technology continues to advance, networks have become more likely to contain processors of different capabilities and configurations. The proposed load balancing method is based on the coterie, a tool first used in mutual exclusion and vote assignment. This paper describes how the unique properties of coteries allow the underlying protocol to be tailored to the capabilities of the individual nodes in a connected network. In general, each processor communicates with only a subset of the other processors in the network, keeping message traffic relatively low. The coterie allows these subsets to be constructed according to a more thoughtful method - one that is designed to better meet the needs of networks of varying characteristics. It is also shown that the proposed method will always perform task migration whenever possible i.e., if at least one lightly loaded processor and at least one heavily loaded processor exist in the network, task migration will occur. Further, an extension of our algorithm to provide fault tolerance is given: when a processor fails, the network can continue to function with a modified system configuration. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： coterie load balancing fault tolerance distributed computing systems heterogeneous systems

来源：评论

学校读者我要写书评

暂无评论

Optimal k-bounded placement of resources in distributed computing systems

引用

IEICE TRANSACTIONS ON INFORMATION AND systems 2000年第7期E83D卷 1480-1487页

作者： Kim, JH Lee, CH Chungnam Natl Univ Dept Comp Engn Parallel Proc Lab Yusong Gu Taejon 305764 South Korea

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of resource copies needed. Resources include special I/O processors, expensive peripheral devices, or such software modules as compilers, library routines, and data files. Due to the delay in accessing each of these resources, system performance degrades as the distance between each processor and its nearest resource copy increases. Thus, every processor must be within a given distance k greater than or equal to 1 of st least one resource copy, which is called the k-bounded placement problem. The structure of a distributed computing system is rep resented by a graph. The Ic-bounded placement problem is first transformed into the problem of finding smallest k-dominating sets in a graph. Searching for smallest k-dominating sets is formulated as a state-space search problem. We derive heuristic information to speed up the search, which is then used to solve the problem with the well-known A* algorithm. An illustrative example and some experimental results are presented to demonstrate the effectiveness of the heuristic search.

关键词： A* algorithm interprocessor communication distributed computing systems k-bounded resource placement k-dominating sets state-space search

来源：评论

学校读者我要写书评

暂无评论

SHARED MINI MICROCOMPUTER MEMORY PERFORMANCE AT REMOTE COMPUTER NETWORK NODES IN LARGE-SCALE distributed computing systems

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROPROGRAMMING 1987年第2期19卷 143-152页

作者： REDDI, AV INDIAN INST TECHNOL DEPT COMP SCI & ENGNBOMBAY 400076INDIA

With the growth of large scale parallel and distributed computing systems, it has become very common to use teletype-writer and display terminals at remote nodes. A remote system model for sharing of information transmission facilities along with regular users in a resources sharing mode is presented. The large memory performance of a mini/microcomputer included in the model is analysed for synchronous transmission of teletypewriter and display terminals data, constant service times and single server interruption, through a first-order Markov process. The application of this model is illustrated by an example. Considering the significant importance of the given example in present and future systems, the large memory performance of the mini/microcomputer presented is studied in terms of average queueing delay. Some of the computed values are graphically portrayed and some are tabulated for the use of the large scale parallel and distributed computing systems designers.

关键词： Shared Memory Analysis distributed computing systems Terminal Performance Resource Sharing Computer Networks Mini/Microcomputer Applications System Modelling and Analysis Queueing Applications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：