Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing最新文献_第6页

Speculative parallel graph reduction of lambda calculus to deferred substitution form 推测并行图将λ演算简化为递延代换形式

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651496

Yong-Hack Lee, Suh-Hyun Cheon

引用次数: 0

Distributed parallel generation of indices for very large text databases 大型文本数据库索引的分布式并行生成

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651539

João Paulo W. Kitajima, M. D. Resende, B. Ribeiro-Neto, N. Ziviani

引用次数: 8

Generating communication sets efficiently on data-parallel programs 在数据并行程序上有效地生成通信集

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651505

Tsung-Chuan Huang, L. Shiu, Cherng-Haw Yu

{"title":"Generating communication sets efficiently on data-parallel programs","authors":"Tsung-Chuan Huang, L. Shiu, Cherng-Haw Yu","doi":"10.1109/ICAPP.1997.651505","DOIUrl":"https://doi.org/10.1109/ICAPP.1997.651505","url":null,"abstract":"Generating local memory access sequences and communication sets efficiently is an important issue while compiling a data-parallel language into a SPMD (Single Program Multiple Data) code. Recently, several approaches have been presented; they are based on the case in which array references are distributed across arbitrary number of processors with arbitrary block sizes using block-cyclic distribution. Typically, in order to generate explicit communication sets, each node program has to scan over the local memory access sequences. In this paper, we focus on two cases. First, array references are aligned to a common template and this template is distributed across processors using block-cyclic distribution. Second, array references are distributed across the same number of processors with same block size. The first case is further classified into one-level and two-level mappings. We construct a block state graph to generate communication sets by scanning only a portion of local memory access sequence. In one-level mappings and the second case, we only need to scan the active elements among the first s local active blocks; while in two-level mappings, only need to scan the active elements among the first /spl alpha/*s local active blocks, where s is the stride of regular section and a is the stride of alignment function. As a result, the efficiency can be greatly improved.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134639136","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

High performance computing on networks of workstations through the exploitation of function parallelism 利用函数并行性在工作站网络上进行高性能计算

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651514

Yung-Lin Liu, Hau-Yang Cheng, C. King

{"title":"High performance computing on networks of workstations through the exploitation of function parallelism","authors":"Yung-Lin Liu, Hau-Yang Cheng, C. King","doi":"10.1109/ICAPP.1997.651514","DOIUrl":"https://doi.org/10.1109/ICAPP.1997.651514","url":null,"abstract":"Parallel programs are often written in the SPMD (single-program-multiple-data) form for exploiting data parallelism in the applications. In this paper, we show that even in SPMD programs further parallelism can be extracted by considering the function parallelism in the programs. Exploiting function parallelism is especially important for parallel systems using the NOW (network of workstations) approach. This is because the high communication overhead in such systems can be hidden with explicit control over the function parallelism. In this paper we describe a general methodology for exploiting function parallelism in SPMD programs and discuss the considerations involved in realizing such parallelism with the multithreading facility supported by most workstations today. The resultant multithreaded parallel program is still coded in the SPMD form. We demonstrate the application of this technique to a PDE solver, which solves a system of linear equations using Jacobi relaxation. Experiments on an 8-node NOW confirm that the performance of an SPMD program can be improved further by exploiting its function parallelism.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123705138","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

Determination of an optimal processor allocation in the design of massively parallel processor arrays 大规模并行处理器阵列设计中处理器最优配置的确定

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651500

D. Fimmel, R. Merker

引用次数: 2

Lazy decomposition: a novel technique to control parallel task granularity 延迟分解:一种控制并行任务粒度的新技术

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651511

Suntae Hwang, H. Cha

引用次数: 0

A new heuristic algorithm based on GAs for multiprocessor scheduling with task duplication 一种基于GAs的任务重复多处理机调度新算法

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651499

T. Tsuchiya, T. Osada, T. Kikuno

引用次数: 24

A systolic architecture for sorting an arbitrary number of elements 对任意数量的元素进行排序的一种收缩结构

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651484

S. Zheng, S. Olariu, M. C. Pinotti

引用次数: 1

A simulator construction methodology for the Shiva multiprocessor system Shiva多处理器系统的模拟器构建方法

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651490

S. Slomka, K. Sterzl, V. Lakshmi Narasimhan

引用次数: 0

Network enabled solvers for scientific computing using the NetSolve system 使用NetSolve系统进行科学计算的网络求解器

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI: 10.1109/ICAPP.1997.651477

H. Casanova, J. Dongarra

{"title":"Network enabled solvers for scientific computing using the NetSolve system","authors":"H. Casanova, J. Dongarra","doi":"10.1109/ICAPP.1997.651477","DOIUrl":"https://doi.org/10.1109/ICAPP.1997.651477","url":null,"abstract":"Agent-based computing is increasingly regarded as an elegant and efficient way of providing access to computational resources. Several metacomputing research projects are using intelligent agents to manage a resource space and to map user computation to these resources in an optimal fashion. Such a project is NetSolve, developed at the University of Tennessee and Oak Ridge National Laboratory. NetSolve provides the user with a variety of interfaces that afford direct access to preinstalled, freely available numerical libraries. These libraries are embedded in computational servers. New numerical functionalities can be integrated easily into the servers by a specific framework. The NetSolve agent manages the coherency of the computational servers. It also uses predictions about the network and processor performances to assign user requests to the most suitable servers. This article reviews some of the basic concepts in agent-based design, discusses the NetSolve project and how its agent enhances flexibility and performance, and provides examples of other research efforts. Also discussed are future directions in agent-based computing in general and in NetSolve in particular.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708540","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