发布求助
文献互助 智能选刊 最新文献

Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis最新文献

筛选
英文 中文
Promising data parallel environment-ADEPS, ADETRAN and ADENA 前景看好的数据并行环境——adeps、ADETRAN和ADENA
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401356
T. Nogi
{"title":"Promising data parallel environment-ADEPS, ADETRAN and ADENA","authors":"T. Nogi","doi":"10.1109/AISPAS.1995.401356","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401356","url":null,"abstract":"This paper compares some parallel computation schemes from view of simple usage, and proposes ADEPS as the most highly recommended. As shown, it produces simple programming language ADETRAN and also sophisticated machine architecture, called ADENA. Some established models of ADENAs are introduced as well as a new hopeful one as the next generation of supercomputers, called TFLOPS machines.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116197774","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}
引用次数: 1
GRAPE project for a dedicated tera-flops computer 用于专用的万亿次计算机的GRAPE项目
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401357
D. Sugimoto, J. Makino, M. Taiji, T. Ebisuzaki
{"title":"GRAPE project for a dedicated tera-flops computer","authors":"D. Sugimoto, J. Makino, M. Taiji, T. Ebisuzaki","doi":"10.1109/AISPAS.1995.401357","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401357","url":null,"abstract":"We are constructing a one tera-flops machine dedicated to astronomical many-body problems. It consists of parallelized GRAPE machines connected to a host workstation. The GRAPE machines only calculate forces between particles in the system by pipeline architecture. We designed and fabricated LSI chips for it, and about 2000 chips are being connected in parallel. The machine will be in operation by summer of 1995. General concept and features of the machine, mode of parallelization, and their merits are discussed in addition to scientific objectives of the project.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129384376","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}
引用次数: 1
Concurrent rollback for crash recovery in extended hypercube networks 扩展超立方体网络中用于崩溃恢复的并发回滚
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401336
T. Juang, C. Chiu, Kun-Ming Yu
{"title":"Concurrent rollback for crash recovery in extended hypercube networks","authors":"T. Juang, C. Chiu, Kun-Ming Yu","doi":"10.1109/AISPAS.1995.401336","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401336","url":null,"abstract":"Recovering from processor failures is an important problem in the design and development of reliable systems. We present a concurrent rollback algorithm in extended hypercube networks to recover from crash failures which involves small message and time complexities. The network of an extended hypercube is a hierarchical, low diameter, recursive structure. By appending only O(1) additional information to each message, we use less than O(Nlog N) message exchanges and O(log/sup 2/ N) time elapsed for recovery work where N is the number of processors of the extended hypercube network. The algorithms can be used to recover from the failure of an arbitrary number of processors.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"537 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125200896","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}
引用次数: 0
Implementing higher-order Gamma on MasPar: a case study 在MasPar上实现高阶Gamma:一个案例研究
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401325
K. Ng, Lin Huang, Yongqiang Sun
{"title":"Implementing higher-order Gamma on MasPar: a case study","authors":"K. Ng, Lin Huang, Yongqiang Sun","doi":"10.1109/AISPAS.1995.401325","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401325","url":null,"abstract":"Gamma is a kernel programming language with an elegant chemical reaction metaphor in which programs are described in terms of multiset rewriting. The Gamma formalism allows one to describe an algorithm without introducing artificial sequentiality and leads to the derivation of a parallel solution to a given problem naturally. However, the difficulty of incorporating control strategies makes Gamma not only hard for one to define any sophisticated approaches but also impossible to reach a decent level of efficiency in any direct implementation. Recently, a higher-order multiset programming paradigm, named higher-order Gamma, is introduced by Metayer to alleviate these problems. In this paper, we investigate the possibility of implementing higher-order Gamma on MasPar, a massively data parallel computer. The results show that a program written in higher-order Gamma can be transformed naturally towards an efficient implementation on a real parallel machine.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127488533","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}
引用次数: 4
Functionality in ASSY system and language of functional programming ASSY系统的功能和函数式编程语言
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401350
V. Malyshkin
{"title":"Functionality in ASSY system and language of functional programming","authors":"V. Malyshkin","doi":"10.1109/AISPAS.1995.401350","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401350","url":null,"abstract":"The main features of an integrated system to support the technology of application problem parallelization, development (assembly) of parallel programs, and tuning to available resources of specific multiprocessor system in the course of their execution are presented. Also the notion of functionality is discussed. Contrary to partitioning, the assembly approach supports synthesis (in a broad sense) of the whole problem solution on the basis of elementary ready made fragments. It enable us to use the unified technology for the solution of wide range application problems (in seismic data and image processing, nuclear physics, modeling of natural phenomena etc.) in the framework of the same parallel programming system. This approach is a generalization of our experience in solution of big-size problems.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121327229","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}
引用次数: 4
A framework for visual parallel programming 一个用于可视化并行编程的框架
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401326
Wentong Cai, Tee Lian Pian, S. Turner
{"title":"A framework for visual parallel programming","authors":"Wentong Cai, Tee Lian Pian, S. Turner","doi":"10.1109/AISPAS.1995.401326","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401326","url":null,"abstract":"One of the difficulties of parallel programming is the gap between the desire of programmers to describe computations with manageable abstractions and the detailed description of parallelism, communication and synchronization required by most parallel programming languages. Since in a parallel program, activities are distributed across both space and time, pictures are much more meaningful than text in program construction. This paper describes a new framework for visual parallel programming based on the concurrency map. Four levels of abstraction are provided in order to reduce the complexity of the construction and to allow fast exploration of different design alternatives. Moreover, the same diagrams that are constructed during the development of a program may also be used to display feedback from its execution. The flexibility of the framework is demonstrated by the implementation of a visual constructor for the occam programming language.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114563890","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}
引用次数: 14
Task scheduling with locality consideration for a clustered parallel FL reduction system 考虑局部性的集群并行FL约简系统任务调度
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401334
H. Shen, H. Kitajima, H. Kobayashi, T. Nakamura
{"title":"Task scheduling with locality consideration for a clustered parallel FL reduction system","authors":"H. Shen, H. Kitajima, H. Kobayashi, T. Nakamura","doi":"10.1109/AISPAS.1995.401334","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401334","url":null,"abstract":"Multiprocessor systems provide us with high performance surpassing sequential computers. When constructing a multiprocessor system, task scheduling is one of the crucial issues affecting the system performance. The paper studies task scheduling for a clustered parallel reduction system of the functional language FL. We construct a shared memory multiprocessor system to realize parallel graph reduction of FL programs. The processing elements PEs in the system are divided into several clusters, in each of which PEs are coupled through a local cache. Redexes with independent data are scheduled to different PEs, and are reduced simultaneously. In this system, the most critical problem is that too many memory accesses may restrict the scalability of the system performance. In order to solve this problem, we take the locality of references into account to keep the contents of a cluster cache available in successive redex evaluation steps. We also pay sufficient attention to the utilization of the PEs while handling the locality of references. As a result, both fewer memory accesses and lower PE idle ratios can be expected. We carry out software simulation to evaluate the system performance under the proposed task scheduling strategy. The simulation results are examined to illustrate the effectiveness of the proposed strategy.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122812270","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}
引用次数: 0
Methods and tools for the efficient use of parallel computer architectures 有效使用并行计算机体系结构的方法和工具
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401353
A. Bode
{"title":"Methods and tools for the efficient use of parallel computer architectures","authors":"A. Bode","doi":"10.1109/AISPAS.1995.401353","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401353","url":null,"abstract":"This article covers research at Technische Universitat Munchen on distributed and parallel architectures and applications. First, an overview on the parallel processing research organization is given. The second main topic covers an integrated hierarchical programming environment TOPSYS for parallel and distributed systems developed as part of the research grant.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124283280","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}
引用次数: 3
Efficient scalable mesh algorithms for merging, sorting and selection 用于合并、排序和选择的高效可扩展网格算法
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401328
S. Ramnath
{"title":"Efficient scalable mesh algorithms for merging, sorting and selection","authors":"S. Ramnath","doi":"10.1109/AISPAS.1995.401328","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401328","url":null,"abstract":"Efficient scalable algorithms are developed for a mesh with fixed buses. The problems considered are merging, sorting and selection. The size of the input is fixed at n, and the mesh size is varied from /spl radic/n/spl times//spl radic/n to n/spl times/n. The merging algorithm is optimal for all the mesh sizes, whereas the sorting and selection algorithms are within factors of i/(1-/spl epsiv/) and log/sup 4/3/ n respectively, of the optimal.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130538109","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}
引用次数: 0
Garbage collection in message passing distributed systems 消息传递分布式系统中的垃圾收集
Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis Pub Date : 1995-03-15 DOI: 10.1109/AISPAS.1995.401335
M. V. Sreenivas, S. Bhalla
{"title":"Garbage collection in message passing distributed systems","authors":"M. V. Sreenivas, S. Bhalla","doi":"10.1109/AISPAS.1995.401335","DOIUrl":"https://doi.org/10.1109/AISPAS.1995.401335","url":null,"abstract":"Distributed systems use optimistic message logging for recovery from transient process failures. Such a recovery is facilitated by asynchronous message logging and check-pointing. It is also supported by garbage collection which requires identifying messages in stable storage that are no longer needed for the process of recovery. For this purpose, it is necessary to keep track of message dependencies between process states. A model to keep track of state dependencies using dependency graphs has been proposed.<<ETX>>","PeriodicalId":321580,"journal":{"name":"Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122407685","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}
引用次数: 7
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信