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

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation最新文献

筛选
英文 中文
Hash table and sorted array: a case study of multi-entry data structures in massively parallel systems 哈希表和排序数组:大规模并行系统中多入口数据结构的案例研究
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89437
I. Yen, D. Leu, F. Bastani
{"title":"Hash table and sorted array: a case study of multi-entry data structures in massively parallel systems","authors":"I. Yen, D. Leu, F. Bastani","doi":"10.1109/FMPC.1990.89437","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89437","url":null,"abstract":"The tree, hash table, and sorted array data structures for implementing the primitive operations of a search table are considered. It is argued that the tree structure suffers from the bottleneck problem created by the single entry point, namely, the root, resulting in a linear time complexity. For the hash table and sorted array, the average time complexity for implementing three major operations, namely, insert, delete, and search, is derived. Both analytical and simulation results show that using a sorted array gives a much better performance than using a hash table with linear probing in implementing search table abstraction when the load of the hash table is more than 80%. However, given a hash table having less than 80% load, the average time complexity becomes better than O(log/sup 2/M), i.e. the hash table gives a better performance in search table implementation than the sorted array. Nevertheless, a larger number of processors is required.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129680059","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
Practical hypercube algorithms for computational geometry 计算几何的实用超立方体算法
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89442
P. MacKenzie, Q. Stout
{"title":"Practical hypercube algorithms for computational geometry","authors":"P. MacKenzie, Q. Stout","doi":"10.1109/FMPC.1990.89442","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89442","url":null,"abstract":"The use of the cross-stitching technique to solve problems in computational geometry on the hypercube is discussed. Given n inputs distributed one per processor on a hypercube with n processors. The cross-stitching paradigm runs in Theta (log/sup 2/n) time with very low constants. This form of 2-D divide-and-conquer is illustrated, some of its applications are considered, and its practicality is shown by the computation of exact communication constants for the authors' algorithms.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132579729","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}
引用次数: 8
Optimal processor-time tradeoffs on massively parallel memory-based architectures 基于大规模并行内存的架构上的最佳处理器时间权衡
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89473
H. Alnuweiri, V. K. Prasanna Kumar
{"title":"Optimal processor-time tradeoffs on massively parallel memory-based architectures","authors":"H. Alnuweiri, V. K. Prasanna Kumar","doi":"10.1109/FMPC.1990.89473","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89473","url":null,"abstract":"Processor-time-optimal algorithms are presented for several image and graph problems on a parallel architecture that combines an orthogonally accessed memory with a linear array structure. The organization has p processors and a memory of size Theta (n/sup 2/) locations. The number of processors p can vary over a wide range while providing processor-time-optimal algorithms for sorting and for several problems from graph theory, computational geometry, and image analysis. Sorting and geometric problems can be solved in O((n/sup 2//p) log n+n) time, which is optimal for p in the range (1, n log n). Graph and image problems can be solved in O(n/sup 2//p+n/sup 1/2/) time, which is optimal for p in the range (1, n/sup 3/2/). The algorithms implemented on the proposed architecture have processor-time products superior to those of the mesh and pyramid computer algorithms.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121042416","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
Design and performance of an optimizing SIMD compiler 优化SIMD编译器的设计和性能
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89504
A. Fisher, J. León, P. Highnam
{"title":"Design and performance of an optimizing SIMD compiler","authors":"A. Fisher, J. León, P. Highnam","doi":"10.1109/FMPC.1990.89504","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89504","url":null,"abstract":"The work reported has taken place within the context of the Scan Line Array Processor (SLAP) project. The SLAP is a long SIMD (single-instruction-stream, multiple-data-stream) vector of word-parallel processing elements designed to combine high-performance integer processing with real-time video I/O. An optimizing compiler has been built for SLANG, a high-level programming language designed to permit concise expression of many image-processing constructs and to provide the compiler with significant information for use in optimization. The SLAP processing elements have been fabricated and are currently being integrated into a prototype system. Early results of using the compiler as a tool for evaluating the SLAP processing element design and as a testbed for the authors' optimization techniques are reported.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126607082","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
Data management and control-flow constructs in a SIMD/SPMD parallel language/compiler SIMD/SPMD并行语言/编译器中的数据管理和控制流结构
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89490
M. A. Nichols, H. Siegel, H. G. Dietz
{"title":"Data management and control-flow constructs in a SIMD/SPMD parallel language/compiler","authors":"M. A. Nichols, H. Siegel, H. G. Dietz","doi":"10.1109/FMPC.1990.89490","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89490","url":null,"abstract":"Features of an explicitly parallel language targeted for reconfigurable massively parallel processing systems capable of operating in the SIMD (single-instruction-stream, multiple-data-stream) and SPMD (single-program, multiple-data-stream) modes of parallelism are presented (SPMD is a subset of MIMD (multiple-instruction stream, multiple-data stream)). All aspects of the language have been provided with an SIMD-mode version and an SPMD-mode version that are functionally equivalent. The language facilitates experimentation with and exploitation of massively parallel SIMD/SPMD machines. Aspects of data management (variable specification, data manipulation operations, etc.) and control-flow constructs (data dependent and processor address dependent) are examined.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126720932","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}
引用次数: 6
Automatic generation of visualization code for the Connection Machine 自动生成可视化代码的连接机
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89453
James M. Purtilo, D.R. Revis
{"title":"Automatic generation of visualization code for the Connection Machine","authors":"James M. Purtilo, D.R. Revis","doi":"10.1109/FMPC.1990.89453","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89453","url":null,"abstract":"A technique for automatically adding graphics code to application programs is described. It has been found that many visualization strategies can be described solely in terms of the productions in the programming language's BNF; therefore, a source-to-source transformation mechanism, whereby a user's nongraphics application can be transformed into a consistently functioning variant that also has graphics display operations methodically inserted, is being implemented. The ultimate goals is to discover principles whereby some clear image of an application's state can be communicated to a user by automatic source code analysis. The initial step has been to focus on a concrete architecture, the Connection Machine (CM), for which a set of high-level display functions has been fixed. Source programs written in C, and containing high-level directives, are passed through a parser and analysis program, which creates a variant program having graphics code installed. The transformation program implemented for the experiments is called CmVis. It has been prototyped using a parser generator called NewYacc, a Yacc-based tool that is enhanced by allowing rewrite rules to be associated with the language's BNF productions.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116008464","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
Partitioning on the banyan-hypercube networks 榕树-超立方体网络上的分区
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89480
A. Bellaachia, A. Youssef
{"title":"Partitioning on the banyan-hypercube networks","authors":"A. Bellaachia, A. Youssef","doi":"10.1109/FMPC.1990.89480","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89480","url":null,"abstract":"Partitioning strategies, as well as data structures for partitioning, are proposed and studied. Simulation results of internal, external, and total fragmentations for uniform and exponential distributions of request sizes are presented and discussed. The buddy system strategy of partitioning the hypercube is also simulated for comparison purposes. It is shown that the banyan-hypercube (BH) exhibits a better internal fragmentation than the hypercube, and for large request sizes the total fragmentation of the two networks is comparable. It is also shown that the internal fragmentation in BH decreases as the number of levels of BH increases.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114734804","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
Early experience with object-oriented message driven computing 有面向对象消息驱动计算的早期经验
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89503
T. Christopher
{"title":"Early experience with object-oriented message driven computing","authors":"T. Christopher","doi":"10.1109/FMPC.1990.89503","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89503","url":null,"abstract":"A model of parallel computation, message-driven computing (MDC), is presented, along with a language OOMDC/C that implements it. OOMDC/C is an object-oriented version of MDC that has been implemented in a sequential version and in two parallel versions on the Encore multiprocessor, one holding the messages in shared memory and the other copying the messages between processes. It is shown that the model facilitates the use of a variety of parallel data and control structures, including Actors, distributed arrays, communicating processes, remote procedure calls, broadcast and accumulation, data flow graphs, l-structures, streams, active messages, and demand-driven dynamic programming.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122055290","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}
引用次数: 5
Efficient parallel algorithms for search problems: applications in VLSI CAD 搜索问题的高效并行算法:在VLSI CAD中的应用
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89455
S. Arvindam, V. Kumar, V. N. Rao
{"title":"Efficient parallel algorithms for search problems: applications in VLSI CAD","authors":"S. Arvindam, V. Kumar, V. N. Rao","doi":"10.1109/FMPC.1990.89455","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89455","url":null,"abstract":"Experimental results are presented to demonstrate that it is possible to speed up search-based algorithms by several orders of magnitude. Highly optimized sequential programs were first implemented in the C language for two applications: floor plan verification and tautology verification. Then parallel programs were developed for the Ncube by modifying the sequential programs to incorporate dynamic load balancing. The speedups obtained on 1024 processors ranged from 430 to 1099 for floor plan optimization, with larger problems showing higher speedups. For tautology verification the speedup on 1024 processors ranged from 564 to 1007, with larger problems again showing higher speedups.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123041012","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}
引用次数: 26
A parallel production system extending OPS5 扩展OPS5的并行生产系统
[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI: 10.1109/FMPC.1990.89446
J. W. Baker, A. R. Miller
{"title":"A parallel production system extending OPS5","authors":"J. W. Baker, A. R. Miller","doi":"10.1109/FMPC.1990.89446","DOIUrl":"https://doi.org/10.1109/FMPC.1990.89446","url":null,"abstract":"It is shown that by assuming a common model of SIMD (single-instruction-stream, multiple-data-stream) computing and extending the OPS5 production system formalism to take advantage of the SIMD model, an entirely new class of problems lends itself to solution through the intuitive use of a parallel production system (PPS) language. The PPS allows actions on the right-hand sides of a rule to act on classes of working memory elements instead of using the single-element-per-action scheme of OPS5. Novel methods of conflict resolution have also been provided. Parallel conflict resolution resolves only potential conflicts as defined herein. The initial conflict set is formed traditionally, but a maximal set of rule instantiations in the conflict set is executed. Traditional OPS5 conflict resolution is used for any rules in the conflict set with conflicting instantiations, allowing multiple directions of reasoning to be followed concurrently. This facilitates the use of production systems to implement asynchronous concurrent systems using an SIMD computer.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133640422","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信