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

1994 International Conference on Parallel Processing Vol. 3最新文献

筛选
英文 中文
A Resource Synchronization Protocol for Multiprocessor Real-Time Systems 多处理器实时系统的资源同步协议
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.44
Chia-Mei Chen, S. Tripathi, A. Blackmore
{"title":"A Resource Synchronization Protocol for Multiprocessor Real-Time Systems","authors":"Chia-Mei Chen, S. Tripathi, A. Blackmore","doi":"10.1109/ICPP.1994.44","DOIUrl":"https://doi.org/10.1109/ICPP.1994.44","url":null,"abstract":"We study resource synchronization in multiprocessor hard real-time systems. Specifically, we propose a multiprocessor resource control protocol which allows a job to simultaneously lock multiple global resources, removing a restriction from previous protocols. Allowing nested critical sections may permit a finer granularity of synchronization, increasing parallelism and throughput. All the protocols discussed belong to the class of priority inheritance protocols and rely in some fashion on priority ceilings for global semaphores. The extended protocol prevents deadlock and transitive blocking. We derive bounds for worse case blocking time, and describe sufficient conditions to guarantee that m sets of periodic tasks can be scheduled on an m multiprocessor system.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132664300","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
Constant Time Graph and Poset Algorithms on the Reconfigurable Multiple Bus Machine 可重构多总线机器上的常时间图和偏序集算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.78
J. Trahan, R. Vaidyanathan, C. Subbaraman
{"title":"Constant Time Graph and Poset Algorithms on the Reconfigurable Multiple Bus Machine","authors":"J. Trahan, R. Vaidyanathan, C. Subbaraman","doi":"10.1109/ICPP.1994.78","DOIUrl":"https://doi.org/10.1109/ICPP.1994.78","url":null,"abstract":"The Reconfigurable Multiple Bus Machine (RMBM) is a model of parallel computation based on reconfigurable buses. In this paper, vie present constant time RMBM algorithms for a collection of basic, graph problems that include, lowest common ancestors and Euler tour related problems (for trees) and shortest path and connectivity related problems (for general graphs). We also present results for some poset and lattice problems. All algorithms are at least as efficient or more efficient in terms of processors than corresponding PARBUS algorithms.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132756700","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
Speculative Computation: Overcoming Communication Delays 推测计算:克服通信延迟
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.183
V. Govindan, M. Franklin
{"title":"Speculative Computation: Overcoming Communication Delays","authors":"V. Govindan, M. Franklin","doi":"10.1109/ICPP.1994.183","DOIUrl":"https://doi.org/10.1109/ICPP.1994.183","url":null,"abstract":"Communication latencies and delays are a major source of performance degradation in parallel computing systems. It is important to \"mask\" these communication delays by overlapping them with useful computation in order to obtain good parallel performance. This article proposes speculative computation as a technique to mask communication latencies in synchronous iterative algorithms. Processors speculate the contents of messages that are not yet received and perform computation based on the speculated values. When the messages are received, they are compared with the speculated values and, if the error is unacceptable, the resulting computation is corrected or recomputed. If the error is small, the speculated value is accepted and the processor has masked the communication delay. The technique, applied to N-body simulations yielded a performance improvement of up to 34%.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114864323","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
MPI-F: An Efficient Implementation of MPI on IBM-SP1 MPI- f: IBM-SP1上MPI的有效实现
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.131
H. Franke, P. Hochschild, P. Pattnaik, M. Snir
{"title":"MPI-F: An Efficient Implementation of MPI on IBM-SP1","authors":"H. Franke, P. Hochschild, P. Pattnaik, M. Snir","doi":"10.1109/ICPP.1994.131","DOIUrl":"https://doi.org/10.1109/ICPP.1994.131","url":null,"abstract":"This article introduces MPI-F an efficient implementation of MPI on the IBM-SP1 distributed memory cluster. After discussing the novel and key concepts of MPI and how they relate to an implementation, the MPI-F system architecture is outlined in detail. Although many incorrectly assume that MPI will not be efficient due to its increased functionality, MPI-F performance demonstrates efficiency as good as the best message passing library currently available on the SP1.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128986738","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}
引用次数: 18
Efficient Parallel Computation of Projections for Animated Volume Visualization 动画体可视化中投影的高效并行计算
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.102
Tuang-Kuang Wu, M. Brady
{"title":"Efficient Parallel Computation of Projections for Animated Volume Visualization","authors":"Tuang-Kuang Wu, M. Brady","doi":"10.1109/ICPP.1994.102","DOIUrl":"https://doi.org/10.1109/ICPP.1994.102","url":null,"abstract":"In this paper, we parallelize a new efficient approximate projection algorithm for volume rendering. The algorithm is unique in that it computes N different views simultaneously, much faster than these projections could be computed independently. It is thus ideal for computing animated sequences of views. We implement and evaluate the algorithm on a MasPar MP-1. We render a 128x128x128 data set at up to 21 frames per second average on a 1K PE MasPar MP-1 using gray scale volumetric compositing (simpler transformations are computed even faster).","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125532561","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
Scheduling Strategies for Sparse Cholesky Factorization on a Shared Virtual Memory Parallel Computer 共享虚拟内存并行计算机稀疏Cholesky分解调度策略
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.177
M. Hahad, J. Erhel, T. Priol
{"title":"Scheduling Strategies for Sparse Cholesky Factorization on a Shared Virtual Memory Parallel Computer","authors":"M. Hahad, J. Erhel, T. Priol","doi":"10.1109/ICPP.1994.177","DOIUrl":"https://doi.org/10.1109/ICPP.1994.177","url":null,"abstract":"To solve a given problem on a distributed memory parallel computer (DMPC), the message passing programming model involves distributing both the data and the computations among the processors. While this can be easily feasible for well structured problems, it can become fairly hard for unstructured ones, like sparse matrix computations, unless you use some runtime support. In this paper, we consider a relatively new approach to implementing the Cholesky factorization on a DMPC, by using a shared virtual memory (SVM). The abstraction of a shared memory on top of a distributed memory allows us to introduce a large-grain factorization algorithm, synchronized with events. Experiments conducted so far show that some scheduling techniques enhance not only the parallelism but the SVM behavior as well, allowing interesting results.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125974299","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
Evaluation of a Local Adaptive Protocol for Distributed Discrete Event Simulation 分布式离散事件仿真的局部自适应协议评价
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.106
Donald O. Hamnes, A. Tripathi
{"title":"Evaluation of a Local Adaptive Protocol for Distributed Discrete Event Simulation","authors":"Donald O. Hamnes, A. Tripathi","doi":"10.1109/ICPP.1994.106","DOIUrl":"https://doi.org/10.1109/ICPP.1994.106","url":null,"abstract":"The performance of a local adaptive protocol for distributed discrete event simulation is evaluated. This protocol allows each process to adapt at runtime to its environment on a per channel basis with the possible range of behavior varying from conservative to optimistic. This evaluation includes a comparison of the performance of the algorithm with that of both a conservative and an optimistic protocol, as well as, an examination of a number of unique characteristics of the algorithm. Results from simulations using a network of workstations on a closed queueing system are presented. The results demonstrate the importance of various protocol features and show that it performs better than either the conservative or optimistic protocols in certain simulations.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128193566","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}
引用次数: 13
Parallel Speculative Computation of Simulated Annealing 模拟退火的并行推测计算
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI: 10.1109/ICPP.1994.154
A. Sohn
{"title":"Parallel Speculative Computation of Simulated Annealing","authors":"A. Sohn","doi":"10.1109/ICPP.1994.154","DOIUrl":"https://doi.org/10.1109/ICPP.1994.154","url":null,"abstract":"Simulated annealing is known to be highly sequential due to loop-carried dependencies. This report presents a new approach to parallel simulated annealing, called generalized speculative computation (GSC). We use an n-ary speculative tree and loop indices to execute n iterations in parallel on n processors while maintaining the same decision sequence as sequential simulated annealing. To verify the performance of GSC, we implement 100- to 500-city Traveling Salesman Problems on the AP1000 massively parallel multiprocessor. Execution results demonstrate that the GSC approach can indeed be an effective method for simulated annealing. We obtain over 20-fold speedup for the initial temperature of 0.1 and 11-fold speedup for the initial temperature of 10, all on 100 processors.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087091","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
Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes 基于可重构网格的CRCW共享内存计算机快速仿真算法
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI: 10.1109/ICPP.1994.112
Daw-Jong Shyu Daw-Jong Shyu, Biing-Feng Wang Biing-Feng Wang, Chuan-Yi Tang Chuan-Yi Tang
{"title":"Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes","authors":"Daw-Jong Shyu Daw-Jong Shyu, Biing-Feng Wang Biing-Feng Wang, Chuan-Yi Tang Chuan-Yi Tang","doi":"10.1109/ICPP.1994.112","DOIUrl":"https://doi.org/10.1109/ICPP.1994.112","url":null,"abstract":"In this paper, fast algorithms for simulating the CRCW shared-memory computer on reconfigurable meshes are proposed.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115670924","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
Keynote Speakers 主旨发言人
1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1900-01-01 DOI: 10.1109/ICPP.1994.120
N. Matheny, Randall Miller, Randall Miller
{"title":"Keynote Speakers","authors":"N. Matheny, Randall Miller, Randall Miller","doi":"10.1109/ICPP.1994.120","DOIUrl":"https://doi.org/10.1109/ICPP.1994.120","url":null,"abstract":"","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129309691","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
首页 上一页 下一页 尾页
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学术官方微信