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

parallel and distributed computation for Dynamical Economic Dispatch

IEEE TRANSACTIONS ON SMART GRID 2017年第2期8卷 1026-1027页

作者： Chen, Guo Li, Chaojie Dong, Zhaoyang Univ Newcastle Sch Elect Engn & Comp Sci Newcastle NSW 2308 Australia RMIT Univ Sch Engn Melbourne 3000 Australia Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia

This letter introduces a parallel and distributed computation method for dynamical economic dispatch over a cyber-physical system. To achieve a faster economic dispatch operation, accelerated consensus approach is pro... 详细信息

关键词： parallel and distributed computation dynamical economic dispatch accelerated gradient

来源：评论

学校读者我要写书评

暂无评论

Automatic methods for hiding latency in parallel and distributed computation

引用

SIAM JOURNAL ON COMPUTING 1999年第2期29卷 615-647页

作者： Andrews, M Leighton, T Metaxas, PT Zhang, L Bell Labs Murray Hill NJ 07974 USA MIT Dept Math Cambridge MA 02139 USA MIT Comp Sci Lab Cambridge MA 02139 USA Wellesley Coll Dept Comp Sci Wellesley MA 02181 USA

In this paper we describe methods for mitigating the degradation in performance caused by high latencies in parallel and distributed networks. For example, given any "dataflow" type of algorithm that runs in T steps on an n-node ring with unit link delays, we show how to run the algorithm in O(T) steps on any n-node bounded-degree connected network with average link delay O(1). This is a significant improvement over prior approaches to latency hiding, which require slowdowns proportional to the maximum link delay. In the case when the network has average link delay d(ave), our simulation runs in O(root d(ave)T) steps using n/root d(ave) processors, thereby preserving efficiency. We also show how to efficiently simulate an n x n array with unit link delays using slowdown (O) over tilde(d(ave)(2/3)) on a two-dimensional array with average link delay d(ave). Last, we present results for the case in which large local databases are involved in the computation.

关键词： hiding latency parallel and distributed computation linear and two-dimensional arrays complementary slackness

来源：评论

学校读者我要写书评

暂无评论

nesC-TinyOS model for parallel and distributed computation of max independent set by Hopfield network on wireless sensor network

nesC-TinyOS model for parallel and distributed computation o...

引用

Conference of the Complex Adaptive Systems on Responding to Continuous Global Change in Systems Needs

作者： Li, Jiakai Serpen, Gursel Univ Toledo Toledo OH 43606 USA

This paper, the second one in a three-paper sequence, presents the nesC model of a Hopfield neural network configured for a static optimization problem, the maximum independent set, in fully parallel and distributed mode for TinyOS-based wireless sensor networks. Actual nesC code that implements the required neural computing functionality is presented. The graph representation of the maximum independent set problem is used as the basis for the topology of the Hopfield network as well as the wireless sensor network since each mote is conceived to house one neuron in order to facilitate fully parallel and distributed computation. The nesC implementation of a multitude of phases of computation is detailed including initialization of the neural network, relaxation, convergence detection, and solution detection all while the neural computations are performed on the wireless sensor network. Simulation of the presented nesC-TinyOS model is deferred to the third paper in the sequence. (C) 2011 Published by Elsevier B.V.

关键词： nesC TinyOS wireless sensor network Hopfield neural network static optimization parallel and distributed computation maximum independent set problem

来源：评论

学校读者我要写书评

暂无评论

nesC-TinyOS model for parallel and distributed computation of max independent set by Hopfield network on wireless sensor network

引用

Procedia Computer Science 2011年 6卷 396-401页

作者： Jiakai Li Gursel Serpen Electrical Engineering and Computer Science University of Toledo Toledo Ohio 43606 USA

关键词： nesC TinyOS wireless sensor network Hopfield neural network static optimization parallel and distributed computation maximum independent set problem

来源：评论

学校读者我要写书评

暂无评论

A neural network approach for a robot task sequencing problem

引用

ARTIFICIAL INTELLIGENCE IN ENGINEERING 2000年第2期14卷 175-189页

作者： Maimon, O Braha, D Seth, V Ben Gurion Univ Negev Dept Ind Engn IL-84105 Beer Sheva Israel Tel Aviv Univ Dept Ind Engn IL-69978 Tel Aviv Israel Boston Univ Dept Mfg Engn Boston MA 02215 USA New England Complex Syst Inst Cambridge MA 02135 USA

This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of tasks comprising loading and unloading of parts into and from the machines by a material-handling robot. The performance criterion is to minimize a weighted objective of the total robot travel time for a set of tasks and the tardiness of the tasks being sequenced. A three-phased parallel implementation of the neural network algorithm on Thinking Machine's CM-5 parallel computer is also presented which resulted in a dramatic increase in the speed of finding solutions. To evaluate the: performance of the neural network approach, a branch-and-bound method and a heuristic procedure have been developed for the problem. The neural network method is shown to give good results and is especially useful for solving large problems on a parallel-computing platform. (C) 2000 Elsevier Science Ltd. All rights reserved.

关键词： robot task sequencing asymmetric traveling salesman problem recurrent neural networks parallel and distributed computation automated storage and retrieval

来源：评论

学校读者我要写书评

暂无评论

The apprentice challenge

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2002年第3期24卷 193-216页

作者： Moore, JS Porter, G Univ Texas Dept Comp Sci Austin TX 78712 USA

We describe a mechanically checked proof of a property of a small system of Java programs involving an unbounded number of threads and synchronization, via monitors. We adopt the output of the javac compiler as the semantics and verify the system at the bytecode level under an operational semantics for the JVM. We assume a sequentially consistent memory model and atomicity at the bytecode level. Our operational semantics is expressed in ACL2, a Lisp-based logic of recursive functions. Our proofs are checked with the ACL2 theorem prover. The proof involves reasoning about arithmetic;infinite loops;the creation and modification of instance objects in the heap, including threads;the inheritance of fields from superclasses;pointer chasing and smashing;the invocation of instance methods (and the concomitant dynamic method resolution);use of the start method on thread objects;the use of monitors to attain synchronization between threads;and consideration of all possible interleavings (at the bytecode level) over an unbounded number of threads. Readers familiar with monitor-based proofs of mutual exclusion will recognize our proof as fairly classical. The novelty here comes from (i) the complexity of the individual operations on the abstract machine;(ii) the dependencies between Java threads, heap objects, and synchronization;(iii) the bytecode-level interleaving;(iv) the unbounded number of threads;(v) the presence in the heap of incompletely initialized threads and other objects;and (vi) the proof engineering permitting automatic mechanical verification of code-level theorems. We discuss these issues. The problem posed here is also put forth as a benchmark against which to measure other approaches to formally proving properties of multithreaded Java programs.

关键词： languages verification Java Java Virtual Machine parallel and distributed computation mutual exclusion operational semantics theorem proving

来源：评论

学校读者我要写书评

暂无评论

A distributed minimum variance estimator for sensor networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2008年第4期26卷 609-621页

作者： Speranzon, A. Fischione, C. Johansson, K. H. Sangiovanni-Vincentelli, A. Unilever R&D Port Sunlight Wirral CH63 3JW Merseyside England Univ Calif Berkeley Berkeley CA 94720 USA Royal Inst Technol Sch Elect Engn S-10044 Stockholm Sweden

A distributed estimation algorithm for sensor networks is proposed. A noisy time-varying signal is jointly tracked by a network of sensor nodes, in which each node computes its estimate as a weighted sum of its own and its neighbors' measurements and estimates. The weights are adaptively updated to minimize the variance of the estimation error. Both estimation and the parameter optimization is distributed;no central coordination of the nodes is required. An upper bound of the error variance in each node is derived. This bound decreases with the number of neighboring nodes. The estimation properties of the algorithm are illustrated via computer simulations, which are intended to compare our estimator performance with distributed schemes that were proposed previously in the literature. The results of the paper allow to trading-off communication constraints, computing efforts and estimation quality for a class of distributed filtering problems.

关键词： distributed estimation sensor networks convex optimization parallel and distributed computation in-network processing cooperative communication

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF COPPERSMITHS BLOCK WIEDEMANN ALGORITHM FOR THE parallel SOLUTION OF SPARSE LINEAR-SYSTEMS

引用

MATHEMATICS OF computation 1995年第210期64卷 777-806页

作者： KALTOFEN, E Department of Computer Science Rensselaer Polytechnic Institute

By using projections by a block of vectors in place of a single vector it is possible to parallelize the outer loop of iterative methods for solving sparse linear systems. We analyze such a scheme proposed by Coppersmith for Wiedemann's coordinate recurrence algorithm, which is based in part on the Krylov subspace approach. We prove that by use of certain randomizations on the input system the parallel speed up is roughly by the number of vectors in the blocks when using as many processors. Our analysis is valid for fields of entries that have sufficiently large cardinality. Our analysis also deals with an arising subproblem of solving a singular block Toeplitz system by use of the theory of Toeplitz-like matrices.

关键词： SPARSE LINEAR SYSTEMS parallel and distributed computation RANDOMIZED ALGORITHMS FINITE FIELDS EXACT ARITHMETIC BLOCK TOEPLITZ MATRICES KRYLOV SUBSPACES

来源：评论

学校读者我要写书评

暂无评论

THE TOKEN DISTRIBUTION PROBLEM

引用

SIAM JOURNAL ON COMPUTING 1989年第2期18卷 229-243页

作者： PELEG, D UPFAL, E IBM ALMADEN RES CTRDEPT COMP SCI K53SAN JOSECA 95120

A solution to the following fundamental communication problem is presented. Suppose that n tokens are arbitrarily distributed among n processors with no processor having more than K tokens. The problem is to specify a... 详细信息

关键词： 68Q25 68R10 68M10 parallel and distributed computation communication expander graphs

来源：评论

学校读者我要写书评

暂无评论

On the design of efficient ATM routing schemes

引用

THEORETICAL COMPUTER SCIENCE 2002年第1-2期270卷 341-359页

作者： Becchetti, L Bertolazzi, P Gaibisso, C Gambosi, G CNR Ist Analisi Sistemi & Informat I-00185 Rome Italy Univ Roma Tor Vergata Dipartimento Matemat I-00133 Rome Italy

In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first prove a lower bound for networks with arbitrary topology and arbitrary set of connection requests. This result is then applied to derive lower bounds for the following settings: (i) one-to-all (one node has to be connected to all other nodes of the network) in arbitrary networks;(ii) all-to-all (each node has to be connected to all other nodes in the network) in several classes of networks, including planar and k-separable networks and networks of bounded genus. We finally study the all-to-all setting on two-dimensional meshes and we design a virtual path layout for this problem. When the hop-count and the network degree are bounded by constants, our results show that the upper bounds proposed in this paper for the one-to-all problem in arbitrary networks and for the all-to-all problem in two-dimensional mesh networks are asymptotically optimal. Moreover, the general lower bound shows that the algorithm proposed in Gerstel (Ph.D. Thesis, Technion-Haifa, Israel, 1995) for the all-to-all problem in k-separable networks is also asymptotically optimal. The upper bound for mesh networks also shows that the lower bound presented in this paper for the all-to-all problem in planar networks is asymptotically tight. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： ATM networks parallel and distributed computation virtual path layout

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：