The Sixth Distributed Memory Computing Conference, 1991. Proceedings最新文献

Scalable Performance Environments for Parallel Systems 并行系统的可扩展性能环境

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-10-18 DOI: 10.1109/DMCC.1991.633315

Daniel A. Reed, R. D. Olson, R. Aydt, Tara M. Madhyastha, T. Birkett, David W. Jensen, B. Nazief, B. K. Totty

{"title":"Scalable Performance Environments for Parallel Systems","authors":"Daniel A. Reed, R. D. Olson, R. Aydt, Tara M. Madhyastha, T. Birkett, David W. Jensen, B. Nazief, B. K. Totty","doi":"10.1109/DMCC.1991.633315","DOIUrl":"https://doi.org/10.1109/DMCC.1991.633315","url":null,"abstract":"As parallel systems expand in size and complexity, the absence of performance tools for these parallel systems exacerbates the already difficult problems of application program and system software performance tuning. Moreover, given the pace of technological change, we can no longer afford to develop ad hoc, one-of-a-kind performance instrumentation software; we need scalable, portable performance analysis tools. We describe an environment prototype based on the lessons learned from two previous generations of performance data analysis software. Our environment prototype contains a set of performance data transformation modules that can be interconnected in user-specified ways. It is the responsibility of the environment infrastructure to hide details of module interconnection and data sharing. The environment is written in C++ with the graphical displays based on X windows and the Motif toolkit. It allows users to interconnect and configure modules graphically to form an acyclic, directed data analysis graph. Performance trace data are represented in a self-documenting stream format that includes internal definitions of data types, sizes, and names. The environment prototype supports the use of head-mounted displays and sonic data presentation in addition to the traditional use of visual techniques.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122370339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 111

Design and Evaluation of Communication Processors supporting Message Passing in Distributed Memory Systems 分布式存储系统中支持消息传递的通信处理器的设计与评价

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633352

H. Corporaal, J. Olk

引用次数: 3

Temporal Communication Graphs: A New Graph Theoretic Model Mapping and Scheduling in Distributed Memory Systems 时间通信图:一种新的图论模型在分布式存储系统中的映射和调度

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633137

V. Lo

引用次数: 5

Apply: A Parallel Compiler on iWarp for Image-Processing Applications 应用:一个并行编译器上的iWarp图像处理应用程序

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633119

B. Baxter, B. Greer

引用次数: 5

Using Spanning-Trees for Balancing Dynamic Load on Multiprocessors 用生成树来平衡多处理器的动态负载

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633134

R. Melhem, K. Pruhs, T. Znati

引用次数: 3

Executing Synchronous Data Flow Graphs on Multicomputers 在多台计算机上执行同步数据流程图

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633128

Zhiwei Xu

引用次数: 1

Reduction operations on a distributed memory machine with a reconfigurable interconnection network 具有可重构互连网络的分布式存储器机器上的约简操作

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633354

S. Miguet, Yves Robert

引用次数: 4

A Real-Time Parallel Algorithm Animation System 一个实时并行算法动画系统

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633314

E. Williams, G.B. Lament

{"title":"A Real-Time Parallel Algorithm Animation System","authors":"E. Williams, G.B. Lament","doi":"10.1109/DMCC.1991.633314","DOIUrl":"https://doi.org/10.1109/DMCC.1991.633314","url":null,"abstract":"Algorithm animation is a visualization method used to enhance understanding of the functioning of an algorithm or program. Visualization is used for many purposes, including education, algorithm research, performance analysis, and program debugging. This research applies algorithm animation techniques to programs developed for parallel architectures, with specific emphasis on the Intel iPSC/2 hypercube. Current, investigations focus in two different areas: performance data display and animations of specific algorithms or classes of algorithms. This research builds on these efforts to provide a system that is able to both display performance data from parallel programs and support the creation of animations for specific algorithms. There are three goals for this visualization system. Data should be displayed as it is generated. The inteiface to the target program should be transparent, allowing the animation of existing programs. The system must be flexible enough to animate any algorithm. The resulting system incorporates, integrates and extends two systems: the AFIT Algorithm Animation Research Facility (AAARF) and the Parallel Resource Analysis Software Environment (PRASE). Since performance data is an essential part of analyzing any parallel program, multiple views of the performance data are provided as an elementary part of the system. In addition to the animation system, a method for developing the animations is discussed. This method is arpplicable to animating any type of program, sequential or parallel. Whilc: both P-time and NP-ttme algorithms can potentially benefit from using visualization techniques, the set of NP .complete problems provides fertile ground for developing parallel atpplications. The methods discussed in this paper were used to animate a parallel implementation of a general Set Covering Problem (SCP).","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131952211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Structured Decompositions for Solving Sparse Nonlinear Systems of Equations on Parallel Computers 并行计算机上求解稀疏非线性方程组的结构化分解

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633304

Xiaodong Zhang

引用次数: 0

Effective Storage and Communication Schemes for Implementation of the Conjugate Gradient Method on an Intel iPSC/860 在Intel iPSC/860上实现共轭梯度法的有效存储和通信方案

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI: 10.1109/DMCC.1991.633309

D. Anderson, L. Sattler

引用次数: 0