Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing最新文献_第3页

Periodically regular chordal rings: generality, scalability, and VLSI layout 周期性正则弦环:通用性、可扩展性和VLSI布局

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570327

D. Kwai, B. Parhami

引用次数: 6

Integrating task and data parallelism in an irregular application: a case study 在不规则应用程序中集成任务和数据并行性:一个案例研究

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570335

Ky MacPherson, P. Banerjee

引用次数: 9

Recovering scalable spin locks 恢复可伸缩自旋锁

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570349

P. Bohannon, D. Lieuwen, A. Silberschatz

引用次数: 11

The active-ray approach to rendering on distributed memory multiprocessors 在分布式内存多处理器上进行渲染的主动射线方法

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570363

A. Law, R. Yagel

{"title":"The active-ray approach to rendering on distributed memory multiprocessors","authors":"A. Law, R. Yagel","doi":"10.1109/SPDP.1996.570363","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570363","url":null,"abstract":"Object dataflow is a popular approach used in parallel rendering. The data representing the 3D scene is statically distributed among processors and objects are fetched and cached only on demand. Most previous object dataflow methods were implemented on shared memory architectures and exploited spatial coherency to reduce hardware cache misses. We propose an efficient model for object dataflow parallel volume rendering on message passing machines. The active ray tracing algorithm is introduced and its ray storage mechanism is used to support latency hiding by postponing computation on inactive rays. Memory usage is optimized by letting objects migrate and replicate at different processors rather than the common static assignments. Our cache-only-memory approach uses a distributed-directory scheme to trace the location of objects at other nodes. A mechanism to minimize network congestion was implemented which optimizes channel utilization. Unlike previous methods, our approach can benefit from temporal coherence and effectively minimizes communication costs in successive frames. We implemented a volume ray casting instance of the algorithm on the Cray T3D and achieved higher efficiency and scalability than existing algorithms. We achieve interactive frame rates of approximately 20 Hz for 128/sup 3/ volume, and 4 Hz for 256/sup 3/ volume on 128 processors.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"1027 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116461261","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

Index-shuffle graphs Index-shuffle图

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570329

M. Baumslag, B. Obrenic

引用次数: 3

Optimistic parallel computation: an example from computational chemistry 乐观并行计算:计算化学中的一个例子

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570336

Emily Angerer Crawford, K. Schwan, S. Yalamanchili

引用次数: 0

A framework for automatic dynamic data mapping 一个用于自动动态数据映射的框架

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570321

Jordi Garcia, E. Ayguadé, Jesús Labarta

{"title":"A framework for automatic dynamic data mapping","authors":"Jordi Garcia, E. Ayguadé, Jesús Labarta","doi":"10.1109/SPDP.1996.570321","DOIUrl":"https://doi.org/10.1109/SPDP.1996.570321","url":null,"abstract":"Physically-distributed memory multiprocessors are becoming popular and data distribution and loop parallelization are aspects that a parallelizing compiler has to consider in order to get efficiency from the system. The cost of accessing local and remote data can be one or several orders of magnitude different, and this can dramatically affect the performance of the system. It would be desirable to free the programmer from considerations of the low-level details of the target architecture, to program explicit processes or specify interprocess communication. We present an approach to automatically derive static or dynamic data distribution strategies for the arrays used in a program. All the information required about data movement and parallelism is contained in a single data structure, called the Communication-Parallelism Graph (CPG). The problem is modeled and solved using a general purpose linear 0-1 integer programming solver. This allows us to find the optimal solution for the problem for one-dimensional array distributions. We also show the feasibility of using this approach in terms of compilation time and quality of the solutions generated.","PeriodicalId":360478,"journal":{"name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132093261","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}

引用次数: 11

Compile-time inter-query dependence analysis 编译时查询间依赖分析

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570377

S. Parthasarathy, Wei Li, Michal Cierniak, Mohammed J. Zaki

引用次数: 3

Mapping and parallel implementation of Bayesian belief networks 贝叶斯信念网络的映射与并行实现

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570391

N. Saxena, Sudeep Sarkar, N. Ranganathan

引用次数: 2

A loop allocation policy for DOACROSS loops DOACROSS循环的循环分配策略

Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing Pub Date : 1996-10-23 DOI: 10.1109/SPDP.1996.570340

Joford T. Lim, A. Hurson, K. Kavi, Ben Lee

引用次数: 8