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

PRIMITIVES FOR distributed computing IN A HETEROGENEOUS LOCAL AREA NETWORK ENVIRONMENT

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1989年第12期15卷 1567-1578页

作者： BERNARD, G DUDA, A HADDAD, Y HARRUS, G IMAG CAMPUS GENIE INFORMATF-38041 GRENOBLEFRANCE GIP ALTAIR INRIAF-78153 LE CHESNAYFRANCE

Epsilon is a testbed for monitoring distributed applications involving heterogenenous computers, including microcomputers, interconnected by a local area network. Such a hardware configuration is usual but raises difficulties for the programmer. First, the interprocess communication mechanisms provided by the operating systems are rather cumbersome to use. Second, they are different from one system to another. Third, the programmer of distributed applications should not worry about system and/or network aspects that are not relevant for the application level. What is needed at this level is the possibility to designate the different modules of a distributed application and to send and receive messages between them, in a way as simple as possible. This paper presents the solution chosen in Epsilon. A set of high-level communication primitives has been designed and implemented. They provide the programmer with an interlace independent of the operating system and of the underlying interprocess communications facilities. A program participating to a distributed application may be executed on any host without any change in the source code except for hostnames. No change is done in the operating system of the hosts. The set of primitives is complemented by three user-written functions. [ABSTRACT FROM AUTHOR]

关键词： Communication primitives communication protocols distributed computing local area network message passing

来源：评论

学校读者我要写书评

暂无评论

COMMUNICATION-NETWORK ISSUES AND HIGH-DENSITY INTERCONNECTS IN LARGE-SCALE distributed computing SYSTEMS

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1988年第3期6卷 587-609页

作者： TEWKSBURY, SK HORNAK, LA AT and T Bell Laboratories Inc. Holmdel NJ USA

The authors discuss the impact of the physical interconnection environment through which the concurrent processes among locally distinct computing nodes of large-scale multicomputer systems are coupled. The communication capabilities implied for massively parallel computing systems by fine-grain task partitioning and by fine-grained communications are discussed in detail. Wafer-scale and hybrid wafer-scale system technologies which would support such communications are described.< >

关键词： Communication networks Intelligent networks Large-scale systems distributed computing Fabrics Packaging Concurrent computing Parallel processing Silicon MOSFET circuits

来源：评论

学校读者我要写书评

暂无评论

Joint Design of Shuffling and Function Assignment in Heterogeneous Coded distributed computing

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2022年 70卷 2560-2575页

作者： Song, Heekang Son, Kyungrak Choi, Wan Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon 34141 South Korea Seoul Natl Univ Inst New Media & Commun Seoul 08826 South Korea Seoul Natl Univ Dept Elect & Comp Engn Seoul 08826 South Korea

Considering the increasing demand for large-scale MapReduce distributed computing, coded distributed computing (CDC) has become a promising technology to reduce the significant bottleneck of MapReduce computation. Despite its importance, most of the works on CDC have assumed homogeneous environments, where the nodes have the same storage, computing, and communication capacities. However, since many practical scenarios involve heterogeneous environments, heterogeneous CDC design is highly demanded to reduce communication load. Under consideration of full heterogeneity among workers, this paper addresses the joint design of function assignment and coded shuffling to reduce communication load effectively. We first devise a new embedded index coding (EIC) solution for the device-to-device (D2D) environment and prove its optimality. By extending our novel approach, we propose the optimal shuffling design for the MapReduce framework. Then, we figure out the optimal function assignment with the optimal shuffling design. On account of the prohibitive complexity, we propose an efficient greedy search algorithm and analyze how much performance the proposed scheme can guarantee. Numerical simulations show that our proposed algorithm provides the near-optimal communication load with a considerable complexity reduction, while we observe that the function assignment design is vital for heterogeneous CDC by comparing with the well-designed file allocation design.

关键词： Indexes Encoding Resource management Complexity theory distributed computing Receivers Heterogeneous networks distributed computing MapReduce data shuffle function assignment heterogeneous system

来源：评论

学校读者我要写书评

暂无评论

Efficient Replication for Fast and Predictable Performance in distributed computing

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2021年第4期29卷 1467-1476页

作者： Behrouzi-Far, Amir Soljanin, Emina Rutgers State Univ Dept Elect & Comp Engn New Brunswick NJ 08901 USA

Master-worker distributed computing systems use task replication to mitigate the effect of slow workers on job compute time. The master node groups tasks into batches and assigns each batch to one or more workers. We first assume that the batches do not overlap. Using majorization theory, we show that a balanced replication of batches minimizes the average job compute time for a general class of service time distributions. We then show that the balanced assignment of non-overlapping batches achieves a lower average job compute time than the overlapping schemes proposed in the literature. Next, we derive the optimum redundancy level as a function of the task service time distribution. We show that the redundancy level that minimizes the average job compute time may not coincide with the redundancy level that maximizes job compute time predictability. Therefore, there is a trade-off in optimizing the two metrics. By running experiments on Google cluster traces, we observe that redundancy can reduce the job compute time by one order of magnitude. The optimum level of redundancy depends on the distribution of task service time.

关键词： Task analysis Redundancy Computational modeling Machine learning Internet Computer architecture Training Redundancy replication distributed systems distributed computing latency coefficient of variations

来源：评论

学校读者我要写书评

暂无评论

A Public Blockchain Consensus Mechanism for Fault-Tolerant distributed computing in LEO Satellite Communications

引用

China Communications 2022年第7期19卷 110-123页

作者： Zhen Zhang Bing Guo Lidong Zhu Yan Shen Chaoxia Qin Chengjie Li College of Computer Science Sichuan UniversityChengdu 610065China National Key Laboratory of Science and Technology on Communications University of Electronic Science and Technology of ChinaChengdu 610000China School of Computer Science Chengdu University of Information TechnologyChengdu 610225China School of Computer Science and Technology Southwest Minzu UniversityChengdu 610225China

In LEO(Low Earth Orbit)satellite communication systems,the satellite network is made up of a large number of satellites,the dynamically changing network environment affects the results of distributed *** order to improve the fault tolerance rate,a novel public blockchain consensus mechanism that applies a distributed computing architecture in a public network is *** calculation of blockchain ensures the credibility of the results;and the transactions with calculation results of a task are stored distributed in sequence in Directed Acyclic Graphs(DAG).The transactions issued by nodes are connected to form a *** net can quickly provide node reputation evaluation that does not rely on third *** show that our proposed blockchain has the following advantages:*** task processing speed of the blockchain can be close to that of the fastest node in the entire blockchain;*** the tasks’arrival time intervals and demanded working nodes(WNs)meet certain conditions,the network can tolerate more than 50%of malicious devices;*** matter the number of nodes in the blockchain is increased or reduced,the network can keep robustness by adjusting the task’s arrival time interval and demanded WNs.

关键词： distributed computing public blockchain network consensus mechanism credibility faulttolerance

来源：评论

学校读者我要写书评

暂无评论

Weak models of distributed computing, with connections to modal logic

引用

distributed computing 2015年第1期28卷 31-53页

作者： Hella, Lauri Jarvisalo, Matti Kuusisto, Antti Laurinharju, Juhana Lempiainen, Tuomo Luosto, Kerkko Suomela, Jukka Virtema, Jonni Univ Tampere Sch Informat Sci FIN-33101 Tampere Finland Univ Helsinki Dept Comp Sci HIIT SF-00510 Helsinki Finland Univ Wroclaw Inst Comp Sci PL-51151 Wroclaw Poland

This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker versions of the widely-studied port-numbering model. In the port-numbering model, a node of degree d receives messages through d input ports and sends messages through d output ports, both numbered with 1, 2,..., d. In this work, VVc is the class of all graph problems that can be solved in the standard port-numbering model. We study the following subclasses of VVc: VV: Input port i and output port i are not necessarily connected to the same neighbour. MV: Input ports are not numbered;algorithms receive a multiset of messages. SV: Input ports are not numbered;algorithms receive a set of messages. VB: Output ports are not numbered;algorithms send the same message to all output ports. MB: Combination of MV and VB. SB: Combination of SV and VB. Now we have many trivial containment relations, such as SB subset of MB subset of VB subset of VV subset of VVc, but it is not obvious if, for example, either of VB subset of SV or SV subset of VB should hold. Nevertheless, it turns out that we can identify a linear order on these classes. We prove that SB (sic) MB = VB (sic) SV = MV = VV (sic) VVc. The same holds for the constant-time versions of these classes. We also show that the constant-time variants of these classes can be characterised by a corresponding modal logic. Hence the linear order identified in this work has direct implications in the study of the expressibility of modal logic. Conversely, one can use tools from modal logic to study these classes.

关键词： distributed computing Local algorithms Modal logic Models of computation

来源：评论

学校读者我要写书评

暂无评论

PASSIVE-SPACE AND TIME VIEW - VECTOR CLOCKS FOR ACHIEVING HIGHER PERFORMANCE, PROGRAM CORRECTION, AND distributed computing

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1993年第9期19卷 845-855页

作者： AHUJA, M CARLSON, T GAHLOT, A OHIO STATE UNIV DEPT MATHCOLUMBUSOH 43210

We have noticed two problems with viewing a process as a sequence of events: The first problem is the complete loss of information about potential intra-process concurrency for both sequential and distributed computations, and partial loss of information about potential inter-process concurrency for distributed computations. The second problem is that the resulting reasoning framework does not lend itself to refinement (from sequential computing or a given set of distributed processes) to a preferable set of distributed processes. We argue that it is more natural to view a computation, either distributed or sequential, as a partially ordered set of events. Doing so leads to a view, called passive-space and time view, which we propose in this paper. In the proposed view, a point in space is a passive entity which does not order events that occur at it, and the order is determined by the interaction among the events. We define a relation, ''Affects'', between pairs of events, which captures the partial order on events. To aid users of the relation ''Affects'' in developing algorithms, we define vector clocks, that are global logical clocks, so that the relation ''Affects'', and hence all potential concurrency, between events can be identified from their timestamps assigned. Since this research is motivated by the need to solve practical problems, we define passive-space and time view such that a user has control, in two ways, over the costs involved. First, a process designer may choose any granularity of events and choose any mechanism for determining partial order among events on the process. Second, a user may choose a vector clock such that the extent of potential intra-process concurrency identified depends on the costs associated with the identification. We give vector clocks which trade cost incurred and concurrency identification. We compare the proposed view with the space and time view. Finally, we give a scheme for reducing the cost of communicating timesta

关键词： EXPERIMENTAL SYSTEMS MEASURING PARALLELISM HIGH-PERFORMANCE computing distributed computing PROGRAM CORRECTION (DEBUGGING) GLOBAL LOGICAL CLOCKS VECTOR CLOCKS TIMES TAMPS EVENT ORDERING EVENT CAUSALITY AND CONCURRENCY

来源：评论

学校读者我要写书评

暂无评论

A parallel distributed computing framework for Newton-Raphson load flow analysis of large interconnected power systems

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2015年第Dec.期73卷 1-6页

作者： Kumar, R. Sreerarna Chandrasekharan, E. King Abdulaziz Univ Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia Govt Engn Coll Dept Elect Engn Trichur 680009 Kerala India

This paper proposes a simple parallel and distributed computing framework for the conventional Newton-Raphson load flow (NRLF) solution of large interconnected power systems. The proposed approach is based on message-passing distributed-memory architecture with separate workstations, and involves the piecewise analysis of power systems utilizing the network tearing procedure. The NRLF solution method, applied to each torn system at the selected buses, employs the matrix inversion lemma consisting of the factorization, forward elimination and back substitution procedures. The computational requirements of the state-of-the art parallel algorithm to obtain the correction vector involved in the back substitution procedure is reduced with the proposed approach in which the back substitution is carried out in parallel taking into account the split buses, rather than the order in which the forward elimination is performed. The investigations are carried out on the IEEE 118 bus standard test system in a Redhat Linux based 100 Mbps Ethernet LAN environment. The investigations reveal that the proposed method is significantly faster than the conventional NRLF and also the NRLF based on the state-of-the-art parallel algorithm, and thus finds potential applications for the real-time load flow solution of both regulated and deregulated power systems distributed over large geographical areas. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Load flow Parallel processing distributed computing Split buses NRLF Power systems

来源：评论

学校读者我要写书评

暂无评论

Modular Reconfigurable Robot distributed computing System for Tracking Multiple Objects

引用

IEEE SYSTEMS JOURNAL 2021年第1期15卷 802-813页

作者： Romanov, Alexey M. Romanov, Mikhail P. Manko, Sergey V. Volkova, Maria A. Chiu, Wei-Yu Ma, Hsi-Pin Chiu, Kun-Yen MIREA Russian Technol Univ Inst Cybernet Moscow 119454 Russia Natl Tsing Hua Univ Dept Elect Engn Hsinchu 30013 Taiwan

A modular reconfigurable robot (MRR) is considered as a system of systems;that is, a robot control system consists of modular systems. For an MRR, onboard tracking of multiple objects is one of the most challenging tasks. This is because the task requires lots of computation resources, but an MRR system is constrained by several physical limitations. To enhance the computing performance of an MRR control system, a novel approach to organizing a distributed computing system is proposed. The key components of the proposed approach are FPGA-based specialized computational cores (SCCs). An SCC for tracking objects is designed to utilize spare resources of the MRR module's control devices. Analysis and experiments on a real testbench are performed to illustrate that the proposed approach can enhance overall computing performance of an MRR control system without adding additional components. As such, weight and dimensional parameters are saved;unnecessary power consumption and heat generation are reduced. One experimental example shows that the proposed SCC enables a Kalman filter to track objects up to 100 times faster than a comparable solution implemented with microcontrollers, while the whole distributed computing system can outperform a similar one built on high-performance CPUs.

关键词： Task analysis Robot sensing systems Field programmable gate arrays Cloud computing Performance evaluation distributed computing Ethernet POWERLINK FPGA Kalman filter matrix computation modular reconfigurable robot (MRR) object tracking

来源：评论

学校读者我要写书评

暂无评论

Static and decentralized-adaptive load balancing in a star configured distributed computing system

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS 1996年第1期26卷 91-104页

作者： Dattatreya, GR Venkatesh, R DIGITAL EQUIPMENT CORP NASHUANH 03062

The problem of minimizing the average job response time (sojourn time) in a star configured distributed computing System (DCS) with N peripheral processors and one central processor is studied. Each peripheral processor (satellite) receives a stream of Poisson arrivals, A job arriving at a satellite S-i will be processed with a probability (1 - P-i) by itself and routed to the central site for remote processing with probability P-i. The service time distribution at each processor is arbitrary with means 1/mu(i) and second moments E[Y-i(2)], i = 0,..., N. We first develop an algorithm to compute the optimal routing probabilities when the arrival and the service parameters are known a priori. For a special case, when all the professors have exponential service time distributions, we obtain explicit closed form expressions for the static optimal routing probabilities under the assumption that the derivative of the objective function vanishes inside or on the N-cube of routing probabilities. If this assumption is violated, at least one of the computed probability falls outside [0, 1]. We develop an O(N log N) algorithm to compute the optimal probabilities within the valid range. The second and a major contribution of the paper is the development of an adaptive estimator to be used by each satellite to compute its optimal routing probability, when the parameters (everywhere) are unknown a priori. A copy of the algorithm runs on each peripheral processor and uses the sojourn time measurements that the peripheral processor can gather on its own from those jobs that are sent to the central processor and returned to the originating site after service. It is assumed that the central processor gives the processing time (of a remote job) to a peripheral processor when returning the remote job submitted by that PP. The algorithm does not use any other message transmission between processors. This makes our algorithm thoroughly decentralized. We prove the convergence, with probab

关键词： Load management distributed computing Routing Satellites Costs Computer errors Delay Time factors distributed control Time measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：