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

International Workshop on Innovative Architecture for Future Generation High-Performance Processors and systems

作者： Kudoh, T Nishimura, S Yamamoto, J Nishi, H Tatebe, O Amano, H Tsukuba Res Ctr RWCP Tsukuba Ibaraki 3050032 Japan

ISBN: (纸本)076950650X

A local area distributed computing system called RHiNET (RWCP High Performance Network), in which thousands of commodity personal computers and workstations can be connected by high speed optical interconnection is being developed. RHiNET consists of network interfaces, network switches and optical interconnections. RHiNET will provide a single system image to users and support high performance parallel computing. This paper presents an overview of the system.

关键词： PARALLEL PROCESSING (COMPUTERS) HIGH-PERFORMANCE distributed computer High Performance computing optical interconnections Workstations distributed computing system Network interfaces

来源：评论

学校读者我要写书评

暂无评论

ELISA: An estimated load information scheduling algorithm for distributed computing systems

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 1999年第8期37卷 57-85页

作者： Anand, L Ghose, D Mani, V Indian Inst Sci Dept Aerosp Engn Bangalore 560012 Karnataka India

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems. (C) 1999 Elsevier Science Ltd. All rights reserved.

关键词： distributed computing system load balancing load scheduling sensitivity analysis time-varying loads

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

distributed-program reliability analysis: Complexity and efficient algorithms

引用

IEEE TRANSACTIONS ON RELIABILITY 1999年第1期48卷 87-95页

作者： Lin, MS Chang, MS Chen, DJ Tamsui Oxford Univ Coll Dept Informat Management Taipei 25103 Taiwan Chunghwa Telecommun Training Inst Taipei 22077 Taiwan Natl Chiao Tung Univ Dept Comp Sci & Informat Hsinchu 30050 Taiwan

This paper investigates the problem of distributed-program reliability in various classes of distributed computing systems. This problem is computationally intractable for arbitrary distributed computing systems, even when it is restricted to the class of star distributed computing systems. One solvable case for star distributed computing systems is identified, in which data files are distributed with respective to a consecutive property;a polynomial-time algorithm is developed for this case. A linear-time algorithm is developed to test whether or not an arbitrary star distributed computing system has this consecutive file distribution property. Efficient algorithms may still be sought for computing lower & upper bounds on the distributed program reliability for arbitrary distributed computing systems.

关键词： distributed computing system distributed-program reliability computation complexity

来源：评论

学校读者我要写书评

暂无评论

The distributed program reliability analysis on a star topology: Efficient algorithms and approximate solution

引用

IEICE TRANSACTIONS ON INFORMATION AND systemS 1999年第6期E82D卷 1020-1029页

作者： 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 (DPR) 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 a star distributed computing system is #P-complete. A polynomially solvable case is developed for computing the distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing the distributed program reliability with approximate solutions when the star star topology has no the additional file distribution.

关键词： distributed program reliability distributed computing system algorithms

来源：评论

学校读者我要写书评

暂无评论

Probabilistic load scheduling with priorities in distributed computing systems

引用

COMPUTERS & OPERATIONS RESEARCH 1998年第10期25卷 839-856页

作者： Anand, L Ghose, D Mani, V Indian Inst Sci Dept Aerosp Engn Bangalore 560012 Karnataka India

In this paper a distributed computing system/network in which two type of loads (or jobs) namely local loads and global loads arrive is considered. The local loads originate at the individual processors/nodes in the network and have to be processed at the same processors. The global loads originate at the central scheduler and have to be distributed among the processors in the system. The individual processors in the system assign different priorities to local and global loads. A priority queuing optimization model of this situation is formulated as a nonlinear programming problem and a solution methodology is presented. The arrival rate of the global and local loads are assumed to follow Poisson distribution and the service time of the global and local loads at the processors follow a general or exponential service time distribution. Both the situations are analyzed. The objective of this study is to minimize the response time of the global loads in the network. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.

关键词： partial load PROCESSOR load dispatching Reaction Time Poisson distribution distributed computing system Service time LOAD arrival rate

来源：评论

学校读者我要写书评

暂无评论

A framework for modelling and simulating data flows in distributed computing systems

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 1998年第4期45卷 1951-1957页

作者： von Praun, C CERN CH-1211 Geneva 23 Switzerland

This paper introduces a framework for modelling and simulating the behaviour of distributed computing systems. The framework comprises both means for abstract modelling and an implementation that allows the evaluation of abstract models by means of discrete event simulation. The basic characteristics of distributed computing systems used for physics data processing at CERN are presented, motivating the purpose and need for modelling and simulation. As an example, the central data recording system of a current High-Energy Physics experiment is introduced. The modelling framework provides concepts to structure relevant state information of a system. The most important factor to set up the structure of components encapsulating state information is thereby given by dynamic aspects of the system, i.e. by identified data flows. Traditional approaches to modelling often tend to focus purely on static, architectural system aspects. All abstract concepts will be motivated and demonstrated using an example. Results of the simulation are compared to figures measured during real system operation, rating the proposed framework and its underlying modelling approach.

关键词： Frameworks simulated data Operating systems CERN distributed computing system simulating Modeling

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Stability of dynamic groups in distributed computing systems

引用

APPLIED MATHEMATICS AND COMPUTATION 1996年第2-3期74卷 223-248页

作者： Billard, EA Faculty of Computer Science and Engineering University of Aizu Aizu-Wakamatsu City 965-80 Japan

Large distributed computing systems provide the opportunity for the synergistic use of shared resources;an example model is computational ecosystems. However, as networks continue to expand, it is not obvious that all of the agents within a network should participate in one interacting set. Although smaller groups may forfeit potential synergy, they also avoid much of the complexity and overhead of coordination. The nature of the dynamics is complicated by the inherent delays in networks and the state update schemes applied by the agents. Large intelligent systems must provide for 1) the participation of agents in a smaller group and/or 2) the participation of agents in the systemwide group only a fraction of the time. Both of these behaviors are modeled by a system of differential equations with a discrete distribution of time delays. Stability analysis determines the boundaries for damped and persistent oscillations based on the average of the discrete time delays. In large systems, there is a fixed ratio between these boundaries: e pi/2. The results also show that stability improves with diversity in the delays.

关键词： Differential equations Behavior Delay Agents dynamic distributed computing system discrete-time delay Network Differential equations absorption of shock

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：