一种高效的分布式存储并行计算机并行光线跟踪方案

W. Lefer
{"title":"一种高效的分布式存储并行计算机并行光线跟踪方案","authors":"W. Lefer","doi":"10.1145/166181.166193","DOIUrl":null,"url":null,"abstract":"The ray-tracing algorithm produces high quality images by taking multiple luminous effects into account. Hence, it requires many computations and a large memory capacity. The use of parallel machines is a solution in order to reduce significantly the synthesis time. Distributed Memory Parallel Computers offer an interesting performance/cost ratio but need to distribute computations and data. This paper is a study of the implementation of the ray-tracing algorithm on a Distributed Memory Parallel Computer. An original solution, based on the association of a data parallelism approach with a task parallelism one, is presented. A dynamic load redistribution mechanism allows us to ensure a good load balance during the synthesis phase. At the end of the paper, some results of our transputer implementation are presented.","PeriodicalId":394370,"journal":{"name":"Proceedings of 1993 IEEE Parallel Rendering Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"An efficient parallel ray tracing scheme for distributed memory parallel computers\",\"authors\":\"W. Lefer\",\"doi\":\"10.1145/166181.166193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ray-tracing algorithm produces high quality images by taking multiple luminous effects into account. Hence, it requires many computations and a large memory capacity. The use of parallel machines is a solution in order to reduce significantly the synthesis time. Distributed Memory Parallel Computers offer an interesting performance/cost ratio but need to distribute computations and data. This paper is a study of the implementation of the ray-tracing algorithm on a Distributed Memory Parallel Computer. An original solution, based on the association of a data parallelism approach with a task parallelism one, is presented. A dynamic load redistribution mechanism allows us to ensure a good load balance during the synthesis phase. At the end of the paper, some results of our transputer implementation are presented.\",\"PeriodicalId\":394370,\"journal\":{\"name\":\"Proceedings of 1993 IEEE Parallel Rendering Symposium\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE Parallel Rendering Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/166181.166193\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1993 IEEE Parallel Rendering Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/166181.166193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

光线追踪算法通过考虑多种发光效应产生高质量的图像。因此,它需要大量的计算和大的内存容量。为了显著减少合成时间,使用并联机器是一种解决方案。分布式内存并行计算机提供了一个有趣的性能/成本比,但需要分配计算和数据。本文研究了光线跟踪算法在分布式存储并行计算机上的实现。提出了一种基于数据并行化与任务并行化相结合的原始解决方案。动态负载重新分配机制使我们能够在合成阶段确保良好的负载平衡。最后给出了本系统的一些实现结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An efficient parallel ray tracing scheme for distributed memory parallel computers
The ray-tracing algorithm produces high quality images by taking multiple luminous effects into account. Hence, it requires many computations and a large memory capacity. The use of parallel machines is a solution in order to reduce significantly the synthesis time. Distributed Memory Parallel Computers offer an interesting performance/cost ratio but need to distribute computations and data. This paper is a study of the implementation of the ray-tracing algorithm on a Distributed Memory Parallel Computer. An original solution, based on the association of a data parallelism approach with a task parallelism one, is presented. A dynamic load redistribution mechanism allows us to ensure a good load balance during the synthesis phase. At the end of the paper, some results of our transputer implementation are presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A multicomputer polygon rendering algorithm for interactive applications An efficient parallel ray tracing scheme for distributed memory parallel computers Parallel volume-rendering algorithm performance on mesh-connected multicomputers Pixel merging for object-parallel rendering: A distributed snooping algorithm A task adaptive parallel graphics renderer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1