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

International symposium on parallel processing

作者： E. Kraemer J.T. Stasko Graphics Visualization and Usability Center College of Computing Georgia Institute of Technology Atlanta GA USA

As parallel and distributed computers become more widely available and used, the already important process of understanding and debugging concurrent programs will rake on even greater importance. We believe that visualization can help in the process. We discuss heretofore unaddressed issues in the visualization of concurrent programs, and present the Animation Choreographer. the Animation Choreographer allows users to view, manipulate, and explore the set of alternate feasible orderings of the program execution under study, both through the Choreographer interface and in the context of the selected visualizations, thus providing the user with a variety of temporal perspectives on the computation.< >

关键词： Animation Visualization Concurrent computing distributed computing Debugging Computer interfaces Displays Computer graphics Usability Educational institutions

来源：评论

学校读者我要写书评

暂无评论

distributed identification of all maximal incomplete subcubes in a faulty hypercube

Distributed identification of all maximal incomplete subcube...

引用

International symposium on parallel processing

作者： Hsing-Lung Chen Nian-Feng Tzeng Department of Electronic Engineering National Taiwan Institute of Technology Taipei Taiwan Center for Advanced Computer Studies University of Southwestern Louisiana Lafayette LA USA

ISBN: (纸本)0818656026

Reconfiguring a faulty hypercube into a maximal incomplete cube tends to lower potential performance degradation, because a hypercube so reconfigured often results in a much larger system than what is attained by any conventional reconfiguration scheme which identifies only complete subcubes. this paper proposes an efficient strategy for identifying all the maximal incomplete subcubes present in a faulty hypercube. the proposed strategy is distributed in that every healthy node executes the same identification algorithm independently at the same time.< >

关键词： Fault diagnosis Hypercubes Degradation Contracts Performance loss Councils

来源：评论

学校读者我要写书评

暂无评论

the design of scalable software libraries for distributed memory concurrent computers

The design of scalable software libraries for distributed me...

引用

International symposium on parallel processing

作者： Jaeyoung Choi J.J. Dongarra D.W. Walker Mathematical Sciences Section Oak Ridge National Laboratory Oak Ridge TN USA Department of Computer Science University of Tennessee Knoxville TN USA

Describes the design of ScaLAPACK, a scalable software library for performing dense and banded linear algebra computations on distributed memory concurrent computers. the specification of the data distribution has important consequences for interprocessor communication and load balance, and hence is a major factor in determining performance and scalability of the library routines. the block cyclic data distribution is adopted as a simple, yet general purpose, way of decomposing block-partitioned matrices. distributed memory versions of the Level 3 BLAS provide an easy and convenient way of implementing the ScaLAPACK routines.< >

关键词： Software design Software libraries Concurrent computing distributed computing Scalability Linear algebra Large-scale systems High performance computing Lifting equipment Laboratories

来源：评论

学校读者我要写书评

暂无评论

distributed data association for multi-target tracking in sensor networks

Distributed data association for multi-target tracking in se...

引用

2005 8th International Conference on Information Fusion, FUSION

作者： Chen, Lei Çetin, Müjdat Willsky, Alan S. Stochastic Systems Group Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA 02139 United States

ISBN: (纸本)0780392868

Associating sensor measurements with target tracks is a fundamental and challenging problem in multi-target tracking. the problem is even more challenging in the context of sensor networks, since association is coupled across the network, yet centralized data processing is in general infeasible due to power and bandwidth limitations. Hence efficient, distributed solutions are needed. We propose techniques based on graphical models to efficiently solve such data association problems in sensor networks. Our approach takes advantage of the sparsity inherent in the problem structure resulting from the fact that each target can be observed by only a small number of sensors and makes use of efficient message-passing algorithms for graphical models to infer the maximum a posteriori association configuration. We illustrate our approach for several typical scenarios in multi-target tracking. Our approach scales well with the number of sensor nodes in the network, and it is well-suited for distributed implementation. distributed inference is realized by a message-passing algorithm which requires iterative, parallel exchange of information among neighboring nodes on the graph. So as to address trade-offs between inference performance and communication costs, we also propose a communication-sensitive form of message-passing that is capable of achieving near-optimal performance using far less communication. We demonstrate the effectiveness of our approach with experiments on simulated data. © 2005 ieee.

关键词： Sensor data fusion

来源：评论

学校读者我要写书评

暂无评论

An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer

An optimal parallel matching algorithm for a convex bipartit...

引用

International symposium on parallel processing

作者： Myung-Ho Kim Chang-Sung Jeong Myung-Soo Kim Department of Computer Science Postech Pohang Gyeongbuk South Korea Department of Electronics Engineering Korea University Seoul South Korea

We address the problem of finding a maximum matching for a convex bipartite graph on a mesh-connected computer (MCC). We show that this can be done in optimal time on MCC by designing the efficient merge and division ... 详细信息

ISBN: (纸本)0818656026

关键词： Bipartite graph Concurrent computing parallel algorithms distributed computing Solid modeling Algorithm design and analysis Partitioning algorithms Computer science Sorting Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Latency hiding in message-passing architectures

Latency hiding in message-passing architectures

引用

International symposium on parallel processing

作者： U. Bruening W.K. Giloi W. Schroeder-Preikschat GMD Institute for Computer Architecture and Software Technology Berlin Germany

the paper demonstrates the advantages of having two processors in the node of a distributed memory architecture, one for computation and one for communication. the architecture of such a dual-processor node is discussed. To exploit fully the potential for parallel execution of computation threads and communication threads, a novel, compiler-optimized IPC mechanism allows for an unbuffered no-wait send and a prefetched receive without the danger of semantics violation. It is shown how an optimized parallel operating system can be constructed such that the application processor's involvement in communication is kept to a minimum while the utilization of both processors is maximized. the MANNA implementation results in an effective message start-up latency of only 1...4 microseconds. It is also shown how the dual-processor node is utilized to efficiently realize virtual shared memory.< >

关键词： Delay Computer architecture Operating systems Memory architecture Concurrent computing Yarn Message passing Software distributed computing parallel programming

来源：评论

学校读者我要写书评

暂无评论

Enhancement on the labeled component unfolding system for parallel implementations 8

Enhancement on the labeled component unfolding system for pa...

引用

8th Brazilian Conference on Intelligent Systems, BRACIS 2019

作者： Pellicer, Lucas Francisco Amaral Orosco Verri, Filipe Alves Neto Curtis, Vitor Venceslau São Paulo SP Brazil São José dos Campos SP Brazil

ISBN: (纸本)9781728142531

Machine learning algorithms are in the fastestgrowing fields of interest in recent years. In this work, a semisupervised learning algorithm based on complex networks is adapted to exploit distributed processing of vertices. this is an algorithm based on the propagation of particles generated by labeled vertices to other edges of this complex network. Particles are absorbed at the edges and provide a dominance relationship between the vertices of the network and how the classes make up the problem. However, this algorithm is formulated by some sums that are performed throughout the database, which decreases the speed-up in parallel implementation due to underutilization. Our work focuses on stipulating an estimator of these values of this sum that decreases the need of the reduction. We demonstrate the formulation of the estimator and we show that the modification increases the classification performance of the original algorithm while increasing the parallelization potential of the algorithm. © 2019 ieee.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Encapsulating networks and routing

Encapsulating networks and routing

引用

International symposium on parallel processing

作者： B. Zerrouk J.M. Blin A. Greiner Institut Blah Pascal-Laboramire MASI-CAO-VLSI Université Pierre et Marie Curie Paris France

Presents a new view of routing messages in interconnection networks based on the known compact interval labeling. the authors propose simple algorithms, encapsulating networks and routing, suitable for a large class of topologies. they define a floating rule that unifies the notions of virtual channels and multiple intervals labeling. the introduced approach is applied to some usual structures.< >

关键词： Routing Labeling Data structures Network topology Concurrent computing distributed computing Tree graphs

来源：评论

学校读者我要写书评

暂无评论

distributed wisdom: What's wrong with us?

引用

ieee distributed Systems Online 2006年第5期7卷 3-3页

作者： Shapiro, Marc INRIA Rocquencourt LIP6

the efforts of EuroSys, the professional society for European systems community, towards researching distributed systems, are discussed. As far as publishing about distributed systems is concerned European are way behind the US. the symposium on Operating Systems Design and Implementation, ACM Transactions on Computer Systems, and the ACM symposium on Operating Systems Principles rank 1st, 8th, and 11th on the CiteSeer impact list. the ACM sigops European workshop is 216th, the International Conference on distributed Computing Systems is 217th, the International symposium on Fault-Tolerant Computing is 270th, and the European Conference on Parrallel processing is 491st. Researchers are trying to change the system from within by creating the Euro Sys professional society, holding workshops, launching the EuroSys conference series, networking and exchanging information, and so on.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient barriers for distributed shared memory computers

Efficient barriers for distributed shared memory computers

引用

International symposium on parallel processing

作者： D. Grunwald S. Vajracharya Department of Computer Science University of Colorado Boulder CO USA

Barrier algorithms are central to the performance of numerous algorithms on scalable, high-performance architectures. Numerous barrier algorithms have been suggested and studied for non-uniform memory access (NUMA) architectures, but less work has been done for cache only memory access (COMA) or attraction memory architectures such as the KSR-1. We present two new barrier algorithms that offer the best performance we have recorded on the KSR-1 distributed cache multiprocessor. We discuss the trade-offs and the performance of seven algorithms on two architectures. the new barrier algorithms adapt well to a hierarchical caching memory model and take advantage of parallel communication offered by most multiprocessor interconnection networks. Performance results are shown for a 256-processor KSR-1 and a 20-processor Sequent Symmetry.< >

关键词： distributed computing Computer architecture Algorithm design and analysis Memory architecture Hardware distributed control Computer science Multiprocessor interconnection networks Communication networks Communication system control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：